Scribd
Upload
3 views2 pages

Dsa Lab Questions

The document outlines the practical examination for the Data Structures and Algorithms Laboratory for B.E/B.Tech students in the third semester, scheduled for November/December 2024. It includes a series of programming tasks that require students to write Python code for various data structures and algorithms, such as lists, stacks, queues, trees, and sorting methods. Each question is designed to assess the students' understanding and application of data structures and algorithms in Python.

Uploaded by

murugansubashtkp
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
3 views2 pages

Dsa Lab Questions

The document outlines the practical examination for the Data Structures and Algorithms Laboratory for B.E/B.Tech students in the third semester, scheduled for November/December 2024. It includes a series of programming tasks that require students to write Python code for various data structures and algorithms, such as lists, stacks, queues, trees, and sorting methods. Each question is designed to assess the students' understanding and application of data structures and algorithms in Python.

Uploaded by

murugansubashtkp
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
You are on page 1/ 2

B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2024

Third Semester CD3281 - DATA STRUCTURES AND ALGORITHMS LABORATORY

(Regulations 2021) Time : 3 Hours Answer any one question, Max. Marks 100

1. Write a Python code for class, Flower, that has three instance variables of type str, int, and float
that respectively represent the name of the flower, its number of petals, and its price. Your class
must include a constructor method that initializes each variable to an appropriate value, and your
class should include methods for setting the value of each type, and retrieving the value of each type
using ADTs.

2. a. Implement List ADT to store the elements 10, 20,30,40,50 and find any element and delete 30
from the list and display the elements after deletion using Python arrays.

b. Write a Python code to sort the N elements using insertion sort.

3. a. Write a Python code to implement List using linked list.

b. Write a Python code to sort the N elements using selection sort.

4. a. Write a Python code to implement Stack using ADTs.

b. Write a Python code to sort the N elements using quick sort.

5. a. Write a Python code to implement Queue using ADTs.

b. Write a Python code to sort the N elements using bubble sort.

6. a. Write a Python code to implement List using linked list.

b. Write a Python code to search an element using linear search.

7. a. Write a Python code to implement Stack using ADTs.

b. Write a Python code to search an element using Binary search

8. a. Write a Python code to implement Queue using ADTs.

b. Write a Python code to sort the N elements using merge sort.

9. a. Write a Python code to implement LIFO structure.

b. Write a Python code to find the element in a list by sequential order.

10. a. Write a Python code to implement FIFO structure.

b. Write a Python code to find the Fibonacci value of N using recursive function.

11. Write a Python code to implement the operations of List ADT using linked list and perform the
following

i. Create a Linked list with the elements 11,22,44,55


ii. Insert 33 after 22

iii. Delete the element 22 from the list

iv. Display the elements.

12. a. Write a Python code to implement Hash table.

b. Write a Python code to find the Factorial value of given number N using recursive function.

13. a. Write a Python code for Tree representation and traverse by Preorder.

b. Write a Python code to find the Fibonacci value of N using recursive function.

14. a. Write a Python code for Tree representation and traverse by Postorder.

b. Write a Python code to find the Fibonacci value of N using recursive function.

15. a. Write a Python code for Tree representation and traverse by Inorder.

b. Write a Python code to find the Fibonacci value of N using recursive function.

16. a. Write a Python code to implement Binary Search Trees by satisfying its properties.

b. Write a Python code to sort the N elements using selection sort.

17. a. Write a Python code to implement Heap.

b. Write a Python code to find the Factorial value of given number N using recursive function.

18. a. Write a Python code for Graph representation and Traverse it by anyone algorithm.

b. Write a Python code to sort the N elements using selection sort.

19. a. Write a Python code to implement minimum spanning tree by anyone algorithm.

b. Write a Python code to sort the N elements using bubble sort.

20. a. Write a Python code to implement single source shortest path algorithm.

b. Write a Python code to find the Factorial value of given number N using recursive function.

You might also like