AD3271 DSD-SET-2Data Represent-UNIV.docx

nandhinimca0606 7 views 12 slides Aug 29, 2025
Slide 1
Slide 1 of 12
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12

About This Presentation

Data Representation, Using spread sheets for basic operations on data and
visualize the data.


Slide Content

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
1.Implement a Stack ADT using Python classes. Demonstrate its usage with push, pop, and
peek operations
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
2. Implement a Queue ADT using Python classes. Perform enqueue and dequeue operations.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
3.Create a Python class for a Deque (double-ended queue). Include methods for insertion,
deletion, and display.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
4.Write a recursive Python function to calculate the factorial of a number.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
5.Implement a recursive function in Python to compute the nth Fibonacci number.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
6.Write a recursive function in Python to perform binary search on a sorted list.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
7.Implement the Tower of Hanoi problem using a recursive algorithm in Python.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
8.Implement a List ADT using Python arrays with operations for insertion, deletion, and
search.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
9.Write a Python program to merge two sorted arrays into a single sorted array.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
10.Create a Python program to reverse the elements of an array without using built-in
methods.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
11. Implement a singly linked list in Python. Include functions for insertion, deletion, and
searching for a node.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
12. Write a Python program to implement a doubly linked list with insertion, deletion,
and traversal operations.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
13. Implement a circular linked list in Python. Include methods for insertion, deletion, and
display.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
14. Write a Python program to detect a loop in a linked list.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
15. Implement a Stack ADT using a linked list in Python. Perform push, pop, and peek
operations.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
16. Write a Python program to implement a Queue ADT using a linked list. Perform
enqueue and dequeue operations.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
17. Create a circular queue using Python lists. Include methods for enqueue, dequeue, and
display.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
18.Write a Python program to evaluate a postfix expression using a stack.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
19. Implement a Python program to check if a string has balanced parentheses using a stack.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
20. Create a Python program to perform level-order traversal of a binary tree using a queue
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
21.Implement a Stack ADT using a linked list in Python. Perform push, pop, and peek
operations
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner
ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
22.Write a Python program to detect a loop in a linked list.
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner

ANNA UNIVERSITY: CHENNAI - 25
B.E / B.Tech PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2025
AD3271 – DATA STRUCTURES DESIGN LABORATORY
23. Create a Python program to perform level-order traversal of a binary tree using a queue
Aim &
Algorithm (20)
Program (30)Output &
Result (30)
Viva (10)Record (10)Total (100)
Internal Examiner External Examiner