Scribd
Upload
13 views1 page

List of Lab Programs: Hasvita Institue of Engineering & Technology

The document lists 16 C++ programs to implement various data structures and algorithms. The programs cover implementing stack, queue, binary search tree, graph traversal, sorting algorithms, minimum spanning tree algorithms using Prim's and Kruskal's algorithms, and operations on hash tables and binary search trees.

Uploaded by

Sangeetha Bajanthri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
13 views1 page

List of Lab Programs: Hasvita Institue of Engineering & Technology

The document lists 16 C++ programs to implement various data structures and algorithms. The programs cover implementing stack, queue, binary search tree, graph traversal, sorting algorithms, minimum spanning tree algorithms using Prim's and Kruskal's algorithms, and operations on hash tables and binary search trees.

Uploaded by

Sangeetha Bajanthri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

HASVITA INSTITUE OF ENGINEERING & TECHNOLOGY

Temple Road, Keesara, RR Dis Class! II "#Te$% I Sem S&'! ADSA La'

LIST OF LA" (ROGRA)S


1. Write C++ Programs to Implement Stack ADT using an Array. 2. Write C++ Programs to Implement Queue ADT using an Array. 3. Write C++ Programs to Implement Stack ADT using a Singly inke! ist. ". Write C++ Programs to Implement Queue ADT using a Singly inke! ist. #. Write C++ Program to Implement De $ueue ADT using a Dou%ly inke! ist. &. Write a C++ Program to Per'orm Inserting an (lement) Deleting an (lement) an! Searc* 'or a +ey (lement in a ,inary Searc* Tree. -. Write a C++ Program to implement Circular Queue ADT using an Array. .. Write C++ Programs t*at use non/ recursi0e 'unctions to tra0erse t*e gi0en %inary tree in Pre 1r!er) In 1r!er an! Post 1r!er. 2. Write a C++ Program 'or t*e Implementation o' ,3S an! D3S 'or a gi0en 4rap*. 15. Write C++ Programs 'or Implement t*e 'ollo6ing Sorting 7et*o!s8 a9 Quick Sort %9 7erge Sort c9 :eap Sort %9 Deletion 'rom a , ; Tree 11. Write C++ Program to Per'orm t*e 'ollo6ing 1perations a9 Insertion into a , ; Tee a9 Insertion into an A< ; Tee %9 Deletion 'rom an A< ; Tree 13. Write a C++ Program to Implement +ruskal=s algorit*m to generate a 7inimum Spanning Tree. 1". Write a C++ Program to Implement Prim=s algorit*m to generate a 7inimum Spanning Tree. 1#. Write a C++ Program to implement all t*e 'unctions o' a Dictionary >ADT9 using :as*ing. 12. Write C++ Program to Per'orm t*e 'ollo6ing 1perations

You might also like