DSU QB For Passing Marks

DSU Question Bank
2 Marks Questions
CHP1
1. Write any four operations that can be performed on data structure.
2. Differentiate between linear and non-linear data structures on any two
parameters.
3. Give classification of data structure.
4. Define Abstract Data Type.
5. Define the term algorithm.
CHP2
6. Define Searching. What are its types ? OR Define sorting and list its type.
7. Difference between linear search and binary search on any two parameters
8. Write an algorithm of bubble sort.
9. Write an algorithm of Quick Sort.
CHP3
10.Compare Linked List and Array (any 4 points).
11.List types of Linked list.
12.What is a linked list?
CHP 4
13.Question on conversion of expression either infix to prefix or infix to
postfix. Example Convert the following infix expression to its prefix form
using stack A + B – C D / E + F
14.Write algorithm for POP operation
15.Write algorithm for PUSH operation
16.Define (A)Infix (B) Prefix (C) Postfix
17. Define the terms ‘overflow’ and ‘underflow’ with respect to stack.
CHP 5
18.Draw the diagram of circular queue with front and rear pointers. OR Draw
the diagram of Linear Queue to represent front and rear pointers.
19.Define queue. State any two applications where the queue is used. OR State
any four applications in the queue.
20.List types of queue with diagram.
21.Differentiate between stack and queue. (any two points)
CHP6
22.Questions on tree terminologies. Example (i) Leaf node of a tree (ii) Degree
of a tree….
23.Define : (i) General tree (ii) Binary tree (iii) Binary search tree
24.Explain Types of tree data structure
4/6 Marks Questions
CHP2
1. Describe the working of the Bubble sort method with an example. OR
Sort the following number using Bubble sort 13,32,26,35,10
2. Describe working of linear search with an example.
3. Find the position of element 30 using Binary search method in array A =
{10, 5, 20, 25, 8, 30, 40}
4. Explain the working of Binary search with an example.
5. Describe the working of the selection sort method. Also sort given input
list in ascending order using selection sort input list – 55, 25, 5, 15, 35
CHP3
6. Construct a singly linked list using data fields 21 25 96 58 74 and show
procedure step-by-step with the help of diagram start to end.
7. Show with suitable diagrams how to delete a node from a singly linked list
at the beginning, in between and at the end of the list.
8. Describe the concept of linked list with the terminologies: node, next
Pointer, null pointer and empty list.
9. Write an algorithm to insert an element at the beginning and at the end of
the linked list.
10.Describe procedure to delete an element from singly linked list using
diagram
11.Write an algorithm to insert a new node at the beginning and end of the
singly linked list.
12.Construct a singly linked list using data fields 21, 25, 96, 58, 74 and show
the procedure step-by-step with the help of diagram start to end.
13.Create a singly linked list using data fields 90, 25, 46, 39, 56. Search a
node 40 from the SLL and show the procedure step-by-step with the help
of a diagram from start to end.
14.Compare Linked List and Array. (any 6 points)
15.Describe circular linked list with suitable diagram. Also state advantage of
circular linked list over linear linked list
CHP4
16.Show the effect of PUSH and POP operation on the stack of size 6.
PUSH(10) PUSH(20),PUSH(30),POP(30), PUSH(40)
17.Difference between memory representation of stack using array and Linked
list.
18.Convert infix expression into prefix expression (A+B*C-D)/(E*F)
19.Convert infix expression into postfix expression A+B/C+D*(E-F)^G
20.Show the effect of PUSH and POP operation on the stack of size 10. The
stack contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack.
Show diagrammatically the effect of : (i) PUSH 59 (ii) PUSH 85 (iii) POP
(iv) POP (v) PUSH 59 (vi) POP Sketch the final structure of stack after
performing the above said operations.
21.Convert the following expression into postfix form. Give stepwise
procedure.
A + B ↑ C * (D / E) – F / G
22.Write an algorithm for performing push and pop operations on stack.
CHP5
23.Describe queue full and queue empty operation conditions on linear queue
with suitable diagrams.
24.Draw and explain construction of circular queue. OR Explain the concept of
circular Queue along with its need.
25.Describe queue full and queue empty operation conditions on linear queue
with suitable diagrams.
26.Explain Queue overflow and underflow conditions with examples
CHP6
27.Traverse the following tree by the in-order, pre-order and post-order
methods
28.Draw the tree structure of the following expressions:(any one)

(i) (2a+5b)3 * (𝒙 – 7𝒚) 4
(ii) (a – 3b) * (𝟐𝒙 – 𝒚) 3
29.Draw an expression tree for the following expression:
(a – 2b + 5c)2*(4d = 6e)5
30.Draw tree for given expression and find pre-order and post-order traversal.
(2b + 5c)2 (4d – 6e)5
31.Construct a binary search tree for the following elements:
30,100,90,15,2,25,36,72,78,10 show each step of construction of BST.
32.Differentiate between general tree and binary tree. (any four points)

DSU QB For Passing Marks

Uploaded by

Copyright:

Available Formats

DSU QB For Passing Marks

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSU QB For Passing Marks

Uploaded by

Copyright:

Available Formats

DSU Question Bank

28.Draw the tree structure of the following expressions:(any one)

You might also like