Time Left - 10:00 mins
NIELIT 2017 Section Test-2 (PDS & Algo)
Attempt now to get your rank among 596 students!
Question 1
The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____.
Note: The height of a tree with a single node is 0.
Note: The height of a tree with a single node is 0.
Question 2
A binary tree T has 20 leaves. The number of nodes in T having two children is __________.
Question 3
A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set.
I. Deletion of the smallest element
II. Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?
I. Deletion of the smallest element
II. Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?
Question 4
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
Question 5
Let T (n) be the number of different binary search trees on n distinct elements.
Then 
where x is
Question 6
Which among the following problem doesn’t follow the greedy algorithm approach?
Question 7
Let 
and 
Then 
is __________.
and Then is __________. Question 8
The concept of order (Big O) is important because
Question 9
In the graph shown, which options shows sum as 4
Question 10
The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:
- 596 attempts
- 3 upvotes
- 11 comments
May 4GATE & PSU CS
