MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 304 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
URL stands for |
| A. | unique reference label |
| B. | uniform reference label |
| C. | uniform resource locator |
| D. | unique resource locator |
| Answer» D. unique resource locator | |
| 102. |
Dynamic web page |
| A. | is same every time whenever it displays |
| B. | generates on demand by a program or a request from browser |
| C. | both is same every time whenever it displays and generates on demand by a program or a request from browser |
| D. | is different always in a predefined order |
| Answer» C. both is same every time whenever it displays and generates on demand by a program or a request from browser | |
| 103. |
RMI uses stub and skeleton for communication with the                  object. |
| A. | client |
| B. | remote |
| C. | server |
| D. | any |
| Answer» C. server | |
| 104. |
A gateway for the server side object. |
| A. | skeleton |
| B. | stub |
| C. | remote |
| D. | server |
| Answer» B. stub | |
| 105. |
An object acting as a gateway for the client side. |
| A. | skeleton |
| B. | stub |
| C. | remote |
| D. | server |
| Answer» C. remote | |
| 106. |
A middleware layer between the stub skeleton and transport. |
| A. | remote layer |
| B. | instruction layer |
| C. | reference layer |
| D. | remote reference layer |
| Answer» E. | |
| 107. |
The                        layer, which provides the interface that client and server application objects use to interact with each other. |
| A. | increasing |
| B. | count |
| C. | bit |
| D. | stub/skeleton |
| Answer» E. | |
| 108. |
A layer which is the binary data protocol layer. |
| A. | stub layer |
| B. | skeleton layer |
| C. | remote layer |
| D. | transport protocol |
| Answer» E. | |
| 109. |
A typical                      program obtains a remote reference to one or more remote objects on a server and then invokes methods on them. |
| A. | server |
| B. | client |
| C. | thread |
| D. | concurrent |
| Answer» C. thread | |
| 110. |
A typical                    program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects. |
| A. | server |
| B. | client |
| C. | thread |
| D. | concurrent |
| Answer» B. client | |
| 111. |
A remote object is an object whose method can be invoked from another virtual environment. |
| A. | true |
| B. | false |
| C. | topic 5.2 client server programming |
| Answer» B. false | |
| 112. |
RMI stands for? |
| A. | remote mail invocation |
| B. | remote message invocation |
| C. | remaining method invocation |
| D. | remote method invocation |
| Answer» E. | |
| 113. |
E-mail is |
| A. | loss-tolerant application |
| B. | bandwidth-sensitive application |
| C. | elastic application |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 114. |
Application layer offers                service. |
| A. | end to end |
| B. | process to process |
| C. | both end to end and process to process |
| D. | none of the mentioned |
| Answer» B. process to process | |
| 115. |
In the slow-start algorithm, the size of the congestion window increases                      until it reaches a threshold. |
| A. | exponentially |
| B. | additively |
| C. | multiplicatively |
| D. | suddenly |
| Answer» B. additively | |
| 116. |
The technique in which a congested node stops receiving data from the immediate upstream node or nodes is called as |
| A. | admission policy |
| B. | backpressure |
| C. | forward signaling |
| D. | backward signaling |
| Answer» C. forward signaling | |
| 117. |
In Go-Back-N window, when the timer of the packet times out, several packets have to be resent even some may have arrived safe. Whereas in Selective Repeat window, the sender resends |
| A. | packet which are not lost |
| B. | only those packets which are lost or corrupted |
| C. | packet from starting |
| D. | all the packets |
| Answer» C. packet from starting | |
| 118. |
Retransmission of packets must not be done when |
| A. | packet is lost |
| B. | packet is corrupted |
| C. | packet is needed |
| D. | packet is error-free |
| Answer» E. | |
| 119. |
Two broad categories of congestion control are |
| A. | open-loop and closed-loop |
| B. | open-control and closed-control |
| C. | active control and passive control |
| D. | active loop and passive loop |
| Answer» B. open-control and closed-control | |
| 120. |
Closed-Loop control mechanisms try to |
| A. | remove after congestion occurs |
| B. | remove after sometime |
| C. | prevent before congestion occurs |
| D. | prevent before sending packets |
| Answer» B. remove after sometime | |
| 121. |
Bytes of data being transferred in each connection are numbered by TCP. These numbers start with a |
| A. | fixed number |
| B. | random sequence of 0’s and 1’s |
| C. | one |
| D. | sequence of zero’s and one’s |
| Answer» E. | |
| 122. |
Communication offered by TCP is |
| A. | full-duplex |
| B. | half-duplex |
| C. | semi-duplex |
| D. | byte by byte |
| Answer» B. half-duplex | |
| 123. |
The value of acknowledgement field in a segment defines |
| A. | sequence number of the byte received previously |
| B. | total number of bytes to receive |
| C. | sequence number of the next byte to be received |
| D. | sequence of zeros and ones |
| Answer» D. sequence of zeros and ones | |
| 124. |
Suppose a TCP connection is transferring a file of 1000 bytes. The first byte is numbered 10001. What is the sequence number of the segment if all data is sent in only one segment? |
| A. | 10000 |
| B. | 10001 |
| C. | 12001 |
| D. | 11001 |
| Answer» C. 12001 | |
| 125. |
In TCP, sending and receiving data is done as |
| A. | stream of bytes |
| B. | sequence of characters |
| C. | lines of data |
| D. | packets |
| Answer» B. sequence of characters | |
| 126. |
The              field is used to detect errors over the entire user datagram. |
| A. | udp header |
| B. | checksum |
| C. | source port |
| D. | destination port |
| Answer» C. source port | |
| 127. |
TCP groups a number of bytes together into a packet called |
| A. | packet |
| B. | buffer |
| C. | segment |
| D. | stack |
| Answer» D. stack | |
| 128. |
“Total length†field in UDP packet header is the length of |
| A. | only udp header |
| B. | only data |
| C. | only checksum |
| D. | udp header plus data |
| Answer» E. | |
| 129. |
The port number is “ephemeral port numberâ€, if the source host is |
| A. | ntp |
| B. | echo |
| C. | server |
| D. | client |
| Answer» E. | |
| 130. |
Return value of the UDP port “Chargen†is |
| A. | string of characters |
| B. | string of integers |
| C. | array of characters with integers |
| D. | array of zero’s and one’s |
| Answer» B. string of integers | |
| 131. |
Beyond IP, UDP provides additional services such as |
| A. | routing and switching |
| B. | sending and receiving of packets |
| C. | multiplexing and demultiplexing |
| D. | demultiplexing and error checking |
| Answer» E. | |
| 132. |
Which one of the following is a version of UDP with congestion control? |
| A. | datagram congestion control protocol |
| B. | stream control transmission protocol |
| C. | structured stream transport |
| D. | user congestion control protocol |
| Answer» B. stream control transmission protocol | |
| 133. |
An endpoint of an inter-process communication flow across a computer network is called |
| A. | socket |
| B. | pipe |
| C. | port |
| D. | machine |
| Answer» B. pipe | |
| 134. |
2 USER DATAGRAM PROTOCOLS (UDP) |
| A. | connection-oriented |
| B. | unreliable |
| C. | transport layer protocol |
| D. | low overhead |
| Answer» B. unreliable | |
| 135. |
The                    field determines the lifetime of IPv6 datagram |
| A. | use dual-stack approach |
| B. | tunneling |
| C. | no solution |
| D. | replace the system |
| Answer» C. no solution | |
| 136. |
Which among the following features is |
| A. | hop limit |
| B. | ttl |
| C. | next header |
| D. | type of traffic |
| Answer» B. ttl | |
| 137. |
Teredo is an automatic tunneling technique. In each client the obfuscated IPv4 address is represented by bits |
| A. | 96 to 127 |
| B. | 0 to 63 |
| C. | 80 to 95 |
| D. | 64 to 79 |
| Answer» B. 0 to 63 | |
| 138. |
IPv6 does not use                    type of address. |
| A. | broadcast |
| B. | multicast |
| C. | anycast |
| D. | unicast |
| Answer» B. multicast | |
| 139. |
In the IPv6 header, the traffic class field is similar to which field in the IPv4 header? |
| A. | fragmentation field |
| B. | fast-switching |
| C. | tos field |
| D. | option field |
| Answer» D. option field | |
| 140. |
The header length of an IPv6 datagram is |
| A. | 10bytes |
| B. | 25bytes |
| C. | 30bytes |
| D. | 40bytes |
| Answer» E. | |
| 141. |
In OSPF database descriptor packet, which field is used to detect a missing packet? |
| A. | lsa header |
| B. | ms |
| C. | database descriptor sequence number |
| D. | options |
| Answer» D. options | |
| 142. |
In OSPF database descriptor packet, if there are more database descriptor packets in the flow, ‘M’ field is set to |
| A. | 1 |
| B. | 0 |
| C. | more |
| D. | -1 |
| Answer» B. 0 | |
| 143. |
In OSPF database descriptor packet, which field is used to indicate that the router is master? |
| A. | m |
| B. | ms |
| C. | i |
| D. | options |
| Answer» C. i | |
| 144. |
The computation of the shortest path in OSPF is usually done by |
| A. | bellman-ford algorithm |
| B. | routing information protocol |
| C. | dijkstra’s algorithm |
| D. | distance vector routing |
| Answer» D. distance vector routing | |
| 145. |
Which of the following is false with respect to the features of OSPF? |
| A. | support for fixed-length subnetting by including the subnet mask in the routing message |
| B. | more flexible link cost than can range from 1 to 65535 |
| C. | use of designated router |
| D. | distribution of traffic over multiple paths that have equal cost to the destination |
| Answer» B. more flexible link cost than can range from 1 to 65535 | |
| 146. |
In Multicast Routing Protocol, flooding is used to broadcast packets but it creates |
| A. | gaps |
| B. | loops |
| C. | holes |
| D. | links |
| Answer» C. holes | |
| 147. |
In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a |
| A. | graph |
| B. | tree |
| C. | network |
| D. | link |
| Answer» B. tree | |
| 148. |
Several techniques can make size of routing table manageable and also handle issues such as |
| A. | maturity |
| B. | error reporting |
| C. | tunneling |
| D. | security |
| Answer» E. | |
| 149. |
Host-specific routing is used for purposes such as checking route or providing |
| A. | network measures |
| B. | security measures |
| C. | routing measures |
| D. | delivery measures |
| Answer» C. routing measures | |
| 150. |
Protocol is a set of |
| A. | formats |
| B. | procedures |
| C. | formats & procedures |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |