# Algorithms (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 9 - 16 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: 9

» 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: 10

» Algorithms » Asymptotic Notation

MCQ▾

### Question

Find the value of T (n) =9T (n/3) +n

### Choices

Choice (4) Response

a.

Θ (n)

b.

Θ (n^2)

c.

Θ (n^3)

d.

None of the above

## Question number: 11

» Algorithms » Dynamic Programming

MCQ▾

### Question

Adding elements to a set according to weight and value solves the ________ problem

### Choices

Choice (4) Response

a.

convex-hull

b.

shortest-path

c.

Knapsack

d.

minimal-spanning-tree

## Question number: 12

» Algorithms » Greedy Approach

MCQ▾

### Question

Dynamic programming solutions are associated with

### Choices

Choice (4) Response

a.

Brute force

b.

c.

Intractability

d.

Probabilistic algorithms

## Question number: 13

» Algorithms » Tree and Graph Traversals

MCQ▾

### Question

The number of articulation points of the following graph is

### Choices

Choice (4) Response

a.

7

b.

3

c.

11

d.

9

## Question number: 14

» Algorithms » Searching

MCQ▾

### Question

Searching is divided how many categories

### Choices

Choice (4) Response

a.

Three

b.

Two

c.

Four

d.

All of the above

## Question number: 15

» Algorithms » Dynamic Programming

MCQ▾

### Question

What is a complexity of dynamic programming-based Floyd-Warshall algorithm?

### Choices

Choice (4) Response

a.

O (| V| ^3)

b.

O (| V| ^4)

c.

O (| v| ^2)

d.

Question does not provide sufficient data or is vague

## Question number: 16

» 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

f Page