Description : Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same ... outgoing packets; the route is determined only by the routing tables in the routers on the way
Last Answer : d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way
Description : 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
Last Answer : c. data is not sent by packets
Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above
Last Answer : hot potatorouting
Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets
Last Answer : Answer: 2
Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above
Last Answer : link state
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 : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above
Last Answer : (D) All of the above
Description : Consider a source computer(S) transmitting a file of size 106 bits to a destination computer (D)over a network of two routers (R1 and R2) and three links(L1, L2, and L3). L1connects S to R1; L2 connects R1 to ... file from S to D? a. 1005 ms b. 1010 ms c. 3000 ms d. 3003 ms Answer: Option(a)
Last Answer : a. 1005 ms
Description : Each IP address can identify the ………... or ………... of IP packets. A. source, destination B. length, size C. source, length D. Size , destination
Last Answer : A. source, destination
Description : A __________ is a device that forwards packets between networks by processing the routing information included in the packet. a) bridge b) firewall c) router d) hub
Last Answer : c) router
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
Description : Who provides counseling pre move destination information and welcome packets?
Last Answer : ACS
Description : For which one of the following reasons does Internet Protocol (IP) use the time-to- live (TTL) field in the IP datagram header? a. Ensure packets reach destination within that time b. ... packets from looping indefinitely d. Limit the time for which a packet gets queued in intermediate routers.
Last Answer : c. Prevent packets from looping indefinitely
Description : In TCP/IP Reference model, the job of ............... layer is to permit hosts to inject packets into any network and travel them independently to the destination. (A) Physical (B) Transport (C) Application (D) Host-to-network
Last Answer : Answer: Marks to all
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Last Answer : d) Mars Hover (Robot Navigation)
Description : The ______ layer is responsible for the movementof a signal from its optical source to its optical destination. A) section B) line C) path D) photonic
Last Answer : line
Description : An independent path is the one A. That is a complete path from source to destination node B. That is a path which introduces at least one new set of processing statements C. That is a path which introduces at most one new set of processing statements D. None of the above
Last Answer : B. That is a path which introduces at least one new set of processing statements
Description : The examples of Interior Gateway Protocols (IGP) are. i) Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii
Last Answer : B) i, and ii only
Description : Flooding is also a……... algorithm, usually generates ………... of duplicate packets. A. Static, vast number B. dynamic , vast number C. Static, less number D. dynamic , less number
Last Answer : A. Static, vast number
Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c
Last Answer : A. Flooding
Description : You are in charge of selecting the destination of Earth's first warp-capable interstellar probe. Which of these two planets do you choose?
Last Answer : Planet A is some weird conspiracy theory that has no basis in fact. So check that out.
Description : In _______forwarding, the full IP address of a destination isgiven in the routing table. A) next-hop B) network-specific C) host-specific D) default
Last Answer : host-specific
Description : Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm
Last Answer : a. Flow Control Policy
Description : 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
Last Answer : d. routing information protocol
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 : Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm
Last Answer : (A) Flow Control Policy
Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database
Last Answer : Answer: 3
Description : Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm
Last Answer : A : Dijkstra's Algorithm
Description : A node with in degree = 0 and out degree ¹ 0 is known as A. Source node B. Destination node C. Transfer node D. None of the above.
Last Answer : A. Source node
Description : The ________is a network layer Internet protocol that provides message packets to report errors and other information regarding IP packet processing back to the source: a) Internet Control Message ... Standard Flexible Message Protocol c) Internet Dynamic Chartered Message Protocol d) None of These
Last Answer : a) Internet Control Message Protocol
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 : Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B ... What is the optimal window size that A should use? a. 20 b. 40 c. 160 d. 320
Last Answer : b. 40
Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40
Last Answer : (2) 10
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 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 : ________ is an interdomain routingprotocol using path vector routing. A) BGP B) RIP C) OSPF D) none of the above
Last Answer : BGP
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 : 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 Information Protocol (RIP) is an intradomain routing based on _________ routing. A) distancevector B) link state C) path vector D) none of the above
Last Answer : distancevector
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
Description : Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii
Description : What is backup? 1) Adding more components to your network 2) Protecting data by copying it from the original source to a different destination 3) Filtering old data from the new data 4) Accessing data on tape 5) None of these
Last Answer : Answer :2
Description : Which of the following use routes with packet filtering rules to allow or deny access based on source address, destination address, or port number? 1) Application layer Firewall 2) Packet Filtering Firewall 3) Router enhanced firewall 4) IP enabled firewall
Last Answer : 2) Packet Filtering Firewall
Description : Which of the following use routes with packet filtering rules to allow or deny access based on source address, destination address, or port number? 1 Application layer Firewall 2 Packet Filtering Firewall 3 Router enhanced firewall 4 IP enabled firewall
Last Answer : 2 Packet Filtering Firewall
Description : In packet-filtering router, the following information can be external from the packet header. i) Source IP address ii) Destination IP address iii) TCP/UDP source port iv) ICMP message type v) TCP/UDP destination port A) i, ii, ... iv and v only C) ii, iii, iv and v only D) All i, ii, iii, iv and v
Last Answer : D) All i, ii, iii, iv and v
Description : Instructions and data can be stored in the memory of Computer for automatically directing the flow of operations. It is called _____ concept. (A) Objective Programming (B) Stored program (C) Both (A) and (B) (D) None of the Above
Last Answer : (B) Stored program
Description : In IPv6, the _______ field inthe baseheader and thesender IP address combineto indicate aunique path identifier for aspecific flow of data. A) flow label B) nextheader C) hoplimit D) destination IP address
Last Answer : flow label
Description : RPB creates a shortest path _______ tree from thesourceto each destination. A) unicast B) multicast C) broadcast D) none of the above
Last Answer : broadcast