McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 151. |
Most packet switches use this principle |
| A. | stop and wait |
| B. | store and forward |
| C. | store and wait |
| D. | stop and forward |
| Answer» B. store and forward | |
| Explanation: the packet switch will not transmit the first bit to outbound link until it receives the entire packet. if the entire packet is not received and the time-out period expires, the packet switch will inform the sender to resend the part of packet or the entire packet based on the algorithm being used. | |
| 152. |
If there are N routers from source to destination, the total end to end delay in sending packet P(L-> number of bits in the packet R-> transmission rate) is equal to |
| A. | n |
| B. | (n*l)/r |
| C. | (2n*l)/r |
| D. | l/r |
| Answer» B. (n*l)/r | |
| Explanation: the equation to find the end to end delay when no. of bits, transmission rate and no. of routers is given by (n*l)/r. the total end to end delay, that is, nodal delay is the sum of all, the processing delay, queuing delay, transmission delay and propagation delay. | |
| 153. |
What are the Methods to move data through a network of links and switches? |
| A. | packet switching and line switching |
| B. | circuit switching and line switching |
| C. | line switching and bit switching |
| D. | packet switching and circuit switching |
| Answer» D. packet switching and circuit switching | |
| Explanation: packet switching and circuit switching are two different types of switching methods used to connect the multiple communicating devices with one another. | |
| 154. |
The required resources for communication between end systems are reserved for the duration of the session between end systems in method. |
| A. | packet switching |
| B. | circuit switching |
| C. | line switching |
| D. | frequency switching |
| Answer» B. circuit switching | |
| Explanation: in circuit switching, a physical path between the sender and receiver is established. this path is maintained until the connection is needed. circuit switching is implemented in the physical layer and is used in telephonic systems. | |
| 155. |
As the resources are reserved between two communicating end systems in circuit switching, is achieved. |
| A. | authentication |
| B. | guaranteed constant rate |
| C. | reliability |
| D. | store and forward |
| Answer» B. guaranteed constant rate | |
| Explanation: circuit switching is connection oriented and is always implemented in the physical layer. once a path is set, all transmission occurs through the same path. it is used since the early times in telephonic systems. | |
| 156. |
In systems, resources are allocated on demand. |
| A. | packet switching |
| B. | circuit switching |
| C. | line switching |
| D. | frequency switching |
| Answer» A. packet switching | |
| Explanation: in packet switching, the bits are received in out of order and need to be assembled at the receiver end, whereas in the case of circuit switching, all the bits are received in order. all transmissions may not occur through the same path in case of packet switching. | |
| 157. |
Which of the following is not an application layer service? |
| A. | network virtual terminal |
| B. | file transfer, access, and management |
| C. | mail service |
| D. | error control |
| Answer» D. error control | |
| Explanation: application layer is the topmost layer in the osi model. network virtual terminal, mail service, file transfer, access and management are all services of the application layer. it uses protocols like http, ftp, and dns etc. to provide these services. | |
| 158. |
Which of the following is not applicable for IP? |
| A. | error reporting |
| B. | handle addressing conventions |
| C. | datagram format |
| D. | packet handling conventions |
| Answer» A. error reporting | |
| Explanation: the internet protocol is the networking protocol which establishes the internet by relaying datagrams across network boundaries. icmp is a supporting protocol for ip which handles the error reporting functionality. | |
| 159. |
Which of the following field in IPv4 datagram is not related to fragmentation? |
| A. | flags |
| B. | offset |
| C. | tos |
| D. | identifier |
| Answer» C. tos | |
| Explanation: tos-type of service identifies the type of packets. it is not related to fragmentation but is used to request specific treatment such as high throughput, high reliability or low latency for the ip packet depending upon the type of service it belongs to. | |
| 160. |
The TTL field has value 10. How many routers (max) can process this datagram? |
| A. | 11 |
| B. | 5 |
| C. | 10 |
| D. | 1 |
| Answer» C. 10 | |
| Explanation: ttl stands for time to live. this field specifies the life of the ip packet based on the number of hops it makes (number of routers it goes through). ttl field is decremented by one each time the datagram is processed by a router. when the value is 0, the packet is automatically destroyed. | |
| 161. |
If the value in protocol field is 17, the transport layer protocol used is |
| A. | tcp |
| B. | udp |
| C. | icmp |
| D. | igmp |
| Answer» B. udp | |
| Explanation: the protocol field enables the demultiplexing feature so that the ip protocol can be used to carry payloads of more than one protocol type. its most used values are 17 and 6 for udp and tcp respectively. icmp and igmp are network layer protocols. | |
| 162. |
The data field cannot carry which of the following? |
| A. | tcp segment |
| B. | udp segment |
| C. | icmp messages |
| D. | smtp messages |
| Answer» C. icmp messages | |
| Explanation: data field usually has transport layer segments, but it can also carry icmp messages. smtp is an application layer protocol. first it must go through the transport layer to be converted into tcp segments and then it can be inserted into ip packets. | |
| 163. |
What should be the flag value to indicate the last fragment? |
| A. | 0 |
| B. | 1 |
| C. | ttl value |
| D. | protocol field value |
| Answer» A. 0 | |
| Explanation: the flag field in the ip header is used to control and identify the fragments. it contains three bits: reserved, don’t fragment and more fragments. if the more fragments bit is 0, it means that the fragment is the last fragment. | |
| 164. |
Which of these is not applicable for IP protocol? |
| A. | is connectionless |
| B. | offer reliable service |
| C. | offer unreliable service |
| D. | does not offer error reporting |
| Answer» B. offer reliable service | |
| Explanation: ip does not provide reliable delivery service for the data. it’s dependent upon the transport layer protocols like tcp to offer reliability. | |
| 165. |
Which of the following demerits does Fragmentation have? |
| A. | complicates routers |
| B. | open to dos attack |
| C. | overlapping of fragments. |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| Explanation: fragmentation makes the implementation of the ip protocol complex and can also be exploited by attackers to create a dos attack such as a teardrop attack. fragmentation won’t be required if the transport layer protocols perform wise segmentation. | |
| 166. |
Which field helps to check rearrangement of the fragments? |
| A. | offset |
| B. | flag |
| C. | ttl |
| D. | identifer |
| Answer» A. offset | |
| Explanation: the fragment offset field specifies where the fragment fits in the original datagram. the offset of the first fragment will always be 0. the size of the field (13 bits) is 3-bits shorter than the size of the total length field (16 bits). | |
| 167. |
Which one of the following is not a function of network layer? |
| A. | routing |
| B. | inter-networking |
| C. | congestion control |
| D. | error control |
| Answer» D. error control | |
| Explanation: in the osi model, network layer is the third layer and it provides data routing paths for network communications. error control is a function of the data link layer and the transport layer. | |
| 168. |
A 4 byte IP address consists of |
| A. | only network address |
| B. | only host address |
| C. | network address & host address |
| D. | network address & mac address |
| Answer» C. network address & host address | |
| Explanation: an ip address which is 32 bits long, that means it is of 4 bytes and is composed of a network and host portion and it depends on address class. the size of the host address and network address depends upon the class of the address in classful ip addressing. | |
| 169. |
Which of the following routing algorithms can be used for network layer design? |
| A. | shortest path algorithm |
| B. | distance vector routing |
| C. | link state routing |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| Explanation: the routing algorithm is what decides where a packet should go next. there are several routing techniques like shortest path algorithm, static and dynamic routing, decentralized routing, distance vector routing, link state routing, hierarchical routing etc. | |
| 170. |
Which of the following is not correct in relation to multi-destination routing? |
| A. | is same as broadcast routing |
| B. | contains the list of all destinations |
| C. | data is not sent by packets |
| D. | there are multiple receivers |
| Answer» C. data is not sent by packets | |
| Explanation: in multi-destination routing, there is more than one receiver and the route for each destination which is contained in a list of destinations is to be found by the routing algorithm. multi-destination routing is also used in broadcasting. | |
| 171. |
Which one of the following algorithm is not used for congestion control? |
| A. | traffic aware routing |
| B. | admission control |
| C. | load shedding |
| D. | routing information protocol |
| Answer» D. routing information protocol | |
| Explanation: the routing information protocol (rip) is used by the network layer for the function of dynamic routing. | |
| 172. |
The network layer protocol for internet is |
| A. | ethernet |
| B. | internet protocol |
| C. | hypertext transfer protocol |
| D. | file transfer protocol |
| Answer» B. internet protocol | |
| Explanation: there are several protocols used in network layer. some of them are ip, icmp, clnp, arp, ipx, hrsp etc. | |
| 173. |
Which type of Ethernet framing is used for TCP/IP and DEC net? |
| A. | ethernet 802.3 |
| B. | ethernet 802.2 |
| C. | ethernet ii |
| D. | ethernet snap |
| Answer» C. ethernet ii | |
| Explanation: the ethernet 802.3 framing is used for netware versions 2 to 3.11, and the ethernet 802.2 framing is used for netware versions 3.12 and later plus osi routing, ethernet ii is used with tcp/ip and dec net, and ethernet snap is used with tcp/ip and appletalk. the type field in ethernet 802.2 frame is replaced by a length field in ethernet 802.3. | |
| 174. |
Consider a situation in which you are a system administrator on a NetWare network, you are running NetWare 4.11 and you cannot communicate with your router. What is the likely problem? |
| A. | netware 4.11 defaults to 802.2 encapsulation |
| B. | netware 4.11 defaults to 802.3 encapsulation |
| C. | cisco routers only work with netware 3.11 |
| D. | netware 3.11 defaults to 802.2 encapsulation |
| Answer» A. netware 4.11 defaults to 802.2 encapsulation | |
| Explanation: the default encapsulation on cisco routers is novell ethernet_802.3 and netware 3.12and later defaults to 802.2 encapsulation, 3.11 and earlier defaults to 802.3. | |
| 175. |
NetWare IPX addressing uses a network number and a node number. Which statement is not true? |
| A. | the network address is administratively assigned and can be up to 16 hexadecimal digits long |
| B. | the node address is always administratively assigned |
| C. | the node address is usually the mac address |
| D. | if the mac address is used as the node address, then ipx eliminates the use of arp |
| Answer» B. the node address is always administratively assigned | |
| Explanation: the network address can be up to 16 hexadecimal digits in length. the node number is 12 hexadecimal digits. the node address is usually the mac address. an example ipx address is 4a1d.0000.0c56.de33. the network part is 4a1d. the node part is 0000.0c56.de33. the network number is assigned by the system administrator of the novell network and the mac address/node address is not assigned by the administrator. | |
| 176. |
Which NetWare protocol works on layer 3– network layer—of the OSI model? |
| A. | ipx |
| B. | ncp |
| C. | spx |
| D. | netbios |
| Answer» A. ipx | |
| Explanation: ipx (internetwork packet exchange) is the netware network layer 3 protocol used for transferring information on lans that use novell’s netware. | |
| 177. |
Which NetWare protocol provides link- state routing? |
| A. | nlsp |
| B. | rip |
| C. | sap |
| D. | ncp |
| Answer» A. nlsp | |
| Explanation: netware link services protocol (nlsp) provides link-state routing. | |
| 178. |
As a system administrator, you want to debug IGRP but are worried that the “debug IP IGRP transaction” command will flood the console. What is the command that you should use? |
| A. | debug ip igrp event |
| B. | debug ip igrp-events |
| C. | debug ip igrp summary |
| D. | debug ip igrp events |
| Answer» D. debug ip igrp events | |
| Explanation: the “debug ip igrp events” is used to display a short summary of igrp routing information. you can append an ip address onto either console’s command-line to see only the igrp updates from a neighbor. the command will only give a short summary and hence won’t flood the command line. | |
| 179. |
0.0.0 router IGRP 109 network 172.68.7.0 |
| A. | it isolates networks 10.0.0.0 and 172.68.7.0 |
| B. | it loads igrp for networks 109 and 71 |
| C. | it disables rip |
| D. | it disables all routing protocols |
| Answer» A. it isolates networks 10.0.0.0 and 172.68.7.0 | |
| Explanation: it isolates network 10.0.0.0 and | |
| 180. |
As a system administrator, you need to set up one Ethernet interface on the Cisco router to allow for both sap and Novell-ether encapsulations. Which set of commands will accomplish this? |
| A. | interface ethernet 0.1 ipx encapsulation novell-ether ipx network 9e interface ethernet 0.2 ipx network 6c |
| B. | interface ethernet 0 ipx encapsulation novell-ether ipx network 9e interface ethernet 0 ipx encapsulation sap ipx network 6c |
| C. | interface ethernet 0.1 ipx encapsulation novell-ether interface ethernet 0.2 ipx encapsulation sap |
| D. | interface ethernet 0.1ipx encapsulation novell-ether ipx network 9e interface ethernet 0.2 ipx encapsulation sap ipx network 6c |
| Answer» D. interface ethernet 0.1ipx encapsulation novell-ether ipx network 9e interface ethernet 0.2 ipx encapsulation sap ipx network 6c | |
| Explanation: the following commands setup the sub interfaces to allow for two types of encapsulation:interface ethernet 0.1 ipx encapsulation novell-ether ipx network 9e interface ethernet0.2 ipx encapsulation sap ipx network 6c. | |
| 181. |
What does the “IPX maximum-paths 2” command accomplish? |
| A. | it enables load sharing on 2 paths if the paths are equal metric paths |
| B. | it sets up routing to go to network 2 |
| C. | it is the default for cisco ipx load sharing |
| D. | it enables load sharing on 2 paths if the paths are unequal metric paths |
| Answer» A. it enables load sharing on 2 paths if the paths are equal metric paths | |
| Explanation: it enables load sharing on 2 paths if the paths are equal metric paths. the default is 1 path and the maximum is 512 paths. the value must always be greater than 1 and must be a natural number. | |
| 182. |
You want to enable both arpa and snap encapsulation on one router interface. How do you do this? |
| A. | the interface can handle multiple encapsulation types with no extra configuration |
| B. | assign two network numbers, one for each encapsulation type |
| C. | enable novell-ether to run multiple encapsulation types |
| D. | both arpa and snap are enabled by default so you don’t have to configure anything |
| Answer» B. assign two network numbers, one for each encapsulation type | |
| Explanation: to assign multiple network numbers, you usually use sub interfaces. a sample configuration follows: ipxethernet | |
| 183. |
By default, Cisco routers forward GNS SAPs to remote networks. |
| A. | false |
| B. | true |
| Answer» A. false | |
| Explanation: gns is novell’s protocol to get nearest server. if there is a server on the local network,that server will respond. if there isn’t, the cisco router has to be configured to forward thegns sap. | |
| 184. |
To prevent Service Advertisements (SAPs) from flooding a network, Cisco routers do not forward them. How are services advertised to other networks? |
| A. | each router builds its own sap table and forwards that every 60 seconds |
| B. | each router assigns a service number and broadcasts that |
| C. | saps aren’t necessary with cisco routers |
| D. | cisco routers filter out all saps |
| Answer» A. each router builds its own sap table and forwards that every 60 seconds | |
| Explanation: cisco routers build sap tables and forward the table every 60 seconds. all saps can’t befiltered even with 4.x since nds and time synchronization uses saps. | |
| 185. |
Novell’s implementation of RIP updates routing tables every seconds. |
| A. | 60 |
| B. | 90 |
| C. | 10 |
| D. | 30 |
| Answer» A. 60 | |
| Explanation: novell’s rip updates routing tables every 60 seconds, apple’s rtmp is every 10 seconds, routers arp every 60 seconds, igrp signal every 90 seconds, and banyan vines signals every 90 seconds. | |
| 186. |
In Novell’s use of RIP, there are two metrics used to make routing decisions. Select the correct metrics. |
| A. | ticks & hops |
| B. | hops & loops |
| C. | loops & counts |
| D. | counts & ticks |
| Answer» A. ticks & hops | |
| Explanation: it first uses ticks (which is about 1/18 sec.); if there is a tie, it uses hops; if hops are equal, then it uses an administratively assigned tiebreaker. | |
| 187. |
The term that is used to place packet in its route to its destination is called |
| A. | delayed |
| B. | urgent |
| C. | forwarding |
| D. | delivering |
| Answer» C. forwarding | |
| Explanation: forwarding is done by the nodes in the path from source to destination, that are not the intended destination for the packet in order to pass the packet to the next node in the path. the destination machine does not forward the packet to any other node. | |
| 188. |
A second technique to reduce routing table and simplify searching process is called |
| A. | network-specific method |
| B. | network-specific motion |
| C. | network-specific maintaining |
| D. | network-specific membership |
| Answer» A. network-specific method | |
| Explanation: in the network specific forwarding method, there is only one record, the destination of the packet, in the routing table and not the other hosts of the network. the other two forwarding methods are the default method and the next-hop method. | |
| 189. |
Next-Hop Method is used to reduce contents of a |
| A. | revolving table |
| B. | rotating table |
| C. | routing table |
| D. | re-allocate table |
| Answer» C. routing table | |
| Explanation: in the next-hop forwarding method, the routing table of each router in the path contains the address of only the next hop in the path of packet. this method is suitable for short distances only. | |
| 190. |
In Unicast routing, if instability is between three nodes, stability cannot be |
| A. | stable |
| B. | reversed |
| C. | guaranteed |
| D. | forward |
| Answer» C. guaranteed | |
| Explanation: in unicast routing, there is only sender and one receiver. so, if there is instability between three nodes, in which one is sender, one is receiver and one is the router in the path, there is no other path available for the packet and the stability of the network is not guaranteed. | |
| 191. |
RPF stands for |
| A. | reverse path forwarding |
| B. | reverse path failure |
| C. | reverse packet forwarding |
| D. | reverse protocol failure |
| Answer» A. reverse path forwarding | |
| Explanation: reverse path forwarding is a loop-free forwarding method for multi-cast routing in modern systems. the method focuses on forwarding the packet away from the source ip in each iteration to make sure there is no loops. | |
| 192. |
LSP stands for |
| A. | link stable packet |
| B. | link state packet |
| C. | link state protocol |
| D. | link state path |
| Answer» B. link state packet | |
| Explanation: a link state packet is a packet created by a router that lists its neighboring nodes and routers in link state routing protocol. it is shared with other routers to find the shortest path from a source to the destination. | |
| 193. |
Protocol is a set of |
| A. | formats |
| B. | procedures |
| C. | formats & procedures |
| D. | none of the mentioned |
| Answer» C. formats & procedures | |
| Explanation: protocol is a set of procedures and formats that entities use to communicate information. | |
| 194. |
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» D. security | |
| Explanation: the size of the routing table in the technique must be manageable for the network nodes i.e. it must not be too big. | |
| 195. |
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» B. security measures | |
| Explanation: in host-specific routing, the | |
| 196. |
In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a |
| A. | graph |
| B. | tree |
| C. | network |
| D. | link |
| Answer» A. graph | |
| Explanation: the djikstra’s shortest path algorithm is the fastest among the algorithms for finding the shortest path in a graph. but it is a greedy method based algorithm so it does not guarantee the shortest path every time. | |
| 197. |
In Multicast Routing Protocol, flooding is used to broadcast packets but it creates |
| A. | gaps |
| B. | loops |
| C. | holes |
| D. | links |
| Answer» B. loops | |
| Explanation: in multicast routing, there is one sender and many receivers. so flooding is | |
| 198. |
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» C. dijkstra’s algorithm | |
| Explanation: shortest path in ospf is usually computed by dijkstra’s algorithm. it was proposed by edsger w. dijkstra in the year 1956. it is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast. | |
| 199. |
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» A. support for fixed-length subnetting by including the subnet mask in the routing message | |
| Explanation: ospf provides support for variable-length sunbathing by including the subnet mask in the routing message. for fixed length subnets, there is no requirement for including the subnet mask in the routing message as there is just one subnet mask for all the subnets. | |
| 200. |
In OSPF, which protocol is used to discover neighbour routers automatically? |
| A. | link state protocol |
| B. | error-correction protocol |
| C. | routing information protocol |
| D. | hello protocol |
| Answer» D. hello protocol | |
| Explanation: hello protocol is used to discover neighboring routers automatically. it makes sure that the communication between neighbors is bidirectional. it’s similar to the real world moral construct of saying “hello” to initialize the communication. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.