CSC441 : Design and Analysis of Algorithms Spring 2011 Iqra University, Islamabad
Course Outline - Asymptotic Analysis of Performance of Algorithms
- Sorting Algorithms
- Insertion Sort
- Merge Sort
- Bubble Sort
- Selection Sort
- Quick Sort
- Heap Sort
- Data Structures
- Stacks
- Queues
- Linked Lists
- Rooted Trees
- Heap
- Heap as Max Priority Queue
- Hash Tables
- Binary Search Trees
- Basic Graphs Algorithms
- Breadth-First Search
- Shortest distance from source node
- Depth-First Search
- Parenthesis Theorem
- White-Path Theorem
- Strongly Connected Components
- Topological Sort
- Minimum Spanning Tree
- Kruskal's algorithm
- Prim's algorithm
- Single Source Shortest Path
- Bellman-Ford algorithm
- DAG Shortest Path algorithm
- Dijkstra's algorithm
|
|