Algorithms [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 6 of 115

Access detailed explanations (illustrated with images and videos) to 2290 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. 3 Year Validity- Access Unlimited Times on Unlimited Devices.

View Sample Explanation or View Features.

Rs. 600.00 -OR-

How to register? Already Subscribed?

Question 1

Question MCQ▾

Which design technique is used by merge sort algorithm?

Choices

Choice (4)Response

a.

Divide and Conquer

b.

Backtracking

c.

Dynamic Programing

d.

Question does not provide sufficient data or is vague

Edit

Question 2

Question MCQ▾

Quick sort algorithm requires a maximum of ________ stack space in the worst case.

Choices

Choice (4)Response

a.

O (n)

b.

O (n2)

c.

O (logn)

d.

None of the above

Edit

Question 3

Question MCQ▾

The goal of hashing is to produce a search that takes

Choices

Choice (4)Response

a.

time

b.

0 (1) time

c.

0 (logn)

d.

Question does not provide sufficient data or is vague

Edit

Question 4

Question MCQ▾

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

Choices

Choice (4)Response

a.

O (| V | 4)

b.

O (| V | 3)

c.

O (| V| 2)

d.

None of the above

Edit

Question 5

Question MCQ▾

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

Choices

Choice (4)Response

a.

Hashed page table.

b.

Base address

c.

Virtual memory

d.

Question does not provide sufficient data or is vague

Edit

Question 6

Question MCQ▾

What is a post order of this binary tree?

The Image is Binary Tree

Choices

Choice (4)Response

a.

DEBFGCA

b.

ABDECFG

c.

DBEAFCG

d.

All of the above

Edit