GATE CSE 2010 | Network Layer Question 29 | Computer Networks

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best explains the need for this field?

It can be used to prioritize packets

It can be used to reduce delays

It can be used to optimize throughput

It can be used to prevent packet looping

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

For which one of the following reasons does Internet Protocol (IP) use the time-to-live (TTL) field in the IP datagram header?

Ensure packets reach destination within that time

Discard packets that reach later than that time

Prevent packets from looping indefinitely

Limit the time for which a packet gets queued in intermediate routers.

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

The address resolution protocol (ARP) is used for

Finding the IP address from the DNS

Finding the IP address of the default gateway

Finding the IP address that corresponds to a MAC address

Finding the MAC address that corresponds to an IP address

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be

255.255.0.0

255.255.64.0

255.255.128.0

255.255.252.0

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory