Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
In serial communication employing 8 data bits a parity bit and 2 stop bits the minimum band rate required to sustain a transfer rate of 300 characters per second is 2400 band 19200 band 4800 band 1200 band | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame 10 000 bytes 12 000 bytes 15 000 bytes 27 000 bytes | Serial Communication | 168 |
In serial communication employing 8 data bits a parity bit and 2 stop bits the minimum band rate required to sustain a transfer rate of 300 characters per second is 2400 band 19200 band 4800 band 1200 band | Serial Communication | 168 |
Let S be an infinite set and S_1 dots S_n be sets such that S_1 cup S_2 cup dots cup S_n S Then at least one of the set S_i is a finite set not more than one of the set S_i can be finite at least one of the sets S_i is an infinite not more than one of the sets S_i can be infinite None of the above | Sets | 169 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The below figure shows four D type flip flops connnected as a shift register using an XOR gate The initial state and three subsequent states for three clock pulses are also given State Q_ A Q_ B Q_ C Q_ D Initial 1 1 1 1 After the first clock 0 1 1 1 After the second clock 0 0 1 1 After the third clock 0 0 0 1 The state Q_ A Q_ B Q_ C Q_ D after the fourth clock pulse is 0000 1111 1001 1000 | Shift Registers | 170 |
The maximum window size for data transmission using the selective reject protocol with n ext bit frame sequence numbers is 2 n 2 n 1 2 n 1 2 n 2 | Sliding Window | 171 |
A client process P needs to make a TCP connection to a server process S Consider the following situation the server process S executes a ext socket a ext bind and a ext listen system call in that order following which it is preempted Subsequently the client process P executes a ext socket system call followed by ext connect system call to connect to the server process S The server process has not executed any ext accept system call Which one of the following events could take place ext connect system call returns successfully ext connect system call blocks ext connect system call returns an error ext connect system call results in a core dump | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
A client process P needs to make a TCP connection to a server process S Consider the following situation the server process S executes a ext socket a ext bind and a ext listen system call in that order following which it is preempted Subsequently the client process P executes a ext socket system call followed by ext connect system call to connect to the server process S The server process has not executed any ext accept system call Which one of the following events could take place ext connect system call returns successfully ext connect system call blocks ext connect system call returns an error ext connect system call results in a core dump | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
A client process P needs to make a TCP connection to a server process S Consider the following situation the server process S executes a ext socket a ext bind and a ext listen system call in that order following which it is preempted Subsequently the client process P executes a ext socket system call followed by ext connect system call to connect to the server process S The server process has not executed any ext accept system call Which one of the following events could take place ext connect system call returns successfully ext connect system call blocks ext connect system call returns an error ext connect system call results in a core dump | Sockets | 172 |
A client process P needs to make a TCP connection to a server process S Consider the following situation the server process S executes a ext socket a ext bind and a ext listen system call in that order following which it is preempted Subsequently the client process P executes a ext socket system call followed by ext connect system call to connect to the server process S The server process has not executed any ext accept system call Which one of the following events could take place ext connect system call returns successfully ext connect system call blocks ext connect system call returns an error ext connect system call results in a core dump | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
A client process P needs to make a TCP connection to a server process S Consider the following situation the server process S executes a ext socket a ext bind and a ext listen system call in that order following which it is preempted Subsequently the client process P executes a ext socket system call followed by ext connect system call to connect to the server process S The server process has not executed any ext accept system call Which one of the following events could take place ext connect system call returns successfully ext connect system call blocks ext connect system call returns an error ext connect system call results in a core dump | Sockets | 172 |
Identify the correct order in which a server process must invoke the function calls accept bind listen and recv according to UNIX socket API listen accept bind recv bind listen accept recv bind accept listen recv accept listen bind recv | Sockets | 172 |
Given relations r w x and s y z the result of select distinct w x from r s is guaranteed to be same as r provided r has no duplicates and s is non empty r and s have no duplicates s has no duplicates and r is non empty r and s have the same number of tuples | Sql | 173 |
Suppose a stack implementation supports an instruction REVERSE which reverses the order of elements on the stack in addition to the PUSH and POP instructions Which one of the following statements is TRUE with respect to this modified stack A queue cannot be implemented using this stack A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each | Stack | 174 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Based on the given statements select the most appropriate option to solve the given question If two floors in a certain building are 9 feet apart how many steps are there in a set of stairs that extends from the first floor to the second floor of the building Statements I Each step is 3 4 foot high II Each step is 1 foot wide Statements I alone is sufficient but statement II alone is not sufficient Statements II alone is sufficient but statement I alone is not sufficient Both statements together are sufficient but neither statement alone is sufficient Statements I and II together are not sufficient | Statement Sufficiency | 175 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
Consider a Boolean function f w x y z Suppose that exactly one of its inputs is allowed to change at a time If the function happens to be true for two input vectors i_ 1 left langle w_ 1 x_ 1 y_ 1 z_ 1 right rangle and i_ 2 left langle w_ 2 x_ 2 y_ 2 z_ 2 right rangle we would like the function to remain true as the input changes from i_ 1 to i_ 2 i_ 1 and i_ 2 differ in exactly one bit position without becoming false momentarily Let f w x y z sum 5 7 11 12 13 15 Which of the following cube covers of f will ensure that the required property is satisfied overline w xz wx overline y x overline y z xyz wyz wxy overline w xz wyz wx overline y overline z xz w overline x yz wx overline y wyz wxz overline w xz x overline y z xyz | Static Hazard | 176 |
On a wireless link the probability of packet error is 0 2 A stop and wait protocol is used to transfer data across the link The channel condition is assumed to be independent from transmission to transmission What is the average number of transmission attempts required to transfer 100 packets 100 125 150 200 | Stop And Wait | 177 |
Suppose that the stop and wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible Then the minimum frame size in bytes to achieve a link utilization of at least 50 is_________________ | Stop And Wait | 177 |
Suppose that the stop and wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible Then the minimum frame size in bytes to achieve a link utilization of at least 50 is_________________ | Stop And Wait | 177 |
On a wireless link the probability of packet error is 0 2 A stop and wait protocol is used to transfer data across the link The channel condition is assumed to be independent from transmission to transmission What is the average number of transmission attempts required to transfer 100 packets 100 125 150 200 | Stop And Wait | 177 |
The values of parameters for the Stop and Wait ARQ protocol are as given below Bit rate of the transmission channel 1 Mbps Propagation delay from sender to receiver 0 75 ms Time to process a frame 0 25 ms Number of bytes in the information frame 1980 Number of bytes in the acknowledge frame 20 Number of overhead bytes in the information frame 20 Assume there are no transmission errors Then the transmission efficiency expressed in percentage of the Stop and Wait ARQ protocol for the above parameters is _____________ correct to 2 decimal places | Stop And Wait | 177 |
The values of parameters for the Stop and Wait ARQ protocol are as given below Bit rate of the transmission channel 1 Mbps Propagation delay from sender to receiver 0 75 ms Time to process a frame 0 25 ms Number of bytes in the information frame 1980 Number of bytes in the acknowledge frame 20 Number of overhead bytes in the information frame 20 Assume there are no transmission errors Then the transmission efficiency expressed in percentage of the Stop and Wait ARQ protocol for the above parameters is _____________ correct to 2 decimal places | Stop And Wait | 177 |
The values of parameters for the Stop and Wait ARQ protocol are as given below Bit rate of the transmission channel 1 Mbps Propagation delay from sender to receiver 0 75 ms Time to process a frame 0 25 ms Number of bytes in the information frame 1980 Number of bytes in the acknowledge frame 20 Number of overhead bytes in the information frame 20 Assume there are no transmission errors Then the transmission efficiency expressed in percentage of the Stop and Wait ARQ protocol for the above parameters is _____________ correct to 2 decimal places | Stop And Wait | 177 |
On a wireless link the probability of packet error is 0 2 A stop and wait protocol is used to transfer data across the link The channel condition is assumed to be independent from transmission to transmission What is the average number of transmission attempts required to transfer 100 packets 100 125 150 200 | Stop And Wait | 177 |
Suppose that the stop and wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible Then the minimum frame size in bytes to achieve a link utilization of at least 50 is_________________ | Stop And Wait | 177 |
Suppose that the stop and wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible Then the minimum frame size in bytes to achieve a link utilization of at least 50 is_________________ | Stop And Wait | 177 |
A sender uses the Stop and Wait ARQ protocol for reliable transmission of frames Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps 1 Kbps 1000 bits second Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps The one way propagation delay is 100 milliseconds Assuming no frame is lost the sender throughout is ________ bytes second | Stop And Wait | 177 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Consider the following relational schema ext Suppliers underline ext sid integer ext sname string city string street string ext Parts underline ext pid integer ext pname string color string ext Catalog underline ext sid integer pid integer ext cost real Consider the following relational query on the above database SELECT S sname FROM Suppliers S WHERE S sid NOT IN SELECT C sid FROM Catalog C WHERE C pid NOT IN SELECT P pid FROM Parts P WHERE P color lt gt blue Assume that relations corresponding to the above schema are not empty Which one of the following is the correct interpretation of the above query Find the names of all suppliers who have supplied a non blue part Find the names of all suppliers who have not supplied a non blue part Find the names of all suppliers who have supplied only non blue part Find the names of all suppliers who have not supplied only blue parts | Sub Queries | 178 |
Consider the following relations A B and C A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following SQL query contain SELECT A Id FROM A WHERE A Age gt ALL SELECT B Age FROM B WHERE B Name lsquo Arun rsquo 4 3 0 1 | Sub Queries | 178 |
Use the patterns given to prove that sum limits_ i 0 n 1 2i 1 n 2 You are not permitted to employ induction Use the result obtained in a to prove that sum limits_ i 1 n i frac n n 1 2 | Summation | 180 |
Let P sum_ substack 1 le i le 2k i odd i and Q sum_ substack 1 le i le 2k i even i where k is a positive integer Then P Q k P Q k P Q P Q 2k | Summation | 180 |
sum limits_ x 1 99 frac 1 x x 1 __________________ | Summation | 180 |
Use the patterns given to prove that sum limits_ i 0 n 1 2i 1 n 2 You are not permitted to employ induction Use the result obtained in a to prove that sum limits_ i 1 n i frac n n 1 2 | Summation | 180 |
Let P sum_ substack 1 le i le 2k i odd i and Q sum_ substack 1 le i le 2k i even i where k is a positive integer Then P Q k P Q k P Q P Q 2k | Summation | 180 |
Let P sum_ substack 1 le i le 2k i odd i and Q sum_ substack 1 le i le 2k i even i where k is a positive integer Then P Q k P Q k P Q P Q 2k | Summation | 180 |
Use the patterns given to prove that sum limits_ i 0 n 1 2i 1 n 2 You are not permitted to employ induction Use the result obtained in a to prove that sum limits_ i 1 n i frac n n 1 2 | Summation | 180 |
sum limits_ x 1 99 frac 1 x x 1 __________________ | Summation | 180 |
sum limits_ x 1 99 frac 1 x x 1 __________________ | Summation | 180 |
Let P sum_ substack 1 le i le 2k i odd i and Q sum_ substack 1 le i le 2k i even i where k is a positive integer Then P Q k P Q k P Q P Q 2k | Summation | 180 |
Subsets and Splits