Programming and Data Structures-Trees [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 5 of 76

Access detailed explanations (illustrated with images and videos) to 2122 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

The number of different binary trees with 6 nodes is …

Choices

Choice (4)Response

a.

42

b.

256

c.

132

d.

6

Question 2

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

Consider the following binary search tree:

The Binary Search Tree

If we remove the root node, which of the node from the left subtree will be the new root?

Choices

Choice (4)Response

a.

13

b.

11

c.

16

d.

12

Question 3

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

The cyclomatic complexity of a flow graph V (G) , in terms of predicate nodes is:

Choices

Choice (4)Response

a.

b.

c.

d.

Question 4

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?

Choices

Choice (4)Response

a.

3, 400, 388, 220, 267, 383, 382,279, 364

b.

925, 221, 912, 245, 899, 259,363, 364

c.

926, 203, 912, 241, 913,246, 364

d.

3, 253, 402, 399, 331, 345,398, 364

Question 5

Appeared in Year: 2010 (UGC-NET)

Question

MCQ▾

Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is (December Paper II)

Choices

Choice (4)Response

a.

4

b.

7

c.

5

d.

6

Developed by: