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

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
by

1 Answer

Answer :

(A) 3
by

Related questions

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Last Answer : Answer: B

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Description : Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Last Answer : (B) 14

There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order: (a) P2 needs to access (b) P1 needs to access (c) P3 needs to access (d) P2 exits critical section (e) Pi exits critical section The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2

Description : There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2 

Last Answer : Answer: 1

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

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

A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Description : A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is  P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Last Answer : (A) Pi || Pj for all i ≠ j Explanation: Bernstein's Condition: 1. If process Pi writes to a memory cell Mi, then no process Pj can read the cell Mi. 2. If process Pi read from a memory ... Mi. 3. If process Pi writes to a memory cell Mi, then no process Pj can write to the cell Mi.

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

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 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

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? (A) 80 % (B) 50 % (C) 60 % (D) 30 %

Description : Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? (A) 80 % (B) 50 % (C) 60 % (D) 30 %

Last Answer : (B) 50 %

According to the American Society of Anesthesiology Physical Status Classification System, a patient with severe systemic disease that is not incapacitating is noted to have physical status classification a) P3 Classification P3 patients are those who have compensated heart failure, cirrhosis, or poorly controlled diabetes, for example. b) P4 Classification P4 patients have an incapacitating systemic disease that is a constant threat to life. c) P1 Classification P1 refers to a normal healthy patient d) P2 Classification P2 reflects a patient with mild systemic disease

Description : According to the American Society of Anesthesiology Physical Status Classification System, a patient with severe systemic disease that is not incapacitating is noted to have physical status ... normal healthy patient d) P2 Classification P2 reflects a patient with mild systemic disease

Last Answer : a) P3 Classification P3 patients are those who have compensated heart failure, cirrhosis, or poorly controlled diabetes, for example.

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

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

The molecular formula of phosphorus is (a) P1 (b) P2 (c) P3 (d) P4

Description : The molecular formula of phosphorus is (a) P1 (b) P2 (c) P3 (d) P4

Last Answer : Ans:(d)

The unit vector to the points p1(0,1,0), p2(1,0,1), p3(0,0,1) is a) (-j – k)/1.414 b) (-i – k)/1.414 c) (-i – j)/1.414 d) (-i – j – k)/1.414

Description : The unit vector to the points p1(0,1,0), p2(1,0,1), p3(0,0,1) is a) (-j – k)/1.414 b) (-i – k)/1.414 c) (-i – j)/1.414 d) (-i – j – k)/1.414

Last Answer : a) (-j – k)/1.414

Find a vector normal to a plane consisting of points p1(0,1,0), p2(1,0,1) and p3(0,0,1) a) –j – k b) –i – j c) –i – k d) –i – j – k

Description : Find a vector normal to a plane consisting of points p1(0,1,0), p2(1,0,1) and p3(0,0,1) a) –j – k b) –i – j c) –i – k d) –i – j – k

Last Answer : a) –j – k

The total power in both series and parallel circuits is computed with the formula: PT = P1 + P2 + P3 +...Pn. Why can this formula be used for both series and parallel circuits?

Description : The total power in both series and parallel circuits is computed with the formula: PT = P1 + P2 + P3 +...Pn. Why can this formula be used for both series and parallel circuits?

Last Answer : In both cases all the power used in the circuit must come from the source.

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

What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). Image I. Translate P1 to origin II. Scale as required III. Rotate IV. Translate to the final position P2. (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Description : What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). I. Translate P1 to origin II. ... (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above

Last Answer : Answer: Marks given to all

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

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5. (A) B, A, D, E, C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Last Answer : (B) C, E, D, B, A

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.

A short column (30 cm × 20 cm) carries a load P1 at 4 cm on one side and another load P2at 8 cm on the other side along a principal section parallel to longer dimension. If the extreme intensity on either side is same, the ratio of P1 to P2 will be (A) 2/3 (B) 3/2 (C) 8/5 (D) 5/8

Description : A short column (30 cm 20 cm) carries a load P1 at 4 cm on one side and another load P2at 8 cm on  the other side along a principal section parallel to longer dimension. If the extreme intensity on  either side is same, the ... to P2 will be  (A) 2/3  (B) 3/2  (C) 8/5  (D) 5/8 

Last Answer : (C) 8/5 

What horse power is required to isothermally compress 800 ft^3 of Air per minute from 14.7 psia to 120 psia?  A. 28 hp  B.108 hp  C.256 hp  D.13900 hp Formula: W= p1V1 ln (p1/p2) Power = dW / dt

Description : What horse power is required to isothermally compress 800 ft^3 of Air per minute from 14.7 psia to 120 psia?  A. 28 hp  B.108 hp  C.256 hp  D.13900 hp Formula: W= p1V1 ln (p1/p2) Power = dW / dt

Last Answer : 108 hp

If f1 and f2 are the distances from the optical centre of a convex lens of focal length to conjugate two points P1 and P2 respectively, the following relationship holds good (A) f = f1 + f2 (B) f = ½ (f1 + f2) (C) 1/f = 1/f1 + 1/f2 (D) None of these

Description : If f1 and f2 are the distances from the optical centre of a convex lens of focal length to conjugate two points P1 and P2 respectively, the following relationship holds good (A) f = f1 + f2 (B) f = ½ (f1 + f2) (C) 1/f = 1/f1 + 1/f2 (D) None of these

Last Answer : (C) 1/f = 1/f1 + 1/f2

A two stage compressor is used to compress an ideal gas. The gas is cooled to the initial temperature after each stage. The intermediate pressure for the minimum total work requirement should be equal to the __________ mean of P1 and P2.(where, P1 and P2 are initial and final pressures respectively) (A) Logarithmic (B) Arithmetic (C) Geometric (D) Harmonic

Description : A two stage compressor is used to compress an ideal gas. The gas is cooled to the initial temperature after each stage. The intermediate pressure for the minimum total work requirement should be equal to ... final pressures respectively) (A) Logarithmic (B) Arithmetic (C) Geometric (D) Harmonic

