MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 113 Mcqs, each offering curated multiple-choice questions to sharpen your Bachelor of Sc in Information Technology knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The …………….. of A TSI controls the order of delivering of slot values that are stored in RAM. |
| A. | cross bar |
| Answer» E. | |
| 2. |
In a time division switch, a ……………… governs the destination of a packet stored in RAM. |
| A. | tdm bus |
| Answer» E. | |
| 3. |
The PSTN is an example of …………….. network. |
| A. | packet-switched |
| B. | circuit-switched |
| C. | message-switched |
| Answer» C. message-switched | |
| 4. |
A repeater takes a weakened or corrupted signal and …………… it. |
| A. | amplifies |
| B. | regenerates |
| C. | resample |
| Answer» C. resample | |
| 5. |
Source routing bridges in the same LANs must have …………… bridge Number. |
| A. | same |
| B. | different |
| C. | source |
| Answer» C. source | |
| 6. |
The DNS name space is divided into non overlapping …………………. |
| A. | regions |
| Answer» E. | |
| 7. |
In ………………. transmission, the channel capacity is shared by both communicating devices at all times. |
| A. | simplex |
| B. | half-duplex |
| C. | full-duplex |
| Answer» D. | |
| 8. |
The address field of a frame in HDLC protocol contains the address of the ……………… station. |
| A. | primary |
| B. | secondary |
| C. | tertiary |
| Answer» C. tertiary | |
| 9. |
FDDI is an acronym for …………… |
| A. | fast data delivery interface |
| B. | fiber distributed data interface |
| C. | fiber distributed digital interface |
| Answer» C. fiber distributed digital interface | |
| 10. |
In ………………… each packet of a message need not follow the same path From sender to receiver. |
| A. | circuit switching |
| Answer» E. | |
| 11. |
LANs can be connected by a device called …………….. |
| A. | routers |
| Answer» E. | |
| 12. |
Sending of a IP packet from host 1 to host 2 where both are of same LAN but the packet is transferred through different intermediate LANs is called ……………… |
| A. | tunnelling |
| B. | routing |
| C. | diverting |
| Answer» B. routing | |
| 13. |
The first collision free protocol is ………………. |
| A. | binary countdown |
| B. | basic bitmap |
| C. | reservation protocol |
| Answer» C. reservation protocol | |
| 14. |
Terminals are required for …………….. |
| A. | real-time, batch processing & time-sharing |
| Answer» E. | |
| 15. |
For applications such as audio and video streaming, the variation in the packet arrival times is called …………….. |
| A. | random early detection |
| B. | jitter |
| C. | delay difference |
| Answer» C. delay difference | |
| 16. |
Flow control policy is implemented in …………………. |
| A. | network layer |
| B. | transport layer |
| C. | application layer |
| Answer» C. application layer | |
| 17. |
If the buffer fills and a packet segment is dropped, then dropping all the rest of the segments from that packet, since they will be useless anyway is called ……………….. |
| A. | priority dropping |
| B. | tail dropping |
| C. | age based dropping |
| Answer» C. age based dropping | |
| 18. |
When the source host receives the choke packet, then the source ……………… |
| A. | reduces the capacity of the line |
| B. | reduces the line utilization factor |
| C. | reduces the traffic generation |
| Answer» D. | |
| 19. |
Upon receipt of a bad segment, UDP ………….. |
| A. | it does flow control |
| Answer» E. | |
| 20. |
When routers are being inundated by packets that they cannot handle, they just throw them away is known as ………………. |
| A. | jitter control |
| Answer» E. | |
| 21. |
The solution to increase the capacity when congestion occurs is ………………… |
| A. | denying service to the users |
| B. | degrading the service to the users |
| C. | splitting traffic over multiple routes |
| Answer» D. | |
| 22. |
The service of closed loop congestion control technique is ……………… |
| A. | when to accept new traffic |
| B. | when to discard the packets |
| C. | monitor the system to detect when and where congestion occurs |
| Answer» D. | |
| 23. |
In transport layer, End to End delivery is the movement of data from ………………. |
| A. | one station to the next station |
| B. | one network to the other network |
| C. | source to destination |
| Answer» D. | |
| 24. |
In …………… case higher bandwidth can be achieved. |
| A. | connectionless networks |
| B. | connection oriented networks |
| C. | virtual circuit networks |
| Answer» B. connection oriented networks | |
| 25. |
The service of open loop congestion control technique is ………………….. |
| A. | monitor the system to detect when and where congestion occurs |
| B. | when to accept new traffic |
| C. | pass the information to places where action can be taken |
| Answer» C. pass the information to places where action can be taken | |
| 26. |
When too many packets are present in the subnet, and performance degrades then it leads to ……………….. |
| A. | ingestion |
| B. | congestion |
| C. | digestion |
| Answer» C. digestion | |
| 27. |
..………..is used to validate the identity of the message sender to the recipient |
| A. | encryption |
| B. | decryption |
| C. | digital certificate |
| Answer» D. | |
| 28. |
In closed loop congestion control techniques, the decisions are based on the …………….. |
| A. | concept of a feedback loop |
| B. | concept of a forward loop |
| C. | concept of current state of network |
| Answer» B. concept of a forward loop | |
| 29. |
In open loop congestion control techniques, the decisions are based on the …………… |
| A. | without regard to the current state of the network |
| B. | with regard to the current state of the network |
| C. | with regard to the choice of the host |
| Answer» B. with regard to the current state of the network | |
| 30. |
The solution to decrease the load on the network when congestion occurs is …………….. |
| A. | splitting the traffic over multiple routes |
| Answer» E. | |
| 31. |
Packet discard policy is implemented in …………….. |
| A. | physical layer |
| Answer» E. | |
| 32. |
What is the routing algorithm used in MANETs? |
| A. | shortest path first |
| Answer» E. | |
| 33. |
The hosts who compute on the run and want to maintain their connections as they move around …………… |
| A. | migratory hosts |
| B. | stationary hosts |
| C. | mobile hosts |
| Answer» D. | |
| 34. |
The hosts which are basically stationary hosts who move from one fixed site to another from time to time but use the network only when they are physically connected to it are called ……………. |
| A. | migratory hosts |
| B. | stationary hosts |
| C. | mobile hosts |
| Answer» B. stationary hosts | |
| 35. |
The processes that keep track of all mobile hosts visiting the area is …………….. |
| A. | home agent |
| B. | mobile agent |
| C. | foreign agent |
| Answer» D. | |
| 36. |
In distance vector routing algorithm, the routing tables are updated ………………… |
| A. | by exchanging information with the neighbours |
| B. | automatically |
| C. | using the backup database |
| Answer» B. automatically | |
| 37. |
Sending a packet to all destinations simultaneously is called ………………. |
| A. | multicasting |
| Answer» E. | |
| 38. |
In ………………. to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree. |
| A. | core based trees |
| B. | avl trees |
| C. | binary trees |
| Answer» B. avl trees | |
| 39. |
To do multicast routing, each router computes a ………………… |
| A. | binary tree |
| B. | avl tree |
| C. | spanning tree |
| Answer» D. | |
| 40. |
In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require ……………….. |
| A. | n pruned spanning trees must be stored for a total of mn trees |
| Answer» E. | |
| 41. |
In distributed applications, it is sometimes necessary to update all the databases concurrently, we use ………………….. |
| A. | shortest path first |
| Answer» E. | |
| 42. |
If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as …………….. |
| A. | random flooding |
| B. | static flooding |
| C. | selective flooding |
| Answer» D. | |
| 43. |
The Clusters in Hierarchical routing are grouped in to ……………… |
| A. | clusters |
| B. | zones |
| C. | blocks |
| Answer» C. blocks | |
| 44. |
The regions in Hierarchical routing are grouped in to …………….. |
| A. | clusters |
| B. | zones |
| C. | blocks |
| Answer» B. zones | |
| 45. |
In Hierarchical routing, the routers are divided into what is called as …………….. |
| A. | zones |
| B. | cells |
| C. | regions |
| Answer» D. | |
| 46. |
The method of network routing where every possible path between transmitting and receiving DTE is used is called …………… |
| A. | random routing |
| B. | packet flooding |
| C. | directory routing |
| Answer» C. directory routing | |
| 47. |
……………. do not base their routing decisions on measurements or estimates of the current traffic and topology. |
| A. | non adaptive algorithms |
| B. | adaptive algorithms |
| C. | static algorithms |
| Answer» B. adaptive algorithms | |
| 48. |
If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ……………….. |
| A. | routing principle |
| B. | optimality principle |
| C. | sink tree principle |
| Answer» C. sink tree principle | |
| 49. |
…………….. change their routing decisions to reflect changes in the topology. |
| A. | nonadaptive algorithms |
| B. | adaptive algorithms |
| C. | static algorithms |
| Answer» C. static algorithms | |
| 50. |
If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as…………….. |
| A. | session routing |
| B. | circuit routing |
| C. | datagram routing |
| Answer» B. circuit routing | |