Computer Sciences > Gate 2022 > 1
Which one of the following statements is TRUE for all positive functions f (n) ?
Correct : a
Similar Questions
Consider the following recurrence:
f(1) = 1;
f(2n) = 2f(n) -1, for n≥1;
f(2n+1) = 2f(n) +1, for n≥1;
Then, which of the following statements is/are TRUE?
Consider the following languages:
L1 = {ww | w ∈ {a, b}* }
L2 = {anbncn | m, n≥ 0}
L3 = {ambncn | m, n≥ 0}
Which of the following statements is/are FALSE?
Which of the following statements is/are TRUE with respect to deadlocks?
Total Unique Visitors
Loading......