Algorithms-Tree and Graph Traversals (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1 - 7 of 34

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

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

A complete graph with n vertices will have

Choices

Choice (4) Response

a.

N (n-1)

b.

2n edge

c.

N (n-1) /2

d.

None of the above

Question number: 2

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

The balanced sort tree is also known as-

Choices

Choice (4) Response

a.

B- tree

b.

Binary tree

c.

m-way tree

d.

Question does not provide sufficient data or is vague

Question number: 3

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

The number of articulation points of the following graph is

The number of articulation points of the following graph is

The Number of Articulation Points of the Following Graph Is

The number of articulation points of the following graph is

Choices

Choice (4) Response

a.

7

b.

3

c.

11

d.

9

Question number: 4

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

A search technique where we keep expanding nodes with least accumulated cost so for is called-

Choices

Choice (4) Response

a.

Best first

b.

Divide and conquer

c.

Branch and bound

d.

None of the above

Question number: 5

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

What is a pre order of this binary tree?

this picture is complete diagram of binary tree

This Picture Is Complete Diagram of Binary Tree

this picture is complete diagram of binary tree

Choices

Choice (4) Response

a.

ABDECFG

b.

DEBFGCA

c.

DBEAFCG

d.

All of the above

Question number: 6

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

Backtracking can be used to solve -

Choices

Choice (4) Response

a.

Sum of subset problem

b.

Queen problem

c.

Knapsack problem

d.

All a. , b. and c. are correct

Question number: 7

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

How many perfect matching’s are there in a complete graph of 6 vertices-

Choices

Choice (4) Response

a.

16

b.

15

c.

19

d.

18

f Page
Sign In