This repository has most of the basic operations on Data Structures using c Programming Language. These programs are also part of JSSSTU Information Science and Engineering - Data Structures and Applications Lab cycle ( 20IS36L).
1.Design, Develop and Implement a menu driven Program for the following
array operations.
a. Creating an array of N Integer Elements.
b. Display of array Elements with Suitable Headings.
c. Inserting an Element (ELEM) at a given valid Position (POS) .
d. Deleting an Element at a given valid Position (POS) .
e. Exit. Support the program with functions for each of the above
operations.
2.Design, Develop and Implement a Program for Strings
a. Insertion sort
b. Selection sort
3.Design, Develop and Implement a menu driven Program for
the following operations on STACK of Integers (Array Implementation of
Stack with maximum size MAX)
a. Push an Element onto Stack.
b. Pop an Element from Stack.
c. Demonstrate how Stack can be used to check Palindrome.
d. Demonstrate Overflow and Underflow situations on Stack.
e. Display the status of Stack.
f. Exit Support the program with appropriate functions for each of the
above operations.
4.Design, Develop and Implement a Program for converting an Infix
Expression to Postfix Expression. Program should support for both
parenthesized and free parenthesized expressions with the operators: +, -,
*, /, % (Remainder), ^ (Power) and alphanumeric operands.
5a. Evaluation of Suffix expression with single digit operands
and operators: +, -, *, /, %,^
5b. Solving Tower of Hanoi problem with n
disks.
6.Design, Develop and Implement a menu driven Program for the following
operations on Circular QUEUE of Characters (Array Implementation of
Queue with maximum size MAX) .
a. Insert an Element onto 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.
e. Exit Support the program with appropriate functions for each of the
above operations.
7.Design, Develop and Implement a menu driven Program for
the following operations on the Singly Linked List (SLL) of Student Data
with the fields: USN, Name, Programme, Sem, PhNo .
a. Create a SLL of N Students Data by using front insertion.
b. Display the status of SLL and count the number of nodes in it.
c. Perform Insertion / Deletion at End of SLL.
d. Perform Insertion / Deletion at Front of SLL(Demonstration of stack).
e. Exit
8.Design, Develop and Implement a menu driven Program for the following
operations on Doubly Linked List (DLL) of Employee Data with the fields:
SSN, Name, Dept, Designation, Sal, PhNo .
a. Create a DLL of N Employees Data by using end insertion.
b. Display the status of DLL and count the number of nodes in it.
c. Perform Insertion and Deletion at End of DLL .
d. Perform Insertion and Deletion at Front of DLL.
e. Demonstrate how this DLL can be used as Double Ended Queue.
f. Exit.
9.Design, Develop and Implement a Program for the following operations on
Singly Circular Linked List (SCLL) with header nodes
a. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y
2
z-4yz5 +3x3
yz+2xy5
z-2xyz3
.
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and
store the result in POLYSUM(x,y,z) Support the program with appropriate
functions for each of the above operations.
10.Design, Develop and Implement a menu driven Program for the following
operations on Binary Search Tree (BT) of Integers .
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2.
b. Traverse the BT in Inorder, Preorder and Post Order.
c. Search the BT for a given element (KEY) and report the appropriate
message .
d. Exit.
11.Design, Develop and Implement a menu driven Program for the following
operations on Binary Search Tree (BST) of Integers .
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2.
b. Traverse the BST in Inorder, Preorder and Post Order.
c. Search the BST for a given element (KEY) and report the appropriate
message .
d. Exit.
12.Given a file of N employee records with a set K of Keys (4-digit) which
uniquely determines the records in file F. Assume that file F is maintained
in memory by a Hash Table (HT) of m memory locations with L as the set
of memory addresses (2-digit) of locations in HT. Let the keys in K and
addresses in L are Integers. Design and develop a Program in C that uses
Hash function H: K→ L as H(K)=K mod m (remainder method), and
implement hashing technique to map a given key K to the address space L.
Resolve the collision (if any) using linear probing