Scribd
Upload
11 views1 page

Data Structures and Algorithms Guide

The document outlines a list of experiments focused on data structures, including searching techniques like Linear and Binary Search, various sorting algorithms such as Bubble, Selection, Insertion, Merge, and Quick Sort. It also covers implementations of Stack and Queue using arrays and linked lists, as well as different types of linked lists and their operations. Additionally, it includes tasks like evaluating postfix expressions and creating a student record management system.

Uploaded by

sitpoly2
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
11 views1 page

Data Structures and Algorithms Guide

The document outlines a list of experiments focused on data structures, including searching techniques like Linear and Binary Search, various sorting algorithms such as Bubble, Selection, Insertion, Merge, and Quick Sort. It also covers implementations of Stack and Queue using arrays and linked lists, as well as different types of linked lists and their operations. Additionally, it includes tasks like evaluating postfix expressions and creating a student record management system.

Uploaded by

sitpoly2
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

Data structure Experiment List

Searching Techniques
1. Implement Linear Search algorithm to search an element in an unsorted
array.
2. Implement Binary Search algorithm to search an element in a sorted /
unsorted array.

Sorting Techniques
3. Implement Bubble Sort algorithm.
4. Implement Selection Sort algorithm.
5. Implement Insertion Sort algorithm.
6. Implement Merge Sort algorithm.
7. Implement Quick Sort algorithm.

Stack and Queue


8. Implement Stack using an array.
9. Implement Stack using linked list.
[Link] Queue using an array.
[Link] Circular Queue using an array.
[Link] Queue using Linked List.

Linked List Implementations


[Link] Singly Linked List (SLL) with basic operations.
[Link] Doubly Linked List (DLL) with insertion and deletion.
[Link] Circular Linked List (CLL) using singly pointers.
[Link] Polynomial Addition using linked lists.
[Link] Postfix Expression using Stack.
[Link] Infix Expression to Postfix using Stack.
[Link] a Menu-driven Program demonstrating all Stack and Queue
operations.
[Link] a Student Record Management System using Linked Lists.

You might also like