Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Consider a system with seven processes A through G and six resources R through W.

Resource ownership is as follows:

process A holds R and wants T

process B holds nothing but wants T

process C holds nothing but wants S

process D holds U and wants S & T

process E holds T and wants V

process F holds W and wants S process G holds V and wants U

Is the system deadlocked ? If yes, ............. processes are deadlocked.

(A) No (B) Yes, A, B, C

(C) Yes, D, E, G (D) Yes, A, B, F
by

1 Answer

Answer :

(C) Yes, D, E, G
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

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

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is inexpensive to implement. (1) (A), (B) and (C) are false. (2) (A) and (B) false; (C) true. (3) (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Description : Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is ... (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Last Answer : Answer: 3

If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Description : If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Last Answer : (C) Skolemization

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Description : Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg( ... edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

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

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

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ................... (1) A (2) B (3) F (4) G

Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G

Last Answer : Answer: 2

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

Which of the following are the components of loamy soils? 1. Red soil 2. Clay soil 3. Alluvial soil 4. Silt soil 5. Sandy soil In d i a n So i l , Se a s o n s a n d N a t u r a l Ve g e t a t i o n (a) I and II (b) I, III and IV (c) II and V (d) II, III and V

Description : Which of the following are the components of loamy soils? 1. Red soil 2. Clay soil 3. Alluvial soil 4. Silt soil 5. Sandy soil In d i a n So i l , Se a s o n s a n d N a t u r a l Ve g e t a t i o n (a) I and II (b) I, III and IV (c) II and V (d) II, III and V

Last Answer : Ans: (c)

Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use a resource at a time. A) i-a, ii-b, iii-c B) i-a, ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Description : Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use ... , ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Last Answer : D) i-c, ii-a, iii-b

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

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 %

………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Description : ………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

…………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Description : …………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Last Answer : A) Mutual Exclusion

Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Description : Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Last Answer : (D) Kill one of the processes

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Last Answer : (C) R(Pi)∩R(Pj)=Φ 

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Description : Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Last Answer : (A) T1 < T2

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

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

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Description : ………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Last Answer : A) Mutual Exclusion

Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a particular attribute (e.g. height-230 cm) (C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist. (D) A template for a group of things with the same set of characteristics that may exist in the real world

Description : Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a ... template for a group of things with the same set of characteristics that may exist in the real world

Last Answer : Answer: D

An ideal gas is heated at constant volume and then expanded isothermally. Show processes on P-V & T-S diagrams.

Description : An ideal gas is heated at constant volume and then expanded isothermally. Show processes on P-V & T-S diagrams.

Last Answer : Process 1-2 : Constant volume process Process 2-3 : Constant temperature process (Isothermal process)

Which of the following processes follows the hardening process for reducing the hardening strains & increasing the toughness of the steel part? (A) Anodising (B) Tempering (C) Carburising

Description : Which of the following processes follows the hardening process for reducing the hardening strains & increasing the toughness of the steel part? (A) Anodising (B) Tempering (C) Carburising

Last Answer : (B) Tempering

When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as................. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching

Description : When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as................. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching

Last Answer : (A) handoff 

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

Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Description : Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Last Answer : Answer: 2

Which of the following is/are true w.r.t. applications of mobile computing? (A) Travelling of salesman (B) Location awareness services (1) (A) true; (B) false (2) Both (A) and (B) are true. (3) Both (A) and (B) are false. (4) (A) false; (B) true.

Description : Which of the following is/are true w.r.t. applications of mobile computing? (A) Travelling of salesman (B) Location awareness services (1) (A) true; (B) false (2) Both (A) and (B) are true. (3) Both (A) and (B) are false. (4) (A) false; (B) true.

Last Answer : Answer: 2

Which of the following is not an issue that marketers need to consider when using digital resources for marketing activities? 1. Jurisdiction 2. Disclosure 3. Ownership 4. Permissions

Description : Which of the following is not an issue that marketers need to consider when using digital resources for marketing activities? 1. Jurisdiction 2. Disclosure 3. Ownership 4. Permissions

Last Answer : Disclosure

Which of the following is NOT an issue that marketers need to consider when using digital resources for marketing activities?  Jurisdiction.  Disclosure.  Ownership  Permissions

Description : Which of the following is NOT an issue that marketers need to consider when using digital  resources for marketing activities?   Jurisdiction.   Disclosure.   Ownership   Permissions 

Last Answer :  Disclosure.

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

Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to the column B in table R. One can determine that: (A) I, III and IV are the same query. (B) II, III and IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

Total number of lone pairs on Xe in `XeF_(2), XeO_(3)F_(2), XeF_(4), XeF_(6)` is t,u,v & w respectively. Then

Description : Total number of lone pairs on Xe in `XeF_(2), XeO_(3)F_(2), XeF_(4), XeF_(6)` is t,u,v & w respectively. Then

Last Answer : Total number of lone pairs on Xe in `XeF_(2), XeO_(3)F_(2), XeF_(4), XeF_(6)` is t,u,v & w respectively. Then A. ... `v +w = 3` C. `u = 0` D. `w = 1`

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

Re-arrange the letters, O O U S W T D N E J R, to spell just one word. What is it? -Riddles

Description : Re-arrange the letters, O O U S W T D N E J R, to spell just one word. What is it? -Riddles

Last Answer : 'Just one word'.

………………. First proposed the process of normalization. A) Edgar. W B) Edgar F. Codd C) Edward Stephen D) Edward Codd

Description : ………………. First proposed the process of normalization. A) Edgar. W B) Edgar F. Codd C) Edward Stephen D) Edward Codd

Last Answer : B) Edgar F. Codd

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

What word can be made with these letters E E E R F G U?

Description : What word can be made with these letters E E E R F G U?

Last Answer : refugee

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

Is there a better system anywhere than a retrial if a jury is deadlocked?

Description : Is there a better system anywhere than a retrial if a jury is deadlocked?

Last Answer : trial by judge.

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

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