FORMAT FOR LABORATORY WRITE-UP

UNIT NO.-
Practical no.-
Aim:- (Title of the experiment and Aims or objectives)
Software Required:-
Hardware Required:-
Theory/Logic:-
Source Code:-
Advantage:-
Disadvantage:-
Conclusion (With Time Complexity):-
No need to write Practical Colored in Orange

UNIT PRACTICAL AIM

1 Implement Below Data Structures
1.1 Array (Matrix Multiplication)
1.2 Queue
1.3 Linked List
2 Analysis of Algorithms with
implementation
2.1 Selection Sort
2.2 Insertion Sort
2.3 Binary Search Tree
2.4 Bubble Sort
3 Divide & Conquer Strategy
3.1 Merge Sort
3.2 Quick Sort
3.3 Binary Search
3.4 Strassen’s matrix multiplication
4 Greedy
4.1 Prim’s Algorithm
4.2 Kruskal’s Algorithm
4.3 Dijkstra’s Algorithm
4.4 Making Change Problem
5 Dynamic Programming
5.1 Binomial Coefficient
5.2 Matrix Chain Multiplication
5.3 Longest Common Subsequence
5.4 Knapsack Problem
6 Graph
6.1 Knapsack Problem with Backtracking
6.2 Breadth First Search
6.3 Depth First Search
7 String Matching Algorithm
7.1 Naïve String Matching
7.2 Rabin Karp
7.3 Finite Automata