Scribd
Upload
26 views7 pages

DSU Extraquestions

Uploaded by

arpitabayas
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
26 views7 pages

DSU Extraquestions

Uploaded by

arpitabayas
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

Chapter no 1: Introduction to Data Structures

(2Marks)

1) Write any fouroperations 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)

(4Marks)

6)Implement a C program to insert an elementin 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)Writea C program for deletion of anelement 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? (C02)


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

(4 Marks)

3)Sort the following numbers in ascending order using Insertion sort: (C02)
25 15A 10362 9
(4Marks)

3)Sortthe following numbers in ascendingorder using Insertion sort: (C02)


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

115,21,3,29, 17,2,43

6) Write aprogram to implemnent bubble sort. (CO2)


7) Describe working of linear search with example. (C02)
8)Write a program toimplement insertion sort. (C02)
9) Sort the following numbers in ascending order using quick sort. (CO2)
50,2.6.22,3,39,49,25, 8,5
1
10) Sort the following numbers in ascending order using Bubble sort.
29,35.3.8,11.15,56, I2,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) Describeworking of binary search with example. (C02)
Chapter no 3: Linked List

(2 Marks)

1) Define the following term.(CO3)


i) Next pointer
ii) Null pointer
2)What node in singly linked list. Explain with an example.(CO3)
is
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 ina singly linked list.(CO3)

8)Create asingly 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) Writea C function for searching a node in singly linked list. (O3)
11) Write a 'C function to count number of nodes in singly linked |ist. (CO3)
12) Create a singly listusing data field |5,20,22,58,60.Search a node 22 from the SLLand
show procedure step-by-stepwith the help of diagram from start to end. (O3)
13) Differentiate between Static and Dynamic memory allocation. (CO3)
(2Marks)

I) anytwo operations performed on the Stack.(CO4)


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

(4 Marks)

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


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 60being at top of the stack. Show diagrammatically the effect of
(CO4)
i) PUSH 55

i) PUSH 70
iii) POP
iv) POP
9)Convert the infix expression to its postfix expression using stack ((A+B)*D (E-F), Show
diagrammnatically each step of conversion. (CO4)
10) Evaluate the following postfix expression. (C04)
4,6,24, +, *,6.3,/, -
11) Write amenu driven "C"program to implement stack using array with the following menu.
(CO4)
)
ii)
Push
Pop
ii) Display
iv) exit
Chapter no 5:Queue

(2 Marks)

1)List any fourtypesof queue.(CO5)


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

(4Marks)

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) Differentiatebetween Stack and Queue with respect to any four parameters.(CO5)
8) Write a neat sketch explain working of priority queue. (CO5)

9) Writea program for insert and delete operation to be performed on queue. (CO5)
10) Draw and explain construction circular queue. (COS)
I)
of

Describequeue full and queue empty operation conditions on linear queue with suitable
diagram. (COS)
Chapter no 6:Tree

(2Maria)

1)State the following term.(CO6)


i) Leaf node of a tree
ii) Degree of a tree

2)Define the following terms. (C06)


i) Sibling
iü) Depth of tree
3)Define (CO6)
i) Binary tree
i) Binary search tree
4)Draw the tree structure of the following expression. (CO6)
(a-3b)°(2x)

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

6)Define theterm w.r.t. tree. (CO6)


1) In-degree
ii) Out-degree

(4Marks)

7) Construet theBinarySeareh Treeusing following elements.(CO6)


(35.15,40.7.10,100.28,8253.253) Show each
diagrammnatically step of construction of BST.
8) From the given reecomplete the following answers.(CO6)

1) Degree of tree:
8)Frotm the given tree, complete thefollowing answers.(C06)

i) Degree of tree:
Degree of node B:
im) Level ofnode H:
iv) Indegree of node C:
Outdegree of node B:
vi) Height of the degree:

9) Writealgorithm for preorder traversal of binary (CO6)


tree.

19) Explain Binary SearchTree with example. (co6)


11) Draw tree forgiven expression. (CO6)
(a-2b+5cy2 (4d-6e)ys
12) Traversethe ollowing tree by the in-order. pre-order and post-order methods. (CO6)

13) Dfferentiate between general tree and binary tree, (C06)

You might also like