Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
In a database system unique timestamps are assigned to each transaction using Lamport s logical clock Let TS T_ 1 and TS T_ 2 be the timestamps of transactions T_ 1 and T_ 2 respectively Besides T_ 1 holds a lock on the resource R and T_ 2 has requested a conflicting lock on the same resource R The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp if TS T_ 2 lt TS T_ 1 then T_ 1 is killed else T_ 2 waits Assume any transaction that is not killed terminates eventually Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks The database system is both deadlock free and starvation free The database system is deadlock free but not starvation free The database system is starvation free but not deadlock free The database system is neither deadlock free nor starvation free | Timestamp Ordering | 189 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
A computer on a 10 Mbps network is regulated by a token bucket The token bucket is filled at a rate of 2 Mbps It is initially filled to capacity with 16 Megabits What is the maximum duration for which the computer can transmit at the full 10 Mbps 1 6 seconds 2 seconds 5 seconds 8 seconds | Token Bucket | 190 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
For a host machine that uses the token bucket algorithm for congestion control the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second Tokens arrive at a rate to sustain output at a rate of 10 mega bytes per second The token bucket is currently full and the machine needs to send 12 mega bytes of data The minimum time required to transmit the data is _____________ seconds | Token Bucket | 190 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Which level of locking provides the highest degree of concurrency in a relational database Page Table Row Page table and row level locking allow the same degree of concurrency | Transaction And Concurrency | 191 |
Consider two transactions T_1 and T_2 and four schedules S_1 S_2 S_3 S_4 of T_1 and T_2 as given below T_1 R_1 x W_1 x W_1 y T_2 R_2 x R_2 y W_2 y S_1 R_1 x R_2 x R_2 y W_1 x W_1 y W_2 y S_2 R_1 x R_2 x R_2 y W_1 x W_2 y W_1 y S_3 R_1 x W_1 x R_2 x W_1 y R_2 y W_2 y S_4 R_2 x R_2 y R_1 x W_1 x W_1 y W_2 y Which of the above schedules are conflict serializable S_1 ext and S_2 S_2 ext and S_3 S_3 only S_4 only | Transactions | 192 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Fig 7 shows a B tree where only key values are indicated in the records Each block can hold upto three records A record with a key value 34 is inserted into the B tree Obtain the modified B tree after insertion | Tree | 193 |
Consider the following 2 3 4 tree i e B tree with a minimum degree of two in which each data item is a letter The usual alphabetical ordering of letters is used in constructing the tree What is the result of inserting G in the above tree None of the above | Trees | 194 |
Consider the pseudocode given below The function DoSomething takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild rightSibling representation Each node of the tree is of type treeNode ypedef struct treeNode treeptr struct treeNode treeptr leftMostChild rightSibling int DoSomething treeptr tree int value 0 if tree NULL if tree gt leftMostChild NULL value 1 else value DoSomething tree gt leftMostChild value value DoSomething tree gt rightSibling return value When the pointer to the root of a tree is passed as the argument to DoSomething the value returned by the function corresponds to the number of internal nodes in the tree height of the tree number of nodes without a right sibling in the tree number of leaf nodes in the tree | Trees | 194 |
The aim of the following question is to prove that the language M M is the code of the Turing Machine which irrespective of the input halts and outputs a 1 is undecidable This is to be done by reducing from the language M x M halts on x which is known to be undecidable In parts a and b describe the 2 main steps in the construction of M In part c describe the key property which relates the behaviour of M on its input w to the behaviour of M on x On input w what is the first step that M must make On input w based on the outcome of the first step what is the second step M must make What key property relates the behaviour of M on w to the behaviour of M on x | Turing Machine | 195 |
L_1 is a recursively enumerable language over Sigma An algorithm A effectively enumerates its words as omega_1 omega_2 omega_3 dots Define another language L_2 over Sigma cup left ext right as left w_i ext w_j mid w_i w_j in L_1 i lt j right Here is new symbol Consider the following assertions S_1 L_1 is recursive implies L_2 is recursive S_2 L_2 is recursive implies L_1 is recursive Which of the following statements is true Both S_1 and S_2 are true S_1 is true but S_2 is not necessarily true S_2 is true but S_1 is not necessarily true Neither is necessarily true | Turing Machine | 195 |
A single tape Turing Machine M has two states q0 and q1 of which q0 is the starting state The tape alphabet of M is 0 1 B and its input alphabet is 0 1 The symbol B is the blank symbol used to indicate end of an input string The transition function of M is described in the following table 0 1 B q0 q1 1 R q1 1 R Halt q1 q1 1 R q0 1 L q0 B L The table is interpreted as illustrated below The entry q1 1 R in row q0 and column 1 signifies that if M is in state q0 and reads 1 on the current page square then it writes 1 on the same tape square moves its tape head one position to the right and transitions to state q1 Which of the following statements is true about M M does not halt on any string in 0 1 M does not halt on any string in 00 1 M halts on all strings ending in a 0 M halts on all strings ending in a 1 | Turing Machine | 195 |
Let a decision problem X be defined as follows X Given a Turing machine M over Sigma and any word w in Sigma does M loop forever on w You may assume that the halting problem of Turing machine is undecidable but partially decidable Show that X is undecidable Show that X is not even partially decidable | Turing Machine | 195 |
Let langle M rangle be the encoding of a Turing machine as a string over Sigma left 0 1 right Let L left langle M rangle mid M ext is a Turing machine ext that accepts a string of length 2014 right Then L is decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable | Turing Machine | 195 |
L_1 is a recursively enumerable language over Sigma An algorithm A effectively enumerates its words as omega_1 omega_2 omega_3 dots Define another language L_2 over Sigma cup left ext right as left w_i ext w_j mid w_i w_j in L_1 i lt j right Here is new symbol Consider the following assertions S_1 L_1 is recursive implies L_2 is recursive S_2 L_2 is recursive implies L_1 is recursive Which of the following statements is true Both S_1 and S_2 are true S_1 is true but S_2 is not necessarily true S_2 is true but S_1 is not necessarily true Neither is necessarily true | Turing Machine | 195 |
A single tape Turing Machine M has two states q0 and q1 of which q0 is the starting state The tape alphabet of M is 0 1 B and its input alphabet is 0 1 The symbol B is the blank symbol used to indicate end of an input string The transition function of M is described in the following table 0 1 B q0 q1 1 R q1 1 R Halt q1 q1 1 R q0 1 L q0 B L The table is interpreted as illustrated below The entry q1 1 R in row q0 and column 1 signifies that if M is in state q0 and reads 1 on the current page square then it writes 1 on the same tape square moves its tape head one position to the right and transitions to state q1 Which of the following statements is true about M M does not halt on any string in 0 1 M does not halt on any string in 00 1 M halts on all strings ending in a 0 M halts on all strings ending in a 1 | Turing Machine | 195 |
Consider the following languages L_ 1 left left langle M right rangle mid M ext takes at least 2016 steps on some input right L_ 2 left left langle M right rangle mid M ext takes at least 2016 steps on all inputs right and L_ 3 left left langle M right rangle mid M ext accepts epsilon right where for each Turing machine M left langle M right rangle denotes a specific encoding of M Which one of the following is TRUE L_ 1 is recursive and L_ 2 L_ 3 are not recursive L_ 2 is recursive and L_ 1 L_ 3 are not recursive L_ 1 L_ 2 are recursive and L_ 3 is not recursive L_ 1 L_ 2 L_ 3 are recursive | Turing Machine | 195 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
A program on machine X attempts to open a UDP connection to port 5376 on a machine Y and a TCP connection to port 8632 on machine Z However there are no applications listening at the corresponding ports on Y and Z An ICMP Port Unreachable error will be generated by Y but not Z Z but not Y Neither Y nor Z Both Y and Z | Udp | 196 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
Packets of the same session may be routed through different paths in TCP but not UDP TCP and UDP UDP but not TCP Neither TCP nor UDP | Udp | 196 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
The transport layer protocols used for real time multimedia file transfer DNS and email respectively are A TCP UDP UDP and TCP B UDP TCP TCP and UDP C UDP TCP UDP and TCP D TCP UDP TCP and UDP | Udp | 196 |
A program on machine X attempts to open a UDP connection to port 5376 on a machine Y and a TCP connection to port 8632 on machine Z However there are no applications listening at the corresponding ports on Y and Z An ICMP Port Unreachable error will be generated by Y but not Z Z but not Y Neither Y nor Z Both Y and Z | Udp | 196 |
A program on machine X attempts to open a UDP connection to port 5376 on a machine Y and a TCP connection to port 8632 on machine Z However there are no applications listening at the corresponding ports on Y and Z An ICMP Port Unreachable error will be generated by Y but not Z Z but not Y Neither Y nor Z Both Y and Z | Udp | 196 |
A program on machine X attempts to open a UDP connection to port 5376 on a machine Y and a TCP connection to port 8632 on machine Z However there are no applications listening at the corresponding ports on Y and Z An ICMP Port Unreachable error will be generated by Y but not Z Z but not Y Neither Y nor Z Both Y and Z | Udp | 196 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
Suppose you break a stick of unit length at a point chosen uniformly at random Then the expected length of the shorter stick is ________ | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
Suppose you break a stick of unit length at a point chosen uniformly at random Then the expected length of the shorter stick is ________ | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
Consider a selection of the form sigma_ A leq 100 r where r is a relation with 1000 tuples Assume that the attribute values for A among the tuples are uniformly distributed in the interval 0 500 Which one of the following options is the best estimate of the number of tuples returned by the given selection query 50 100 150 200 | Uniform Distribution | 197 |
Suppose you break a stick of unit length at a point chosen uniformly at random Then the expected length of the shorter stick is ________ | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
Consider a selection of the form sigma_ A leq 100 r where r is a relation with 1000 tuples Assume that the attribute values for A among the tuples are uniformly distributed in the interval 0 500 Which one of the following options is the best estimate of the number of tuples returned by the given selection query 50 100 150 200 | Uniform Distribution | 197 |
Consider a selection of the form sigma_ A leq 100 r where r is a relation with 1000 tuples Assume that the attribute values for A among the tuples are uniformly distributed in the interval 0 500 Which one of the following options is the best estimate of the number of tuples returned by the given selection query 50 100 150 200 | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
If V_1 and V_2 are 4 dimensional subspaces of a 6 dimensional vector space V then the smallest possible dimension of V_1 cap V_2 is _____ | Vector Space | 199 |
If V_1 and V_2 are 4 dimensional subspaces of a 6 dimensional vector space V then the smallest possible dimension of V_1 cap V_2 is _____ | Vector Space | 199 |
Consider the set of column vectors defined by X left x in R 3 mid x_1 x_2 x_3 0 ext where x T left x_1 x_2 x_3 right T right Which of the following is TRUE left left 1 1 0 right T left 1 0 1 right T right is a basis for the subspace X left left 1 1 0 right T left 1 0 1 right T right is a linearly independent set but it does not span X and therefore is not a basis of X X is not a subspace of R 3 None of the above | Vector Space | 199 |
Consider the set of column vectors defined by X left x in R 3 mid x_1 x_2 x_3 0 ext where x T left x_1 x_2 x_3 right T right Which of the following is TRUE left left 1 1 0 right T left 1 0 1 right T right is a basis for the subspace X left left 1 1 0 right T left 1 0 1 right T right is a linearly independent set but it does not span X and therefore is not a basis of X X is not a subspace of R 3 None of the above | Vector Space | 199 |