Scribd
Upload
88 views2 pages

ADA Lab Assignment Updated

The document outlines a lab assignment for an Analysis and Design of Algorithms course. It includes 21 programming assignments covering various algorithm techniques like searching and sorting, divide and conquer, greedy methods, dynamic programming, backtracking, and tree and graph algorithms. Students are expected to implement algorithms like linear search, merge sort, Huffman coding, knapsack problems, minimum spanning trees, and tree/graph traversals. The assignments are divided over 13 labs to be completed over the course of a semester.

Uploaded by

Rahul Soni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
88 views2 pages

ADA Lab Assignment Updated

The document outlines a lab assignment for an Analysis and Design of Algorithms course. It includes 21 programming assignments covering various algorithm techniques like searching and sorting, divide and conquer, greedy methods, dynamic programming, backtracking, and tree and graph algorithms. Students are expected to implement algorithms like linear search, merge sort, Huffman coding, knapsack problems, minimum spanning trees, and tree/graph traversals. The assignments are divided over 13 labs to be completed over the course of a semester.

Uploaded by

Rahul Soni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Lakshmi Narain College of Technology (LNCT), Bhopal

LAB ASSIGNMENT Page No:


1/2

Department COMPUTER SCIENCE & ENGG. Session : 2021-2022

Name of Faculty Vijay Trivedi Semester IV

Subject Name Analysis & Design of Algorithm (ADA) Sub. Code CS402/AL402

TIME SCHEDULE : Total expected periods ______

Day Monday Tuesday Wednesday Thursday Friday Saturday


Timings ---- 12:10-1:50 --- --- --- [Link]- 5:00

Date Of Implementation
S. No. Practical
Batch-I Batch-II
Searching & Sorting CO1

Assignment-1: Write a program to implement linear search.


Lab-1 Assignment-2: Write a program to implement binary search.
Assignment-3: Write a program to perform the following
operations on Heap.
 Build Heap
Lab-2  Heapify
 Insertion & Deletion Operation
 Heap sort

CO1
Divide & Conquer
Assignment-4:Write a program to perform Merge Sort using
Lab-3 Divide & Conquer Technique.
Assignment-5:Write a program to perform Quick Sort using
Divide & Conquer Technique.
Greedy Method CO2
Assignment-6: Write a program to implement Optimal File
Merge Pattern using Greedy method
Lab 4 Assignment-7: Write a program to implement Huffman
Coding Compression Technique using Greedy
strategy.
Assignment-8: Write a program to implement fractional
Lab-5 Knapsack Problem.
Assignment-9: Write a program to implement Job
Sequencing with Deadlines.
Assignment-10: Write a program to implement Dijkstra’s
Lab-6 Single Source Shortest Path Problem using
Greedy Technique.
Assignment-11: Write a program to implement Minimum
Lab-7 Spanning Tree using Prim’s algorithm.
Assignment-12: Write a program to implement Minimum
Spanning Tree using Kruskal’s algorithm.

Data Structures [CS302] |1 of 2


Lakshmi Narain College of Technology (LNCT), Bhopal

LAB ASSIGNMENT Page No:


2/2

Dynamic Programming CO3


Assignment-13: Write a program to implement 0/1 Knapsack
Lab-8
Problem.
Assignment--14: Write a program to Implement All-Pairs
Lab-9 Shortest Paths Problem using Floyd's
algorithm.
Backtracking & Branch and Bound CO4

Assignment-15:Write a program for Hamiltonian cycle


problem.
Lab-10
Assignment-16: Write a program to solve Traveling
Salesman Problem using Branch and Bound.
Assignment-17: Write a program m-Coloring Problem using
Lab-11
backtracking.
Tree and Graph CO5
Assignment-18: Write a program to perform Breadth First
Search (BFS) in a graph.
Lab-12
Assignment-19: Write a program to perform Depth First
Search (DFS) in a graph.
Assignment-20: Write a program to perform In-and Pre-order
Traversal in a Tree.
Lab-13 Assignment-21: Write a program to perform Post-order
Traversal in a Tree.

Prepared By Approved By

Asst. Professor, CSE HOD (CSE)

Data Structures [CS302] |2 of 2

You might also like