Scribd
Upload
3 views1 page

Data Structure Lab Questions

The lab assignment focuses on various data structure operations including insertion and deletion in arrays and linked lists, stack and queue implementations using both arrays and linked lists, and the creation of doubly and circular linked lists. Additionally, it covers searching techniques such as linear and binary search, sorting algorithms like insertion, selection, bubble, quick, and heap sort, and the creation of a binary search tree with traversal methods. Each task aims to enhance understanding of fundamental data structure concepts and their practical applications.

Uploaded by

devsingha200716
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 views1 page

Data Structure Lab Questions

The lab assignment focuses on various data structure operations including insertion and deletion in arrays and linked lists, stack and queue implementations using both arrays and linked lists, and the creation of doubly and circular linked lists. Additionally, it covers searching techniques such as linear and binary search, sorting algorithms like insertion, selection, bubble, quick, and heap sort, and the creation of a binary search tree with traversal methods. Each task aims to enhance understanding of fundamental data structure concepts and their practical applications.

Uploaded by

devsingha200716
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

Lab Assignment : Data Structure

1. To insert and delete elements from an array of size ‘n’ and display the updated array.
2. To create a linked list , insert in a linked list, delete from a linked list and display the linked
list
3. To implement the basic operations on stack (push and pop) using array.
4. To implement the basic operations on stack (push and pop) using linked list.
5. To implement the basic operations on queue (add and remove) using array.
6. To implement the basic operations on queue (add and remove) using linked list.
7. To create a doubly linked list , insert in a doubly linked list, delete from a doubly linked list
and display the doubly linked list.
8. To create a circular linked list, and display the circular linked list
9. To search a particular element in an array of n element using
a) Linear search
b) Binary search
10. To sort an array of n elements using
a) Insertion sort
b) Selection sort
c) Bubble sort
d) Quick sort
e) Heap sort
11. To create a binary search tree and display the nodes in binary search tree in preorder,
inorder and post order using Doubly linked list

You might also like