You are on page 1of 4


1. The Information required by the fragmentation technique: a. Data Unit Identifier b. QOS bits c. Priority bits 2.Which one is true about Internet Protocol: a. It is a Dynamic protocol. b. It is connection oriented. c.provides the best effort delivery services to the layers below it. d. NOT

3.tick the correct one about total length field of IP Packet: a. The size of total length field is 16 bits and it represents the length of the data portion in an IP packet. b. it represents total length of IP datagram in 32 bit words. c. the size of the field is 12 bits. d. NOT 4.tick the correct one: 1. PING tells you how long it takes to get to destination. 2. TELNET allows you to log on to remote host. 3.FINGER tells you who is logged on. 4.LOOK command tells about the information of the neighbours of a node. a.only 1&2 b.only 1,2 &3 c.all 5.OSPF and BGP are: a. Interiour Gateway Protocols. b.Exteriour Gateway Protocols. c.OSPF is interiour and BGP is exteriour. d.OSPF is Exteriour and BGP is interiour. 6.Tick the correct one: a.Leaky bucket algorithm never discard the packets. b.token bucket algorithm discard the packets when the bucket is full. c.In leaky bucket, o/p depends upon the burstiness of the input. d.NOT 7. A routing protocol is run in a datagram network ? a.Only When a link cost changes b.When the first packet of a new connection arrives at the first router c.When a packet arrives at the network and has to be sent to the next d.NOT 8. Maximum payload which can be carried by an IPv4 datagram is, ? a. 65495 bytes b. 65515 bytes c. 65475 bytes d. 65535 bytes

Reporting c. ? a.physical layer c.which protocol at the network layer does the host use: a.Both bridge and router selectively forward data packets. ALL e. True b.Both A and B .NOT 13.Which of the following is not TRUE with respect to a transparent bridge and a router? ? a. session layer 16.A router can connect between a LAN and a WAN d. Which of the following is a function of e-mail system ? a.Which layer functions as liaison between user support layers and network support layers ? a.with each user session c. Transfer b.Adaptive or dynamic directory used in packet routing changes ? a.NOT layer b.Consider congestion control in TCP.A Bridge builds its routing tables by inspecting incoming packets.NOT 15. Composition d.which protocol in the IP suite is used to tell neighbour routers: a. If a router interface is congested. Perl c. Java d. c. b.BIND c.within each user session b.ICMP b.9.IPX d.NOT 12. When the timer expires at the sender. False 10.If a host broadcasts a frame that includes a source and destination h/w address and its purpose is to assign IP address to itself. the threshold is set to one half of the congestion window.NOT 14. C b.PCP c.transport layer d.ICMP b.REGENRATE e.SLOW system generation times only d. ICMP ping can NOT be written in ? a.

c.0: a. unknown or non applicable target.Tick the correct one: a. b.NOT SECTION 3: +2/NOT 24. c.NOT 23.What is the main function of transport layer ? 1.Both A and B d.ARP c.11 b: .the main disadvantage of distance vector routing algorithm is that it chooses a shortest path which is locally optimal but somtimes it may not leads to global optima.Flooding algorithms are adaptive algorithms.Flow control 18.both d.UDP d. Switches b. Proxy Servers c.17.which protocol works at transport layer and provides a virtual circuit b/w hosts: a non-routable meta-address. b. Write down the use of the IP address with a proper network number and all 1's in host field: 25:what is the bandwidth and data rate of WLAN 802.128-190 c. Explicit Congestion Notification (ECN) is done in ? a.1-126 b.Transparent b. Which of the following is a type of fragmentation ? a. the IP address 0.NOT 22.NOT 21. Gateways d.process to process message delivery 3.192-219 d.used to designate an invalid.Non transparent c.None of these SECTION 2: +2/-2 19. d.node to node delivery 2.Error control 4.what is the range of the addresses in the first octets of class B network addresses: a.IP b. Shortest path routing can use a greedy algorithm to find shortest paths.0.NOT 20.0.