Indian Engineering Colleges Rank | Top Placement College

Algorithms Lab

An algorithm is an effective method that can be expressed within a finite amount of space and time[1] and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty) the instructions describe a computation that, when executed, proceeds through a finite. Number of well-defined successive states, eventually producing “output”.and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input .

Sr. No.Name of PracicalSoftware and Hardware RequiredIcon
1Divide and conquer method (quick sort, merge sort, Strassen’s matrix multiplicationTurbo C/C++
2Greedy method (knapsack problem, job sequencing, optimal merge patterns, minimal
spanning trees).
Turbo C/C++
3Dynamic programming (multistage graphs, OBST, 0/1 knapsack, traveling sales person
problem).
Turbo C/C++
4Back tracking (n-queens problem, graph coloring problem, Hamiltonian cycles).Turbo C/C++
5Sorting: Insertion sort, Heap sort, Bubble sortTurbo C/C++
6Searching: Sequential and Binary SearchTurbo C/C++
7Selection: Minimum/ Maximum, Kth smallest elementTurbo C/C++

Paste your AdWords Remarketing code here