NIELIT STQC 2021 Quiz-66

Which of the following has best lower bound time complexity?

Consider the following statements:

(i). Any Dynamic Programming algorithm with n subproblems will run in O(1) time.

(ii). Dynamic programming solves a problem faster then greedy method.

(iii). Unlike greedy algorithms, dynamic programming methods always provide correct/optimal solution.

Which of the above statement/s is/are correct?

The SRAM’s are basically used as ______

The Output of below code is-

What does the following C-statement declare?

float ∗ (∗ p[n]) (int ∗ a);

If a relation is in BCNF, it is also in:

Three coins are tossed. What is the probability of getting at most two tails?

A subgroup has the properties of ________