ExamSIDE (Powered by ExamGOAL)
Questions
NEXT
1
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0.33

Consider routing table of an organization's router shown below:

Subnet number Subnet mask Next hop
12.20.164.0 255.255.252.0 R1
12.20.170.0 255.255.254.0 R2
12.20.168.0 255.255.254.0 Interface 0
12.20.166.0 255.255.254.0 Interface 1
default R3

Which of the following prefixes in CIDR notation can be collectively used to correctly aggregate all of the subnets in the routing table?

A
12.20.164.0/20
B
12.20.164.0/22
C
12.20.164.0/21
D
12.20.168.0/22
2
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.
3
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 3 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
4
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
The protocol data unit (PDU) for the application layer in the Internet stack is
A
Segment
B
Datagram
C
Message
D
Frame
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
K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits
Database Management System
Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability 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 Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12