G.H.

Patel of College of Engineering and Technology

Department of Computer Engineering

Vision

 To produce globally competitive computer engineers, who are prepared to accept the
challenges at professional level, while maintaining the core values.

Mission

 To create excellent teaching learning environment.

 To mould engineers with a strong foundation of scientific knowledge and engineering
concepts.
 To enhance the acquired concepts and develop new technology through excellence in
research.
 To assist nation building and elevating the quality of life of the people through
leadership in professionalism, education, research and public services.

Programme Educational Objectives (PEO)

 To educate young aspirants with the fundamentals of engineering and knowledge of

latest technologies.
 To encourage the students to remain updated by pursuing higher degree or
certification programs.
 To assume management and leadership roles to contribute in socio-economic
development of the nation.
 G.H. Patel of College of Engineering & Technology
Department of Computer Engineering

Academic year: 2022-23

Semester : 3
Subject Name: Data Structures
Subject Code: 102040301

INDEX
Name: ……………………………………………………………………………………………………………..

Enrolment No: ……………………………………… Branch: Computer Engineering

Sr. Page Date Marks Signature

Name of Experiment
No. No.
1) Write a program to insert/delete in a linear array
at specific position.
2) Write a program to remove duplicate elements
01 from linear array.
3) Write a program to read 10 integers in an array.
Sort them in ascending order.

1) Write a program to demonstrate the concept of

Call by value and Call by Reference.
2) Write a program to implement stack using array
that performs the following operations.
02 (a) PUSH, (b) POP, (c) PEEK, (d) ISEMPTY, (e)
ISFULL, (f) DISPLAY.
3) Write a program to reverse array elements using
stack.

1) Write a program to evaluate postfix expressions

using stack.
2) Write a program to check for balanced parenthesis
03 using stacks.
3) Write a program to check whether the string is
palindrome or not using stack.
 1) Write a program to convert infix expression to
04 postfix expression using stack.

1) Write a program to implement queue using array

that performs the following operations
(a) ENQUEUE, (b) DEQUEUE, (c) ISEMPTY, (d)
ISFULL, (e) DISPLAY.
05 2) Write a program to implement circular queue
using array that performs the following operations
(a) ENQUEUE, (b) DEQUEUE, (c) ISEMPTY, (d)
ISFULL, (e) DISPLAY.

1) Write a menu driven program to implement singly

linked list that performs the following operations
(a) createList(): To create the list with ‘n’ number
of nodes initially as defined by the user.
(b) traverse():The given traverse() function
06 traverses and prints the content of the linked
list.
(c) insertAtFront(): This function simply inserts
an element at the front/beginning of the linked
list.

1) Write a menu driven program to implement

following functions in a singly linked list
(a) insertAtEnd(): This function inserts an
element at the end of the linked list.
(b) insertAtPosition(): This function inserts an
element at a specified position in the linked
list.
(c) deleteFirst(): This function simply deletes an
element from the front/beginning of the linked
07
list.
(d) deleteEnd(): This function simply deletes an
element from the end of the linked list.
(e) deletePosition(): This function deletes an
element from a specified position in the linked
list.
(f) reverseLL(): This function reverses the given
linked list.

1) Write a program to implement stack using linked

list that performs the following operations
(a) PUSH, (b) POP, (c) PEEK, (d) ISEMPTY, (e)
08 ISFULL, (f) DISPLAY.
2) Write a program to implement queue using linked
list that performs the following operations
(a) ENQUEUE, (b) DEQUEUE, (c) ISEMPTY, (d)
 ISFULL, (e) DISPLAY.

1) Write a program to implement doubly linked list

that performs the following operations
(a) Insert a node at the front of the linked list.
(b) Insert a node at the end of the linked list.
(c) Delete a last node of the linked list.
(d) Delete a node before specified position.
09 2) Write a program to implement circular linked list
that performs the following operations
(a) Insert a node at the end of the linked list.
(b) Insert a node before specified position.
(c) Delete a first node of the linked list.
(d) Delete a node after specified position.

1) Write a program to construct binary tree using

array.
10 2) Write a program to traverse binary search tree
using linked list.

1) Write a program to implement depth-first search.

2) Write a program to implement breadth-first
11
search.

1) Write a program to implement linear search and

binary search algorithms.
12 2) Write a program to implement insertion sort and
selection sort algorithms.

1) Write a program to implement quick sort and

13 merge sort algorithms.

1) Write a program to implement a hash table.

14
Additional Programs

1) Implement a program to convert infix notation to

1 prefix notation using stack.

1) Write a program to implement radix sort and

2 bucket sort algorithms.

1) Write a program to implement the mechanism to

handle hash collision by
3 1. Separate chaining.
2. Open addressing.

1) Exercise 2.2.8 from “ Data Structures using C and

C++” by Yedidyah Langsam, Moshe J. Augenstein
4
and Aaron M. Tenenbaum.
 G.H. Patel of College of Engineering & Technology
Department of Computer Engineering

Academic year: 2022-23

Semester : 3
Subject Name: Data Structures
Subject Code: 102040301

INDEX
Name: ……………………………………………………………………………………………………………..

Enrolment No: ……………………………………… Branch: Computer Engineering

Sr.
List of Assignment(s) Page No. Date Marks Signature
No.

1 Assignment 1

2 Assignment 2

3 Assignment 3

4 Mini Project