# Algorithms-Tree and Graph Traversals (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 21 - 27 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: 21

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A directed graph G is ________ if and only if a DFS (Depth first search) of G produces no back edge.

### Choices

Choice (4) Response

a.

Graph

b.

Cyclic

c.

Acyclic

d.

All of the above

## Question number: 22

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

### Choices

Choice (4) Response

a.

Path

b.

Leaf

c.

d.

Branch

## Question number: 23

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A graph is set to be, if it can be draw in a planner show that the edge does not intersect to another edge is called

### Choices

Choice (4) Response

a.

Regular

b.

Non-planner graph

c.

Planner graph

d.

All of the above

## Question number: 24

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The complete graph KN has n^n-2 different spanning tree is called which theorem?

### Choices

Choice (4) Response

a.

Cyley’s theorem

b.

Lagrange’s theorem

c.

theoem

d.

All of the above

## Question number: 25

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

If each node in a tree has value greater than every value in its left sub tree and has value less than every in the its right sub tree, the tree is called

### Choices

Choice (4) Response

a.

Full binary tree

b.

Complete tree

c.

Binary search tree

d.

## Question number: 26

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The number of edges in a regular graph of degree d and n vertices is

### Choices

Choice (4) Response

a.

nd/2

b.

Maximum of n, d

c.

Nd

d.

n + d

## Question number: 27

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

A given connected graph G is an Euler graph, if and only if all vertices of G are of

### Choices

Choice (4) Response

a.

odd number of degree

b.

Same degree

c.

Even number of degree

d.

None of the above

f Page