Concept drill

theta

GATE CSE & IT · Complexity Theory · 2003-2003

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2003 PYQ

Consider the following three claims I. (n + k) m = $$\Theta \,({n^m})$$ where k and m are constants II. 2 n+1 = O(2 n ) III. 2 2n = O(2 2n ) Which of those claims are correct?

easyanswer keyelite explanation