- Algorithm
- Compiler Design
- Computer Fundamentals
- Computer Networks
- Computer Organization & Architecture
- DBMS
- Digital logic
- Information System
- Ms Office
- Operating System
- Programming & Data structure
- Software Engineering
- Software Testing
- System Programming
- Theory of computation
- Web technology
- Analog & Digital Circuits
- Control System
- Electronic Devices
- EMFT
- Junctions, Diodes & Tunnel
- Signals & systems
- Wireless Communication
- Engineering Mechanics
- Fluid Mechanics
- Heat Transfer
- I.C. Engines
- Power Engineering
- Strength of Materials
- Theory of Machines
- Thermodynamics
- Concrete Structure
- Construction & Structure engineering
- Costing & Valuation of Building Materials
- Errors & Adjustments
- Hydraulics
- Soil Mechanics
- Steel Structures
- Structural Analysis
- Surveying
- Traffic Engineering
- Water supply & waste water engineering
Computer Science/IT
Electronics & communications
Mechanical Engineering
Civil engineering
Electrical engineering
-
-
( 41 ) Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.
- 1) Lengthened; Shortened
- 2) Shortened; Lengthened
- 3) Shortened; Shortened
- 4) Shortened; Unchanged
-
Show Answer Report Discussion in forumAnswer : 2) Shortened; Lengthened
Solution : Under multiprogramming, turnaround time for short jobs is usually Shortened and that for long jobs is slightly Lengthened .
discussion
Answer : 2) Shortened; Lengthened
-
-
-
( 42 ) Complex scheduling algorithms :
- 1) are very appropriate for very large computers
- 2) use minimal resources
- 3) use many resources
- 4) All of these
-
Show Answer Report Discussion in forumAnswer : 1) are very appropriate for very large computers
Solution : Complex scheduling algorithms are very appropriate for very large computers.
discussion
Answer : 1) are very appropriate for very large computers
-
-
-
( 43 ) The content of the matrix Need is :
- 1) Allocation - Available
- 2) Max - Available
- 3) Max - Allocation
- 4) Allocation - Max
-
Show Answer Report Discussion in forumAnswer : 3) Max - Allocation
Solution : The content of the matrix Need is Max - Allocation
discussion
Answer : 3) Max - Allocation
-
-
-
( 44 ) The data structures available in the Banker's algorithm are :
- 1) Available
- 2) Need
- 3) Allocation
- 4) All of these
-
Show Answer Report Discussion in forumAnswer : 4) All of these
Solution : The data structures available in the Banker's algorithm are :
Available: vector [1..m], Available[ j ] - the number of instances currently available for resource j.
Max: matrix[1..n, 1..m], Max[ i, j ] - the maximum number of instances of resource j that process i can request at any one time.
Allocation: matrix[1..n, 1..m] - process i currently holds Allocation[ i, j ] instances of resource j.
Need: matrix[1..n, 1..m] - process i may need additional Need[ i, j ] instances of resource j.
discussion
Answer : 4) All of these
-
-
-
( 45 ) Cancelling a thread asynchronously :
- 1) may not free each resource
- 2) frees all the resources properly
- 3) spoils the process execution
- 4) None of these
-
Show Answer Report Discussion in forumAnswer : 1) may not free each resource
Solution : Cancelling a thread asynchronously may not free each resource.
discussion
Answer : 1) may not free each resource
-
-
-
( 46 ) When one thread immediately terminates the target thread, it is called :
- 1) Asynchronous cancellation
- 2) Sudden Termination
- 3) Systematic cancellation
- 4) Deferred cancellation
-
Show Answer Report Discussion in forumAnswer : 1) Asynchronous cancellation
Solution : When one thread immediately terminates the target thread, it is called Asynchronous cancellation.
discussion
Answer : 1) Asynchronous cancellation
-
-
-
( 47 ) Which of the following state transitions is not possible ?
- 1) blocked to running
- 2) ready to running
- 3) blocked to ready
- 4) running to blocked
-
Show Answer Report Discussion in forumAnswer : 1) blocked to running
Solution : blocked to running is not possible because if any process is in block state so is follow sequence is : BLOCKED then SUSPEND BLOCKED, SUSPEND BLOCKED then SUSPEND READY, SUSPEND READY then READY .
discussion
Answer : 1) blocked to running
-
-
-
( 48 ) The degree of multi-programming is :
- 1) the number of processes executed per unit time
- 2) the number of processes in the ready queue
- 3) the number of processes in the I/O queue
- 4) the number of processes in memory
-
Show Answer Report Discussion in forumAnswer : 4) the number of processes in memory
Solution : The degree of multi-programming is depends on the number of processes in memory.
discussion
Answer : 4) the number of processes in memory
-
-
-
( 49 ) To install the new font
- 1) Start -> setting -> control panel -> font
- 2) Start -> setting -> control panel -> font -> install new font
- 3) Start -> control panel -> font -> install new font
- 4) Start -> setting -> font
-
Show Answer Report Discussion in forumAnswer : 2) Start -> setting -> control panel -> font -> install new font
Solution : To install the new font follow Start -> setting -> control panel -> font -> install new font
discussion
Answer : 2) Start -> setting -> control panel -> font -> install new font
-
-
-
( 50 ) Which of the following is not the state of a process ?
- 1) New
- 2) Old
- 3) Waiting
- 4) Running
-
Show Answer Report Discussion in forumAnswer : 2) Old
Solution : 1 New: The process is being created.
2 Ready :The process is waiting to be assigned to a processor. Ready processes are waiting to have the processor allocated to them by the operating system so that they can run.
3 Running :Process instructions are being executed (i.e. The process that is currently being executed).
4 Waiting :The process is waiting for some event to occur (such as the completion of an I/O operation).
5 Terminated :The process has finished execution.
discussion
Answer : 2) Old
-