Operating system:

1. Define operating system and explain its objective.

2. Explain real time operating system.

3. Difference between single processor and multiprocessor system.

4. Difference between kernal and shell.

5. Explain clustered system.

6. Define spooling.

7. Explain dual mode operation.

8. Explain distributed system.

9. Explain the working of client-server and peer-to-peer computing.

10. Difference between multitasking ,multiprocessing and multithreading system.

11. Explain system call

12. Define process and draw process transition diagram and explain each states.

13. Difference between process and program.

14. Define throughput and turnaround time.

15. Explain PCB

16. Difference between process and thread.

17. Explain the purpose of scheduler and explain the working of long term,short term and
medium term scheduler.

18. Explain the term context switching.

19. what do you mean by cooperating process and independent process.

20. What do you mean by inter-process communication.

21. How inter-process communication can be handle using message passing and shared memory
model.

22. Explain advantage,disadvantage of message passing and shared memory model in IPC and
explain when we use message passing and when we use shared memory model.

23. Why we need scheduling

24. Difference between preemptive and non-preemptive scheduling with example.

25. Explain working of dispatcher and define dispatch latency.

26. What are the scheduling criteria for good scheduling algorithm.

27. Explain the working of FCFS,SJF,ROND ROBIN,SRTF,and PRIORITY scheduling.

28. Compare between FCFS,SJF,ROND ROBIN,SRTF,and PRIORITY scheduling.

29. All scheduling math problem that I solved in class.

30. What is the disadvantage of priority scheduling and explain how we can solve this
problem(ans: aging).

31. Define deadlock in operating system and write down the necessary condition of for deadlock.

32. Explain resource allocation graph and explain how it detect deadlock.

33. Explain deadlock prevention can be handle.

34. How deadlock avoidance can be handle

35. Explain RAG algorithm to handle dead lock avoidance with example.

36. Explain Bankers Algorithm(safety algo,resource-request algo) to handle deadlock avoidance.

37. Bankers alogorithm math solve.

38. What is safe state,explain not all unsafe state are deadlock state.

39. What is starvation and when it is occur.

40. Difference between starvation and deadlock

41. With example describe if resources are not properly allocated to the processes it may lead
from safe state to unsafe state.

42. Difference between deadlock prevention and deadlock avoidance.

43. How to recovery from deadlock.

44. Explain difference memory management strategies(Fech,placement,replacement)

45. Explain demand fetch and anticipatory fetch and distingwise them.

46. Explain first fit,best fit,worst fit strategies with advantagedisadvantage and example.

47. Explain FIFO,LRU,LFU,OPTIMAL PAGE REPLACEMENT technique using and its math which I
solved in class.

48. What is belady’s anomaly.

49. What is fragmentation problem.

50. Difference between internal and external fragmentation

51. How to solve external fragmentation using coalescing and compaction(burfing/garbage

collection).

52. What is vartual memory concept and how it is implemented.

53. Difference between logical address(virtual address) and physical address(real address).

54. Define dynamic address translation.

55. Explain virtual address translation.

56. Virtual address translation using block mapping.

57. Define paging and explain is advantage and disadvantage.

58. What is pages and frames.

59. How we implement paging.

60. paging address translation using direct mapping.

61. Paging address translation using associative mapping.

62. Explain demand paging and its advantage and disadvantage.

63. Explain translation look aside buffer(TLB).

64. Explain swapping.

65. Explain thrashing.

66. Explain segmentation and its advantage and disadvantage.

67. Explain how segmentation is implemented.

68. Virtual address translation using seg

69. Segmentation address translation using direct mapping.

70. Direct address translation by segmentation/paging system.

71. Difference paging and segmentation.

72. Explain race condition and how to solve it.

73. Explain critical section problem and the solution of critical section problem.

74. Explain how to solve critical solution problem using lock variable and Peterson’s solution.

75. Define semaphore.

76. Explain usage of semaphore(different types of semaphore)(Ans:binary and counting

semaphore).

77. Explain drawback of semaphore.

78. Explain producer consumer problem and mention its disadvantage and how to solved it.(very
importatnt)

79. Explain dining philosopher problem and mention its disadvantage and how to solved it.

80. Explain sleeping barber problem and reader writer problem.

81. Explain seek time and what is its rotational latency.

82. Explain FCFS,SSTF,SCAN,C-SCAN,LOCK,C-LOCK with example

83. Advantage disadvantage of SSTF and FCFS.

84. Define monitor.