Scribd
Upload
32 views2 pages

Ad&sa Lab - Evaluation

This document outlines the laboratory course for Advanced Data Structures and Algorithms Analysis at Sree Rama Engineering College. It includes a list of experiments to be conducted, such as constructing AVL and B-Trees, implementing sorting algorithms, and solving optimization problems using various strategies. The evaluation criteria are specified, with a total of 30 marks allocated across different competencies.

Uploaded by

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

Ad&sa Lab - Evaluation

This document outlines the laboratory course for Advanced Data Structures and Algorithms Analysis at Sree Rama Engineering College. It includes a list of experiments to be conducted, such as constructing AVL and B-Trees, implementing sorting algorithms, and solving optimization problems using various strategies. The evaluation criteria are specified, with a total of 30 marks allocated across different competencies.

Uploaded by

koushi8485
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SREE RAMA ENGINEERING COLLEGE

(Approved by AICTE, New Delhi – Affiliated to JNTUA,


Ananthapuramu)
An ISO 9001:2015 & ISO 14001:2015 certified Institution
Rami Reddy Nagar, Karakambadi Road,
Tirupati Department of Computer Science &
Engineering

Year and Semester II B.Tech. I Semester Roll No :


Name of the Laboratory Advanced Data Structures and
Course Code 23A05302P
Algorithms Analysis LABORATORY

DAY-TO-DAY EVALUATION: 30 Marks


CO1 CO2 CO3 CO4 CO5 CO6 CO7 CO8 CO9

Interpretation
TOTAL Signature

Tools & Tech


Experiment

Engineer &
Knowledge
Page No.

Analysis
S.No Experiment Name

Record
Society
of the

Design

Ethics
From
Data
Faculty

Team
work
3M 3M 3M 4M 3M 3M 3M 3M 5M 30 M
1 Construct an AVL tree for a given set of elements
which are stored in a file. And
implement insert and delete operation on the
constructed tree. Write contents of tree
into a new file using in-order.
2 Construct B-Tree an order of 5 with a set of 100
random elements stored in array.
Implement searching, insertion and deletion
operations.
Construct Min and Max Heap using arrays, delete any
3
element and display the content
of the Heap.
Implement BFT and DFT for given graph, when graph
4
is represented by
a) Adjacency Matrix b) Adjacency Lists
Write a program for finding the bi-connected
5
components in a given graph.
6 Implement Quick sort and Merge sort and observe the
execution time for various
input sizes (Average, Worst and Best cases).
Compare the performance of Single Source Shortest
7
Paths using Greedy method when
the graph is represented by adjacency matrix and
adjacency lists.
8 Implement Job sequencing with deadlines using
Greedy strategy.
Write a program to solve 0/1 Knapsack problem Using
9
Dynamic Programming.
Implement N-Queens Problem Using Backtracking.
10
Use Backtracking strategy to solve 0/1 Knapsack
11
problem.
Implement Travelling Sales Person problem using
12
Branch and Bound approach.
Write a program in Hamiltonian cycles using branch
13 and bound .(BEYOND SYLLABUS)

Faculty in-charge

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy