dsa

Which procedure is used to solve a problem in a sequence?

Algorithm

Which of the following standard algorithms is not a Greedy algorithm?

Bellmen Ford Shortest path algorithm

Backtracking can be used to solve:

Combinatorial optimization problems

A storage that is used to organize, process, and retrieve data is called:

Data structure

Six files F1, F2, f3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency.

F3, F4, F1, F5, F6, F2

The Fibonacci sequence is often used to illustrate dynamic programming concepts. What is the time complexity of a naive recursive implementation of Fibonacci numbers?

O(2^n)

The "Egg Dropping Puzzle" involves determining the minimum number of attempts needed to find the critical floor from which an egg will break when dropped. What is the time complexity of the dynamic programming approach for solving the Egg Dropping Puzzle for K eggs and N floors?

O(K * N)

What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

X will be a better choice for all inputs except possibly small inputs

Which of the following is a data structure used in programming?

binary tree

What of the following is NOT a characteristic of dynamic programming?

Solving problems in a sequential manner.

n an unordered array, it's generally faster to find out an item is not in the array, than to find out it is.

True