UNIT- 1&2 imp questions

1. Distinguish among computer organization and computer architecture?

2. Describe about memory unit?

3. Describe about Arithmetic Logic Unit?

4. Describe about control unit?

5. Define (r -1)’s complement and r’s complement?

6.a Give an overview of the basic functional units and bus structures of a computer?
b) Give an overview of the performance measurement of computers.

6. Write various ways to improve the clock rate?

7. What are the functional units of a computer system? Explain the way of handling
information by each of them?

8. Discuss the generations of computers based on the development technologies used

to fabricate the processors, memories and I/O units.

9. What is optimizing compiler?

10. Write about various general purpose registers involved in the typical computer system.

11. “System software is responsible for coordination of all activities in a computing system”-
Justify this statement with the functionalities of it.

12. Write a short note on bus structures used in computer system.

13. Explain the importance of instruction set in measuring the performance of a

computer system.

14. Discuss various computer types with their applications in real world environment.
 15. 12. What do you mean by multiprogramming?

16. 2. Give the major characteristics of RISC and CISC architectures.

17. Demonstrate the procedure for obtaining product-of-sums using k-maps?

18. What is the role of Processor clock, clock rate in the performance of computer
system? Explain.

19. a)Role of MDR in

fetching a word from memory.

20. c) Block diagram of a complete processor .

21. What is the use of pipelining and superscalar operations?

Machine Instruction and Programs

1. What do you mean by register transfer language? What are the uses of register
transfer language?

2. Describe the phases of instruction cycle briefly.

3. What are the basic differences among a branch instruction, a call subroutine
instruction, and program interrupt?

4. Write short notes on additional addressing mode.

5. Describe the basic Instruction format.

6. Construct a bidirectional shift register with parallel load and give the function table of the
circuit.(OS)

8. An 8-bit register contains the binary value 10011100. What is the register value after
arithmetic shift right? Starting from the initial number 10011100, determine the register
value after an arithmetic shift left, and state whether there is an overflow?

10. Using a 4-bit counter with parallel load and a 4-bit adder, draw a block diagram
that shows how to implement the following statements:

x: R1 ←R1+R2 Add R2 to R1

x ' y: R1← R1+1 Increment R1

where R1 is a counter with parallel load and R2 is a 4-bit register.

11. Explain the functionalities and applications of the following

i. Decoders ii. Encoders iii. Multiplexers iv. De-multiplexers

12. Differentiate the instruction execution for adding ‘n’ numbers using Straight line
sequencing and branching?

13. Write short notes on shift and rotate instruction.

14 a) Write about various means by which data are transferred between memory of a
computer and outside world.

b) Write the subroutines for parameter passing through registers.

15 a) What is register transfer notation? Write and explain these notations to three-
address, two-address, single address and zero-address instruction types.

b) llustrate the concept of assembly directives with an assembly language Program.

(7M, Apr’18)

16. Give example for left and right shift operations.

17. In how many ways the location of an operand is specified in an instruction? Explain
each mode with suitable examples.

18. Represent the number (+46.5)10 as a floating-point binary number with 24 bits?
The normalized fraction mantissa has 16 bits and the exponent has 8 bits?

19. Distinguish between fixed point representation and floating point representation.

20. Describe fixed point representation and floating point representation?

21. Illustrate with examples fixed point representation and floating point representation

22. List basic input and output operations.

23. Explain 3 steps a processor perform to execute instruction

type of Instructions
1. Give the flow chart of addition and subtraction of two floating-point binary numbers.

2.What are addressing modes? Give an overview of the addressing modes.

3. With an example write about relative addressing.

4. Differentiate post-indexed and pre-indexed addressing with write back policy.

5. Suppose two numbers located in memory are to be added. What are the functional units
of digital computer system will carry out this? Explain how.

Input/Output Organization
1. Give few examples of external interrupts and few examples of internal interrupts. What
is the difference between a software interrupt and subroutine call?

2. What is the difference between isolated I/O and memory mapped I/O? What are the
advantages and disadvantages of each?

3. Define cycle stealing.

4. What do you mean by vectored interrupt?

