Scribd
Upload
19 views7 pages

DSU IMPQ by Campusify

Uploaded by

ketankotane70
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views7 pages

DSU IMPQ by Campusify

Uploaded by

ketankotane70
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

DSU

IMP QUESTION

Join Our Telegram Channel to get Total Free Engineering


Study Material
JOIN - https://t.me/campusifyy
SITE - https://www.campusify.co.in/

Downloaded From Campusify!


Chapter no 1: Introduction to Data Structures

(2 Marks)

1) Write any four operations on data structure.(CO1)


2) Explain linear and non-linear data structures. (CO1)
3) Define complexity and classify it. (CO1)
4) Define Abstract data type. (CO1)
5) Give classification of data structure. (CO1)

(4 Marks)

6) Implement a C program to insert an element in an array.(CO1)


7) Differentiate between linear and non-linear data structure.(any four points) (CO1)
8) Explain time and space complexity with an example. (CO1)
9) Write a C program for deletion of an element from an array. (CO1)
10) Define the term recursion. Write a program in C to display factorial of an entered number
using recursion. (CO1)

Chapter no 2: Searching and Sorting

(2 Marks)

1) Define Searching. What are its types? (CO2)


2) State the following terms.(CO2)
i) Searching
ii) Sorting

(4 Marks)

3) Sort the following numbers in ascending order using Insertion sort: (CO2)
25,15,4,103,62,9
4) Differentiate between Binary search and Linear search with respect to any four parameters.
(CO2)
5) Find the position of element 29 using Binary search method in an array given as : (CO2)

Downloaded From Campusify!


11,5,21,3,29,17,2,43
6) Write a program to implement bubble sort. (CO2)
7) Describe working of linear search with example. (CO2)
8) Write a program to implement insertion sort. (CO2)
9) Sort the following numbers in ascending order using quick sort. (CO2)
50,2,6,22,3,39,49,25,18,5
10) Sort the following numbers in ascending order using Bubble sort.
29,35,3,8,11,15,56,12,1,4,85,5
11) Elaborate the steps for performing selection sort for given elements of array. (CO2)
37,12,4,90,49,23,-19
12) Describe working of binary search with example. (CO2)

Chapter no 3: Linked List

(2 Marks)

1) Define the following term.(CO3)


i) Next pointer
ii) Null pointer
2) What is node in singly linked list. Explain with an example. (CO3)
3) What is dynamic memory allocation? (CO3)
4) List any four applications of linked list? (CO3)
5) List types of lists. (CO3)
(4 Marks)

6) Write an algorithm to delete a node at the beginning from a singly linked list.(CO3)
7) Write an algorithm to delete an intermediate node in a singly linked list. (CO3)
8) Create a singly linked list using data fields 10,20,30,40,50 and show procedure step-by-step
with the help of diagram from start to end. (CO3)
9) Write an algorithm to insert a new node at the beginning in singly linked list. (CO3)
10) Write a ‘C’ function for searching a node in singly linked list. (CO3)
11) Write a ‘C’ function to count number of nodes in singly linked list. (CO3)
12) Create a singly list using data field 15,20,22,58,60. Search a node 22 from the SLL and
show procedure step-by-step with the help of diagram from start to end. (CO3)
13) Differentiate between Static and Dynamic memory allocation. (CO3)

Downloaded From Campusify!


Chapter no 4: Stack

(2 Marks)

1) Write any two operations performed on the Stack.(CO4)


2) List any four applications of stack. (CO4)
3) Convert the following infix expression to its postfix expression using stack. (CO4)
(A+B)/(C-D)
4) Evaluate the following postfix expression. (CO4)
5, 7, +, 6, 2, -, *
5) Show the memory representation of stack using array with the help of diagram. (CO4)
6) Draw representation of stack using Linked List. (CO4)

(4 Marks)

7) Explain stack overflow and underflow conditions with example.(CO4)


8) Show the effect of PUSH and POP operation on to the stack of size 10. The stack contains
10, 20, 30, 40, 50 and 60 being at top of the stack. Show diagrammatically the effect of-
(CO4)
i) PUSH 55
ii) PUSH 70
iii) POP
iv) POP
9) Convert the infix expression to its postfix expression using stack ((A+B)*D)^(E-F). Show
diagrammatically each step of conversion. (CO4)
10) Evaluate the following postfix expression. (CO4)
4, 6, 24, +, *, 6, 3, /, -
11) Write a menu driven “C” program to implement stack using array with the following menu.
(CO4)
i) Push
ii) Pop
iii) Display
iv) exit

Downloaded From Campusify!


Chapter no 5: Queue

(2 Marks)

1) List any four types of queue. (CO5)


2) Show the memory representation of queue using array with the help of diagram.(CO5)
3) Define queue. State any two applications where queue is used.(CO5)
4) Enlist queue operation condition. (CO5)
5) Draw representation of queue using Linked List. (CO5)

(4 Marks)

6) Show the effect of INSERT and DELETE operation onto the linear queue of size 10. The
linear queue sequential contains 10,20,30,40 and 50 where 10 is at front queue. Show
diagrammatically the effect of (CO5)
ii) INSERT 75
iii) INSERT 85
iv) DELETE
v) INSERT 60
vi) DELETE
vii) INSERT 90
7) Differentiate between Stack and Queue with respect to any four parameters. (CO5)
8) Write a neat sketch explain working of priority queue. (CO5)
9) Write a program for insert and delete operation to be performed on queue. (CO5)
10) Draw and explain construction of circular queue. (CO5)
11) Describe queue full and queue empty operation conditions on linear queue with suitable
diagram.. (CO5)

Downloaded From Campusify!


Chapter no 6: Tree

(2 Marks)

1) State the following term.(CO6)


i) Leaf node of a tree
ii) Degree of a tree
2) Define the following terms. (CO6)
i) Sibling
ii) Depth of tree
3) Define (CO6)
i) Binary tree
ii) Binary search tree
4) Draw the tree structure of the following expression. (CO6)
(a-3b)*(2x)

5) Traverse the following tree by the in-order and pre-order. (CO6)

6) Define the term w.r.t. tree. (CO6)


i) In-degree
ii) Out-degree

(4 Marks)

7) Construct the Binary Search Tree using following elements.(CO6)


(35,15,40,7,10,100,28,82,53,25,3). Show diagrammatically each step of construction of BST.
8) From the given tree, complete the following answers. (CO6)

i) Degree of tree:
ii) Degree of node B:
iii) Level of node H:
iv) Indegree of node C:
v) Outdegree of node B:
vi) Height of the degree:

Downloaded From Campusify!


9) Write algorithm for preorder traversal of binary tree. (CO6)
10) Explain Binary Search Tree with example. (CO6)
11) Draw tree for given expression. (CO6)
(a-2b+5c)^2 * (4d-6e)^5
12) Traverse the following tree by the in-order, pre-order and post-order methods. (CO6)

13) Differentiate between general tree and binary tree. (CO6)

Downloaded From Campusify!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy