B.Sc. (E.C.S.) II (Semester IV) (Old CGPA) Examination, 2018
Paper III data structures algorithms enginering ii
Day and Date Monday, 10-12-2018 Total Marks 70
Time 10.30 a.m. to 1.00 p.m.
Instructions All questions are compulsory.
Figures to the right indicate full marks.
1. Choose correct alternatives 10
search method requires data to be sorted first.
Sequential Linear
Binary Both a and b
The number of possible binary trees with 3 nodes is
18 15 9 5
Which of the following sorting algorithm is of divide and conquer type
Bubble sort Insertion sort
Quick sort All of these
In a binary expression tree, parent node is always
Operator Operand
Parenthesis None of these
is hierarchical data structure.
Linked list Tree
Graph Both b and c
AOV network is useful for
Critical path Shortest path
Topological sort None of these
Finding location of the element with a given value is
Traversal Search
Sort None of these
NULL links are replaced in binary tree.
Extended Complete
Threaded AVL
Maximum degree of node in binary search tree
0 1 2 3
10) Queue can be used to implement
Quick sort Radix sort
Selection sort None of these
State true or false 4
If we read binary search tree by pre order then we get descending order
of element.
Graph is a non-linear data structure.
Preorder is same as breadth first order.
For linear sequential search the array must be in a sorted order.
2. Answer any seven of the following 14
What is topological sorting
Define AVL tree.
Give the applications of trees.
Define In-degree ii) Out-degree.
List out any two applications of sorting methods.
What is linear searching
Define the term terminal nodes, siblings.
Describe the use of hash function.
List the applications of Graph.
3. Answer any two of the following 10
What is Binary tree Explain strictly binary tree and complete binary
tree.
Write an algorithm for Binary Search method.
What are tree traversals Explain in detail.
Sort the given array using Quick Sort show all Passes.
20, 13, 45, 33, 22, 10, 77, 60. 4
4. Answer any two of the following 14
Explain the process to insert new node in binary search tree.
Explain Radix sort algorithm in detail.
What are the different representations of graph Explain adjacency matrix
representation of graph.
5. Answer any two of the following 14
Give the uses of sorting techniques with suitable example.
Explain the graph traversal methods.
Explain threaded binary tree with its any two types.