# Analysis and Design of Algorithms [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 4 of 80

Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!

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 » Recursion and Non-Recursion Algorithms

Edit

Appeared in Year: 2015

MCQ▾

### Question

In general, in a recursive and non-recursive implementation of a problem (program):

### Choices

Choice (4)Response

a.

Space complexity is better in recursive version but time complexity is better in non-recursive version of the program

b.

Time complexity is better in recursive version but space complexity is better in non-recursive version of the program

c.

Time and space complexities are better in recursive than in non-recursive program

d.

Time and space complexities are better in non-recursive than in recursive program

## Question number: 3

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

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

Developed by: