15CSL38 Data Structures Laboratory syllabus for IS

1. Design, Develop and Implement a menu driven Program in C for the followingArray 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 in C for the following operationsonStrings
a. Read a main String (STR), a Pattern String (PAT) and a Replace String(REP)
b. Perform Pattern Matching Operation: Find and Replace all occurrences ofPAT in STR with REP if PAT exists in STR. Report suitable messages incase PAT does not exist in STR
Support the program with functions for each of the above operations. Don\'t useBuilt-in functions.

3. Design, Develop and Implement a menu driven Program in C for the followingoperations on STACK of Integers (Array Implementation of Stack with maximumsize MAX)
a. Push an Element on to 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 in C for converting an InfixExpression to Postfix Expression. Program should support for both parenthesizedand free parenthesized expressions with the operators: +, -, *, /, %(Remainder),^(Power) and alphanumeric operands.

5. Design, Develop and Implement a Program in C for the following StackApplications
a. Evaluation of Suffix expression with single digit operands and operators:+, -, *, /, %, ^
b. Solving Tower of Hanoi problem with n disks

6. Design, Develop and Implement a menu driven Program in C for the followingoperations on Circular QUEUE of Characters (Array Implementation of Queuewith 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
e. Exit
Support the program with appropriate functions for each of the above operations

7. Design, Develop and Implement a menu driven Program in C for the followingoperations on Singly Linked List (SLL) of Student Data with the fields: USN,Name, Branch, 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 in C for the followingoperations 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 in C for the following operationsonSingly Circular Linked List (SCLL) with header nodes
a. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) andstore the result in POLYSUM(x,y,z)

10. Design, Develop and Implement a menu driven Program in C for the followingoperations 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
e. Exit

11. Design, Develop and Implement a Program in C for the following operations onGraph(G) of Cities
a. Create a Graph of N cities using Adjacency Matrix.
b. Print all the nodes reachable from a given starting node in a digraph usingDFS/BFS method

12. Given a File of N employee records with a set K of Keys(4-digit) which uniquelydetermine the records in file F. Assume that file F is maintained in memory by aHash 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. Designand develop a Program in C that uses Hash function H: K ®L as H(K)=K modm (remainder method), and implement hashing technique to map a given key Kto the address space L. Resolve the collision (if any) using linear probing.