set-11

Answer: 1. Forced deallocation of the CPU from a program which is executing on the CPU

Explanation:

• Preemption: Preemption occurs when the operating system forcibly removes a running process from the CPU to allocate it to another process, typically in a time-sharing system.
• Conclusion: Preemption involves forced deallocation of the CPU from a running process.

Answer: 2. Machine dependent

Explanation:

• Assembler: An assembler is a program that converts assembly language code into machine code. It is machine-dependent because the generated machine code is specific to the target processor architecture.
• Conclusion: Assemblers are machine-dependent.

Answer: 2. Executing

Explanation:

• Process States: The fundamental process states are Ready, Running, Blocked, and Terminated. “Executing” is not a standard process state; it is synonymous with the Running state.
• Conclusion: Executing is not a fundamental process state.

Answer: 2. Least Recently Used

Explanation:

• LRU Policy: The Least Recently Used (LRU) page replacement policy replaces the page that has not been used for the longest time.
• Conclusion: LRU stands for Least Recently Used.

Answer: 3. Both (A) and (B)

Explanation:

• Encryption Techniques: Block cipher and stream cipher are both encryption techniques. Block cipher encrypts data in fixed-size blocks, while stream cipher encrypts data bit by bit.
• Conclusion: Both block cipher and stream cipher are encryption techniques.

Answer: 3. Deadlock prevention

Explanation:

• Deadlock Prevention: Deadlock prevention techniques do not require knowledge of the system state. They ensure that at least one of the necessary conditions for deadlock (mutual exclusion, hold and wait, no preemption, circular wait) is never satisfied.
• Conclusion: Deadlock prevention does not require knowledge of the system state.

Answer: 1. Automatic generation of program

Explanation:

• Program Generation: Program generation involves automatically creating programs based on predefined templates or specifications.
• Conclusion: Program generation aims at the automatic generation of programs.

Answer: 4. None of the above

Explanation:

• Advantages of Distributed Systems: Distributed systems offer reliability, resource sharing, and incremental growth. All the listed options are advantages.
• Conclusion: None of the options are disadvantages of distributed systems.

Answer: 2. Indicates an action to be performed during execution of assembled program

Explanation:

• Imperative Statement: An imperative statement in assembly language specifies an action to be performed during the execution of the program.
• Conclusion: Imperative statements indicate actions to be performed during execution.

Answer: 2. Bootstrap loader

Explanation:

• Bootstrap Loader: The bootstrap loader is a small program that runs when the system is first turned on or restarted. It loads the operating system into memory.
• Conclusion: The bootstrap loader is executed during system startup.

Answer: 4. Any of the above

Explanation:

• Poor Response Time: Poor response time can be caused by a busy process, high paging rates, or high I/O rates, as all these factors can delay the execution of user requests.
• Conclusion: Any of the listed factors can cause poor response time.

Answer: 3. The number of logical records in one physical record

Explanation:

• Blocking Factor: The blocking factor is the number of logical records stored in one physical block or record.
• Conclusion: The blocking factor refers to the number of logical records in one physical record.

Answer: 4. All of the above

Explanation:

• Process Precedence Sequence: A process precedence sequence includes process names, concurrency operators, and sequence operators to define the order of process execution.
• Conclusion: All the listed options are components of a process precedence sequence.

Answer: 1. Fork

Explanation:

• Fork and Join Primitive: The Fork and Join primitives are used in parallel programming. The valid syntax for Fork is Fork <label>, where <label> specifies the starting point of the new process.
• Conclusion: The correct syntax is Fork <label>.

Answer: 3. LIFO (Last in First out)

Explanation:

• Nested Macro Calls: Nested macro calls are expanded using the Last In First Out (LIFO) rule, similar to a stack.
• Conclusion: LIFO is used for expanding nested macro calls.

Answer: 2. LL(1) parser

Explanation:

• LL(1) Parser: The LL(1) parser is a variant of top-down parsing that does not require backtracking. It uses a lookahead of one token to make parsing decisions.
• Conclusion: The LL(1) parser is a top-down parser without backtracking.

Answer: 3. LIFO rule

Explanation:

• Nested Macro Calls: Nested macro calls are expanded using the Last In First Out (LIFO) rule, similar to a stack.
• Conclusion: LIFO is used for expanding nested macro calls.

