set-12
601. Recognition of basic syntactic constructs through reductions, this task is performed by:
Lexical Analysis
Semantic Analysis
Syntax Analysis
Structure Analysis
602. A grammar for a programming language is a formal description of:
Syntax
Structure
Semantics
Code
603. ______ is a technique of temporarily removing inactive programs from the memory of a computer system:
Swapping
Semaphore
Spooling
Scheduler
604. ______ is a technique of improving the priority of processes waiting in the queue for CPU allocation:
Starvation
Revocation
Aging
Relocation
605. ______ is the time required by a sector to reach below the read/write head:
Seek Time
Access Time
Latency Time
None
606. Which of the following is the most general phase-structured grammar?
Context-Sensitive
Context-Free
Regular
None of the above
607. File record length:
Should always be fixed
Should always be variable
Depends upon the size of the file
Should be chosen to match the data characteristics
608. The process is:
An instance of a program in execution
A program only
Processor state
None of the above
609. A program is passive while a process is:
Inactive
Spontaneous
Active
None of the above
610. A process is created and is initially put in the:
Ready queue
Device output
Any of the above
None of the above
611. Exit() system call results in:
Forced termination
Normal termination
Abnormal termination
None of the above
612. A thread is a:
Task
Process
Program
Lightweight process
613. Generally, we have user-level threads and:
Programmer-level thread
Kernel-level thread
Program-level thread
None of the above
614. IPCs can be done through:
Mails
Messages
System calls
Traps
615. RR scheduling is a preemptive version of:
FIFO
SJF
MLQ
None of the above
616. A scheduling where in the jobs are allowed to move between the queues:
Multilevel queue scheduling
Multilevel feedback scheduling
RR scheduling
None of the above
617. In RR Scheduling, a ready queue is treated as:
Circular queue
Doubly linked list
Stack
None of the above
618. FIFO scheduling is:
Preemptive
Non-preemptive
Deadline scheduling
None of the above
619. The indefinite blocking of low-priority processes by high-priority processes is known as:
Starvation
Deadlock
Aging
None of the above
620. The technique of gradually increasing the priority of processes that wait in the system for a long time is called:
Aging
Throughput
FCFS
None of the above
621. The main objective of scheduling is:
CPU utilization
Increase the throughput
Both A and B
None of the above
622. The total time elapsed from the time the job is submitted (or process is created) to the time the job (or process) is completed is called:
Response time
Waiting time
Turnaround time
None of the above
623. ______ is defined as the average fraction of time during which the CPU is busy, executing either user programs or system modules:
Throughput
CPU utilization
Response time
Waiting time
624. In ______ scheduling, if once a process has been allocated CPU, then the CPU cannot be taken away from that process:
Pre-emptive scheduling
Non-preemptive scheduling
Both A and C
None of the above
625. In ______, the CPU can be taken away before the completion of the process:
Pre-emptive scheduling
Non-preemptive
Both A and B
None of the above
626. “If there are n-processes in a ready queue and the time quantum is ‘q’ time intervals, then each process gets ‘1/n’, of the CPU time in the chunks of at most ‘q’ units of time. Each process will have to wait for (n -1) x q time unit until its next time quantum comes in” This principle is suitable for which one of the following:
Round robin algorithm
SFJ
FCFS
None of the above
627. Process can be in one of the following states:
New, Ready
Running
Waiting, Blocked, Terminate
All of the above
628. Process is:
Loosely coupled
Tightly coupled
Both A and B
None of the above
629. Process is:
Lightweight process
Heavyweight process
Tightly coupled
None of the above
630. The high paging activity is called:
Segmentation
Thrashing
Demand Paging
None of the above
631. The process of merging adjacent holes to form a single larger hole is called as:
Fragmentation
Coalescing
Swapping
None of the above
632. The degree of multiprogramming is controlled by:
CPU scheduler
Context switching
Long-term scheduler
Medium-term scheduler
633. Thrashing occurs:
When excessive swapping takes place
When you thrash your computer
Whenever deadlock occurs
When no swapping takes place
634. Boundary registers:
Are available in temporary program variables storage
Are only necessary with fixed partitions
Track the beginning and ending of programs
Track page boundaries
635. A scheduling algorithm is fair:
If no process faces starvation
If a process is starved, detect it and run it with high priority
If it uses semaphores
Only if a queue is used for scheduling
636. A critical region:
Is a piece of code which only one process executes at a time
Is a region prone to deadlock
Is a piece of code which only a finite number of processes executes
Is found only in Windows N operating system
637. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the ______ condition of deadlock:
Mutual exclusion
Hold and Wait
Circular wait
No preemption
638. Semaphore can be used for solving:
Wait and signal
Deadlock
Synchronization
Priority
639. The hardware mechanism that enables a device to notify the CPU is called:
Polling
Interrupt
System call
None of the above
640. ______ begins at the root and follows a path down to the specified file:
Relative path name
Absolute path name
Standalone name
All of the above
641. Process state is a part of:
Process control block
Node
File allocation table
None of the above
642. Virtual memory is commonly implemented by:
Segmentation
Swapping
Demand paging
None of the above
643. Paging:
Solves the memory fragmentation problem
Allows modular programming
Allows structured programming
Avoids deadlock
644. Which of the following is a criterion to evaluate a scheduling algorithm?
CPU Utilization: keep CPU utilization as high as possible
Throughput: number of processes completed per unit time
Waiting time: amount of time spent ready to run but not running
All of the above
645. Which of the following is contained in Process Control Block (PCB)?
Process number
List of open files
Memory limits
All of the above
646. With the round-robin CPU scheduling in a time-shared system:
Using very large time slice degenerates into the first-come-first-served algorithm
Using extremely small time slices improves performance
Using extremely small time slices degenerates into the last-in-first-out algorithm
Using medium-sized time slices leads to the shortest request time first algorithm
Last updated