CS210 - Data Structures

This course introduces classical data structures and algorithms with emphasis on performance using asymptotic analysis of algorithms and complexity classes. Fundamental data structure includes lists, stacks, queues, heaps, trees, and graphs. The student will learn a variety of algorithms for searching, sorting, traversing and hashing. In addition, the course covers the application of these data structures and algorithms in real-life problems and implementing them in modern programming languages. Students attending the course should demonstrate prowess in programing skills with two programming projects to be completed in class.

Class Schedule:
9.00AM to 10.00AM Everyday except Thursday. Room GB06 Building 105.
11.00AM to 12.00 noon Everyday except Thursday. Room 1A13 Building 105.

Exams Schedule:
Major 1 Exam on Monday, February 19, 2024 at noon.
Major 2 Exam on Monday, April 29, 2024 at noon.
Final Exam TBA.

Important Links: [Syllabus] [This week] [Scores] [Learning Management System] [Github] [Book Companion website] [Video lectures from 193]

Resources: [Java JDK 8] [Java JDK 8 + Netbeans 8 bundle] [Netbeans 16] [IntelliJ IDEA]