Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
The circuit shown below implements a 2 input NOR gate using two 2 4 MUX control signal 1 selects the upper input What are the values of signals x y and z 1 0 B 1 0 A 0 1 B 0 1 A | Multiplexer | 106 |
Consider a multiplexer with X and Y as data inputs and Z the as control input Z 0 selects input X and Z 1 selects input Y What are the connections required to realize the 2 variable Boolean function f T R without using any additional hardware R to X 1 to Y T to Z T to X R to Y T to Z T to X R to Y 0 to Z R to X 0 to Y T to Z | Multiplexer | 106 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider the following implications relating to functional and multivalued dependencies given below which may or may not be correct If A u2192 u2192 B and A u2192 u2192 C then A u2192 BC If A u2192 B and A u2192 C then A u2192 u2192 BC If A u2192 u2192 BC and A u2192 B then A u2192 C If A u2192 BC and A u2192 B then A u2192 u2192 C Exactly how many of the above implications are valid 0 1 2 3 | Multivalued Dependency 4nf | 107 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
The following functional dependencies hold for relations R A B C and S B D E B o A A o C The relation R contains 200 tuples and the relation S contains 100 tuples What is the maximum number of tuples possible in the natural join R bowtie S 100 200 300 2000 | Natural Join | 108 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
Let r be a relation instance with schema R A B C D We define r_1 pi_ A B C R and r_2 pi_ A D r Let s r_1 r_2 where denotes natural join Given that the decomposition of r into r_1 and r_2 is lossy which one of the following is TRUE s subset r r cup s r r subset s r s s | Natural Join | 108 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
Let r be a relation instance with schema R A B C D We define r_1 pi_ A B C R and r_2 pi_ A D r Let s r_1 r_2 where denotes natural join Given that the decomposition of r into r_1 and r_2 is lossy which one of the following is TRUE s subset r r cup s r r subset s r s s | Natural Join | 108 |
Let r be a relation instance with schema R A B C D We define r_1 pi_ A B C R and r_2 pi_ A D r Let s r_1 r_2 where denotes natural join Given that the decomposition of r into r_1 and r_2 is lossy which one of the following is TRUE s subset r r cup s r r subset s r s s | Natural Join | 108 |
The following functional dependencies hold for relations R A B C and S B D E B o A A o C The relation R contains 200 tuples and the relation S contains 100 tuples What is the maximum number of tuples possible in the natural join R bowtie S 100 200 300 2000 | Natural Join | 108 |
Consider two relations R_1 A B with the tuples 1 5 3 7 and R_2 A C 1 7 4 9 Assume that R A B C is the full natural outer join of R_1 and R_2 Consider the following tuples of the form A B C a 1 5 null b 1 null 7 c 3 null 9 d 4 7 null e 1 5 7 f 3 7 null g 4 null 9 Which one of the following statements is correct R contains a b e f g but not c d R contains all a b c d e f g R contains e f g but not a b R contains e but not f g | Natural Join | 108 |
Let r be a relation instance with schema R A B C D We define r_1 pi_ A B C R and r_2 pi_ A D r Let s r_1 r_2 where denotes natural join Given that the decomposition of r into r_1 and r_2 is lossy which one of the following is TRUE s subset r r cup s r r subset s r s s | Natural Join | 108 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
Consider two hosts X and Y connected by a single direct link of rate 10 6 bits sec The distance between the two hosts is 10 000 km and the propagation speed along the link is 2 imes 10 8 m sec Host X sends a file of 50 000 bytes as one large message to host Y continuously Let the transmission and propagation delays be p milliseconds and q milliseconds respectively Then the value of p and q are p 50 and q 100 p 50 and q 400 p 100 and q 50 p 400 and q 50 | Network Communication | 109 |
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame excluding network overhead Assume that IP overhead per packet is 20 bytes What is the total IP overhead in the second network for this transmission 40 bytes 80 bytes 120 bytes 160 bytes | Network Flow | 110 |
A link of capacity 100 Mbps is carrying traffic from a number of sources Each source generates an on off traffic stream when the source is on the rate of traffic is 10 Mbps and when the source is off the rate of traffic is zero The duty cycle which is the ratio of on time to off time is 1 2 When there is no buffer at the link the minimum number of sources that can be multiplexed on the link so that link capacity is not wasted and no data loss occurs is S1 Assuming that all sources are synchronized and that the link is provided with a large buffer the maximum number of sources that can be multiplexed so that no data loss occurs is S2 The values of S1 and S2 are respectively 10 and 30 12 and 25 5 and 33 15 and 22 | Network Flow | 110 |
In a data link protocol the frame delimiter flag is given by 0111 Assuming that bit stuffing is employed the transmitter sends the data sequence 01110110 as 01101011 011010110 011101100 0110101100 | Network Flow | 110 |
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame excluding network overhead Assume that IP overhead per packet is 20 bytes What is the total IP overhead in the second network for this transmission 40 bytes 80 bytes 120 bytes 160 bytes | Network Flow | 110 |
A link of capacity 100 Mbps is carrying traffic from a number of sources Each source generates an on off traffic stream when the source is on the rate of traffic is 10 Mbps and when the source is off the rate of traffic is zero The duty cycle which is the ratio of on time to off time is 1 2 When there is no buffer at the link the minimum number of sources that can be multiplexed on the link so that link capacity is not wasted and no data loss occurs is S1 Assuming that all sources are synchronized and that the link is provided with a large buffer the maximum number of sources that can be multiplexed so that no data loss occurs is S2 The values of S1 and S2 are respectively 10 and 30 12 and 25 5 and 33 15 and 22 | Network Flow | 110 |
A channel has a bit rate of 4 kbps and one way propagation delay of 20 ms The channel uses stop and wait protocol The transmission time of the acknowledgement frame is negligible To get a channel efficiency of at least 50 the minimum frame size should be 80 bytes 80 bits 160 bytes 160 bits | Network Flow | 110 |
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame excluding network overhead Assume that IP overhead per packet is 20 bytes What is the total IP overhead in the second network for this transmission 40 bytes 80 bytes 120 bytes 160 bytes | Network Flow | 110 |
A link of capacity 100 Mbps is carrying traffic from a number of sources Each source generates an on off traffic stream when the source is on the rate of traffic is 10 Mbps and when the source is off the rate of traffic is zero The duty cycle which is the ratio of on time to off time is 1 2 When there is no buffer at the link the minimum number of sources that can be multiplexed on the link so that link capacity is not wasted and no data loss occurs is S1 Assuming that all sources are synchronized and that the link is provided with a large buffer the maximum number of sources that can be multiplexed so that no data loss occurs is S2 The values of S1 and S2 are respectively 10 and 30 12 and 25 5 and 33 15 and 22 | Network Flow | 110 |
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame excluding network overhead Assume that IP overhead per packet is 20 bytes What is the total IP overhead in the second network for this transmission 40 bytes 80 bytes 120 bytes 160 bytes | Network Flow | 110 |
A channel has a bit rate of 4 kbps and one way propagation delay of 20 ms The channel uses stop and wait protocol The transmission time of the acknowledgement frame is negligible To get a channel efficiency of at least 50 the minimum frame size should be 80 bytes 80 bits 160 bytes 160 bits | Network Flow | 110 |
A link of capacity 100 Mbps is carrying traffic from a number of sources Each source generates an on off traffic stream when the source is on the rate of traffic is 10 Mbps and when the source is off the rate of traffic is zero The duty cycle which is the ratio of on time to off time is 1 2 When there is no buffer at the link the minimum number of sources that can be multiplexed on the link so that link capacity is not wasted and no data loss occurs is S1 Assuming that all sources are synchronized and that the link is provided with a large buffer the maximum number of sources that can be multiplexed so that no data loss occurs is S2 The values of S1 and S2 are respectively 10 and 30 12 and 25 5 and 33 15 and 22 | Network Flow | 110 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Assume that source S and destination D are connected through two intermediate routers labeled R Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D A Network layer u2013 4 times and Data link layer u2013 4 times B Network layer u2013 4 times and Data link layer u2013 3 times C Network layer u2013 4 times and Data link layer u2013 6 times D Network layer u2013 2 times and Data link layer u2013 6 times | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
Choose the best matching between ext Group 1 and ext Group 2 Group 1 Group 2 P Data link layer 1 Ensures reliable transport of data over a physical point to point link Q Network layer 2 Encodes decodes data for physical transmission R Transport layer 3 Allows end to end communication between two processes 4 Routes data from one network node to the next P 1 Q 4 R 3 P 2 Q 4 R 1 P 2 Q 3 R 1 P 1 Q 3 R 2 | Network Layering | 111 |
In one of the pairs of protocols given below both the protocols can use multiple TCP connections between the same client and the server Which one is that HTTP FTP HTTP TELNET FTP SMTP HTTP SMTP | Network Protocols | 112 |
Match the following P SMTP 1 Application layer Q BGP 2 Transport layer R TCP 3 Data link layer S PPP 4 Network layer 5 Physical layer P 2 Q 1 R 3 S 5 P 1 Q 4 R 2 S 3 P 1 Q 4 R 2 S 5 P 2 Q 4 R 1 S 3 | Network Protocols | 112 |
Match the following P SMTP 1 Application layer Q BGP 2 Transport layer R TCP 3 Data link layer S PPP 4 Network layer 5 Physical layer P 2 Q 1 R 3 S 5 P 1 Q 4 R 2 S 3 P 1 Q 4 R 2 S 5 P 2 Q 4 R 1 S 3 | Network Protocols | 112 |
Consider the following clauses Not inherently suitable for client authentication Not a state sensitive protocol Must be operated with more than one server Suitable for structured message organization May need two ports on the serve side for proper operation The option that has the maximum number of correct matches is IMAP i FTP ii HTTP iii DNS iv POP3 v FTP i POP3 ii SMTP iii HTTP iv IMAP v POP3 i SMTP ii DNS iii IMAP iv HTTP v SMTP i HTTP ii IMAP iii DNS iv FTP v | Network Protocols | 112 |
Consider the following clauses Not inherently suitable for client authentication Not a state sensitive protocol Must be operated with more than one server Suitable for structured message organization May need two ports on the serve side for proper operation The option that has the maximum number of correct matches is IMAP i FTP ii HTTP iii DNS iv POP3 v FTP i POP3 ii SMTP iii HTTP iv IMAP v POP3 i SMTP ii DNS iii IMAP iv HTTP v SMTP i HTTP ii IMAP iii DNS iv FTP v | Network Protocols | 112 |
In one of the pairs of protocols given below both the protocols can use multiple TCP connections between the same client and the server Which one is that HTTP FTP HTTP TELNET FTP SMTP HTTP SMTP | Network Protocols | 112 |
Match the following P SMTP 1 Application layer Q BGP 2 Transport layer R TCP 3 Data link layer S PPP 4 Network layer 5 Physical layer P 2 Q 1 R 3 S 5 P 1 Q 4 R 2 S 3 P 1 Q 4 R 2 S 5 P 2 Q 4 R 1 S 3 | Network Protocols | 112 |
In one of the pairs of protocols given below both the protocols can use multiple TCP connections between the same client and the server Which one is that HTTP FTP HTTP TELNET FTP SMTP HTTP SMTP | Network Protocols | 112 |
In one of the pairs of protocols given below both the protocols can use multiple TCP connections between the same client and the server Which one is that HTTP FTP HTTP TELNET FTP SMTP HTTP SMTP | Network Protocols | 112 |
Consider the following clauses Not inherently suitable for client authentication Not a state sensitive protocol Must be operated with more than one server Suitable for structured message organization May need two ports on the serve side for proper operation The option that has the maximum number of correct matches is IMAP i FTP ii HTTP iii DNS iv POP3 v FTP i POP3 ii SMTP iii HTTP iv IMAP v POP3 i SMTP ii DNS iii IMAP iv HTTP v SMTP i HTTP ii IMAP iii DNS iv FTP v | Network Protocols | 112 |
Consider the following clauses Not inherently suitable for client authentication Not a state sensitive protocol Must be operated with more than one server Suitable for structured message organization May need two ports on the serve side for proper operation The option that has the maximum number of correct matches is IMAP i FTP ii HTTP iii DNS iv POP3 v FTP i POP3 ii SMTP iii HTTP iv IMAP v POP3 i SMTP ii DNS iii IMAP iv HTTP v SMTP i HTTP ii IMAP iii DNS iv FTP v | Network Protocols | 112 |
Consider the following two statements A hash function these are often used for computing digital signatures is an injective function A encryption technique such as DES performs a permutation on the elements of its input alphabet Which one of the following options is valid for the above two statements Both are false Statement i is true and the other is false Statement ii is true and the other is false Both are true | Network Security | 113 |
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections However it will only allow external hosts to send packets on existing open TCP connections or connections that are being opened by internal hosts but not allow them to open TCP connections to hosts in the private network To achieve this the minimum capability of the firewall should be that of A combinational circuit A finite automaton A pushdown automaton with one stack A pushdown automaton with two stacks | Network Security | 113 |
Suppose that everyone in a group on N people wants to communicate secretly withhe ext N 1 others using symmetric Key cryptographic system The communication between any two person should not be decodable by the others in the group The numbers of keys required in the system as a whole to satisfyhe confidentiality requirement is 2N N N 1 dfrac N N 1 2 N 1 2 | Network Security | 113 |
Two hosts are connected via a packet switch with 10 7 bits per second links Each link has a propagation delay of 20 microseconds The switch begins forwarding a packet 35 microseconds after it receives the same If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______ | Network Switching | 114 |
In a packet switching network packets are routed from source to destination along a single path having two intermediate nodes If the message size is 24 bytes and each packet contains a header of 3 bytes then the optimum packet size is 4 6 7 9 | Network Switching | 114 |
Consider the store and forward packet switched network given below Assume that the bandwidth of each link is 10 6 bytes sec A user on host A sends a file of size 10 3 bytes to host B through routers R1 and R2 in three different ways In the first case a single packet containing the complete file is transmitted from A to B In the second case the file is split into 10 equal parts and these packets are transmitted from A to B In the third case the file is split into 20 equal parts and these packets are sent from A to B Each packet contains 100 bytes of header information along with the user data Consider only transmission time and ignore processing queuing and propagation delays Also assume that there are no errors during transmission Let T1 T2 and T3 be the times taken to transmit the file in the first second and third case respectively Which one of the following is CORRECT T lt T2 lt T3 T1 gt T2 gt T3 T2 T3 T3 lt T1 T1 T3 T3 gt T2 | Network Switching | 114 |
Consider the store and forward packet switched network given below Assume that the bandwidth of each link is 10 6 bytes sec A user on host A sends a file of size 10 3 bytes to host B through routers R1 and R2 in three different ways In the first case a single packet containing the complete file is transmitted from A to B In the second case the file is split into 10 equal parts and these packets are transmitted from A to B In the third case the file is split into 20 equal parts and these packets are sent from A to B Each packet contains 100 bytes of header information along with the user data Consider only transmission time and ignore processing queuing and propagation delays Also assume that there are no errors during transmission Let T1 T2 and T3 be the times taken to transmit the file in the first second and third case respectively Which one of the following is CORRECT T lt T2 lt T3 T1 gt T2 gt T3 T2 T3 T3 lt T1 T1 T3 T3 gt T2 | Network Switching | 114 |
Consider the store and forward packet switched network given below Assume that the bandwidth of each link is 10 6 bytes sec A user on host A sends a file of size 10 3 bytes to host B through routers R1 and R2 in three different ways In the first case a single packet containing the complete file is transmitted from A to B In the second case the file is split into 10 equal parts and these packets are transmitted from A to B In the third case the file is split into 20 equal parts and these packets are sent from A to B Each packet contains 100 bytes of header information along with the user data Consider only transmission time and ignore processing queuing and propagation delays Also assume that there are no errors during transmission Let T1 T2 and T3 be the times taken to transmit the file in the first second and third case respectively Which one of the following is CORRECT T lt T2 lt T3 T1 gt T2 gt T3 T2 T3 T3 lt T1 T1 T3 T3 gt T2 | Network Switching | 114 |
Two hosts are connected via a packet switch with 10 7 bits per second links Each link has a propagation delay of 20 microseconds The switch begins forwarding a packet 35 microseconds after it receives the same If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______ | Network Switching | 114 |
In a packet switching network packets are routed from source to destination along a single path having two intermediate nodes If the message size is 24 bytes and each packet contains a header of 3 bytes then the optimum packet size is 4 6 7 9 | Network Switching | 114 |
Two hosts are connected via a packet switch with 10 7 bits per second links Each link has a propagation delay of 20 microseconds The switch begins forwarding a packet 35 microseconds after it receives the same If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______ | Network Switching | 114 |
Two hosts are connected via a packet switch with 10 7 bits per second links Each link has a propagation delay of 20 microseconds The switch begins forwarding a packet 35 microseconds after it receives the same If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______ | Network Switching | 114 |
In a packet switching network packets are routed from source to destination along a single path having two intermediate nodes If the message size is 24 bytes and each packet contains a header of 3 bytes then the optimum packet size is 4 6 7 9 | Network Switching | 114 |
Consider the store and forward packet switched network given below Assume that the bandwidth of each link is 10 6 bytes sec A user on host A sends a file of size 10 3 bytes to host B through routers R1 and R2 in three different ways In the first case a single packet containing the complete file is transmitted from A to B In the second case the file is split into 10 equal parts and these packets are transmitted from A to B In the third case the file is split into 20 equal parts and these packets are sent from A to B Each packet contains 100 bytes of header information along with the user data Consider only transmission time and ignore processing queuing and propagation delays Also assume that there are no errors during transmission Let T1 T2 and T3 be the times taken to transmit the file in the first second and third case respectively Which one of the following is CORRECT T lt T2 lt T3 T1 gt T2 gt T3 T2 T3 T3 lt T1 T1 T3 T3 gt T2 | Network Switching | 114 |
Consider the store and forward packet switched network given below Assume that the bandwidth of each link is 10 6 bytes sec A user on host A sends a file of size 10 3 bytes to host B through routers R1 and R2 in three different ways In the first case a single packet containing the complete file is transmitted from A to B In the second case the file is split into 10 equal parts and these packets are transmitted from A to B In the third case the file is split into 20 equal parts and these packets are sent from A to B Each packet contains 100 bytes of header information along with the user data Consider only transmission time and ignore processing queuing and propagation delays Also assume that there are no errors during transmission Let T1 T2 and T3 be the times taken to transmit the file in the first second and third case respectively Which one of the following is CORRECT T lt T2 lt T3 T1 gt T2 gt T3 T2 T3 T3 lt T1 T1 T3 T3 gt T2 | Network Switching | 114 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
X is a 30 digit number starting with the digit 4 followed by the digit 7 Then the number X 3 will have 90 digits 91 digits 92 digits 93 digits | No Of Digits | 115 |
Subsets and Splits