Algorithms (GATE Computer Science): Questions 1 - 8 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: 1

» Algorithms » Divide-and-Conquer

MCQ▾

Question

Which design technique is used by merge sort algorithm?

Choices

Choice (4) Response

a.

Divide and Conquer

b.

Backtracking

c.

Dynamic Programing

d.

None of the above

Question number: 2

» Algorithms » Dynamic Programming

MCQ▾

Question

The delay (complexity) of a carry propagation adder is

Choices

Choice (4) Response

a.

o (n)

b.

O (logn)

c.

O (nlogn)

d.

Question does not provide sufficient data or is vague

Question number: 3

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

» Algorithms » Greedy Approach

MCQ▾

Question

A tree on n nodes has ________edges.

Choices

Choice (4) Response

a.

N

b.

N-1

c.

n-2

d.

All of the above

Question number: 5

» Algorithms » Searching

MCQ▾

Question

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.

None of the above

Question number: 6

» Algorithms » Dynamic Programming

MCQ▾

Question

Longest common subsequence problem solved by-

Choices

Choice (4) Response

a.

Divide and conquer

b.

Dynamic programming

c.

back-tracking

d.

None of the above

Question number: 7

» Algorithms » Searching

MCQ▾

Question

In external searching table is kept which storage memory

Choices

Choice (4) Response

a.

memory

b.

Main memory

c.

Auxiliary storage

d.

Question does not provide sufficient data or is vague

Question number: 8

» Algorithms » Greedy Approach

MCQ▾

Question

An undirected graph is a ________if and only if there is a unique path between any pair of nodes.

Choices

Choice (4) Response

a.

Circle

b.

Graph

c.

Tree

d.

All of the above

Sign In