Data Structure Practical Slips from 1 to 15

Data Structure Practical Slips


SLIP 1

 Q.1. Data Structure

A) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes

- Create a Binary Search Tree

- Insert element in a Binary Search Tree

- Display

[20 M]


B) Write a ‘C’ program to evaluate a given polynomial using function. (Use array).

[10 M]


SLIP 2

Q.1. Data Structure

A) Write a ‘C’ program to accept a string from user and reverse it using Static

implementation of Stack.

[20 M]


B) Write a ‘C’ program to create Circularly Doubly Linked list and display it.

[10 M]


SLIP 3

Q.1. Data Structure

A)Write a program to create two singly linked list of elements of type integer and find

the union of the linked lists. (Accept elements in the sorted order)

[20 M]


B) Write a ‘C’ program to read the adjacency matrix of directed graph and convert it

into adjacency list.

[10 M]


SLIP 4

Q.1. Data Structure

A) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes

- Create a Binary Search Tree

- Traverse it by using Inorder and Postorder traversing technique

[20 M]


B) Write a ‘C’ program to accept two polynomial and find the addition of accepted

polynomials.(use array)

[10 M]



SLIP 5

Q.1. Data Structure

A)Write menu driven program using ‘C’ for Binary Search Tree. The menu includes

- Create a Binary Search Tree

- Traverse it by using Inorder and Preorder traversing technique

[20 M]


B) Write a ‘C’ program to create linked list with given number in which data part of

each node contains individual digit of the number.

(Ex. Suppose the number is 368 then the nodes of linked list should contain 3, 6, 8)

[10 M]


SLIP 6

Q.1. Data Structure

A) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes

- Create a Binary Search Tree

- Traverse it by using Preorder and Postorder traversing technique

[20 M]


B) Write a ‘C’ program to accept and sort n elements in ascending order by using

bubble sort.

[10 M]


SLIP 7

Q.1. Data Structure

A) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes
- Create a Binary Search Tree
- Display
- Delete a given element from Binary Search Tree
[20 M]


B) Write a ‘C’ program to create a singly linked list and count total number of nodes
in it and display the list and total number of Nodes.
[10 M]


SLIP 8

Q.1. Data Structure

A) Write menu driven program using ‘C’ for Binary Search Tree. The menu includes

- Create a Binary Search Tree

- Display

- Search the element in Binary Search Tree

[20 M]


B) Write a ‘C’ program to accept and sort n elements in ascending order by using

insertion sort.

[10 M]


SLIP 9

Q.1. Data Structure

A) Write a program to accept a postfix expression and evaluate the expression using

the stack.

Example: Input: ab+cd-*

Values: a=4, b=2, c=5, d=3

Answer: 12

[20 M]


B) Write a ‘C’ program to create a singly linked list, reverse it and display both the

list. [10 M]


SLIP 10

Q.1. Data Structure

A) Write a ‘C’ program to read ‘n’ integers and store them in a Binary search tree and

display the nodes level wise.

[20 M]


B) Write a ‘C’ program to sort randomly generated array elements using Insertion sort

method. (Use Random Function)

[10 M]


SLIP 11

Q.1. Data Structure

A) Write a menu driven program using ‘C’ for singly linked list-

- To create linked list.

- To display linked list

- To search node in linked list.

- Insert at last position

[20 M]


B) Write a menu driven program using ‘C’ for Dynamic implementation of Queue for

integers. The menu includes

- Insert

- Delete

- Display

- Exit

[10 M]


SLIP 12

Q.1. Data Structure

A)Write a C program that accepts the graph as an adjacency matrix and checks ifthe

graph is undirected. The matrix for undirected graph is symmetric. Also calculate in

degree of all vertices

- Read a graph as adjacency Matrix

- Check the matrix is symmetric or not

- Calculate indegree of all vertices

[20 M]


B) Write a ‘C’ program to accept and sort n elements in ascending order using

Selection sort method.

[10 M]


SLIP 13

Q.1. Data Structure

A) Write a C program to accept an infix expression and convert it into postfix

form.(Use Static Implementation of Stack)

Example: - A * B + C as AB*C+


[20 M]

B) Write a ‘C’ program to create doubly link list and display nodes having odd value

[10 M]


SLIP 14

Q.1. Data Structure

A) Write a ‘C’ program to accept a string from user and reverse it using Dynamic

implementation of Stack.

[20 M]


B)Write a ‘C’ program to accept names from the user and sort in alphabetical order

using bubble sort

- Accept n name

- Bubble sort Function

- Display

[10 M]


SLIP 15

Q.1. Data Structure

A) Write a ‘C’ program to accept an infix expression, convert it into its equivalent

postfix expression and display the result.(Use Dynamic Implementation of Stack)

[20 M]


B)Write menu driven program using ‘C’ for Dynamic implementation of Stack. The

menu includes following operations:

- Push

- Pop

- Display

- Exit

[10 M]



Comments

Popular posts from this blog

Classical Problems of Synchronization in OS

Semester IV : Assignment #1 OPERATING SYSTEM