Last Answer : (C) Geometric

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Last Answer : hot potatorouting

Find coordinates of points on line having end points P1(3,5,8) and P2 (6,4,3) at u=0.25 a.[3.75 4.25 6.25] b.[3.25 4.25 6.25] c.[3.75 4.75 6.75] d.[4.25 3.75 6.25]

Description : Find coordinates of points on line having end points P1(3,5,8) and P2 (6,4,3) at u=0.25 a.[3.75 4.25 6.25] b.[3.25 4.25 6.25] c.[3.75 4.75 6.75] d.[4.25 3.75 6.25]

Last Answer : c.[3.75 4.75 6.75]

Find the tangent vector of line having end points P1(3,5,8) and P2 (6,4,3) a.3i+j-5k b.3i-j-5k c.3i-j+5k d.-3i-j-5k

Description : Find the tangent vector of line having end points P1(3,5,8) and P2 (6,4,3) a.3i+j-5k b.3i-j-5k c.3i-j+5k d.-3i-j-5k

Last Answer : b.3i-j-5k

Write parametric equation of line having end points P1(3,5,8) and P2 (6,4,3). a.[3 5 8]+u[3 -1 -5] b.[3 5 8]+u[3 1 5] c.[3 8 5]+u[3 -1 -5] d.[3 5 8]+u[-3 1 5]

Description : Write parametric equation of line having end points P1(3,5,8) and P2 (6,4,3). a.[3 5 8]+u[3 -1 -5] b.[3 5 8]+u[3 1 5] c.[3 8 5]+u[3 -1 -5] d.[3 5 8]+u[-3 1 5]

Last Answer : a.[3 5 8]+u[3 -1 -5]

Two lines L1 and L2 having Parametric equations are P1=[3 4 7]+u[2 2 -6] and P2=[15 -2]+u[1 4 2]. Tangent vector for line L1 a.2i+2j-6k b.2i+2j+6k c.2i-2j-6k d.6-2j-2k

Description : Two lines L1 and L2 having Parametric equations are P1=[3 4 7]+u[2 2 -6] and P2=[15 -2]+u[1 4 2]. Tangent vector for line L1 a.2i+2j-6k b.2i+2j+6k c.2i-2j-6k d.6-2j-2k

Last Answer : a.2i+2j-6k

Phosphorus vapour comprises of (A) P (B) P2 (C) P3 (D) P4

Description : Phosphorus vapour comprises of (A) P (B) P2 (C) P3 (D) P4

Last Answer : (D) P4

The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below: E = a(KLOC)b Assume that the values of a and b are 2.5 and 1.0 respectively. (A) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Description : The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to ... ) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months

Last Answer : (C) 62.5 person months 

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

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

In a 2-D CAD package, clockwise circular arc of radius, 5, specified from P1 (15,10)to P2 (10,15)will have its center at a.(10, 10) b.(15, 10) c.(15, 15) d.(10, 15)

Description : In a 2-D CAD package, clockwise circular arc of radius, 5, specified from P1 (15,10)to P2 (10,15)will have its center at a.(10, 10) b.(15, 10) c.(15, 15) d.(10, 15)

Last Answer : a.(10, 10)

Find out the price elasticity in the following example : Price Demand 5(P1) 10(Q1) 4(P2) 15(Q2) (a) – 2.5 (b) + 3.5 (c) + 4.0 (d) + 2.5

Description : Find out the price elasticity in the following example : Price Demand 5(P1) 10(Q1) 4(P2) 15(Q2) (a) – 2.5 (b) + 3.5 (c) + 4.0 (d) + 2.5

Last Answer : (a) – 2.5

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%.

Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height>180); If the SQL queries (a) and (b) above, return 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

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

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

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Description : The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Last Answer : FCFS scheduling algorithm

Which of the following are the functions of operating system? i) recovering from errors ii) facilitating input/output iii) facilitating parallel operation iv) sharing hardware among users v) implementing user interface A) i, ii, ii, and v only B) i, ii, iii, and iv only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Description : Which of the following are the functions of operating system? i) recovering from errors ii) facilitating input/output iii) facilitating parallel operation iv) sharing hardware among users v) implementing user interface A) i, ii, ... only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

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