# Recent questions and answers in Computer Networks

traceroot is a program in a server side program b. clint side program c . boath a and b none of the above
hi i want to ask that “network security” in computer networks is necessary for gate 2022 or not ? cause gate 2021 syllabus have not so can i do for sake of completing or left that topic. thank you
#Fragmentation How will a Datagram packet react (fragment or drop packet ) when it's Do not fragment is set true and the MTU of it's own network is less, is this case possible? Sender can fragment it's packet based on the MTU of Data link layer
Which of the following Access Control Method Is Probabilistic? A.Polling B.Contention C.Token Passing D.Sliding Window
An HTML form is to be designed to enable purchases of office stationery.Required items are to be selected(Checked).Credit card details are to be entered and then the submit button is to be pressed.Which of the following options would be appropriate for sending the data to the server? ... a way that is transparent to form design. A.Only GET B.Only POST C.Either GET or POST. D.Neither GET nor POST.
Prove that the reflection along the line y = x is equivalent to the reflection along the X axis followed by counter clockwise rotation by theta degrees, also find the value of theta.
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other users remain quiescent and don't ... data has been transmitted. Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
What is the range of IP addresses spanned by the CIDR address 192.168.10.0/20?
I was scrolling through sample questions when I chanced over this question. Consider a sliding window flow control protocol between hosts A and B. Suppose the link propagation delay is 1 time unit, the retransmission timeout is 3 time units, and the window size is ... the drops? I would really appreciate any help regarding this question. Also, can someone please leave a link to similar questions?
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender and reciever ... the entire window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
Do we have hdlc and ppp protocols(flow and error control) in syllabus?
does it generally happens that different hosts at different networks have same mac address or its just rare
Do we have Parity check in syllabus?
I have some conceptual doubts about MAC address why we need them when we have an IP address and routers know the IP address
If there are n bits available for subnet, how many sub-nets are possible ?
Do TCP packets with PSH flag set, which are immediately pushed to the Application layer arrive out of order?
If the bandwidth is 100 Mbps, round trip time is 50sec and the frame size is 25 bits. Calculate (i) Window size used in selective repeat ARQ. (ii) Number of sequence bits in selective repeat ARQ.
Finding Optimal Window Size In Slinding Window Protocol. Given Round trip time(RTT sec), Bandwidth(BW bits/sec), packet size(L bits), which approch is right? Approch 1. max data that can be sent in RTT = RTT * BW bits max window size = (RTT * BW)/L packets Apprach 2: ... size = (1 + 2a) packets; a=Tp/Tt Some problems are sloved with approch 1 and others with 2nd one. Which one should we use?
Is AIMD and slow start in congestion control are same. if not then why
A satellite communication example using a stop-and-wait-style ARQ. In this task, the goal is to change the protocol of the example using some sliding window method so that the sender is active at least 50% of the time instead of 3% of the example. 64 kbps, 1000 ... should the window size be at least if the sender's activity percentage (ratio of transmission time to total time) was at least 50%?
Which of the following is a list of packet switching characteristics? (a) Bandwidth divided, translation tables for routing, destination address (b) Bandwidth shared, queues at router,different path possible (c) Bandwidth divided, store and forward, good for bursty data (d) Bandwidth shared, low transmission delay routes may change
can a host simultaneously exist in two different network?
1 vote
Consider a file of 3MB that needs to be transmitted over a 1Gbps link with RTT of 80ms, What is the effective throughput? A)36.2 Mbps B)9.26Mbps C)9.9 Mbps D)28.85 Mbps
Maximum value of fragment offset in IP4
Consider the three-way handshake mechanism followed during $\text{TCP}$ connection establishment between hosts $P$ and $Q$. Let $X$ and $Y$ be two random $32$-bit starting sequence numbers chosen by $P$ and $Q$ respectively. Suppose $P$ sends a $\text{TCP}$ connection request message to $Q$ with a ... $\text{SEQ}$ number $=Y$, $\text{ACK}$ bit $=1$, $\text{ACK}$ number $=X$, $\text{FIN}$ bit $=0$
Consider the cyclic redundancy check $\text{(CRC)}$ based error detecting scheme having the generator polynomial $X^3+X+1$. Suppose the message $m_4m_3m_2m_1m_0=11000$ is to be transmitted. Check bits $c_2c_1c_0$ are appended at the end of the message by the ... bit string is denoted by $m_4m_3m_2m_1m_0c_2c_1c_0$. The value of the checkbit sequence $c_2c_1c_0$ is $101$ $110$ $100$ $111$
1 vote
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below. The objective is to find the shortest-cost path from the router $R$ to routers $P$ and $Q$. Assume that $R$ does not initially know the shortest routes ... for a packet from $R$ to $P$ is $Y$ The next hop router for a packet from $R$ to $Q$ is $Z$
Consider a network using the pure $\text{ALOHA}$ medium access control protocol, where each frame is of length $1,000$ bits. The channel transmission rate is $1$ Mbps ($=10^6$ bits per second). The aggregate number of transmissions across all ... as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ______________
1 vote
Consider the following two statements. $S_1$: Destination $\text{MAC}$ address of an $\text{ARP}$ reply is a broadcast address. $S_2$: Destination $\text{MAC}$ address of an $\text{ARP}$ request is a broadcast address. Which one of the following choices is correct? Both $S_1$ and $S_2$ are true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$ ... $0$ $x$ is $0$ and $y$ is $1$ $x$ is $1$ and $y$ is $0$ $x$ is $1$ and $y$ is $1$
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network. Consider that while the $\text{TCP}$ connection was active, the server machine $S$ crashed ... it will receive a $\text{RST}$ segment If the client sends a packet after the server reboot, it will receive a $\text{FIN}$ segment
Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between $R$ and $Q$ is $820$ bytes. A $TCP$ segment of size $1400$ bytes was ... lost, $P$ is required to resend the whole $\text{TCP}$ segment. $\text{TCP}$ destination port can be determined by analysing only the second fragment.
Consider the sliding window flow-control protocol operating between a sender and a receiver over a full-duplex error-free link. Assume the following: The time taken for processing the data frame by the receiver is negligible. The time taken for processing the ... of the number of frames, (rounded to the nearest integer) needed to achieve a link utilization of $50\%$ is_____________.
find the total number of subnets available and broadcast address is given mask is 255.255.255.224 and IP is 192.168.0.102?
Options are: 8,4,6,7. This is a multiple correct question. Answer as per key is 8,6,7 Their explanation is this: My doubt: if the window size is 8, then why does the sender wait for acknowledgement after sending 3 packets? It can send more without waiting.