5. What is bus arbitration?

6 Write about the transfer of control between programs through interrupts.

6. What is the use of PCI bus in a computer system?

7. Discuss various types of Interrupts.

13. Demonstrate how communication proceeds between CPU and IOP?.

14. Explain in detail various I/O modes of transfer.

15. Design parallel priority interrupt hardware for a system with eight interrupt sources.

16. What is direct memory transfer? Give an overview and the block diagram of a DMA
controller.

17. Demonstrate interrupt-initiated I/O.

18. Explain the functionalities of an IOP interface unit.

19. Give an overview of parallel priority interrupt hardware.

20. Demonstrate the mechanism of DMA.

21. Explain typical read operation with various data transfer signals on the PCI bus.
22. Write about two different approaches for bus arbitration.

23. What are the main phases involved in the operation of SCSI bus?

24. List the functionalities of I/O interface. Draw and explain a combined
input/output interface circuit?

25. Discuss the implementation of nested interrupts to handle multiple devices?

26. Explain the importance of handshake control for data transfer in asynchronous bus?

27. How to meet device characteristics and addressing objectives by USB?

28. Explain the usage of daisy chains and priority in simultaneous interrupt handling?
Processing Unit

1. Define Micro-operation.

2. Define micro program.

3. Define Microcode.

4. Explain basic organization of micro programmed control unit.

5. Define Microinstruction.

6. How to determine branch target address?

7. What is micro programmed control and micro routines?

8. Discuss load/store instructions for multiple operands.

9. Write short notes on wide-branch addressing.

10. Give an overview of address sequencing in micro programmed control unit.

11. Formulate a mapping procedure that provides eight consecutive microinstructions

for each routing. The operation code has six bits and the control memory has 2048
words.

12. Distinguish between micro programmed and hardwired control unit.

13. What are the microinstructions needed for the fetch routine? Explain.

14. a) What are main types of control units? Explain briefly.

b) Give the block diagram of a control memory and the associated hardware needed
for selecting the next micro-instruction address.

15. a)What is the difference between a microprocessor and micro program? Is it

possible to design a microprocessor?

b) Explain, how address sequencing is done in a micro programmed control unit?

Processor design

Block diagram of a complete processor.

16. Explain about the following:

a) Conditional branching micro program

b) Vertical/Horizontal organization of micro instruction.

 c) Fetching a word from memory.

17. . Explain about the

following:

a) Single bus organization of the data path inside a processor.

b) Micro program sequencing.

c) Micro instructions with next address field

18. b) Control sequence that implements unconditional branch instructions

3,4,5 units important questions

1) Summarize the Classifications and functions of Operating System.

2) Explain the activities of Operating System in connection with Memory and

Process management.

3)Draw and explain five state process model.

4) Write the important characteristics of Round Robin Scheduling algorithm.

And demonstrate its performance for the following workload in a system with

time quantum = 2 units.

Consider the set of 5 processes whose arrival time and burst time are given

below

Process Id Arrival Time Burst time

P1 5 5

P2 4 6

P3 3 7

P4 1 9

P5 2 2

P6 6 3

Draw a Gantt chart illustrating the execution of these jobs and also Calculate

the average waiting and average turnaround times

5) What are the causes for External and Internal fragmentation? Suggest

solutions to the fragmentation problem.

6) Explain the LRU and Optimal page replacement algorithms.

7) Discuss various approaches for breaking a Deadlock.

8) What is meant by Starvation in Dining philosopher problem? Suggest a

solution to solve this problem using Semaphores.

9) Explain Indexed file allocation method and discuss its advantages and

disadvantages.

10) Briefly discuss various Disk-scheduling algorithms.

11) What are the important functions of an operating system? Explain in detail.

12) What is the different system calls in an operating system? Explain.

13) What are the methods to provide synchronization in inter process

communication? List the different models of inter process communication.

14) Explain multithreading with an example. What are the benefits of

multithreaded programming?

15)What is contiguous and non-contiguous memory allocation? Explain the

swapping mechanism with a neat diagram.

16) What is the role of hardware in OS process synchronization? Explain how

