Scribd
Upload
178 views2 pages

CD3281-Data Structures and Algorithms Lab MANUAL-1-55-1-2

The document outlines the practical laboratory observation book for the Data Structures and Algorithms course (CD3281) in the Department of Computer Science and Engineering (AIML). It includes course objectives, a list of experiments to be conducted, and expected course outcomes for students, emphasizing the implementation of data structures and algorithms in Python. Additionally, it provides references to relevant textbooks for further study.

Uploaded by

18BIT4065-Ramar K
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
178 views2 pages

CD3281-Data Structures and Algorithms Lab MANUAL-1-55-1-2

The document outlines the practical laboratory observation book for the Data Structures and Algorithms course (CD3281) in the Department of Computer Science and Engineering (AIML). It includes course objectives, a list of experiments to be conducted, and expected course outcomes for students, emphasizing the implementation of data structures and algorithms in Python. Additionally, it provides references to relevant textbooks for further study.

Uploaded by

18BIT4065-Ramar K
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

DEPARTMENT OF

COMPUTER SCIENCE AND ENGINEERING(AIML)

Course Code/Name: CD3281 / DATA STRUCTURES AND


ALGORITHMS
Department: AIML
APP DEVELOPMENT LABORATORY

PRACTICAL LABORATORY - OBSERVATION BOOK

Name : ………………………………………….

Register No : ………………………………………….

Branch : ………………………………………….

Year & Sem : ………………………………………….


CD3281 DATA STRUCTURES & ALGORITHM LABORATORY LT PC
0 0 42
COURSE OBJECTIVES:
● To implement ADTs in Python
● To design and implement linear data structures – lists, stacks, and queues
● To implement sorting, searching and hashing algorithms
● To solve problems using tree and graph structures

LIST OF EXPERIMENTS:
Note: The lab instructor is expected to design problems based on the topics listed.
TheExamination shall not be restricted to the sample experiments designed.
1. Implement simple ADTs as Python classes
2. Implement recursive algorithms in Python
3. Implement List ADT using Python arrays
4. Linked list implementations of List
5. Implementation of Stack and Queue ADTs
6. Applications of List, Stack and Queue ADTs
7. Implementation of sorting and searching algorithms
8. Implementation of Hash tables
9. Tree representation and traversal algorithms
10. Implementation of Binary Search Trees
11. Implementation of Heaps
12. Graph representation and Traversal algorithms
13. Implementation of single source shortest path algorithm
14. Implementation of minimum spanning tree algorithms

COURSE OUTCOMES:
At the end of the course, the student should be able to:
CO1:implement ADTs as Python classes
CO2:design, implement, and analyse linear data structures, such as lists, queues, and stacks,
according to the needs of different applications
CO3:design, implement, and analyse efficient tree structures to meet requirements such as
searching, indexing, and sorting
CO4:model problems as graph problems and implement efficient graph algorithms to solve them

TOTAL:60 PERIODS
TEXT BOOKS:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures and
Algorithms in Python” (An Indian Adaptation), Wiley, 2021.
2. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python”
SpringerEdition 2015.
3. Narasimha Karumanchi, “Data Structures and Algorithmic Thinking with
Python”Careermonk, 2015.

You might also like