Scribd
Upload
101 views2 pages

DSU Paper

Uploaded by

pritish8754
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
101 views2 pages

DSU Paper

Uploaded by

pritish8754
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/ 2

ARROW Computer Academy

DSU Sample Question Paper

1. Attempt any FIVE of the following : 10


(a) State any two differences between linear search and binary search.
(b) Define node structure of Singly Linked List .
(c) Define the terms : linear data structure and non-linear data structure.
(d) List any four applications of queue.
(e) Write any four operations that can be performed on data structure.
(f) Convert the following infix expression to its postfix form using stack :
A + B – C * D/E + F
(g)State the following terms :
(i) Leaf node of a tree
(ii) Degree of a tree

2. Attempt any THREE of the following : 12


(a) Describe working of selection sort method with suitable example.
(b) Write algorithm to delete an intermediate node from a singly linked list.
(c) Explain stack overflow and underflow conditions with example.
(d) Convert the given infix expression to postfix expression using stack and the details
of stack at each step of conversion.
Expression : A * B ↑ C – D / E + [F / G]

3. Attempt any THREE of the following : 12


(a) Evaluate the following postfix expression :
4 6 24 + * 6 3 / –

(b) Draw an expression tree for the following expression :

(a + 3b – 7c)3 * (6d – 8e)7

(c) Describe working of bubble sort with example.


(d) Show the effect of PUSH and POP operation on the stack of size 10. The stack
contains 10, 20, 25, 15, 30 & 40 with 40 being at top of stack. Show diagrammatically
the effect of
(i) PUSH (45) (ii) PUSH (50)
(iii) POP (iv) PUSH (55)
4. Attempt any THREE of the following : 12
(a) Create singly linked list using data fields 10, 20, 30, 40, 50 and show step-bystep
procedure with the help of diagram from start to end.
(b) Describe advantages of circular link list over linear link list with example.
(c) Write an algorithm to insert a new node at the beginning in linear list.
(d) Write an algorithm to count no. of nodes in singly linked list.

5. Attempt any TWO of the following : 12


(a) Define the term tree traversal. Construct the Binary Search Tree (BST) of following :
85, 90, 45, 60, 25, 35, 10, 20, 75, 95 and traverse the above BST in inorder, preorder &
postorder.
(b) Write a ‘C’ program for insertion sort. Sort the following array using insertion
sort :
30 10 40 50 20 45
(c) Implement a ‘C’ program to insert element into the queue and delete the element
from the queue.

6. Attempt any TWO of the following : 12


(a) Find out prefix equivalent of the expression :
(i) [(A + B) + C] * D
(ii) A[(B * C) + D]
(b) Sort the following number in ascending order using bubble sort. Given
numbers as follows : 475, 15, 513, 6753, 45, 118.
(c) Describe circular linked list with suitable diagram. State advantages of circular
linked list over linear linked list.

You might also like