Time Left - 10:00 mins

Mission ISRO CS 2017 Exam : PDS Quiz-3

Attempt now to get your rank among 636 students!

Question 1

How many different Spanning trees are there with four nodes A, B, C and D?

Question 2

The in-order traversal of a tree resulted in FBGADCE. This tree also follows the property of a heap.  Then the pre-order traversal of that tree would result in

Question 3

Consider the following binary search tree T given below. Which node contains the fourth smallest element in T?
Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image021.png

Question 4

A complete binary tree with n non leaf nodes contains:

Question 5

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

Question 6

How many distinct binary search trees can be created out of 4 distinct keys?

Question 7

Consider the following Max-heap tree stored in the form of array.

Which of the following is a heap tree after deleting 97 and 88

Question 8

Consider a binary max-heap implemented using an array. Which of the following array represent a binary max-heap?

Question 9

(Suppose n data items A1, A2,…. are already sorted i.e. ). Assuming that the items are inserted in order into an empty binary search tree, the final tree will be

Question 10

Which of the following is/are correct in order traversal sequence(s) of binary search tree(s)?
I. 3, 5, 7, 8, 15, 19, 25
II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20
IV. 4, 6, 7, 9 18, 20, 25
  • 636 attempts
  • 4 upvotes
  • 22 comments
Apr 7GATE & PSU CS