CSE323 / DAA Lab

Syllabus

188KB

PDF

EXPT-1: Write a program to implement Quick sort algorithm for sorting a list of integers in ascending order

[⤓]

EXPT-2: Write a program to implement Merge sort algorithm for sorting a list of integers in ascending order

[⤓]

EXPT-3: DFS & BFS

i) Write a program to implement the DFS algorithm for a graph. ii) Write a program to implement the BFS algorithm for a graph. :

EXPT-4: Write a programs to implement backtracking algorithm for the N-queens problem.

[⤓]

EXPT-5: Write a program to implement the backtracking algorithm for the sum of subsets problem.

[⤓]

EXPT-6: Write a program to implement the backtracking algorithm for the Hamiltonian Circuits problem.

EXPT-7: Write a program to implement greedy algorithm for job sequencing with deadlines.

EXPT-8: Write a program to implement Dijkstra’s algorithm for the Single source shortest path problem.

EXPT-9: Write a program that implements Prim’s algorithm to generate minimum cost spanning tree.

EXPT-10: Write a program that implements Kruskal’s algorithm to generate minimum cost spanning tree.

EXPT-11: Write a program to implement Dynamic Programming algorithm for the 0/1 Knapsack.

Content Yet to be Updated for this Page, Submit Resources If you want to collaborate, find form attached on this page below.

Last updated 3 months ago