Scribd
Upload
4 views3 pages

Index 1

The document outlines a series of experiments related to data structures, including operations on arrays, stacks, queues, linked lists, trees, and sorting techniques. Each experiment is detailed with specific tasks such as inserting and deleting elements, implementing various data structures, and performing sorting algorithms. The document serves as a comprehensive guide for practical applications in data structure operations.

Uploaded by

rakhiray11223344
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
4 views3 pages

Index 1

The document outlines a series of experiments related to data structures, including operations on arrays, stacks, queues, linked lists, trees, and sorting techniques. Each experiment is detailed with specific tasks such as inserting and deleting elements, implementing various data structures, and performing sorting algorithms. The document serves as a comprehensive guide for practical applications in data structure operations.

Uploaded by

rakhiray11223344
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/ 3

INDEX

PCA - 2
SL. PAGE
NO EXPERIMENT NAME NO.
1 EXPERIMENT NO1:- Implementa on of data 01-05
structure opera ons (inser on, dele on,
traversing and searching) in array. Linear search
and binary search
1) Solve:- Inser ng an Element to an array 01
using array module
2) Dele on an Element to an array using array 01
module:

2 EXPERIMENT NO2:- Implement of Stack, queue 02


opera on using array. Pop, Push, Inser on,
dele on, Implementa on of Circular queue. Infix
to pos ix expression evalua on. Implementa on
of stack opera ons in data structure:
1) Implementa on of stack opera ons in data 02
structure:
2) Implementa on of circular queue opera ons 04
in data structure:

3 EXPERIMENT NO3:- Implementa on of linked lists: 06-13


Single linked list, circular linked list, double linked
list, doubly circular linked list. Implementa on of
stack and queue using linked list. Merging two
linked list, Linked list representa on of a
polynomial, polynomial addi on, polynomial
mul plica on.
SL. EXPERIMENT NAME PAGE
NO NO.
1) Implementa on of single linked list in data 06
structure:
2) Implementa on of the circular linked list in 08
Data Structure:
3) Implementa on of double linked list in data 09
structure:
4) Implementa on of doubly Circular linked list 11
in data structure:
5) Implementa on of queue using linked list: 12

4 EXPERIMENT 4: Tree: crea ng Binary Search tree, 14-24


recursive and non recursive traversal of BST,
dele on in BST, calcula ng height of a BST,
building AVL tree. BST, dele on in BST, calcula ng
height of a BST, building AVL tree.

1) CREATING BINARY SEARCH TREE: 14

2) DELETION IN BST: 17

3) CALCULATING HEIGHT OF BST: 19


4) BUILDING AVL TREE: 20

5 EXPERIMENT 5: Implementa on of sor ng 24-28


techniques: selec on, bubble, quick sort, inser on
sort, merge sort, heap sot, implementa on of
priority queue. Hash table implementa on.
SL. EXPERIMENT NAME PAGE
NO NO.
1) SELECTION SORT: 24

2) BUBBLE SORT: 25

3) QUICK SORT: 26
4) INSERTION SORT: 27

_______________________ _________________________
TEACHER SIGNATURE INVIGILATOR SIGNATURE

You might also like