DataStructure - 1BM22CS135

LABORATORY PROGRAM-1

Write a program to simulate the working of stack using an array with the following : a) Push b) Pop c) Display The program should print appropriate messages for stack overflow, stack underflow

LABORATORY PROGRAM-2

WAP to convert a given valid parenthesized infix arithmetic expression to postfix expression. The expression consists of single character operands and the binary operators + (plus), - (minus), * (multiply) and / (divide)

LABORATORY PROGRAM-3(A)

WAP to simulate the working of a queue of integers using an array. Provide the following operations: Insert, Delete, Display The program should print appropriate messages for queue empty and queue overflow conditions

LABORATORY PROGRAM-3(B)

WAP to simulate the working of a circular queue of integers using an array. Provide the following operations: Insert, Delete & Display The program should print appropriate messages for queue empty and queue overflow conditions

LABORATORY PROGRAM-4(A)

WAP to Implement Singly Linked List with following operations a) Create a linked list. b) Insertion of a node at first position, and at end of list. c) Delete a node at front and at the end of the list. d) Display the contents of the linked list.

LABORATORY PROGRAM-4(B)

5. WAP to Implement Singly Linked List with following operations a) Create a linked list. b) Insertion of a node at first position, and at end of list and at any position c) Delete a node at front and at the end of the list and at any position d) Display the contents of the linked list.

LABORATORY PROGRAM-5

WAP to Implement Circular Singly Linked List with following operations a) Create a linked list. b) Insertion of a node at first position, and at end of list and at any position c) Delete a node at front and at the end of the list and at any position d) Display the contents of the linked list.

LABORATORY PROGRAM-6(A)

WAP to Implement Single Link List with following operations: Sort the linked list, Reverse the linked list, Concatenation of two linked lists.

LABORATORY PROGRAM-6(B)

WAP to Implement Single Link List to simulate Stack & Queue Operations.

LABORATORY PROGRAM-7

WAP to Implement doubly link list with primitive operations a) Create a doubly linked list. b) Insert a new node to the left of the node. c) Delete the node based on a specific value d) Display the contents of the list

LABORATORY PROGRAM-8

8. Write a program a) To construct a binary Search tree. b) To traverse the tree using all the methods i.e., in-order, preorder and post order c) To display the elements in the tree. d) Also perform finding the immediate predecessor and immediate successor in inorder traversal using BST.

LABORATORY PROGRAM-9

Given a File of N employee records with a set K of Keys(4-digit) which uniquely determine 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 i. linear probing ii. Quadratic Probing iii. Double Hashing

LABORATORY PROGRAM-10(A)

Write a program to traverse a graph using BFS method.

LABORATORY PROGRAM-10(B)

Write a program to check whether given graph is connected or not using DFS method.