Lecturer: Marc Gaetano, Assistant Professor, Polytech Nice-Sophia, France.

Data Structures and Algorithms

CSE 373
1. Credits: 3 (45 periods) 2. Goals: The objective of this class is to study the fundamental data structures and algorithms used in computer science. Students will study advanced programming techniques and will learn to analyze the algorithms to determine their time and space requirements. 3. Textbook: Data Structures and Algorithm Analysis in Java (Second Edition) by Mark Allen Weiss. Published by Addison-Wesley, 2007. 4. Prerequisites: CSE 143 5. Grading system: - Assignments: 40 % - Quizz: 30 % - Final exam: 30 % 6. Duration: 2 24 April 2010 7. Syllabus and Schedule: Lecture topics

Homeworks 1. A spell Checker

Introduction Math 1 & 2 Induction Lists, Stacks and Queues Priority Queues Heapsort Hashing Trees and search trees AVL trees AVL trees (continued) Sorting Huffman code Disjoint sets Quizz (duration : 60 minutes) Introduction to Graphs Minimum Spanning tree

2. Sound Blaster 3. Heap implementation 4. AVL based Ordered Sets AVL based Ordered Sets (continued) 5. Programming a maze

6. Shortest path algorithm implementation

Topological sort Shortest path algorithm Shortest path implementation (continued) Final exam: final exam will be scheduled a couple of weeks after the end of the course (duration: 60 minutes). Signature: