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.

Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?

(A)

Subnet Mask: 255.255.255.192 (/26); 62 usable hosts per subnet ($2^6 - 2 = 62$) (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(B)

Mask: 255.255.255.128 (/25); 126 usable hosts

(C)

Mask: 255.255.255.224 (/27); 30 usable hosts

(D)

Mask: 255.255.255.240 (/28); 14 usable hosts

Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.

Algorithms (Graph Theory): What is the tightest worst-case time complexity of finding Single-Source Shortest Paths in a directed graph with $V$ vertices, $E$ edges, and NON-NEGATIVE weights using a Fibonacci Heap in 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm'?

(A)

$O(V \log V + E)$ (Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm)

(B)

$O((V + E) \log V)$

(C)

$O(V^2)$

(D)

$O(V E)$

Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
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 in to unlock Create free account

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