In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

In process scheduling, ………………… determines which ready process will be executed next by  processor.
A) long term scheduling
B) medium term scheduling
C) short term scheduling  
D) none of the above
by

1 Answer

Answer :

C) short term scheduling
by

Related questions

In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Description : In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Last Answer : A) long term scheduling

.................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Description : .................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Last Answer : C) Short-term scheduling

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) Processes are permanently assigned to a queue (D) This algorithm can be configured to match a specific system under design

Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design

Last Answer : (C) Processes are permanently assigned to a queue

.............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Description : .............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Last Answer : D) Starvation

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Linux operating system uses (A) Affinity Scheduling (B) Fair Preemptive Scheduling (C) Hand Shaking (D) Highest Penalty Ratio Next

Description : Linux operating system uses (A) Affinity Scheduling (B) Fair Preemptive Scheduling (C) Hand Shaking (D) Highest Penalty Ratio Next

Last Answer : (B) Fair Preemptive Scheduling Explanation: Linux uses two process-scheduling algorithms: 1. A time-sharing algorithm for fair preemptive scheduling between multiple processes 2. A real-time algorithm for tasks where absolute priorities are more important than fairness

Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Description : Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Last Answer : D) All of the above

A .................... architecture assigns only a few essential functions to the kernel, including address spaces, Inter process communication(IPC) and basic scheduling. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : A .................... architecture assigns only a few essential functions to the kernel, including address spaces, Inter process communication(IPC) and basic scheduling. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : B) Micro kernel

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Last Answer : (C) Scheduling parameters

One of the disadvantages of user level threads compared to Kernel level threads is (1) If a user level thread of a process executes a system call, all threads in that process are blocked. (2) Scheduling is application dependent. (3) Thread switching doesn’t require kernel mode privileges. (4) The library procedures invoked for thread management in user level threads are local procedures.

Description : One of the disadvantages of user level threads compared to Kernel level threads is (1) If a user level thread of a process executes a system call, all threads in that process are ... privileges. (4) The library procedures invoked for thread management in user level threads are local procedures.

Last Answer : If a user level thread of a process executes a system call, all threads in that process are blocked.

Process is ........................ A) A program in execution B) An instance of a program running on a computer. C) The entity that can be assigned to and executed D) All of the above.

Description : Process is ........................ A) A program in execution B) An instance of a program running on a computer. C) The entity that can be assigned to and executed D) All of the above.

Last Answer : D) All of the above.

Concurrent Process are: a) process that do not overlap in time b) process that overlap in time c) process that are executed by a processor at the same time d) None of The Above

Description : Concurrent Process are: a) process that do not overlap in time b) process that overlap in time c) process that are executed by a processor at the same time d) None of The Above

Last Answer : b) process that overlap in time

Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Description : Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also ... memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Last Answer : Answer: C Explanation: T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s Ninstr x 1µs = 60,000,000 µs - 30,000,000 µs = 30,000,000 µs Ninstr = 30,000,000 The number of instruction ... doesn't mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.

In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Description : In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Last Answer : (B) Hardware abstraction layer

Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share scheduler, priority is calculated based on: (1) only (a) and (b) (2) only (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

Description : Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share ... (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

Last Answer : (3) (a), (b) and (c)

File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Description : File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : B) i, iii and iv only

........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : ........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : A) Monolithic kernel

The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Description : The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Last Answer : B) Disk scheduling

........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Description : ........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Last Answer : B) Monolithic kernel

Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. v) Scheduling resources among users. A) i, ii, iii and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Description : Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. ... only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string

Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string

Last Answer : (C) Job Scheduling

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

Which of the following is not one of three software product aspects addressed by McCall's software quality factors? (1) Ability to undergo change. (2) Adaptability to new environments. (3) Operational characteristics (4) Production costs and scheduling

Description : Which of the following is not one of three software product aspects addressed by McCall's software quality factors? (1) Ability to undergo change. (2) Adaptability to new environments. (3) Operational characteristics (4) Production costs and scheduling

Last Answer : Answer: 4

A critical ratio scheduling (A) Determines the status of each activity (B) Adjusts automatically changes in activity progress (C) Is a dynamic system (D) None of these

Description : A critical ratio scheduling (A) Determines the status of each activity (B) Adjusts automatically changes in activity progress (C) Is a dynamic system (D) None of these

Last Answer : (D) None of these

A ………………… attaches itself to executable files and replicates, when the infected program is executed, by finding other executable files to infect. A) Stealth virus B) Polymorphic Virus C) Parasitic Virus

Description : A ………………… attaches itself to executable files and replicates, when the infected program is executed, by finding other executable files to infect. A) Stealth virus B) Polymorphic Virus C) Parasitic Virus

Last Answer : C) Parasitic Virus

Suppose d = {“john”:40, “peter”:45}, what happens when we try to retrieve a value using the expression d[“susan”]? a) Since “susan” is not a value in the set, Python raises a KeyError exception b) It is executed fine and no exception is raised, and it returns None c) Since “susan” is not a key in the set, Python raises a KeyError exception d) Since “susan” is not a key in the set, Python raises a syntax error

Description : Suppose d = { john :40, peter :45}, what happens when we try to retrieve a value using the expression d[ susan ]? a) Since susan is not a value in the set, Python raises a KeyError ... Python raises a KeyError exception d) Since susan is not a key in the set, Python raises a syntax error

Last Answer : c) Since “susan” is not a key in the set, Python raises a KeyError exception

What is the output of the following piece of code when executed in Python shell? >>> a=("Check")*3 >>> a a) (‘Check’,’Check’,’Check’) b) * Operator not valid for tuples c) (‘CheckCheckCheck’) d) Syntax erro

