OS is 20% of every tech interview
know the concept, not just the answer.

Q1.What does a Process Control Block (PCB) store?

Q2.Which of the following is NOT a valid process state?

Q3.A zombie process is one that:

Q4.What is the key difference between a process and a thread?

Q5.An orphan process is one whose:

Q6.How do user-level threads differ from kernel-level threads?

Q7.How does a system call differ from a regular function call?

Q8.What is "spooling" in an operating system?

Q9.What is a "race condition"?

Q10.What does the fork() system call do in Unix?

Q1.The "convoy effect" is a problem associated with which scheduling algorithm?

Q2.Which CPU scheduling algorithm gives the minimum average waiting time?

Q3.In Round Robin scheduling, if the time quantum is made very large, it behaves like:

Q4."Starvation" in CPU scheduling means:

Q5.What is the "turnaround time" of a process?

Q6.Preemptive SJF is also known as:

Q7.In priority scheduling, which technique prevents starvation?

Q8.Which scheduling algorithm is best suited to a time-sharing interactive OS?

Q9.What characterizes preemptive scheduling?

Q10.What is Linux's Completely Fair Scheduler (CFS)?

Q1.Internal fragmentation occurs when:

Q2.Paging eliminates which type of fragmentation?

Q3.What is the purpose of the TLB (Translation Lookaside Buffer)?

Q4."Thrashing" in virtual memory means:

Q5.The Working Set Model is used to:

Q6.Virtual memory primarily allows:

Q7.What does "swapping" mean in memory management?

Q1.Which of the following is NOT one of the four necessary Coffman conditions for deadlock?

Q2.The Banker's Algorithm is used for:

Q3.In a Resource Allocation Graph (RAG), a cycle indicates:

Q4.The "Ostrich Algorithm" for handling deadlocks means:

Q5.Deadlock prevention works by:

Q6.Which condition must hold for Mutual Exclusion to contribute to deadlock?

Q1.The requirement that only one process executes in the critical section at a time is called:

Q2.How does a binary semaphore differ from a mutex?

Q3.A counting semaphore is typically used to:

Q4.Which of the following is true about monitors?

Q5.The classic Producer-Consumer problem with a bounded buffer is typically solved using:

Q6.The Dining Philosophers problem primarily illustrates:

Q7.What does the semaphore P() operation do?

Q8.In a multi-processor system, what does "cache coherence" guarantee?

Q1.Which page replacement algorithm is theoretically optimal (gives the minimum possible page faults)?

Q2.FIFO page replacement can suffer from Belady's Anomaly, meaning:

Q3.LRU page replacement evicts:

Q4."Demand paging" means:

Q5.What is a page fault?

Q6.What structure does a Unix-style file system use to track which disk blocks belong to a file?

Q7.What does an inode in a Unix file system store?

Q8.The "degree of multiprogramming" in an OS refers to:

Q9.Which of the following is NOT a function of the OS kernel?