mutex locks are used.

17) What is the purpose of safety resource algorithm? Explain in detail.

18) Explain how the file system is implemented in an operating system.

19) Why is it important to balance file-system I/O among the disks and controllers

on a system in a multitasking environment? Explain.

20) What is meant by a system call? Explain how Linux handles system calls.
31) Explain the main purpose of an Operating System.

32) Compare Serial processing and Batch Processing operating systems.

33) Describe the actions taken by a Kernel to context switch between processes.

34) Consider the set of 6 processes whose arrival time and burst time are given below:

Process Arrival Time Burst Time

P1 0 4

P2 1 5

P3 2 2

P4 3 1

P5 4 6

P6 5 3

If the CPU scheduling policy is Round Robin with time quantum = 2. Draw a Gantt
chart illustrating the execution of these jobs and calculate the average waiting time

and average turnaround time.

35) Explain the five major activities of an operating system with regard to memory

management.

36) What is paging? Explain the steps involved in handling a page fault.

Considering a system with five processes P0 through P4 and three resources of type

A, B, C. Resource type A has 10 instances, B has 5 instances and type C has 7

instances. Suppose at time t0 following snapshot of the system has been taken:

Process Allocation Max Available

i) What will be the content of the Need matrix?

ii) Is the system in a safe state? If Yes, then what is the safe sequence?

iii) What will happen if process P1 requests one additional instance of resource type

A and two instances of resource type C?

37) Explain the three allocation methods in file system implementation. Illustrate with a

proper diagram.

38) Explain and Compare the following disk scheduling algorithms:

i) FCFS ii) SCAN iii) C-LOOK.

39)Define the essential properties of the following types of operating systems:

i) Batch ii) Interactive iii) Time sharing iv) Real time v) Parallel

vi) Distributed vii) Handheld.

40) What is a process? Explain it with its state diagram.

41) Discuss how the following pairs of scheduling criteria conflict in a certain settings.

i) CPU utilization and response time, ii) Average turnaround time and maximum

waiting time, and iii) I/O device utilization and CPU utilization.

42) What is fragmentation? Explain the differences between internal and external

fragmentation.
43) Compare the main memory organization schemes of continuous memory

allocation, pure segmentation, and pure paging with respect to the following

issues: i) External fragmentation, ii) Internal fragmentation, iii) Ability to share

code across the process.

44) Discuss the hardware support required to support demand paging.

45) What is a deadlock? Explain the necessary condition for deadlock. [6M]

46) Explain the following deadlock avoidance algorithms:

i) Banker’s algorithm ii) Safety algorithm.

47) Explain different File Attributes and File Operations.

48) Explain what is meant by interleaving and overlapping with respect to

multiprogramming and multi-processing. Assume system have two user

processes.

49) Draw and explain OS layered and modular architecture and its services.

50) Write and explain various scheduling criteria’s with respect CPU scheduling.

And show the calculations for at least 5 processes arriving at consecutive

intervals.

51) Explain typical elements of inter process communication models.

52) What is paging? Explain the hardware support given for paging.

53) Consider the following page reference string 2,3,4,5,3,2,6,7,3,2,3,4,1,7,

1,4,3,2,3,4,7. Calculate the number of page faults with LRU, FIFO and optimal

page replacement algorithms with frame size of 3.

54) What is critical section problem? Write and explain Peterson’s solution for it.

55) How to prevent necessary and sufficient conditions of deadlock? Explain.

56) What are the advantages and disadvantages of recording the name of the

creating program with the file's attributes? Explain in detail.

57) In detail explain the structure of disk with a neat diagram. How to attach to the

existing memory resource?

58) What is meant by interleaving and overlapping with respect to multi

programming and multi processing? Explain. (Assume system have two user

processes).

59) Explain the Time-shared operating system.

60) For the processes listed below, evaluate Average Waiting Time and Average
Turnaround Time for: i) FCFS ii) SJF iii) SRT iv) Non-Preemptive Priority

v) Preemptive Priority vi) RR(Q=2).

61) What is paging? Explain its structure for 32 -byte memory with 4-byte pages.

