Scribd
Upload
13 views1 page

Question Set Python

The document outlines the practical examination details for the Master of Computer Applications program at Anna University, scheduled for November/December 2025. It includes a list of ten programming tasks related to data structures and algorithms using Python, such as implementing a student record management system, various data structures, and search algorithms. The examination is set for the first session on December 11, 2025.

Uploaded by

32gvlin1990
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
13 views1 page

Question Set Python

The document outlines the practical examination details for the Master of Computer Applications program at Anna University, scheduled for November/December 2025. It includes a list of ten programming tasks related to data structures and algorithms using Python, such as implementing a student record management system, various data structures, and search algorithms. The examination is set for the first session on December 11, 2025.

Uploaded by

32gvlin1990
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

ANNA UNIVERSITY

CHENNAI – 600025
UNIVERSITY PRACTICAL EXAMINATION –NOV/ DEC 2025

College Code:9615-Maria College of Engineering and technology Date of Examination :11/12/2025


Branch Code/Name:622–Master of Computer Applications Session: FN
Subject Code/Name: MC25104/Data structures and Algorithms using python Class:S1 MCA

QUESTION SET

[Link] a student record management system.

[Link] a Bank Account Simulation using Oop.

[Link] Custom Stack and Queue ADTs with Recursion and Algorithm Analysis.

4. Recursive Merge sort with Operation count and custom object sorting.

5. Implement sorting algorithms in python bubble sort, selection sort.

6. Implement Linear Search, Binary search, Hash Table with collision handling.

7. Implement Binary Tree ADT.

8. Implement an AVL Tree class with Rotations (LL, RR, LR,RL).

9. Implement Breadth-First Search(BFS), Depth-first Search(DFS).

10. Implement Dijkstra’s Algorithm for shortest path(Greedy).

INTERNAL EXAMINER

You might also like