Course Descriptions:
Introduction to data structure: Abstract data types, abstraction; Algorithm and algorithm analysis; Simple sorting and searching algorithms; Data structure: Linear ADTs (linked list, stack, queue), Non linear ADTs (binary trees); Advanced sorting and searching: heap sort, quick sort, merge sort, shell sort, hashing.
Objective:
- After completing this course students should be able to:
- Understand common data structures and algorithms, and be able to implement them;
- Understand linked list, queue, stack, tree etc.
- Understand simple and advanced sorting and searching algorithms
- Analyze the complexities of data structures and algorithms;
- Analyze and chose appropriate data structure and algorithms for a particular problem domain
Course Content:
- Introduction to data structure
- Algorithm and Algorithm Analysis
- Simple Sorting and Searching Algorithms
- Data Structure
- Advanced sorting and searching
