Programming and Data Structures-Binary Search Trees (GATE Computer Science): Questions 1 - 5 of 5

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

Question number: 1

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

Evaluate the expression 2 * 5^4 * 3^2 * 1

Choices

Choice (4) Response

a.

4320

b.

35750

c.

11250

d.

None of the above

Question number: 2

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

A complete graph with n vertices has at least

Choices

Choice (4) Response

a.

2n-1 - 1 spanning trees

b.

2n spanning trees

c.

2n-1 spanning trees

d.

Question does not provide sufficient data or is vague

Question number: 3

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

A binary tree in which every non-leaf node has non-empty left and right sub trees is

Called a strictly binary tree. Such a tree with 10 leaves

Choices

Choice (4) Response

a.

has exactly 19 nodes

b.

cannot have more than 15 nodes

c.

has exactly 12nodes

d.

None of the above

Question number: 4

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

A computer hard work on a – number system.

Choices

Choice (4) Response

a.

Hexadecimal

b.

Binary

c.

Decimal

d.

Octal

Question number: 5

» Programming and Data Structures » Binary Search Trees

MCQ▾

Question

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

Choices

Choice (4) Response

a.

5

b.

42

c.

14

d.

24

Sign In