Time/ Location. Tu Th 12:30 – 1:45. SN 014

(MWF 4:00 – 4:50. SN 011)

Instructor. Sanjoy Baruah [baruah@cs.unc.edu; (919)962-1803; Sitterson 319]

Course Goal. To provide knowledge of, and experience in implementing, several useful data structures and associated algorithms.

Objectives. During this course, you will

• Gain experience in objected-oriented C++ program development in a Unix environment
• Learn how the choice of data structures and algorithm design methods impacts the performance of programs
• Learn object-oriented design principles
• Study specific data structures such as linear lists, stacks, queues, hash tables, binary trees, heaps, binary search trees, and graphs

Prerequisite. Foundations of Programming (Comp 114). You must drop the course if you do not have the prerequisite.

Text. The required course text is: Mark Allen Weiss, Data structures & algorithm analysis in C++. Addison Wesley.

Grading. Grades will be based on several programming assignments (30% of your grade), three in-class exams (45%), and a final examination (25%). I reserve the right to change the method of assigning grades. You must perform satisfactorily in each component – the programming assignment, the three midterms taken together, and the final exam – in order to obtain a passing grade in the course.

Programs. Barring documented tragedy, I will not accept late programs. You are not permitted to work in groups – all your work must be your own, and you must attest to this in a signed comment enclosed with each program submission.

Special needs. If you are entitled to extra accommodation for any reason (such as a disability), we will make every reasonable attempt to accomodate you. However, it is your responsibility to discuss this with the instructor during the first week of the course.

Course Information. Latest organizational information concerning this course is available off the WWW, at the following URL:

http://www.cs.unc.edu/~baruah/Teaching/2000f/courseHomePage.htm

It is your responsibility to check this URL frequently.

(Features of C++, object-oriented programming principles, and features of the Unix programming environment will be introduced concurrently with the study of these topics, as appropriate.)

• Review of C++
• Introduction to Unix
• Review of program performance
• time and space complexity
• asymptotic notation

• Lists, stacks and queues
• Binary trees
• representation
• traversal
• Priority queues
• Linear lists
• Heaps
• Search trees
• Binary search trees
• balanced binary search trees – AVL trees
• Graphs
• representation
• traversal
• shortest paths