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

Process Scheduling, Normalization, SQL & Networking Protocols question bank (Operating Systems, DBMS & Computer Networks)

Practice 64 free GATE Engineering - Computer Science & Information Technology (CS/IT) Operating Systems, DBMS & Computer Networks - Process Scheduling, Normalization, SQL & Networking Protocols 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 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm'?

(A)

$O(n)$ linear time (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(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 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm'?

(A)

Context-Free Languages (CFL) (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(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 64 Questions in Process Scheduling, Normalization, SQL & Networking Protocols

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 64 questions

Unlock every Process Scheduling, Normalization, SQL & Networking Protocols question, generate papers, and practice at your own pace.

Start free