Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged bridges
1
vote
1
answer
1
NIELIT 2017 July Scientist B (IT) - Section B: 6
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph? $(a,b), (e,f)$ $(a,b), (a,c)$ $(c,d), (d,h)$ $(a,b)$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
611
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
bridges
0
votes
4
answers
2
NIELIT 2017 July Scientist B (CS) - Section B: 11
Consider the following graph $L$ and find the bridges,if any. No bridge $\{d,e\}$ $\{c,d\}$ $\{c,d\}$ and $\{c,f\}$
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
868
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
bridges
0
votes
1
answer
3
previous year
a bridge builds up its routing table by inspecting incoming packets..plz explain...
Rudra Pratap
asked
in
Computer Networks
Dec 6, 2017
by
Rudra Pratap
186
views
bridges
0
votes
2
answers
4
UGC NET CSE | December 2008 | Part 2 | Question: 36
A conventional $LAN$ bridge specifies only the functions of $OSI$ : layers 1 and 2 layers 1 through 3 all layers none of the above
rishu_darkshadow
asked
in
Computer Networks
Sep 26, 2017
by
rishu_darkshadow
720
views
ugcnetcse-dec2008-paper2
computer-networks
osi-model
bridges
0
votes
1
answer
5
Consider the following graph L and find the bridges, if any
A) No bridge B) {d, e} C) {c, d} D) {c, d} and {c, f}
habedo007
asked
in
DS
Aug 18, 2017
by
habedo007
1.8k
views
graph-theory
bridges
21
votes
1
answer
6
GATE CSE 2006 | Question: 83
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least ...
go_editor
asked
in
Computer Networks
Nov 7, 2016
by
go_editor
5.8k
views
gatecse-2006
computer-networks
bridges
normal
50
votes
5
answers
7
GATE CSE 2006 | Question: 82
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
Rucha Shelke
asked
in
Computer Networks
Sep 26, 2014
by
Rucha Shelke
18.5k
views
gatecse-2006
computer-networks
bridges
normal
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent questions tagged bridges
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...