CS-285 - Data Structures Winter Quarter 1999-2000 Electrical Engineering and Computer Science Department Dr. Christopher C. Taylor CC-27C, 277-7339 t a y l o r@m s o e.e d u (remove spaces) www.msoe.edu/~taylor/ The course covers fundamentals of data organization and basic algorithms for data manipulation. Topics include arrays, lists, stacks, queues, trees, sets, and hash tables. Fundamentals of algorithm performance are introduced, with an emphasis placed on time complexity analysis. Special emphasis is placed on appropriate use of containers, iterators, and algorithms defined in the C++ standard library. Laboratory assignments involve both the use and implementation of common data structures> Objectives Upon successful completion of this course, the student will: . Understand and apply complex data structures and algorithms. . Use appropriate algorithms (and associated data structures) to solve complex problems. . Have a thorough understanding of the STL. . Be able to analyze the complexity of algorithms (both sequential and recursive). . Understand the use of recursion in problem solving. . Be able to use data structures in software design and implementation. . Be able to apply the STL in software design. The above course description and goals were taken from the official course description. General Course Policies Please review the general course policies webpage. Textbook Data Structures in C++ Using the Standard Template Library, by Timothy Budd, Addison-Wesley, 1998. My Schedule Time Mon Tue Wed Thu Fri 9:00 CS285 CC48 CS285 CC48 CS285L S210 10:00 Office Hour Office Hour CS285L S210 11:00 Office Hour Office Hour Office Hour XX 12:00 XX Office Hour 1:00 DEPT MTG CS182 CC48 CS182 CC48 CS182L L104 CS182 CC48 2:00 Fac Senate Office Hour CS182L L104 CS285L S210 3:00 CS285 L100 CS285 L100 Office Hour CS182L L104 CS285L S210 and by appointment. Quizzes A quiz will be given at the beginning of each lab period. The lowest quiz score will be dropped. No make-up quizzes will be given. Grading Section: 1 4 Quizzes: (Weekly) 30% 16% Lab projects: 30% 42% Mid-term: (1/11) 20% 20% Final exam: (Week 11) 20% 22% Total: 100% 100% Tentative Schedule