Scribd
Upload
16 views1 page

ACAD

This document outlines the list of practical assignments for the Design and Analysis of Algorithms Lab course for the 4th semester of the B Tech program. It includes 9 assignments that map to various course outcomes. The assignments involve implementing graphs, trees, sorting algorithms like quicksort, and algorithms like fractional knapsack, traveling salesman problem, Floyd's algorithm, and N-Queens problem. The document provides brief descriptions of the requirements for each assignment.

Uploaded by

coolshubupaunikar
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
16 views1 page

ACAD

This document outlines the list of practical assignments for the Design and Analysis of Algorithms Lab course for the 4th semester of the B Tech program. It includes 9 assignments that map to various course outcomes. The assignments involve implementing graphs, trees, sorting algorithms like quicksort, and algorithms like fractional knapsack, traveling salesman problem, Floyd's algorithm, and N-Queens problem. The document provides brief descriptions of the requirements for each assignment.

Uploaded by

coolshubupaunikar
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
You are on page 1/ 1

Iss. No.

: 01,
ACAD-14 e)
Shri Ramdeobaba College of Engineering Rev. No.: 00
Ref. Clause(s): andManagement, Nagpur-440013 Date of Rev:
7.1.3, 7.1.4 01/01/2018
Department: Course: Design and Analysis of Algorithms Lab
Information Course Code: ITP353 Page: 01/01
Technology List of Practical
(IV Semester)
Programme: Session: 2023-24 (Even Semester) Date:8/01/2023
B Tech.

Sr. Aim of Practical


CO Mapped
No.
Implementation of Graph and Tree: CO1
1.
a) Write two different programs to implement a Graph of a minimum of 5 nodes
using the first Adjacency Matrix and the second Adjacency List. Show BFS and
DFS traversals for both programs. Comment on the complexities of both
programs.
b) Implement a Binary Search Tree of 10 nodes and traverse it Level by Level
using a suitable data structure.
c) Write a program to implement a Heap Tree of 10 nodes and perform insertion
and deletion on it. Comment on the complexity of the algorithm.
write a program to verify the following: CO2
2 a) on average n/2 comparisons are required for linear search
b) the worst-case time complexity for binary search is O(log n)
Write a program to implement a greedy algorithm for fractional knapsack CO2
3.
algorithm, take the following input:
M=100, n=5
(w1,w2,w3,ww4,w5) = (10,30,40,25,20)
(p1,p2,p3,p4,p5) = (20,50,10,60,80)
Implement a quick sort algorithm and comment on its complexity for the CO2
4.
following inputs:
a) normal input
b) input in ascending order
c) input where all the elements are the same
Implement a program to find minimum and maximum elements in an array using CO2
5.
divide and conquer paradigm.
derive the time complexity of your program.
WAP to identify Singleton(occurring once) elements in a given array. Comment CO2
6.
on the time complexity of your program.
Implement Traveling Salesmen's problem CO2
7.

8. Implement Floyds Algorithm CO2, 3

Implement N-Queens algorithm CO4


9.

Dr. D. S. Adane
Course Coordinator

You might also like