Theme: Computer Architecture and Operating Systems

Courses: Operating System-30

1.What is a primary objective of a modern operating system?

A. Manage hardware resources efficiently and fairly.
B. Provide a user-friendly interface for interacting with applications.
C. Protect the system from unauthorized access and malicious software.
D. All of the above.
2.Which function does NOT fall under the core responsibilities of an operating system?
A. Process management: creating, scheduling, and terminating processes.
B. Memory management: allocating and deallocating memory for running programs.
C. Device management: controlling access to and communication with peripherals.
D. Application development: providing tools and libraries for building software.
3.What is the purpose of a file system in an operating system?
A. Organize and manage files and folders on storage devices.
B. Facilitate communication and data exchange between different programs.
C. Control access to system resources and enforce security policies.
D. Provide a graphical user interface for interacting with the system.
4.What is the benefit of using virtual memory in modern operating systems?
A. It allows multiple programs to run concurrently without exceeding physical memory
limitations.
B. It improves the performance of disk access by caching frequently used data.
C. It enhances security by isolating processes from each other's memory space.
D. It simplifies memory management for programmers by providing a unified address
space.
5.How does multithreading differ from multiprocessing in an operating system?
A. Multithreading allows a single process to execute multiple threads concurrently, while
multiprocessing involves running multiple processes simultaneously on multiple CPUs.
B. Both multithreading and multiprocessing involve dividing tasks among multiple units
for parallel execution, but multiprocessing focuses on hardware parallelism while
multithreading focuses on software parallelism.
C. Multithreading provides a way to share resources efficiently between multiple threads
within a single process, while multiprocessing is primarily concerned with utilizing
multiple CPUs effectively.
D. There is no fundamental difference between multithreading and multiprocessing; they
are just different terms for the same concept.
6. What is the role of a kernel in an operating system?
A. It acts as the core interface between hardware and software, providing essential low-
level services.
B. It manages the user interface and provides visual elements for interacting with the
system.
C. It handles high-level tasks like application execution and file management.
D. It is responsible for network communication and data transfer between devices.
 7. What is the advantage of using a modular operating system design?
A. It allows for easier development and maintenance of the system by dividing its
functionality into independent modules.
B. It improves performance by optimizing each module for specific tasks.
C. It enhances security by isolating security-sensitive components from other parts of the
system.
D. All
8. In Operating Systems, which of the following is/are CPU scheduling algorithms?
A. Priority
B. Round Robin
C. Shortest Job First
D. All of the mentioned
9. To access the services of the operating system, the interface is provided by
the___________
A. Library
B. System calls
C. Assembly instructions
D. API
10. CPU scheduling is the basis of ___________
A. multiprogramming operating systems
B. larger memory sized systems
C. multiprocessor systems
D. none of the mentioned
11. Which one of the following is not true?
A. kernel remains in the memory during the entire computer session
B. kernel is made of various modules which cannot be loaded in running operating system
C. kernel is the first part of the operating system to load into memory during booting
D. kernel is the program that constitutes the central core of the operating system
12. What is the fundamental requirement for deadlock to occur in a system?
A. Competition for shared resources that is not readily available.
B. A circular dependency between processes holding different resources.
C. The presence of preemption, where the operating system can forcibly take resources
from processes.
D. An abundance of resources that exceeds the needs of all running processes.
13. Which of the following is NOT a condition for deadlock according to Coffman's
conditions?
A. Mutual exclusion: A resource can only be used by one process at a time.
B. Hold and wait: A process holding resources can wait for additional resources.
C. No preemption: Resources cannot be forcibly taken away from a process.
D. Circular wait: A chain of processes exists where each is waiting for a resource held by
the next process in the chain.
14. Consider a system with two resources, R1 and R2, and two processes, P1 and P2. If P1
holds R1 and is waiting for R2, while P2 holds R2 and is waiting for R1, what situation
exists?
 A. Resource starvation
