CS1201- DATA STRUCTURES

Course Objective:
This course introduces students to the fundamental data structures used in
Computer Science. The data structures covered include linked lists, doubly linked lists,
stacks, queues, trees, and graphs. Algorithms that manipulate these data structures are
discussed and used in laboratory work. Students are introduced to the run-time analysis
of algorithms and basic algorithms for searching and sorting.

Learning Outcomes:
Upon completion of the course through examinations and assignments, the student will:

1. Understand the Asymptotic notation and how to measure the efficiency of an

Algorithm
2. Understand the concept of an Abstract Data Type.
3. Be able to associate the concept of an Abstract Data Type with the Language
constructs that support Data abstraction.
4. Understand sorting and searching techniques including the Binary Search.
5. Know how implement Linked Lists, Stacks, Queues, Trees, Hashing.
6. Know the benefit of recursive programming.
7. Know several algorithms for processing Graphs.
8. Understand hashing.
9. Understand how to enter compile, link, and execute complex C programs.