Data Structures and Algorithms
Contact Hours / Week:
Aims of Course:
•Analysis of Algorithms: worst case time and space complexity.
•Data Structures: stack, queue, linked list, tree, priority queue, and heap.
•Searching algorithms: binary and AVL search trees;
•Sorting algorithms: merge sort, quick sort, bucket sort and radix sort; (Reduce some contents)
•Graph: data structure, depth first search and breadth first search. (add some interesting contents).
The course is offered in 40 hours lecture with case studies, individual exercises, class discussion, critical analysis and problem solving.
Course Learning Outcomes:
Upon successful completion of this course, students will be able:
•To understand widely used data structures and the algorithms that manipulates them.
•To appreciate object-oriented design in constructing data structures.
•To implement abstract data type concepts through programming techniques.
•To emphasize on formal methods of testing; basic algorithmic analysis; time and space tradeoffs in algorithms.
High Quality Education with Reasonable & Affordable Prices
Apply NOW and Benefit from Financial AID program