B. Race condition
C. Deadlock
D. Live lock
15. How can deadlock be prevented in an operating system?
A. By increasing the number of available resources beyond the maximum demand of any
process.
B. By allowing processes to hold multiple resources simultaneously, even if needed by
others.
C. By implementing resource allocation algorithms that avoid situations where all four
deadlock conditions hold.
D. By restarting all processes whenever any resource contention occurs.
16. What is a potential consequence of deadlock prevention techniques?
A. Increased resource utilization and system efficiency.
B. Reduced process parallelism and overall system throughput.
C. Elimination of all performance overhead associated with resource management.
D. Automatic resolution of any resource contention without user intervention.
17. Which deadlock detection algorithm typically identifies the minimum set of processes to
be preempted or aborted to break the deadlock cycle?
A. Banker's algorithm
B. Resource allocation graph algorithm
C. Timeout-based detection
D. All of the above
18. What are some disadvantages of using preemption as a deadlock recovery technique?
A. It can lead to data loss or inconsistent system state if preemption occurs during critical
sections.
B. It can be computationally expensive to determine the optimal process to preempt.
C. It can cause unfairness by favoring processes that have already acquired more
resources.
D. All of the above
19. What is the primary objective of a deadlock recovery algorithm?
A. To identify the root cause of the deadlock and permanently prevent its recurrence.
B. To minimize the impact of deadlock on system performance and restore normal
operation.
C. To distribute available resources equally among all processes to avoid resource
starvation.
D. To automatically restart all processes and clear any resource locks associated with the
deadlock.
20. How can the design of a system itself reduce the susceptibility to deadlock?
A. By minimizing the number of shared resources required by processes.
B. By simplifying process synchronization mechanisms and avoiding unnecessary
dependencies.
C. By employing dynamic resource allocation strategies that adapt to changing demands.
D. All of the above
21. Can deadlock occur in systems without shared resources?
A. No, deadlock solely depends on the competition for shared resources.
B. Yes, it can occur if processes are involved in complex circular dependencies with
exclusive access to different resources.
C. Only if the system is incorrectly designed or programmed with faulty synchronization
mechanisms.
D. No, deadlock is strictly a phenomenon observed in hardware resource allocation issues.
22. Which scheduling algorithm balances the CPU time among processes, aiming for each
process to receive an equal share over time?
A. Shortest Remaining Time First (SRTF)
B. Priority Scheduling
C. Fair-Share Scheduling
D. Round Robin (RR)
23. In a preemptive scheduling scenario, which algorithm can prioritize urgent tasks by
interrupting currently running processes based on their priority?
A. Non-preemptive Priority Scheduling
B. First Come First Serve (FCFS)
C. Multilevel Queue Scheduling
D. Any algorithm with fixed time quanta
24. Which performance metric would likely improve the most when using Priority
Scheduling compared to First Come First Serve (FCFS)?
A. Average turnaround time
B. Average waiting time
C. Throughput
D. Memory utilization
25. What potential drawback does Round Robin (RR) scheduling have compared to Priority
Scheduling?
A. Increased context switching overhead due to frequent preemption
B. Unfairness towards long-running processes who get smaller time slices
C. Inability to prioritize critical tasks over others
D. Higher complexity in implementation and management
26. How does a multilevel queue scheduling algorithm combine preemption and non-
preemption?
A. By assigning different priorities to processes based on their arrival time
B. By allowing higher-priority processes to preempt lower-priority processes at any time
C. By running processes in fixed priority queues with non-preemption within each queue
D. By incorporating an aging mechanism to gradually increase the priority of waiting
processes
27. Which scheduling scheme uses performance metrics like CPU utilization and response
time to dynamically adjust process priorities?
A. Performance-Based Priority Scheduling
B. Static Priority Scheduling
C. Deadline Scheduling
D. Fair-Share Scheduling
 28. What makes Earliest Deadline First (EDF) scheduling suitable for real-time systems?
A. Its ability to guarantee timely completion of tasks with strict deadlines
B. Its efficient utilization of CPU resources by favoring shorter processes
C. Its predictable execution behavior due to pre-defined priorities
D. Its low overhead and simplicity in implementation
29. When might a hybrid scheduling approach, combining elements of different algorithms,
be beneficial?
A. To achieve a balance between fairness and responsiveness for diverse system
workloads
B. To prioritize system processes over user processes for increased stability
C. To simplify scheduling logic and reduce overhead through a single unified algorithm
D. To adapt scheduling behavior based on changing system conditions and resource
availability
30. What is a key challenge in the development and implementation of advanced scheduling
algorithms?
A. Accurately predicting process execution times and resource requirements
B. Balancing the needs of different processes without introducing starvation or unfairness
C. Minimizing context switching overhead while ensuring responsiveness to dynamic
workloads
D. All of the above
Courses: Computer organization and architecture-30

