# Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 24 - 30 of 98

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: 24

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The circuit statistical problem belongs to the class of________

### Choices

Choice (4) Response

a.

p

b.

q

c.

n - p

d.

None of the above

## Question number: 25

» Algorithms » Dynamic Programming

MCQ▾

### Question

What is a maximum number of edges in a planar graph with 5 vertices?

### Choices

Choice (4) Response

a.

6

b.

20

c.

18

d.

None of the above

## Question number: 26

» Algorithms » Dynamic Programming

MCQ▾

### Question

A common approach for handling address spaces larger than 32 bits is to use a ________.

### Choices

Choice (4) Response

a.

Hashed page table.

b.

c.

Virtual memory

d.

Question does not provide sufficient data or is vague

## Question number: 27

MCQ▾

### Question

NP (non-polynomial) complete refers to how many classless?

### Choices

Choice (4) Response

a.

Three

b.

Two

c.

One

d.

All of the above

## Question number: 28

» Algorithms » Greedy Approach

MCQ▾

### Question

A solution to the knapsack problem that uses a table to store evolving estimates of solution values uses

### Choices

Choice (4) Response

a.

The optimal-substructure property

b.

Hill climbing

c.

Dynamic programming

d.

A divide-and conquer approach

## Question number: 29

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

What is a pre order of this binary tree?

### Choices

Choice (4) Response

a.

ABDECFG

b.

DBEAFCG

c.

DEBFGCA

d.

All of the above

## Question number: 30

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

What is a post order of this binary tree?

### Choices

Choice (4) Response

a.

ABDECFG

b.

DEBFGCA

c.

DBEAFCG

d.

None of the above

f Page