 Create Quiz

# Quiz: Mock Tests on Analysis of Algorithms (Recurrences).

## This quiz contains information about the Analysis of Algorithms (Recurrences).

You can mute/unmute sounds from here

in 1975
in 1980
in 1965

## The recurrence relation capturing the optimal time of .................. problem with n discs is T(n) = 2T(n – 1) + 1.

the trail tower
the Tower of Hanoi

a list
a solution
an equation

## The term Analysis of Algorithms also known as-

master theorem
limited algorithm
basic theorem

LT list
MQ array
AVL tree

an array
a graph
a list

O(log )
O log 2n
n(log0 )

## Which two main measures are important for the efficiency of an algorithm?

Object and Memory
Data and file
Time and Space

## Which algorithm based on the Greedy Approach?

Lambda algorithm
Dijkstra’s algorithm
Definite algorithm

data listing
alignment
game playing

arrays
key operations
nodes

solution
equation
complexity

O log n
O(1 log)
O(n log n)

## Which algorithm is used to efficiently solve an all-pairs shortest-paths problem?

Martin algorithm
Floyd-Warshall algorithm
Floyd-Warshall algorithm

## Conciseness design matric is used to measure ....................... of the program in terms of lines of code.

the memory space
the compactness

Currently, we have no comments. Be first to comment on this quiz.

SIMILAR QUIZZES
Health Care Reform History Quiz
Health care in America is one of the most expensive in the world. If you want to know why then let's play!