Menu

Question Discussion & Solution

MCQ

Q.

For analyzing an algorithm, which is better computing time?

A

O (100 Log N)

B

O (N) (c)O (2N)

C

O (N logN)

D

O (N2).

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

In Algorithm comments begin with____________

A

/*

B

/

C

*/

D

//

Discussion

MCQ

2.

. Which of the following is the collection of records of the entities in a given entity set?

A

Field

B

File

C

Records

D

Entity

Discussion

MCQ

3.

Two main measures for the efficiency of an algorithm are

A

Processor and memory

B

Complexity and capacity

C

Time and space

D

Data and space

Discussion

MCQ

4.

Which of the following operations combined record into different sorted files into a single sorted file?

A

Sorting

B

Merging

C

Searching

D

Inserting

Discussion

MCQ

5.

Which is the logical or mathematical model of a particular organization of a data?

A

Structures

B

Variable

C

Data structures

D

Function

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs