If in a computer networking environment when all the processing is done on single computer can be referred as

Related MCQs

• In multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1- Concurrent processes running on a multi programmed uni processor, 2 Parallel processing or multi tasking is done within a single application, 3-Parallel processing is done within a single instruction stream.
• The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO,
• In file management, the primary interface of computer system with external environment is done through
• In the pure User Level Threads (ULT) (i) Thread management is done by application, (ii) Thread management is done by kernel, (iii) Kernel is not aware of the existence of thread, (iv) Application program interface (API) to the kernel thread facility.
• In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
• The concept used to support multi programming environment on a computer is
• A policy in memory management referred as clock policy because one can visualize the page frames as laid out in
• Instruction processing consists of
• In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
• The Java run time environment is an example of