Answer: 4. Synthesize the target program

Explanation:

• Pass II of Assembler: In a two-pass assembler, Pass II synthesizes the target program by generating machine code using the symbol table built in Pass I.
• Conclusion: Pass II synthesizes the target program.

Answer: 3. Links the program with other programs needed for its execution

Explanation:

• Linker Program: The linker combines object modules into a single executable program and resolves external references between them.
• Conclusion: The linker links the program with other programs needed for its execution.

Answer: 2. Round-Robin

Explanation:

• Time-Shared Systems: Round-Robin scheduling is most suitable for time-shared systems because it provides fair CPU allocation to all processes by giving each process a fixed time slice (quantum).
• Conclusion: Round-Robin is ideal for time-shared operating systems.

Answer: 3. Where shared resources are accessed

Explanation:

• Critical Section: A critical section is a segment of code where shared resources are accessed. It must be executed atomically to prevent race conditions.
• Conclusion: The critical section is where shared resources are accessed.

Answer: 1. 4

Explanation:

• Deadlock Prevention: To prevent deadlock, the system must ensure that the total number of resources is sufficient to satisfy the maximum demand of at least one process. For $n$ processes, each requiring $k$ units of a resource, the minimum number of resources required to avoid deadlock is given by:

  $$\text{Minimum Resources} = n \times (k - 1) + 1$$

  For 3 processes, each requiring 2 units:

  $$\text{Minimum Resources} = 3 \times (2 - 1) + 1 = 4$$

• Conclusion: The minimum number of units of R required to avoid deadlock is 4.

Answer: 2. Is likely to be the one of the pages used in the last few page references

Explanation:

• Locality of Reference: Locality of reference refers to the tendency of a program to access the same set of memory locations repeatedly over a short period of time. This property can be spatial (nearby locations) or temporal (recently accessed locations).
• Conclusion: Locality of reference implies that a process is likely to access pages used in the last few references.

Answer: 3. Perform LC processing

Explanation:

• Synthesis Phase: The synthesis phase of an assembler involves generating machine code from assembly instructions. LC (Location Counter) processing is part of the analysis phase, not the synthesis phase.
• Conclusion: LC processing is not part of the synthesis phase.

Answer: 3. EQU

Explanation:

• EQU Directive: The EQU directive in assembly language is used to define a symbol and assign it a value. The correct syntax is <symbol> EQU <address space>.
• Conclusion: The correct syntax is <symbol> EQU <address space>.

Answer: 4. All of the above

Explanation:

• Top-Down Parsing: Top-down parsing requires a source string marker, matching and backtracking, and a prediction-making mechanism to determine the correct production rule.
• Conclusion: All the listed features are needed for top-down parsing.

Answer: 4. All of the above

Explanation:

• Macro Definition: A macro definition includes a macro prototype statement, macro pre-processor statements, and one or more model statements.
• Conclusion: All the listed components are part of a macro definition.

Answer: 3. Secure it for transmission

Explanation:

• File Encryption: The primary purpose of encrypting a file is to secure it during transmission or storage, preventing unauthorized access.
• Conclusion: Encryption is used to secure files for transmission.

Answer: 3. A reference for the disk block that stores the page

Explanation:

• Page Table Entry: A page table entry typically includes the frame number and a bit indicating whether the page is in memory or on disk. It does not include a reference to the disk block.
• Conclusion: A reference to the disk block is not stored in a page table entry.

Answer: 1. Structured into two halves called top half and bottom half

Explanation:

• UNIX Device Driver: A UNIX device driver is structured into two halves: the top half (interrupt handler) and the bottom half (deferred processing).
• Conclusion: UNIX device drivers are structured into top and bottom halves.

Answer: 4. MCS (Management Control System)

Explanation:

• IO Management Module: The IO management module includes PIOCS, LIOCS, and FS. MCS is not a standard layer of the IO management module.
• Conclusion: MCS is not part of the IO management module.

Answer: 3. RU policy (Recurrently used)

Explanation:

• Page Replacement Policies: LRU, FIFO, and Optimal are valid page replacement policies. RU (Recurrently Used) is not a standard policy.
• Conclusion: RU is not a valid page replacement policy.

