ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
In an Ethernet local area network, which one of the following statements is TRUE?
A
A station stops to sense the channel once it starts transmitting a frame.
B
The purpose of the jamming signal is to pad the frames that are smaller than the minimum frame size.
C
A station continues to transmit the packet even after the collision is detected.
D
The exponential backoff mechanism reduces the probability of collision on retransmissions.
2
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits second) over a 1 km(kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?
A
8000
B
10000
C
16000
D
20000
3
GATE CSE 2014 Set 2
Numerical
+1
-0
In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each ISP and across the two ISPs, are all point-to-point’ optical links. The initial value of the TTL field is 32. The maximum possible value of the TTL field when R receives the datagram is ____________. GATE CSE 2014 Set 2 Computer Networks - Lan Technologies and Wi-Fi Question 16 English
Your input ____
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
In Ethernet when Manchester encoding is used, the bit rate is:
A
Half the baud rate.
B
Twice the baud rate.
C
Same as the baud rate.
D
None of the above
PREVIOUS 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 Dynamic Programming P and NP Concepts
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems 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 AdvancedMHT CETBITSATCOMEDKWB JEEKCETVITEEEAP EAPCETTS EAMCETIAT (IISER)
Medical
NEETAIIMSMHT CET (Biology)
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