110 likes | 127 Views
This course covers the fundamentals of data structures, including object-oriented techniques, algorithms, sequence containers, dynamic memory, iterators, linked lists, and more.
E N D
CS 33101 Computer Science II:Data Structures and AbstractionFall 2009 Dr. Angela Guercio (www.personal.kent.edu/~aguercio) Course Web Page http://www.personal.kent.edu/~aguercio/Fall09/CS33001-600Fa09.html
Course Administration • Instructor: Dr. Angela Guercio aguercio@kent.edu • 424 Main Hall • Office Hrs: • TR 10:00am - 10:55am 12:25pm 1:55pm 4:55pm - 5:25pm • other times are available by appointment • Text (Required): • W. Ford, W. Topp – Data Structures with C++ using STL– Prentice Hall, 2nd Edition, 2001
URLs • PC code and slides can be downloaded at : • http://www1.pacific.edu/~wford/fordtopp/cs2book/cs2_index.html • Class URL:http://www.personal.kent.edu/~aguercio/Fall08/CS33001-600Fa08.html
The Syllabus: Requirements • Class attendance is required. • If you miss a class, let me know ahead of time • you must provide the documented reason. • You are responsible for bringing yourself up-to-date on class material and assignments • You cannot miss more than 5 classes without documentation • Penalty: drop of the grade (ex from A to B, from B to C, ect.) • Reading material before class is required • Read material once before class and again after class
Course Content • Content • This course will introduce you to the fundamentals of data structures from an object oriented perspective. The course covers: • The definition of data structures; • Object Oriented Techniques; • Algorithms; • Sequence containers; Arrays; Vectors; List; Dequeue • Dynamic Memory and Pointers; • Iterators; Linked Lists; • Adapter Classes; Stacks; Queues and Priority Queues • Binary Trees; • Associative Structures;
Course goals • To learn the use of appropriate data structures and become familiar with their formal representation, their manipulation, and access. • To understand to identify the appropriate data structure for the solution of a problem and the efficiency of the solution; • To learn abstraction • To recognize STL container classes; • To deepen your program design abilities; • To expose you to the design and the testing of C++ programs using data structures via hands-on experience. • Course prerequisites • CS22021 CS I
The Exams • 2 Mid Term Exams and 1 Final Exam • 100 points each • No Make-up exams • Except in extreme case and only if I have been notified prior the exam has been issued • Homework and Projects must be returned by the deadline • Late penalty: 3 points per day
The Grade • Participation 5% • Attendance 5% • Homework and Projects 40% • Exam 1 and 2 30% • Final Exam 20% • Check the syllabus for the grading scale
Dates to Remember • Last day to withdraw before grade W is assigned, is Sept. 7, 2008 • Last day to drop the class is Nov. 2, 2008 • Exam 1 is Thursday, Sept. 25 • Exam 2 is Thursday, Oct. 30 • Final Exam is Tuesday, Dec. 9 (1:00 pm – 3:00pm) • Thanksgiving Recess: Nov. 26 – Nov. 30 • Classes End: Dec. 7, 2008
Others: more on the syllabus • Read the syllabus for: • Course Withdrawal • Academic Honesty Policy • Students with Disabilities • Classes Canceled – Campus Closings • Conduct • And other important issues
Others: Security • Emergency: In case of an emergency please contact the security on campus. • Security phone on campus: #53123 • Security cell phone (330) 705-0430 or, of course, 911. • I recommend that you program into your cell phone the previous numbers.