Course Name DATA STRUCTURES AND ALGORITHMS ANALYSIS

The course includes linear data structures such as arrays, stacks, queues, linked-lists;
Course Description nonlinear data structures such as generalized lists, trees, and graphs; operations on
these using algorithms such as insertions, deletions, and traversals.
Number of Units for 3 units lecture
Lecture and Laboratory 1 unit laboratory
Number of Contact Hours 3 hours lecture
per week 3 hours laboratory

Prerequisite Computer Fundamentals and Programming

Course Objectives After completing this course, the student must be able to:
1. Recognize the different linear and nonlinear data structures
2. Graphically represent any data structure
3. Have a clear understanding of the algorithms for creating, accessing, and
destroying structural information
4. Determine the complexity of common algorithms
5. Apply programming techniques like searching and sorting in solving
problems
1. Introduction/ Design Principles
2. Analysis of Algorithms
3. Stacks, Queues and Link List
Course Outline 4. Sequences
5. Trees
6. Simple Sorting Method
7. Searching Algorithm
8. Advance Sorting Method
9. Graphs
10. Weighted Graphs
Laboratory Equipment Please refer to Annex IV – Laboratory Requirements