B.Tech Operating Systems Paper Important Bits

Here are some important questions from the topic Operating Systems of B.Tech Computer Science / Information Technology branches. The questions may useful for JNTU, Osmania and all other universities of other states which have similar lessons and topics in Engineering courses.

1. Dynamic linking is particularly useful for _____
2. ____ must be brought (from disk) into memory and placed within a process for it to be run
3. Swapper that deals with pages is a _____
4. ____ and registers are only storage CPU can access directly
5. _____ address is generated by the CPU
6. Logical address is also called as ____ address
7. logical (virtual) and physical addresses differ in ____ time address-binding scheme
8. _____ sits between main memory and CPU registers
9. ____ never swaps a page into memory unless page will be needed
10. If a process is busy in swapping pages in and out than doing the actual process.it is called
11. Address binding of instructions and data to memory addresses can happen at _____ different stages
12. _____ address is generated by the CPU
13. this register contains the starting physical address where the segments reside in memory
14. Logical and physical addresses are the same in _____ and load-time address-binding schemes;
15. MMU is the hardware device that maps virtual to ____ address
16. Routine is not loaded until it is called.This concept is called as _____ loading
17. Logical address consists of a two tuple:segment-number and ____
18. Replace page that will not be used for longest period of time.it is used in ____ algorithm.
19. set of processes waiting for an I/O device will be in ____ queue
20. Communication consists between a pair of ______
21. set of all processes in the system are loaded in ___ queue
22. Blocking is considered as _______
24. Parent process create children processes, which, in turn create other processes, forming a ____ of processes
25. In UNIX, ____ system call creates new process
26. IPC facility provides ____ operations
27. The _____ scheduler controls the degree of multiprogramming
28. The client-side stub locates the server and _____ the parameters
29. threads directly supported by the kernel are called as ____ threads
30. _______ process can affect or be affected by other processes
31. If the process is waiting to be assigned to a processor, then it is in ____ state
32. RMI is ____ based.
33. If processes reside on different computers in a network, we call it as _____ environment
34. CPU scheduler is also called as _____ scheduler
35. _____ buffer places no practical limit on the size of the buffer
36. If the process has finished execution, then it is in ____ stste
37. a program in execution——-
38. Basic unit of CPU utilization ———-

B.Tech Operating Systems Viva Important Questions

Following are important questions for Viva – Voce examination of B.Tech Computer Science and Engineering and IT branch students. The questions are useful for the paper on Operating Systems:

Important questions:

1. Discuss about os objectives and functions
2. Explain about os structures with neat figures
3. Briefly discuss about os services
4. What are different schedulers? Explain about scheduling criteria
5. Explain round robin and priority scheduling algorithms with any example
6. Discuss about critical section problem and provide Petersons solution semaphores.
7. What is the differncebetween binary and counting semaphores and how they provide solution for critical section?
8. Explain about readers writers problem with code
9. What is dining philosopher’s problem and how can we provide solution without getting deadlock.
10. Clearly explain bankers algorithm for deadlock avoidance
11. What are conditions for occurring deadlocks how can we prevent them
12. Explain about Disk scheduling algorithms with an example
13. Discuss various allocation methods on files
14. Draw hardisk structure and discuss various parts
15. Differentiate between internal and external fragmentation problem with figures
16. What are fixed and variable partitioning schemes
17. Implement LRU and optimal page replacement algorithms with any example
18. Explain about Direct memory access with a neat figure
19. What is blocking I/O and non blocking I/O
20. Discuss about various security attacks and threats
21. What are different viruses and how can we protect our system from viruses
22. Discuss about FCFS and SJF scheduling algorithms with an example
23. Explain about paging concept with a neat figure
24. how address translation is done from logical memory to physical memory in segmentation

error: Content is protected !!