62) Explain the usage and structure of monitors with an example.

63) Explain Banker's deadlock-avoidance algorithm with an illustration.

64) List out the various methods for free-space management and explain them.

65) Give a brief note on Disk scheduling algorithms.

With a neat sketch, Explain in detail about the interrelation between various

services provided by the operating system.

66a) Explain in detail, the sequence of actions taken by the operating system to context

switch between processes.

b) Assume the following workload in a system. All jobs arrive at time 0 in the order

given.

Draw a Gantt chart illustrating the execution of these jobs using Priority CPU

scheduling algorithm and also Calculate the average waiting time and average

turnaround time.

67) What is a page fault? Explain the steps involved in handling a page fault with a

neat sketch.

b) Explain the process of converting virtual addresses to physical addresses with a

neat diagram.

68 a) What is a Critical Section problem? Give the conditions that a solution to the

critical section problem must satisfy.

b) What is a deadlock? How deadlocks are detected?

69) Briefly explain about single-level, two-level and Tree-Structured directories.

b) Consider a disk queue with following requests for I/O to blocks on cylinders

30,70,115,130.110,80,20,25 (Assume disk head is at 90)

Draw FCFS and SSTF scheduling and also determine how many times the disk

head changes its direction for each of the above mentioned scheduling techniques.

70) Discuss the advantages and several disadvantages of open-source Operating

systems.

Discuss various operating system services that are very much helpful to the user.

b) What are the advantages and disadvantages of using the same system call

interface for manipulating both files and devices?

71 a) With a neat diagram, explain the process state diagram. [6M]

b) What are the advantages of inter-process communication? How communication

takes place in a shared-memory environment? Explain.

72a) How demand paging affects the performance of a computer system? Give

explanation.

b) How does the system detect Thrashing? What can the system do to eliminate this

problem? Explain.

73 a) What happens if the wait() and signal() semaphore operations are not executed

atomically? Give explanation.

b) What is Dining Philosophers problem? Discuss the solution to Dining

philosopher’s problem using monitors.

74 a) Discuss various file access methods in detail.

b) Explain about various issues involved in selecting appropriate disk scheduling

algorithm.

75a) Explain the objectives and functions of Operating system.

b) Explain in detail about the functions of System Call Interface.

76a) Explain the process scheduling with a neat queuing diagram. [7M]

b) Assume the following workload in a system. All jobs arrive at time 0 in the order

given.
Draw a Gantt chart illustrating the execution of these jobs using Round Robin CPU

scheduling algorithm (Assume time quantum= 1 unit) and also Calculate the

average waiting time and average turnaround time.

77. a) Explain the difference between External fragmentation and Internal fragmentation.

How to solve the fragmentation problem using paging.

b) Consider the following page reference string:

1,2,4,7,3,5,6,3,6,1,4,2,3,6,5,2

How many page faults would occur for the optimal page replacement algorithm,

assuming four frames and all frames are initially empty.

78 a) Discuss Mutual-exclusion implementation with Test And Set () instruction.

b) Discuss various techniques to recover from the deadlock.

79a) Explain in detail about various ways of accessing disk storage.

b) Explain the various methods for free-space management.

80a) Discuss various challenges and issues that are to be considered while designing an

operating system.

b) Why Real time operating systems are needed? Give some examples.

c) Write the difference between the function and system call. Briefly explain the six

major categories of system calls.

81 a) Explain in detail the two popular inter-process communication mechanisms. [7M]

b) What are the criteria for evaluating the CPU scheduling algorithms? Why do we

need it?

82 a) Discuss various issued related to the allocation of frames to processes. [7M]

b) Consider the following page reference string:

1,2,4,7,3,5,6,3,6,1,4,2,3,6,5,2

How many page faults would occur for the LRU page replacement algorithm,

assuming four frames and all frames are initially empty.

83 a) How does the signal() operation associated with monitors differ from the

corresponding operation defined for semaphores.

b) Explain the various ways of aborting a process in order to eliminate deadlocks.

84a) Explain the Indexed allocation of disk space.

b) Compare the SCAN and C-SCAN disk scheduling algorithms with an example.