[go: up one dir, main page]
Scribd
Upload
9 views1 page

Dsa Lab Syylabus

The document outlines a course on data structures and algorithms lab. It provides the course code, title, credits, prerequisites and syllabus version. It then lists the course objectives and outcomes. Finally, it details 13 indicative experiments that will be conducted as part of the lab course.

Uploaded by

Shivam Mishra
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
9 views1 page

Dsa Lab Syylabus

The document outlines a course on data structures and algorithms lab. It provides the course code, title, credits, prerequisites and syllabus version. It then lists the course objectives and outcomes. Finally, it details 13 indicative experiments that will be conducted as part of the lab course.

Uploaded by

Shivam Mishra
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

Item 67/28 - Annexure - 32

Course Code Course Title L T P C


MCSE501P Data Structures and Algorithms Lab 0 0 2 1
Pre-requisite NIL Syllabus version
1.0
Course Objectives
1. To familiarize the concepts of data structures and algorithm focusing on space
and time complexity.
2. To provide a deeper insight on the basic and advanced data structures.
3. To develop the knowledge for application of the advanced trees and graphs in
real world scenarios.
Course Outcome
1. Understand and analyze the space and time complexity of the algorithms.
2. Identification of suitable data structure for a given problem.
3. Implementation of graph algorithms in various real-life applications.
4. Implementation of heaps and trees for querying and searching.
5. Use of basic data structures in advanced data structure operations.
6. Use of searching and sorting in various real-life applications.

Indicative Experiments
1. Analyzing the complexity of iterative and recursive algorithms
2. Implement Linear data structures (Stacks, Queues, Linked Lists)
3. Linear time sorting techniques
4. Interpolation search & Exponential search
5. Binary tree & Tree traversals
6. B-trees & B+ trees
7. Advanced Trees: 2-3 tree, splay tree, red black tree etc.
8. Advanced Trees: Threaded Binary trees, tournament trees
9. Graph traversals (BFS, DFS, Topological sorting)
10. Determining the Shortest path between pair of nodes in the given graph
11. Minimum Spanning trees- reverse delete & Boruvka’s algorithm
12. Heaps & Hashing
Total Laboratory Hours 30 hours
Text Book(s)
1. Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford
Stein. Introduction to algorithms. MIT press, 2022.
Reference Books
1. Skiena, Steven S. "The Algorithm Design Manual (Texts in Computer Science)." 3rd
edition, 2020, Springer.
2. Brass, Peter. Advanced data structures. Vol. 193. Cambridge: Cambridge University
Press, 2008.
Mode of Evaluation: CAT / Mid-Term Lab/ FAT

Recommended by Board of Studies 26-07-2022


Approved by Academic Council No. 67 Date 08-08-2022

Proceedings of the 67th Academic Council (08.08.2022) 1646

You might also like