Group Assignment

Target Group: - Electrical & Computer Engineering (Computer Engineering Stream) Students

Titles: -

1.
 Dijkstra Algorithm
 Transform & Conquer
 Presorting
 Balanced search tree
 Heap & Heapsort
2.
 Greedy Algorithm
 Brute Force Approach
 Exhausting Search
 Traveling Salesman problem
 Knapsack problem
 Assignment problem
3.
 Kruskal’s Algorithm
 Divide & Conquer Approach
 Merge Sort
 Quick Sort
 Binary Tree Traversal & related Properties
4.
 Prim’s Algorithm
 Minimal spanning tree
 Hufman tree
 Space and Time Tradeoff
 Input Enhancement in string Matching
 Horspool’s Algorithm
 Boyer-Moore Algorithm

5.

 Graph Basics with Algorithms

 Depth First search
 Breadth First Search
 Topological Sorting