PrepPro AcademyPrepPro.Academy
PrepPro Academy
PrepPro.AcademyLearning Portal
Sprache
AnmeldenKostenlos registrieren
All Subjects
Bahria University10 Fragen

Operating Systems and Networking MCQs

Practice Operating Systems and Networking multiple-choice questions for Bahria University competitive exams. Each question includes the correct answer and a short explanation, and past-paper questions are marked so you can revise both repeated and fresh material in one place.

View Active Exams Start Custom Exam
Preventing race conditions
Resource allocation and deadlock detection
Managing process priority
Interrupt handling
ErklärungA Wait-For graph is a directed graph used to detect circular wait conditions, which signify a deadlock.
To indicate the sequence number of the next packet
To provide flow control by specifying the amount of data the receiver can accept
To define the header length
To detect packet corruption
ErklärungThe Window Size field enables the receiver to inform the sender about the available buffer space, preventing buffer overflow.
LRU (Least Recently Used)
FIFO (First-In-First-Out)
Optimal Page Replacement
Clock Algorithm
ErklärungBelady's Anomaly occurs when increasing the number of page frames results in an increase in the number of page faults, which is characteristic of FIFO.
Data Link Layer
Transport Layer
Network Layer
Physical Layer
ErklärungThe Network Layer is responsible for logical addressing and routing packets across different networks.
Memory allocation
Process synchronization
Interrupt handling
File system indexing
ErklärungSemaphores are integer variables used as a mechanism for process synchronization to manage access to shared resources and prevent race conditions.
The congestion window increases linearly
The congestion window increases exponentially
The connection stays at a fixed rate
The throughput is capped at the maximum bandwidth
ErklärungIn slow start, for every ACK received, the congestion window (cwnd) increases by one MSS, effectively doubling the window size every RTT.
Round Robin
Shortest Job First (SJF)
Priority Scheduling
Multilevel Queue Scheduling
ErklärungSJF is a non-preemptive algorithm that minimizes average waiting time by executing the process with the shortest execution time next.
Compaction
Segmentation
Paging
Demand Paging
ErklärungPaging eliminates external fragmentation by allocating fixed-size blocks, though it can still suffer from internal fragmentation in the last page.
Encryption of payload
Preventing replay attacks
Authentication of identity
Packet header compression
ErklärungA nonce (number used once) ensures that old communication data cannot be captured and retransmitted by an attacker.
Round Robin
First-Come First-Served
Shortest Job First
Multilevel Feedback Queue
ErklärungShortest Job First (SJF) is mathematically proven to result in the minimum average waiting time for a set of jobs.

Frequently Asked Questions

Are these Operating Systems and Networking MCQs free?

Yes. Every Operating Systems and Networking MCQ on this page is free to practice, including the correct answer and explanation.

Do these include past-paper questions?

Yes — questions sourced from past papers are clearly marked with a "Past Paper" badge, alongside fresh practice questions.

Which exams do these Operating Systems and Networking MCQs help with?

They are aimed at Bahria University and related Pakistani competitive exams that test Operating Systems and Networking.

How should I practice subject-wise MCQs?

Attempt each question first, then reveal the answer and read the explanation. Short, focused sessions on one subject work better than long unstructured reading.

Wir verwenden Cookies

Wir nutzen essentielle Cookies für den Betrieb der Plattform und Analyse-Cookies zum Verständnis der Nutzung. Analyse- und Werbe-Cookies kannst du annehmen oder ablehnen.