JIS University

Day Particulars
Design, develop and implement a program in C for the following Array operations
a. Creating an Array of N Integer Elements
1 Data Structure
b. Display of Array Elements Lab
with Suitable Manual
Headings
c. Inserting an Element
Odd at a given 2019
Semester valid [July
position
to December]
d. Deleting an Element at a given valid position
e. Merge two sorted arrays
Design and develop a program in C for the following operations on singly Linked
List (SLL) :
a. Create a SLL of N integer data items
2
b. Display the status of SLL and count the number of nodes in it
c. Perform insertion and deletion at any position of SLL
d. Print the elements in reverse order
Design, Develop and Implement a Program in C for the following operations on
Strings
a. Read a main String (str), a Pattern String (mat) and a Replace String (rep)
3 b. Perform Pattern Matching Operation: Find and Replace all occurrences of mat in
str with rep if mat exists in str. Report suitable messages in case mat does not exist in
str

Design, Develop and Implement a menu driven Program in C for the following
operations on STACK
of Integers (Array Implementation of Stack with maximum size MAX)
4
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Demonstrate Overflow and Underflow situations on Stack
a. Design, Develop and Implement a Program in C for converting an Infix
5 Expression to Postfix Expression
b. Solving “Tower of Hanoi” problem with “n” disks
Design, Develop and Implement a menu driven Program in C for the following
operations on Circular
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
6
b. Delete an Element from Circular QUEUE
c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
Support the program with appropriate functions for each of the above operations
Design, Develop and Implement a menu driven Program in C for the following
operations on AVL-Binary Search Tree (BST) of Integers
a. Create an AVL-BST of N Integers: 5, 9, 0, 1, 2, 3, 4, 10, 11, 6
7 b. Traverse the AVL-BST in Inorder, Preorder and Post Order
c. Search the AVL-BST for a given element (KEY) and report the appropriate
message
d. Delete an element (ELEM) from AVL- BST
Design, Develop and Implement a menu driven Program in C fo r
the following operations on Max-Heap tree of Integers
8 a. Create an Max-Heap of N Integers: 5, 9, 0, 1, 2, 3, 4, 10, 11, 6
c. Insert a new member: 7
d. Delete an element (ELEM) from Max-Heap
Design, Develop and Implement a Program in C for the following operations on
Graph(G) of Cities
a. Create a Graph of N cities using Adjacency Matrix.
9
b. Print all the nodes reachable from a given starting node in a digraph using BFS
method
c. Check whether a given graph is connected or not using DFS method.
Create a data array and store the values in sequence: 952, 863, 718, 591, 605, 484,
396, 217, 182
Apply
a. Bubble Sort
10 b. Insertion Sort
c. Selection Sort
d. Shell Sort
e. Radix Sort
Compute the CPU-time cycles for each sorting algorithm
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table
11 of length 10 using open addressing with hash function h(k) = k mod 10 and linear
probing. Develop a C program and print the table.
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]

Practical 1:
e. Merge Design, develop and implement a program in C for the following Array operations
two sorted a. Creating an Array of N Integer Elements
arrays b. Display of Array Elements with Suitable Headings
c. Inserting an Element at a given valid position
d. Deleting an Element at a given valid position
*****************************Screen Shot of Code****************************
******************************Screen Shot of Output **************************
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]
Practical 2:
Design, Develop and Implement a menu driven Program in C for the following operations on STACK
of Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Demonstrate Overflow and Underflow situations on Stack

*****************************Screen Shot of Code****************************

******************************Screen Shot of Output **************************
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]

Practical 3:
Design, Develop and Implement a menu driven Program in C for the following operations on
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to QUEUE
b. Delete an Element from QUEUE
c. Demonstrate Overflow and Underflow situations on
QUEUE
d. Display the status of QUEUE
Support the program with appropriate functions for each of the above operations

*****************************Screen Shot of Code****************************

******************************Screen Shot of Output **************************
R=0, F=0, R=1,F=1 R=2, F=2
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]

Practical 4
Design, Develop and Implement a menu driven Program in C for the following operations on Circular
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE
c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
Support the program with appropriate functions for each of the above operations

R=0

V=100
V=20

V=12 F= 1
V=56

V=13
V=55

*****************************Screen Shot of Code****************************

******************************Screen Shot of Output **************************
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]

Practical 5

d. Design and develop a program in C for the following operations on singly Linked List (SLL) :
Print a. Create a SLL of N integer data items
the b. Display the status of SLL and count the number of nodes in it
c. Perform insertion and deletion at any position of SLL
elements in reverse order

***********************Screen Shot of Code **************************

**************************Screen Shot of Output **********************
 JIS University

Data Structure Lab Manual

Odd Semester 2019 [July to December]

Practical 6

a. Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix Expression
b. Solving “Tower of Hanoi” problem with “n” disks

***********************Screen Shot of Code **************************

**************************Screen Shot of Output **********************