Explore topic-wise MCQs in Bachelor of Sc in Information Technology.

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.

51.

If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..

A. dynamic routing
B. session routing
C. temporary routing
Answer» B. session routing
52.

The router algorithm takes the decision to changes the route when ……………..

A. router changes
B. topology changes
C. user changes
Answer» C. user changes
53.

In Hierarchical routing for N router subnet, the optimal number of levels is …………..

A. logn
B. log(n -1)
C. lnn (
Answer» D.
54.

If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ……………….

A. dynamic routing
Answer» E.
55.

Adaptive routing algorithms get their information from ………….

A. only from local environment
B. only from adjacent routers
C. from locally, adjacent, external routers
Answer» D.
56.

The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as ……………..

A. binary tree (
B. sparse tree
C. sink tree
Answer» D.
57.

A permanent virtual circuit involves ……………..

A. connection establishment
B. data transfer
C. connection release
Answer» C. connection release
58.

In ………………, each packet of a message follows the same path from sender to receiver.

A. circuit switching
B. message switching
C. virtual approach to packet switching
Answer» B. message switching
59.

In ……………., each packet of a message need not follow the same path from sender to receiver.

A. circuit switching
Answer» E.
60.

For a connection oriented service, we need a ……………

A. virtual circuit subnet
B. short circuit subnet
C. datagram subnet
Answer» D.
61.

In datagram subnet new route is chosen …………………

A. for every packet sent
B. for all the packet sent
C. only for the first packet
Answer» B. for all the packet sent
62.

If a datagram router goes down then …………..

A. all packets will suffer
B. only those packets which are queued in the router at that time will suffer
C. only those packets which are not queued in the router at that time will suffer
Answer» C. only those packets which are not queued in the router at that time will suffer
63.

The PSTN is an example of …………….. network.

A. packet-switched
B. circuit-switched
C. message-switched
Answer» C. message-switched
64.

A repeater takes a weakened or corrupted signal and …………… it.

A. amplifies
B. regenerates
C. resample
Answer» C. resample
65.

Source routing bridges in the same LANs must have …………… bridge Number.

A. same
B. different
C. source
Answer» C. source
66.

In ………………. transmission, the channel capacity is shared by both communicating devices at all times.

A. simplex
B. half-duplex
C. full-duplex
Answer» D.
67.

The address field of a frame in HDLC protocol contains the address of the ……………… station.

A. primary
B. secondary
C. tertiary
Answer» C. tertiary
68.

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
69.

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
70.

The first collision free protocol is ……………….

A. binary countdown
B. basic bitmap
C. reservation protocol
Answer» C. reservation protocol
71.

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
72.

Flow control policy is implemented in ………………….

A. network layer
B. transport layer
C. application layer
Answer» C. application layer
73.

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
74.

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.
75.

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.
76.

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.
77.

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.
78.

In …………… case higher bandwidth can be achieved.

A. connectionless networks
B. connection oriented networks
C. virtual circuit networks
Answer» B. connection oriented networks
79.

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
80.

What is it goal of congestion control?

A. making sure that subnet is not able to carry the offered traffic
B. making sure that subnet will allow more than the offered packets
C. making sure that subnet is able to carry the offered traffic
Answer» D.
81.

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
82.

..………..is used to validate the identity of the message sender to the recipient

A. encryption
B. decryption
C. digital certificate
Answer» D.
83.

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
84.

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
85.

What is the type of network in which the routers themselves are mobile?

A. wide area network
B. mobile ad hoc network
C. mobile network
Answer» C. mobile network
86.

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.
87.

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
88.

The processes that keep track of all mobile hosts visiting the area is ……………..

A. home agent
B. mobile agent
C. foreign agent
Answer» D.
89.

In AODV routing algorithm for MANETs, the route is discovered at time

A. only when the network is established
B. in middle of the transmission
C. when there is a need for route by the host
Answer» D.
90.

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
91.

In distance vector routing algorithm, each router maintains a separate routing table with the following entries.

A. preferred input line , estimated time
B. preferred input line, estimated distance
C. preferred output line, estimated time
Answer» D.
92.

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
93.

To do multicast routing, each router computes a …………………

A. binary tree
B. avl tree
C. spanning tree
Answer» D.
94.

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.
95.

The Clusters in Hierarchical routing are grouped in to ………………

A. clusters
B. zones
C. blocks
Answer» C. blocks
96.

The regions in Hierarchical routing are grouped in to ……………..

A. clusters
B. zones
C. blocks
Answer» B. zones
97.

In Hierarchical routing, the routers are divided into what is called as ……………..

A. zones
B. cells
C. regions
Answer» D.
98.

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
99.

……………. 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
100.

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