3RD SEM VTU Data Structure Lab Programs | All IN ONE

VTU 3rd sem CSE - Data Structure Lab Programs

Copy the code and execute all the programs.

  • Design, Develop and Implement a menu-driven Program in C for the following Array operations
    1. Creating an Array of N Integer Elements
    2. Display of Array Elements with Suitable Headings
    3. Inserting an Element (ELEM) at a given valid Position (POS)
    4. Deleting an Element at a given valid Position(POS)
    5. Exit.
  • Support the program with functions for each of the above operations.

Checkout

  • Design, Develop and Implement a Program in C for the following operations on Strings
    1. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
    2. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with REP if PAT exists in STR. Report suitable messages in case PAT does not exist in STR
  • Support the program with functions for each of the above operations. Don’t use Built-in functions.

Checkout

  • 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).
    1. Push an Element on to Stack
    2. Pop an Element from Stack
    3. Demonstrate how Stack can be used to check Palindrome
    4. Demonstrate Overflow and Underflow situations on Stack
    5. Display the status of Stack
    6. Exit
  • Support the program with appropriate functions for each of the above operations

Checkout

  • Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix Expression. Program should support for both parenthesizedand free parenthesized expressions with the operators: +, -, *, /, %(Remainder), ^(Power) and alphanumeric operands.

Checkout

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

Checkout

  • 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)
    1. Insert an Element on to Circular QUEUE
    2. Delete an Element from Circular QUEUE
    3. Demonstrate Overflow and Underflow situations on Circular QUEUE
    4. Display the status of Circular QUEUE
    5. Exit
  • Support the program with appropriate functions for each of the above operations

Checkout

  • Design, Develop and Implement a menu driven Program in C for the following operations on Singly Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo
    1. Create a SLL of N Students Data by using front insertion.
    2. Display the status of SLL and count the number of nodes in it
    3. Perform Insertion / Deletion at End of SLL
    4. Perform Insertion / Deletion at Front of SLL(Demonstration of stack)
    5. Exit

Checkout

  • Design, Develop and Implement a menu driven Program in C for the following operations on Doubly Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation, Sal, PhNo
    1. Create a DLL of N Employees Data by using end insertion.
    2. Display the status of DLL and count the number of nodes in it
    3. Perform Insertion and Deletion at End of DLL
    4. Perform Insertion and Deletion at Front of DLL
    5. Demonstrate how this DLL can be used as Double Ended Queue
    6. Exit

Checkout

  • Design, Develop and Implement a Program in C for the following operations on Singly Circular Linked List (SCLL) with header nodes
    1. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
    2. 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

Checkout

  • Design, Develop and Implement a menu driven Program in C for the following operations on Binary Search Tree(BST) of Integers
    1. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
    2. Traverse the BST in Inorder, Preorder and Post Order
    3. Search the BST for a given element (KEY) and report the appropriate message
    4. Exit

Checkout

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

Checkout

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 linear probing.

Checkout

Leave a Reply

Your email address will not be published. Required fields are marked *