computer network(self doubt)

Question

Please log in or register to answer this question.

Related questions

0 votes

0 answers

1

self doubt(computer network)
Q.1 how many crosspoints are needed if we use crossbar switch to connect 1000 telephones in small town.

asked Oct 7, 2018 in Computer Networks by BASANT KUMAR Active (2.2k points) | 26 views

0 votes

0 answers

2

Self doubt(Computer network security)

asked Apr 2, 2017 in Computer Networks by gabbar Junior (517 points) | 144 views

+2 votes

1 answer

3

Computer network doubt
Assume by transmitting packet using go back 5, every 4th packet is lost .number of Transmission required to transmit 10 packets.......

asked Dec 27, 2017 in Computer Networks by Surya Dhanraj Active (2.2k points) | 110 views

0 votes

1 answer

4

Doubt related to solving numerical questions in computer network
how to decide while solving questions whether we have to take the units in power of 2 or power of 10 when it came to bandwidth or data size?? every question follows different approach,I am confused

asked Jun 23, 2017 in Computer Networks by vamp_vaibhav Active (3.5k points) | 302 views

0 votes

0 answers

5

[Computer Network] Sliding window General doubt Tanenbaum p-333
To find an appropriate value for w we need to know how many frames can fit inside the channel as they propagate from sender to receiver. This capacity is determined by the bandwidth in bits/sec multiplied by the one- ... delay product means that time it takes first bit to reach receiver to the first frame to reach receiver?Please help

asked Jan 26, 2017 in Computer Networks by rahul sharma 5 Boss (24.3k points) | 250 views

0 votes

1 answer

6

self doubt-LONGEST MASK MATCHING-NETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??

asked Apr 4 in Computer Networks by Doraemon (179 points) | 23 views

0 votes

0 answers

7

Made Easy Test Series: Computer Network-Dijkstra Algo
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm ... costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?

asked May 14 in Computer Networks by srestha Veteran (111k points) | 39 views

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

computer network(self doubt)

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

Please log in or register to answer this question.

Related questions

Network Sites

computer network(self doubt)

Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof here

Please log in or register to answer this question.

Related questions

Network Sites

Recent Posts

Recent Blog Comments