CS 261 (4 credits)
Schedule Score Posting Links
|Lecture||COVL 216 T-TR 4:00-5:20 (1/4/11 - 3/10/11)|
||Prof. Timothy A. Budd (contact info)|
|Office Hours||MWF 1:30-3:00, KEC 3049
|Teaching Assistants||Walker Orr (office hours W 2:30-4:30)
Ali Mohammad Torkamani (e-mail: email@example.com office hours Tue: 8-10AM)
|Prerequisites||CS 162, Math 231|
|Textbook||C pocket reference
course notes - you should print out the chapters portion. You can print (and do) worksheets ahead of class if you wish.
|Course Learning Objectives||
2. read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment
3. state the asymptotic time complexity of the fundamental operations associated with a variety of data structures, such as vector, linked list, tree, and heap
4. recall the space utilization of common data structures in terms of the long-term storage needed to maintain the structure, as well as the short-term memory requirements of fundamental operations, such as sorting
5. design and implement general-purpose, reusable data structures that implement one or more abstractions
6. compare and contrast the operation of common data structures (such as linear structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time complexity, space utilization, and the abstract data types they implement
|Schedule||Check here every
week; the schedule is subject to "adjustments"
This course has been redesigned to make use of C instead of Java, and to incorporate a different teaching style. This is admittedly experimental. I will evaluate the success of this approach as the term progresses, and adjust the schedule as necessary.
|Communication||There is a class mail list established for this course. I will use this to send e-mail to the entire class where appropriate. You can also use this as you wish, simply by sending e-mail to firstname.lastname@example.org.|
|Grades||There will be a number of homework sets, programming assignments, two midterm exams, and a final. The grades for these will be weighted so that the homework is about half of the final grade, and the exams the remaining half.||
|Academic Honesty Policy||See the university,
and course policies.
Obviously, compliance is expected.