SCHOOL OF COMPUTING

Department of Computer Science

&Engineering

LAB RECORD NOTE BOOK

Name of the Student : KRISHNARAMANI SADANAND

THIPPABATHINI

VtU / Register Number : Vtu17698 /

20UECS0510
Subject : DATA STRUCTURES LAB
Subject Code : 1151CS301
Degree : B.TECH
Department : CSE

Semester/Academic Year: Summer Semester / 2021 - 22

 Ceritificate

Certified that this is the bonafide record of work done by Mr./Ms.

______KRISHNARAMANI SADANAND THIPPABATHINI_____________

Reg. No. / VtU No. __20UECS0510 / _____Vtu17698______ __ of _II year _III

semester, in the CSE

branch during the academic year 2021 -2022 .

Signature of faculty In-Charge Signature of the Head of the

Department with date- with date

Submitted for the University Practical Examination held on _____________.

Signature of the Examiner-1 Signature of the Examiner-2

with date with date
 Index
Marks
S. No Topic Name Date out of 15 sign

1. ARRAY ADT
Basic Operations in ADT: Creating an array, displaying of
i 12-08-2021
array elements, Inserting an element
Problems related to: Finding duplicates, missing element,
ii 12-08-2021
minimum difference and rotations
2. LINKED LIST

i. Singly Linked List: Operations in Ascending Order 19-08-2021

ii. Doubly Linked List: Get reversed in from the given order 19-08-2021
Circular Linked List: Choose the place in the end of the
iii. 19-08-2021
circle so that you are the last one.
3. STACK ADT

i. i) Stack using Array 02-09-2021

ii. ii) Find all elements greater than their Right element 02-09-2021

iii. iii) Infix To Postfix Conversion 09-09-2021

iv. iv) Balanced Parenthesis 09-09-2021

v. v) Tower of Hanoi 09-09-2021

4. Queue ADT

i. Basic Operations of Queue ADT Using Array 16-09-2021

ii. Queue Implementation using Stack 16-09-2021

iii. Circular Queue of Characters 23-09-2021

5. BINARY SEARCH TREE

i. Basic Operations of BS 23-09-2021

ii. Tree Traversal with Recursion 30-09-2021

iii. Tree Traversal without Recursion 30-09-2021

iv. Find the Depth and Height of the tree 07-10-2021

v. Find the MIN and MAX element of the tree. 07-10-2021

6. HASHING

i. Basic Hashing Technique 21-10-2021

ii. Linear Probing 21-10-2021

iii. Separate Chaining 21-10-2021

iv. Character Frequency Counting 28-10-2021

v. Number Frequency Counting 28-10-2021

7. GRAPH

i. Read the adjacent Vertices from given Matrices 10-11-2021

ii. Find the Shortest Path using Dijkstra’s Algorithm 10-11-2021

Find Minimum Spanning Tree using Prim’s algorithm
iii. 10-11-2021
(based on Priority Queue)
Find Minimum Spanning Tree using Kruskal’s algorithm
iv. 10-11-2021
- using Disjoint subsets and Union find algorithm
v. Topological Sorting 10-11-2021

vi. Graph Traversal using Depth First Search 10-11-2021

vii. Graph Traversal using Breadth First Search 10-11-2021

8. SORTING

i. Insertion Sort 17-11-2021

ii. Merge sort 17-11-2021

iii. Quick Sort 17-11-2021

iv. Bubble sort 17-11-2021

v. Radix sort. 17-11-2021

9. SEARCHING

i. Implementation of Linear Search 17-11-2021

ii. Implementation of Binary Search 17-11-2021