GATE Engineering - Computer Science & Information Technology (CS/IT)

Asymptotic Analysis, Trees, Graphs, Automata & Turing Machines question bank (Algorithms, Data Structures & Theory of Computation)

Practice 48 free GATE Engineering - Computer Science & Information Technology (CS/IT) Algorithms, Data Structures & Theory of Computation - Asymptotic Analysis, Trees, Graphs, Automata & Turing Machines questions with answers and step-by-step solutions.

Start free Book a demo

All Easy Hard Medium

Q1.

GATE CS/IT (Algorithms): What is the asymptotic time complexity of building a Max-Heap from an unsorted array of $n$ elements in 'Asymptotic Analysis: Big-O, Omega, Theta, Recurrence Relations and Master Theorem'?

(A)

$O(n)$ linear time (Asymptotic Analysis: Big-O, Omega, Theta, Recurrence Relations and Master Theorem)

(B)

$O(n \log n)$

(C)

$O(n^2)$

(D)

$O(\log n)$

Show answer & solution

Verified Answer & Solution Locked

Q2.

Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Asymptotic Analysis: Big-O, Omega, Theta, Recurrence Relations and Master Theorem'?

(A)

Context-Free Languages (CFL) (Asymptotic Analysis: Big-O, Omega, Theta, Recurrence Relations and Master Theorem)

(B)

Regular Languages

(C)

Deterministic Context-Free Languages (DCFL - closed under complement)

(D)

Recursive Languages

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 48 Questions in Asymptotic Analysis, Trees, Graphs, Automata & Turing Machines

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 48 questions

Unlock every Asymptotic Analysis, Trees, Graphs, Automata & Turing Machines question, generate papers, and practice at your own pace.

Start free