DAA-II

Is this your test? Login to manage it. If not, you can make an exam just like it.

This is a non-interactive preview of the quiz content.

1 point

When determining the efficiency of algorithm, the space factor is measured by

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

1 point

Finding counterfeit coin problem can be solved using the following strategy

Dynamic Programming

Backtracking

Divide and conquer

Branch & Bound

1 point

The complexity of Binary search algorithm is

O(n)

O(n2)

O(log n)

O(n log n)

1 point

Two main measures for the efficiency of an algorithm are

Complexity and capacity

Data and space

Processor and memory

Time and space

1 point

The complexity of merge sort algorithm is

O(n)

O(log n)

O(n2)

O(n log n)

1 point

The complexity of linear search algorithm is

O(n log n)

O(log n)

O(n)

O(n2)

1 point

The complexity of Bubble sort algorithm is

O(log n)

O(n2)

O(n log n)

O(n)

1 point

Which of the following case does not exist in complexity theory

Worst case

Average case

Nullcase

Best case

1 point

Pick the one which does not belong to the same paradigm, others belong to

Knapsack problem

Selection Problem

Merge sort

Max & Min problem

10.

1 point

What type of design strategy is used for solving and optimizing the container loading problem

Divide and conquer

Branch and bound

Linear search

Greedy method

Home Features Pricing FAQs Legal Sample Tests Build a Test Login/Sign Up