Answer: 4. None of the above

Explanation:

• Relocation Register: The relocation register contains the difference between the linked origin and the actual start address. Here:

  $$\text{Relocation Register} = 70000 - 5000 = 65000$$

• Conclusion: The correct value is 65000, which is not listed in the options.

Answer: 1. Low-level programming language

Explanation:

• Assembly Language: Assembly language is a low-level programming language that is closely related to machine code and provides direct control over hardware.
• Conclusion: Assembly language is a low-level programming language.

Answer: 1. Table of Incomplete Instructions

Explanation:

• TII: TII stands for Table of Incomplete Instructions, which is used in assembly language processing to track instructions that are not fully resolved.
• Conclusion: TII refers to the Table of Incomplete Instructions.

Answer: 2. Syntax Analysis

Explanation:

• Syntax Analysis: Syntax analysis is the phase of compilation that checks the syntactic structure of source code to ensure it conforms to the language’s grammar rules.
• Conclusion: Syntax analysis determines the syntactic structure of source statements.

Answer: 2. Instruction Execution

Explanation:

• Instruction Execution: The execution phase of the CPU carries out the actions specified by the instruction, such as performing arithmetic operations or accessing memory.
• Conclusion: Instruction execution implements the meaning of instructions.

Answer: 2. Segment Field

Explanation:

• Segment Field: In segmented memory systems, the segment field contains the segment index or internal index used to locate the segment in memory.
• Conclusion: The segment field contains the segment index.

Answer: 1. Process

Explanation:

• Process: A process is an instance of a program in execution. It includes the program code, data, and resources allocated to it.
• Conclusion: A program in execution is called a process.

Answer: 1. Long-term scheduling

Explanation:

• Long-Term Scheduling: Long-term scheduling involves admitting jobs to the system and placing them in the job queue for processing.
• Conclusion: Jobs admitted to the system are handled by long-term scheduling.

Answer: 3. Virtual Memory

Explanation:

• Virtual Memory: Virtual memory is a technique that allows a program to execute even if it is not entirely loaded into physical memory. It uses paging or segmentation to manage memory.
• Conclusion: Virtual memory enables programs to execute without being fully loaded into memory.

Answer: 1. Shortest-Seek-Time-First scheduling

Explanation:

• SSTF: SSTF (Shortest-Seek-Time-First) is a disk scheduling algorithm that selects the request with the shortest seek time from the current head position.
• Conclusion: SSTF stands for Shortest-Seek-Time-First scheduling.

Answer: 1. Hold and Wait

Explanation:

• Hold and Wait: Hold and wait is a condition for deadlock where a process holds at least one resource and waits for additional resources.
• Conclusion: Hold and wait describes a process acquiring all needed resources before execution.

Answer: 3. Assembler or Translator

Explanation:

• Relocation Bits: Relocation bits are specified by the assembler or translator to indicate which parts of the program need to be relocated during loading.
• Conclusion: The assembler or translator specifies relocation bits.

Answer: 1. Linker

Explanation:

• Linker: The linker resolves externally defined symbols by combining object modules and resolving references between them.
• Conclusion: The linker performs resolution of externally defined symbols.

Answer: 2. Can be loaded almost anywhere in memory

Explanation:

• Relocation Programs: Relocation programs can be loaded into different memory locations because they use relative addressing.
• Conclusion: Relocation programs can be loaded almost anywhere in memory.

Answer: 1. Security Context

Explanation:

• Authentication: Authentication verifies the identity of users or systems and is a fundamental part of computer security.
• Conclusion: Authentication is part of the security context.

Answer: 4. Locality of reference is applicable to the process

Explanation:

• Locality of Reference: If a process exhibits strong locality of reference, it accesses the same set of memory locations repeatedly, reducing page faults.
• Conclusion: Locality of reference reduces page fault frequency.

Answer: 4. All of the above

Explanation:

• Language Processors: Assemblers, interpreters, and compilers are all language processors that convert high-level or assembly code into machine code.
• Conclusion: All of the above are language processors.

Answer: 4. All of the above

Explanation:

• Virtual Memory Implementation: Virtual memory can be implemented using paging, segmentation, or a combination of both.
• Conclusion: Virtual memory can be implemented with paging, segmentation, or both.