Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
33 views2 pages

2 Dsa Lab Syl

The document outlines the objectives and experiments for a Data Structures and Algorithms laboratory course, focusing on implementing abstract data types (ADTs) in Python and various data structures. Students will learn to design and analyze linear data structures, sorting, searching, and graph algorithms. The course includes a list of experiments and references for further reading.

Uploaded by

mahalakshmi
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
33 views2 pages

2 Dsa Lab Syl

The document outlines the objectives and experiments for a Data Structures and Algorithms laboratory course, focusing on implementing abstract data types (ADTs) in Python and various data structures. Students will learn to design and analyze linear data structures, sorting, searching, and graph algorithms. The course includes a list of experiments and references for further reading.

Uploaded by

mahalakshmi
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/ 2

CD3281 DATA STRUCTURES AND ALGORITHMS LABORATORY LTPC

0042
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:

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

TOTAL: 60 PERIODS

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

TEXT BOOK:

1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &

Algorithms in Python”, John Wiley & Sons Inc., 2013

REFERENCES:

1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons,

2011

2. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.

3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,

“Introduction to Algorithms", Second Edition, McGraw Hill, 2002.

4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition,

Pearson Education, 2014

CO’s-PO’s & PSO’s MAPPING:

CO’s PO’s PSO’s


1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4
1 3 2 1 1 1 - - - 2 3 1 2 1 2 1
2 3 3 2 - 1 - - - 2 3 1 2 2 2 1
3 2 2 2 1 1 - - - 2 3 1 2 1 3 1
4 3 1 2 1 1 - - - 2 3 1 2 1 3 1
AVg. 2.75 2 1.75 1 1 2 3 1 2 1.25 2.5 1
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

You might also like