Analysis and Design of Algorithms-Analysis of Algorithms (NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)): Questions 1 - 6 of 34

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 1

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2015

MCQ▾

Question

An ideal sort is an in-place-sort whose additional space requirement is …………… (December)

Choices

Choice (4) Response

a.

O (log2n)

b.

O (1)

c.

O (n)

d.

O (nlog2n)

Question number: 2

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2015

MCQ▾

Question

Floyd-Warshall algorithm utilizes …………… to solve the all-pairs shortest paths problem on a directed graph in ……………. time. (December)

Choices

Choice (4) Response

a.

Greedy algorithm, θ (V2 lgn)

b.

Dynamic programming, θ (V3)

c.

Greedy algorithm, θ (V3)

d.

Dynamic programming, θ (V2 lgn)

Question number: 3

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2015

MCQ▾

Question

Given two sequences X and Y:

X = < a, b, c, b, d, a, b >

Y = < b, d, c, a, b, a >

The longest common subsequence of X and Y is: (December)

Choices

Choice (4) Response

a.

< b, c, a >

b.

< b, c, a, a >

c.

< b, c, b, a >

d.

< c, a, b >

Question number: 4

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2016

MCQ▾

Question

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?

The alpha-beta pruning

The Alpha-Beta Pruning

The alpha-beta pruning

Choices

Choice (4) Response

a.

GHI

b.

I

c.

HI

d.

CHI

Question number: 5

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2012

MCQ▾

Question

Let be the function defined by which of the following is TRUE? (December Paper III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 6

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2012

MCQ▾

Question

Suppose there are sorted lists of n elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure). (December Paper III)

Choices

Choice (4) Response

a.

b.

c.

d.

Developed by: