0% found this document useful (0 votes)
44 views1 page

Data Structures and Algorithms (Practical) : L T P: 3 0 0 Credits: 02

This document outlines 14 practical programming assignments for a Data Structures and Algorithms course. The assignments cover fundamental data structures like arrays, linked lists, stacks, queues and their common operations such as searching, inserting, deleting and reversing elements. Students will implement basic list, stack and queue structures and algorithms like towers of Hanoi using both arrays and linked lists.

Uploaded by

Tanvi Sharma
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
0% found this document useful (0 votes)
44 views1 page

Data Structures and Algorithms (Practical) : L T P: 3 0 0 Credits: 02

This document outlines 14 practical programming assignments for a Data Structures and Algorithms course. The assignments cover fundamental data structures like arrays, linked lists, stacks, queues and their common operations such as searching, inserting, deleting and reversing elements. Students will implement basic list, stack and queue structures and algorithms like towers of Hanoi using both arrays and linked lists.

Uploaded by

Tanvi Sharma
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/ 1

Data Structures and Algorithms (Practical)

L T P: 3 0 0
Credits: 02

List of Practicals
Program Title

1. Linear Search
2. Finding the maximum element in an array
3. Create 5 nodes in singly linked list
4. Insert an element in the beginning of singly linked list.
5. Insert an element in the end of singly linked list.
6. Insert an element at any position in singly linked list.
7. Counting the number of nodes in singly linked list.
8. Implement stack using array.
9. Implement stack using linked list.
10. Implement circular queue
11. Insert an element at any position in doubly linked list.
12. Delete a node at given position in doubly linked list.
13. Tower of Hanoi.
14. Reverse a string using stack

You might also like