ExamSIDE (Powered by ExamGOAL)
Questions
NEXT
1
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Consider the following statements :

(i) Address Resolution Protocol (ARP) provides a mapping from an IP address to the corresponding hardware (link-layer) address.

(ii) A single TCP segment from a sender $S$ to a receiver $R$ cannot carry both data from $S$ to $R$ and acknowledgement for a segment from $R$ to $S$.

Which ONE of the following is CORRECT?

A
Both (i) and (ii) are TRUE
B
(i) is TRUE and (ii) is FALSE
C
(i) is FALSE and (ii) is TRUE
D
Both (i) and (ii) are FALSE
2
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Identify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown.

OSI Layers Functionalities
(a) Network layer (I) Packet routing
(b) Transport layer (II) Framing and error handling
(c) Datalink layer (III) Host to host communication

A
(a)-(I), (b)-(II), (c)-(III)
B
(a)-(I), (b)-(III), (c)-(II)
C
(a)-(II), (b)-(I), (c)-(III)
D
(a)-(III), (b)-(II), (c)-(I)
3
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
A
Network layer and Routing.
B
Transport layer and End-to-end process communication.
C
Data Link Layer and Bit synchronization.
D
Medium Access Control sub-layer and Channel sharing.
4
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D. GATE CSE 2013 Computer Networks - Concepts of Layering Question 6 English
A
Network layer – 4 times and Data link layer – 4 times
B
Network layer – 4 times and Data link layer – 3 times
C
Network layer – 4 times and Data link layer – 6 times
D
Network layer – 2 times and Data link layer – 6 times
NEXT
GATE CSE Subjects
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
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 Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCETTS EAMCET
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12