Data Structure and Algorithm (Updated)
Data Structure and Algorithm (Updated)
Prerequisites:
Course Objectives:
Grading:
Course Outline:
4. Trees
Binary trees, binary search trees
Tree traversal algorithms (preorder, inorder, postorder)
Balanced trees (AVL trees, red-black trees)
5. Graphs
Introduction to graphs
Graph representation (adjacency matrix, adjacency list)
Graph traversal algorithms (DFS, BFS)
6. Sorting Algorithms
Comparison-based sorting algorithms (bubble sort, selection sort, insertion
sort, merge sort, quick sort)
Non-comparison-based sorting algorithms (counting sort, radix sort)
7. Searching Algorithms
Linear search, binary search
Searching in trees and graphs
8. Dynamic Programming
Introduction to dynamic programming
Memorization and tabulation techniques
Applications of dynamic programming