1. The internal storage of a computer is called_______________

A. CPU
B. ALU
C. Memory
D. Control Unit
2. The processing required for a single instruction is called____________
A. Fetch cycle
B. Execution cycle
C. Instruction cycle
D. Branch cycle
3. Which one of the following specifies the operation to be performed?
A. Machine code
B. CPU code
C. Op code
D. ALU code
4. Which operation is used for addition, subtraction, increment, decrement and complement
function?
A. Logical micro operation
B. Arithmetic micro operation
C. Shift micro operation
D. Data base operation
5. The register that includes the address of the memory unit is termed as the______.
A. MAR
B. PC
C. IP
D. IR
6. Power failure interrupts is___________
A. Internal interrupt
B. Software interrupt
C. External interrupt
D. CPU
7. Which control unit determines the address of the next instruction to be executed and loads it
into program counter?
A. Instruction Interpretation
B. Instruction sequencing
C. Instruction regulation
D. Instruction composition
8. The computer architecture aimed at reducing the time of execution of instructions is
__________
A. CISC
B. RISC
C. ISA
D. ANNA
9. If A and B are the inputs of a half adder, the sum is given by ________
A. A AND B
B. A OR B
 C. A XOR B
D. A EX-NOR B
10. The _____________format is usually used to store data.
A. BCD
B. Decimal
C. Hexadecimal
D. Octal
11. During the execution of a program which gets initialized first?
A. MDR
B. IR
C. PC
D. MAR
12. During the execution of the instructions, a copy of the instructions is placed in the
_________
A. Register
B. RAM
C. System heap
D. Cache
13. The average number of steps taken to execute the set of instructions can be made to be less
than one by following ____________
A. ISA
B. Pipe-lining
C. Super-scaling
D. Sequential
14. In case of, Zero address instruction method the operands are stored in ______________
A. Registers
B. Push down stack
C. Accumulators
D. Cache
15. The addressing mode which makes use of in-direction pointers is ____________
A. Indirect addressing mode
 B. Index addressing mode
C. Relative addressing mode
D. Offset addressing mode
16. A Stack-organized Computer uses instruction of ______________.
A. indirect addressing
B. two-addressing
C. zero addressing
D. index addressing
17. A group of bits that tell the computer to perform a specific operation is known as_____.
A. Instruction code
B. Micro-operation
C. Accumulator
D. Register
18. The operation executed on data stored in registers is called___________.
A. Macro-operation
B. Micro-operation
C. Bit-operation
D. Byte-operation
19. The BSA instruction is:
A. Branch and Store Accumulator
B. Branch and save return address
C. Branch and shift address
D. Branch and show Accumulator
20. In case of, Zero-address instruction method the operands are stored in_________.
A. Registers
B. Accumulators
C. Push down stack
D. Cache
21. The addressing mode, where you directly specify the operand value is___________.
A. immediate
B. direct
 C. definite
D. relative
22. Which register keeps track of the instructions stored in program memory?
A. AR (Address Register)
B. XR (Index Register)
C. PC (Program Counter)
D. AC (Accumulator)
23. Operation calculating NOT of the OR can be represented as____________.
A. NOT
B. OR
C. NAND
D. NOR
24. Which language is termed as the symbolic depiction used for indicating the series?
A. Random transfer language
B. Register transfer language
C. Arithmetic transfer language
D. Arithmetic operation
25. In which transfer the computer register are indicated in capital letters for depicting its function?
A. Memory transfer
B. Register transfer
C. Bus transfer
D. Arithmetic operation
26. In which shift is used to divide a signed number by two?
A. Logical right-shift
B. Arithmetic right shift
C. Logical left shift
D. Arithmetic left shift
27. Which one of the following is the sequence of operations performed by CPU in processing an
instruction?
A. Execute cycle
B. Fetch cycle
C. Decode
 D. Instruction cycle
28. Which one of the following is a single control line that informs destination unit that a valid is
available on the bus?
A. Strobe
B. Handshaking
C. Synchronous
D. Asynchronous
29. Which is a method of decomposing a sequential process into sub operations?
A. Pipeline
B. CISC
C. RISC
D. Database
30. Register capable of shifting its binary information either to the right or the left is called___
A. parallel register
B. serial register
C. shift register
storage register