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 Computers and IT Programming Important Questions

Following are important questions for Viva Voce examination of B.Tech Computer Science, IT and other branches which have a paper on Programming and related topics. The questions are useful for JNTU students and other Universities which follow similar syllabus. Unit Wise important questions are given below:

Unit-I

1) What is the purpose of the scheduling algorithms?
2) What are FCFS, SJF, and Priority?
3) What is difference between preemptive and non-preemptive?
4) Advantages of FCFS, SJF, Priority, Round robin?
5) Disadvantages of FCFS, SJF, Priority, Round robin?
6) What is arrival time, burst time, turnaround time, waiting time, finish time and starting time?
7) Explain the technique followed by the different scheduling algorithms?
8) Which is more advantageous?
9) Formulas to calculate waiting time, turnaround time and finish time?
10) Different states a process undergoes?

UNIT-II

1) What is a file?
2) What is the structure of a file?
3) What is a block?
4) What is directory?
5) What are the various file operations?
6) What is FAT?
7) What is free-space management?

UNIT-V

1) Explain the purpose of page replacement?
2) Explain FIFO?
3) Explain LRU?
4) Explain Opt?
5) Advantages of FIFO, LRU, OPT?
6) Disadvantages of FIFO. LRU, OPT?
7) Which replacement algorithm is more beneficial?
8) What is page success?
9) What is page fault?
10) How do we calculate the page fault?
11) What is virtual memory?
12) What is the difference between logical and physical address?
13) What is the importance of MMU?
14) What is memory?
15) Purpose of memory?
16) Different types of memory?
17) What is memory management?
18) Different techniques used in the memory management algorithm?
19) What is memory hierarchy?
20) What is base and index address?
21) What is segmentation and paging?
22) What is fragmentation?

UNIT-VI

1) What is a deadlock?
2) Reasons for deadlock occurrence?
3) How to prevent deadlock?
4) How can we avoid deadlock?
5) What are the necessary conditions for the occurrence of deadlock?
6) What is critical section?
7) What is semaphore and monitor?
8) Explain message passing?
9) Types of semaphores?
10) What is banker’s algorithm?
11) How does it try to avoid the deadlock?
12) What is a deadlock?
13) How to prevent deadlock?
14) How to avoid deadlock?
15) What is race condition?
16) Explain solution for critical section?

UNIT-VII

1) What is a directory?
2) Explain the directory structure?
3) Explain different functions used for files and directories?
4) What are the various directory operations?
5) What is paging technique?
6) What is page table?
7) What is frame list?
8) What is simple paging?
9) What are the functions involved in this technique?

1) Return Values of fork()
2) What is OS ? Define.
3) What is the function call to create a pipe. ANS: read fn.call and write fn.call
4) function call to change environmental variables.
5) Why do we use execvp();
6) Why we use fork()
7) How to check status of file
8) How many copies of a process are present in address space when fork is executed.
9) How to get the id of parent and current process. ANS: getppid() for parent, getpid() for current process.
10) How to get the id of child process of current process. ANS: fork() returns it.
11) What is a Semaphore?
12) What is a system call ?
13) Difference between pipe and message queue
14) What is pipe? What is message queue
15) Difference between system call, Procedure call,Function call.
16) What is environment variable?
17) In pipe what is the argument of pipe()function.
18) 0666–> What does this mean. Why do we only use 6 here. ANS: 666 are the access rights i.e read and write permissions are given to the User ,Group and Owner .
19) How do we create a message queue?
20) what is mtype in msgrcv sys.call?
21) What are arguements of stat()
22) How does processes interact in message queue and pipes.
23) What are disadvantages of pipe. Mention atleast 3.
24) Difference b/w fork() and exec? why do we go for exec?
25) what is execvp()
26) How to create message queue?
27) What does 0 mean in 0666
28) 0666 – Why do we use 3 6’s in this.?
29) What is difference b/w write and read sys call in pipe.
30) Difference between fork() & execvp()
31) How many process can we use in pipe

error: Content is protected !!