Description : What is the output of the following piece of code when executed in Python shell? >>> a=("Check")*3 >>> a a) (‘Check’,’Check’,’Check’) b) * Operator not valid for tuples c) (‘CheckCheckCheck’) d) Syntax erro

Last Answer : c) (‘CheckCheckCheck’)

What is the output when following code is executed ? >>>list1 = [11, 2, 23] >>>list2 = [11, 2, 2] >>>list1 < list2 is a) True b) False c) Error d) None

Description : What is the output when following code is executed ? >>>list1 = [11, 2, 23] >>>list2 = [11, 2, 2] >>>list1 < list2 is a) True b) False c) Error d) None

Last Answer : b) False

What is the output when following code is executed ? names1 = ['Amir', 'Bear', 'Charlton', 'Daman'] names2 = names1 names3 = names1[:] names2[0] = 'Alice' names3[1] = 'Bob' sum = 0 for ls in (names1, names2, names3): if ls[0] == 'Alice': sum += 1 if ls[1] == 'Bob': sum += 10 print sum a) 11 b) 12 c) 21 d) 22

Description : What is the output when following code is executed ? names1 = ['Amir', 'Bear', 'Charlton', 'Daman'] names2 = names1 names3 = names1[:] names2[0] = 'Alice' names3[1] = 'Bob' sum = 0 for ls in (names1, names2, names3): ... if ls[1] == 'Bob': sum += 10 print sum a) 11 b) 12 c) 21 d) 22

Last Answer : d) 22

What is the output when following code is executed ? >>>names = ['Amir', 'Bear', 'Charlton', 'Daman'] >>>print(names[-1][-1]) a) A b) Daman c) Error d) n

Description : What is the output when following code is executed ? >>>names = ['Amir', 'Bear', 'Charlton', 'Daman'] >>>print(names[-1][-1]) a) A b) Daman c) Error d) n

Last Answer : b) Daman

What is the output when following code is executed ? >>>str1="helloworld" >>>str1[::-1] a) dlrowolleh b) hello c) world d) helloworld

Description : What is the output when following code is executed ? >>>str1="helloworld" >>>str1[::-1] a) dlrowolleh b) hello c) world d) helloworld

Last Answer : a) dlrowolleh

What is the output when following statement is executed ? >>> print(‘x\97\x98’) a) Error b) 97 98 c) x\97 d) \x97\x98

Description : What is the output when following statement is executed ? >>> print(‘x\97\x98’) a) Error b) 97 98 c) x\97 d) \x97\x98

Last Answer : c) x\97

What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Description : What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Last Answer : c) newline

hat is the output when following code is executed ? >>>print r"\nhello" The output is a) a new line and hello b) \nhello c) the letter r and then hello d) error

Description : hat is the output when following code is executed ? >>>print r"\nhello" The output is a) a new line and hello b) \nhello c) the letter r and then hello d) error

Last Answer : d) error

What is the output when following code is executed ? >>> str1 = 'hello' >>> str2 = ',' >>> str3 = 'world' >>> str1[-1:] a) olleh b) hello c) h d) o

Description : What is the output when following code is executed ? >>> str1 = 'hello' >>> str2 = ',' >>> str3 = 'world' >>> str1[-1:] a) olleh b) hello c) h d) o

Last Answer : b) hello

What is the output when following statement is executed ? >>>"abcd"[2:] a) a b) ab c) cd d) dc

Description : What is the output when following statement is executed ? >>>"abcd"[2:] a) a b) ab c) cd d) dc

Last Answer : c) cd

When the following code is executed what will be the value of x and y? int x = 1, y=0; y = x++; (A) 2, 1 (B) 2, 2 (C) 1, 1 (D) 1, 2

Description : When the following code is executed what will be the value of x and y? int x = 1, y=0; y = x++; (A) 2, 1 (B) 2, 2 (C) 1, 1 (D) 1, 2

Last Answer : (A) 2, 1

What will be the output at PORT1 if the following program is executed? MVI B, 82H MOV A, B MOV C, A MVI D, 37H OUT PORT1 HLT (A) 37H (B) 82H (C) B9H (D) 00H

Description : What will be the output at PORT1 if the following program is executed? MVI B, 82H MOV A, B MOV C, A MVI D, 37H OUT PORT1 HLT (A) 37H (B) 82H (C) B9H (D) 00H

Last Answer : Answer: B Explanation: In 8085 programming, the result of an operation is stored in the accumulator. So output is 82H.

What Happens When Hlt Instruction Is Executed In Processor?

Description : What Happens When Hlt Instruction Is Executed In Processor?

Last Answer : Answer :The Micro Processor enters into Halt-State and the buses are tri-stated.

Which of the following are the states of a five state process model? i) Running ii) Ready iii) New iv) Exit v) Destroy A) i, ii, iii and v only B) i, ii, iv and v only C) i, ii, iii, and iv only D) All i, ii, iii, iv and v

Description : Which of the following are the states of a five state process model? i) Running ii) Ready iii) New iv) Exit v) Destroy A) i, ii, iii and v only B) i, ii, iv and v only C) i, ii, iii, and iv only D) All i, ii, iii, iv and v

Last Answer : C) i, ii, iii, and iv only

The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Description : The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Last Answer : A) Fetch policy

Which layers of the OSI determines the interface often system with the user? A) Network B) Application C) Data link D) Session

Description : Which layers of the OSI determines the interface often system with the user? A) Network B) Application C) Data link D) Session

Last Answer : B) Application

……………. Allows definitions and query language statements to be entered; query results are formatted and displayed. A) Schema Processor B) Query Processor C) Terminal Interface D) None of the above

Description : ……………. Allows definitions and query language statements to be entered; query results are formatted and displayed. A) Schema Processor B) Query Processor C) Terminal Interface D) None of the above

Last Answer : C) Terminal Interface