Scribd
Upload
15 views2 pages

Python Data Structures and Algorithms Syllabus

The syllabus outlines a course focused on implementing Abstract Data Types (ADTs) in Python, including linear data structures like lists, stacks, and queues, as well as algorithms for sorting, searching, and graph problems. Students will complete a series of experiments to develop practical skills in data structure implementation and algorithm design. The course aims to equip students with the ability to analyze and model problems using various data structures and algorithms.

Uploaded by

afreen
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
15 views2 pages

Python Data Structures and Algorithms Syllabus

The syllabus outlines a course focused on implementing Abstract Data Types (ADTs) in Python, including linear data structures like lists, stacks, and queues, as well as algorithms for sorting, searching, and graph problems. Students will complete a series of experiments to develop practical skills in data structure implementation and algorithm design. The course aims to equip students with the ability to analyze and model problems using various data structures and algorithms.

Uploaded by

afreen
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

SYLLABUS

COURSE OBJECTIVES: LT P C
0 0 4 2
 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 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
PO PSOS
CO 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 3.5 1

You might also like