Finance[US] Career Guide Free Tutorials Go to Your University Placement Preparation 
0 like 0 dislike
6.7k views
in VTU B.Tech (CSE-III Sem) Data Structure Lab by Goeduhub's Expert (7.1k points)

Visvesvaraya Technological University(VTU) B.Tech (CSE-III Sem) Data Structure Lab Experiments and Solutions With Required Theory

VTU Home

1 Answer

0 like 0 dislike
by Goeduhub's Expert (7.1k points)
edited by
 
Best answer

Visvesvaraya Technological University(VTU) B.Tech (CSE-III Sem) Data Structure Lab

S.No.List of Experiments
1.Design, Develop and Implement a menu driven Program in C for the following array operations.
  • Creating an array of N Integer Elements
  • Display of array Elements with Suitable Headings
  • Inserting an Element (ELEM) at a given valid Position (POS)
  • Deleting an Element at a given valid Position (POS)
  • Exit.

Support the program with functions for each of the above operations.

To see full Solution Click here

2.Design, Develop and Implement a Program in C for the following operations on Strings.
  • Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
  • 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.

To see full solution Click here

3.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)

  • Push an Element on to Stack
  • Pop an Element from Stack 
  • Demonstrate how Stack can be used to check Palindrome
  • Demonstrate Overflow and Underflow situations on Stack
  • Display the status of Stack
  • Exit

Support the program with appropriate functions for each of the above operations

To see full solution Click here

4.Design, Develop and Implement a Program in C 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.
5.Design, Develop and Implement a Program in C for the following Stack Applications
6.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)

  • Insert an Element on to Circular QUEUE
  • Delete an Element from Circular QUEUE
  • Demonstrate Overflow and Underflow situations on Circular QUEUE
  • Display the status of Circular QUEUE
  • Exit

Support the program with appropriate functions for each of the above operations

To see full solution Click here

7.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, Programme, Sem,PhNo

  • Create a SLL of N Students Data by using front insertion.
  • Display the status of SLL and count the number of nodes in it
  • Perform Insertion / Deletion at End of SLL
  • Perform Insertion / Deletion at Front of SLL(Demonstration of stack)
  • Exit

For full solution Click Here

8.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

  • Create a DLL of N Employees Data by using end insertion.
  • Display the status of DLL and count the number of nodes in it
  • Perform Insertion and Deletion at End of DLL
  • Perform Insertion and Deletion at Front of DLL
  • Demonstrate how this DLL can be used as Double Ended Queue.
  • Exit

For full solution Click Here

9.Design, Develop and Implement a Program in C for the following operations on Singly Linked List
  • Find the sum of two polynomials

For full solution Click Here

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

For full solution Click Here

Learn & Improve In-Demand Data Skills Online in this Summer With  These High Quality Courses[Recommended by GOEDUHUB]:-

Best Data Science Online Courses[Lists] on:-

Claim your 10 Days FREE Trial for Pluralsight.

Best Data Science Courses on Datacamp
Best Data Science Courses on Coursera
Best Data Science Courses on Udemy
Best Data Science Courses on Pluralsight
Best Data Science Courses & Microdegrees on Udacity
Best Artificial Intelligence[AI] Courses on Coursera
Best Machine Learning[ML] Courses on Coursera
Best Python Programming Courses on Coursera
Best Artificial Intelligence[AI] Courses on Udemy
Best Python Programming Courses on Udemy

Related questions

 Important Lists:

Important Lists, Exams & Cutoffs Exams after Graduation PSUs

 Goeduhub:

About Us | Contact Us || Terms & Conditions | Privacy Policy ||  Youtube Channel || Telegram Channel © goeduhub.com Social::   |  | 

 

Free Online Directory

...