Menu

Question Discussion & Solution

MCQ

Q.

In a Heap tree

A

Values in a node is greater than every value in left sub tree and smaller than right sub tree

B

Values in a node is greater than every value in children of it

C

Both of above conditions applies

D

None of above conditions applies

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.

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

2.

The time factor when determining the efficiency of algorithm is measured by

A

Counting microseconds

B

Counting the number of key operations

C

Counting the number of statements

D

Counting the kilobytes of algorithm

Discussion

MCQ

3.

The complexity of Bubble sort algorithm is

A

O(n)

B

O(n^2)

C

O(log n)

D

O(n log n)

Discussion

MCQ

4.

The complexity of linear search algorithm is

A

O(n)

B

O(log n)

C

O(n^2)

D

O(n log n)

Discussion

MCQ

5.

. 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

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