Quiz  /  Computer Networks MCQ Questions and Answers

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

  • all packets will suffer
  • only those packets which are queued in the router at that time will suffer
  • only those packets which are not queued in the router at that time will suffer
  • no packets will suffer

  • 2. 
    In datagram subnet new route is chosen …………………

  • for every packet sent
  • for all the packet sent
  • only for the first packet
  • for the packet which is not transmitted

  • 3. 
    Which type of switching uses the entire capacity of a dedicated link?

  • circuit switching
  • datagram packet switching
  • virtual circuit packet switching
  • message switching

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

  • circuit switching
  • message switching
  • virtual approach to packet switching
  • datagram approach to packet switching

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

  • circuit switching
  • message switching
  • virtual approach to packet switching
  • datagram approach to packet switching

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

  • only from local environment
  • only from adjacent routers
  • from locally, adjacent, external routers
  • only from external routers

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

  • router changes
  • topology changes
  • user changes
  • transmission time does not change

  • 8. 
    …………….. change their routing decisions to reflect changes in the topology.

  • Nonadaptive algorithms
  • Adaptive algorithms
  • Static algorithms
  • Recursive algorithms

  • 9. 
    ……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.

  • Non adaptive algorithms
  • Adaptive algorithms
  • Static algorithms
  • Recursive algorithms

  • 10. 
    In distributed applications, it is sometimes necessary to update all the databases concurrently, we use …………………..

  • Shortest path first
  • First come first serve
  • Forwarding
  • Flooding

  • 11. 
    In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require ………………..

  • n pruned spanning trees must be stored for a total of mn trees
  • m pruned spanning trees must be stored for a total of m trees
  • n pruned spanning trees must be stored for a total of n trees
  • m pruned spanning trees must be stored for a total of mn trees

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

  • preferred input line , estimated time
  • preferred input line, estimated distance
  • preferred output line, estimated time
  • preferred output line, router

  • 13. 
    In distance vector routing algorithm, the routing tables are updated …………………

  • by exchanging information with the neighbours
  • automatically
  • using the backup database
  • by the server

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

  • only when the network is established
  • in middle of the transmission
  • when there is a need for route by the host
  • when there is no need for route by the host

  • 15. 
    What is the routing algorithm used in MANETs?

  • Shortest Path First
  • Routing Information Protocol
  • Distance Vector Protocol
  • Ad hoc On -demand Distance Vector Protocol

  • 16. 
    Why probe packets are transmitted in the network?

  • to know about the capacity of the channel
  • to count the number of host in the network
  • to know about efficiency of the routing algorithm
  • to know about the congestion

  • 17. 
    The solution to decrease the load on the network when congestion occurs is ……………..

  • splitting the traffic over multiple routes
  • increasing the transmission power
  • usage of spare routers
  • denying service to the users

  • 18. 
    In open loop congestion control techniques, the decisions are based on the ……………

  • without regard to the current state of the network
  • with regard to the current state of the network
  • with regard to the choice of the host
  • without regard to the choice of the host

  • 19. 
    In closed loop congestion control techniques, the decisions are based on the ……………..

  • concept of a feedback loop
  • concept of a forward loop
  • concept of current state of network
  • None of these

  • 20. 
    What is it goal of congestion control?

  • making sure that subnet is not able to carry the offered traffic
  • making sure that subnet will allow more than the offered packets
  • making sure that subnet is able to carry the offered traffic
  • making sure that subnet will not allow any traffic

  • 21. 
    The service of open loop congestion control technique is …………………..

  • monitor the system to detect when and where congestion occurs
  • when to accept new traffic
  • pass the information to places where action can be taken
  • adjusting the system to correct the problem

  • 22. 
    In transport layer, End to End delivery is the movement of data from ……………….

  • one station to the next station
  • one network to the other network
  • source to destination
  • one router to another router

  • 23. 
    The service of closed loop congestion control technique is ………………

  • when to accept new traffic
  • when to discard the packets
  • monitor the system to detect when and where congestion occurs
  • which packets to discard

  • 24. 
    The solution to increase the capacity when congestion occurs is …………………

  • denying service to the users
  • degrading the service to the users
  • splitting traffic over multiple routes
  • rescheduled the demands of the users

  • 25. 
    When the source host receives the choke packet, then the source ………………

  • reduces the capacity of the line
  • reduces the line utilization factor
  • reduces the traffic generation
  • rate reduces the threshold value

  • 26. 
    Which of the following is required to communicate between two computers?

  • communications software
  • protocol
  • communication hardware
  • all of above including access to transmission medium

  • 27. 
    Terminals are required for ……………..

  • real-time, batch processing & time-sharing
  • real time, time-sharing & distributed message processing
  • real time, distributed processing & manager inquiry
  • real-time, time sharing & message switching

  • 28. 
    In ………………… each packet of a message need not follow the same path From sender to receiver.

  • Circuit switching
  • message switching
  • a virtual approach to packet switching
  • The datagram approach to packet switching
Report Question
warning
access_time
  Time