Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
7 views

Data Structure Practical Assignment

Practice question of data structure for students
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
0% found this document useful (0 votes)
7 views

Data Structure Practical Assignment

Practice question of data structure for students
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/ 1

Data Structure Practical Assignment

Submission date:
Q. 1 to Q. 11 — 22 Dec 2024
Q. 12 onwards - 28 Dec 2024.

Note:
For each of the following statements do the following:
1. Write an algorithm
2. Write code with output
3. Dry run the code with some data values. (Write all steps)

1. Implement the following: a. Write a program to store the elements in a 1-D array and
perform the operations like searching, sorting and reversing the elements. [Menu Driven].
2. Read the two arrays from the user and merge them and display the elements in sorted
order. [Menu Driven].
3. Write a program to perform the Matrix addition, Multiplication and Transpose Operation.
[Menu Driven].
4. Write a program to create a singly linked list and display the node elements in reverse
order.
5. Write a program to search the elements in the linked list and display the same.
6. Write a program to create a doubly linked list and sort the elements in the linked list.
7. Write a program to implement the concept of Stack with Push, Pop, Display and Exit
operations. (Implement stack using both array and stack)
8. Write a program to convert an infix expression to postfix and prefix conversion.
9. Write a program to implement the Tower of Hanoi problem.
10. Write a program to implement the concept of Queue with Insert, Delete, Display and Exit
operations. |Implement queue using both array and stack)
11. Write a program to implement the concept of priority Queue.
12. Write a program to implement bubble sort.
13. Write a program to implement selection sort.
14. Write a program to implement insertion sort.
15. Write a program to implement merge sort.
16. Write a program to search the element using binary search.
17. Write a program to generate the adjacency matrix.

You might also like