Description : . In _______ routing, the least cost routebetween any two nodes is theroute with the minimum distance. A) path vector B) distancevector C) link state D) none of the above
Last Answer : distancevector
Description : The Multicast Open Shortest Path First (MOSPF)protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is basedon _______ routing. A) distancevector B) link state C) path vector D) none of the above
Last Answer : link state
Description : The Open Shortest Path First (OSPF)protocol is an intradomain routing protocolbased on _______ routing. A) distancevector B) link state C) path vector D) none of the above
Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above
Description : The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing. A) distancevector B) link state C) path vector D) none of the above
Description : In ________ routing, we assume that there is one node (or more) ineach autonomous system that acts on behalf of the entire autonomous system. A) distant vector B) path vector C) link state D) none of the above
Last Answer : path vector
Description : In distance vector routing,each node periodically shares its routing table with_________ and whenever there is achange. A) every other node B) its immediate neighbors C) one neighbor D) none of the above
Last Answer : its immediate neighbors
Description : 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
Last Answer : d. all of the mentioned
Description : ________ is an interdomain routingprotocol using path vector routing. A) BGP B) RIP C) OSPF D) none of the above
Last Answer : BGP
Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table
Last Answer : (C) Super block
Description : Data link control deals withthe design and procedures for ______communication. A) node-to-node B) host-to-host C) process-to-process D) none of the above
Last Answer : node-to-node
Description : Explain distance vector routing and link state routing
Last Answer : Distance vector routing _ Sharing information _ Routing table _ Creating the table _ Updating the table _ Updating algorithm
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
Description : Network layer at source is responsible for creating a packet from data coming from another ________ a) Station b) Link c) Node d) Protocol
Last Answer : d) Protocol
Description : A _______is the optical link connecting two neighbor devices. A) section B) line C) path D) none of the above
Last Answer : line
Description : Which of the following statements is correct for the use of packet switching? A. the subdivision of information into individuallyaddressed packets in conjunction with alternativerouting arrangementenabled the transmission path ... capacity could be achieved. D. All of theabove E. None of the above
Last Answer : All of theabove
Description : Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a ……… A. Static , routing table B. Dynamic, look-up table C. Dynamic, routing table D. Static, look-up table
Last Answer : C. Dynamic, routing table
Description : The ____ layer establishes, maintains, and synchronizes the interaction between communicating systems. a. network b. transport c. session d. presentation
Last Answer : c. session
Description : A ________ switch combines crossbar switches inseveral (normally three) stages. A) multistage B) multiple crossbar C) multiple path D) none of the above
Last Answer : multistag
Description : In multicast routing, eachinvolvedrouter needs toconstructa ________ path tree for each group. A) average B) longest C) shortest D) none of the above
Last Answer : shortest
Description : In OSPF, a ________ link is a network is connectedto only one router. A) point-to-point B) transient C) stub D) none of the above
Last Answer : stub
Description : In OSPF, a ________ link connects two routers without anyother host or router in between. A) point-to-point B) transient C) stub D) none of the above
Last Answer : point-to-point
Description : The routing processor of arouter performs the ________ layer functions of therouter. A) physical and data link B) network C) transport D) none of the above
Last Answer : network
Description : The inputand output portsof a router perform the ________ layer functions of therouter. A) physical and data link B) network C) transport D) none of the above
Last Answer : physical and data link
Description : In a ________ connection, three or more devices share a link. A) multipoint B) point-to-point C) (a) and(b) D) none of the above
Last Answer : multipoint
Description : Automatic repeat request error management mechanism is provided by ________ a. logical link control sublayer b. media access control sublayer c. network interface control sublayer d. application access control sublayer
Last Answer : a. logical link control sublayer
Description : Automatic repeat request error management mechanism is provided by ________ A. logical link control sublayer B. media access control sublayer C. network interface control sublayer D. application access control sublayer
Last Answer : A. logical link control sublayer
Description : HTTP is ________ protocol. a) application layer b) transport layer c) network layer d) data link layer
Last Answer : a) application layer
Description : Three or more devices share a link in ________ connection. a) Unipoint b) Multipoint c) Point to point d) Simplex
Last Answer : b) Multipoint
Description : In unicast routing,each router in the domain has a table thatdefines a______ path tree to possible destinations. A) average B) longest C) shortest D) none of the above
Description : A streamline is (A) The line connecting the mid-points of flow cross-sections (B) Defined for uniform flow only (C) Drawn normal to the velocity vector at every point (D) Always the path of a particle
Last Answer : (C) Drawn normal to the velocity vector at every point
Description : A stream line is (A) Fixed in space in steady flow (B) Always the path of particle (C) Drawn normal to the velocity vector at every point (D) A line connecting the mid points of flow cross-section
Last Answer : (A) Fixed in space in steady flow
Description : What is the minimum number of wires needed to send data over a serial communication link layer? a. 1 b. 2 c. 4 d. 6 e. none of above
Last Answer : 2
Description : The minimum frame size required for a CSMA/CD based computer network running at 1 Gbps on a 200m cable with a link speed of 2 × 108m/s is a. 125 bytes b. 250 bytes c. 500 bytes d. None of these
Last Answer : b. 250 bytes
Description : The translation distances (dx, dy) is called as a.Translation vector b.Shift vector c.Both a and b d.Neither a nor b
Last Answer : c.Both a and b
Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack
Last Answer : (C) Scheduling parameters
Description : The principle of ________ states that the routing table is sorted from the longest mask to the shortest mask. A) first mask matching B) shortest mask matching C) longest mask matching D) none of the above
Last Answer : longest mask matching
Description : The idea of address aggregation wasdesigned to alleviate theincreasein routing table entries when using ________. A) classful addressing B) classless addressing C) both a and b D) none of the above
Last Answer : classless addressing
Description : To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1
Last Answer : d. 2t+1
Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1
Last Answer : (C) t-1, 2t-1
Description : Type of transmission path that permits communication in the frequency range from 30 to 60 MHz and over distances form about 1000 to 2000 km. A. Ducting B. Ionospheric scatter C. Microwave D. Troposcatter
Last Answer : B. Ionospheric scatter
Description : A spanningtree is agraph in which there is no_____. A) node B) branch C) loop D) arc
Last Answer : loop
Description : Another name for the cable TV office is the _______. A) splitter B) fiber node C) combiner D) head end
Last Answer : head end
Description : What is the name of the network topology in which there are bi- directional links between eachpossible node? A) Ring B) Star C) Tree D) Mesh
Last Answer : D) Mesh
Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables
Last Answer : B) End to end delivery
Description : Transport layer protocols deals with _____ a. application to application communication b. process to process communication c. node to node communication d. man to man communication
Last Answer : b. process to process communication
Description : A _____ is a TCP name for a transport service access point. a. port b. pipe c. node d. protocol
Last Answer : a. port
Description : Which form of byte assigning strategy is adopted in class B type of network corresponding to IP addresses? a. Network.Node.Node.Node b. Network.Network.Node.Node c. Network.Network.Network.Node d. Network.Node.Node.Node
Last Answer : b. Network.Network.Node.Node