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.

Operating Systems: In 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm', which page replacement algorithm is immune to Belady's Anomaly (where increasing page frames increases page faults)?

(A)

Least Recently Used (LRU) and Optimal (Stack Algorithms) (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(B)

First-In-First-Out (FIFO)

(C)

Second Chance algorithm

(D)

Random replacement

Show answer & solution

Verified Answer & Solution Locked

Q2.

Database Management Systems (DBMS): In 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm', a relation $R(A,B,C,D)$ has functional dependencies $F = \{AB \to C, C \to D, D \to A\}$. What is the highest normal form of $R$?

(A)

3NF (Third Normal Form) (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(B)

1NF

(C)

2NF

(D)

BCNF (Boyce-Codd Normal Form)

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 24 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 24 questions

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

Start free