Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
alpha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by alpha
2
answers
1
c pointers
main() { char *p1="name"; char *p2; p2=(char*)malloc(20); memset(p2,0,20); while(*p2++=*p1++); printf("%s\n",p2); }
main() { char *p1="name"; char *p2; p2=(char*)malloc(20); memset(p2,0,20); while(*p2++=*p1++); printf("%s\n",p2); }
1.5k
views
commented
Apr 14, 2017
0
answers
2
tanenbaum
Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for protocol 6 on a heavily loaded 50-kbps satellite channel with data frames consisting of 40 header and 3960 data bits. Assume that the signal propagation time from the earth ... error rate for data frames is 1%, and the error rate for NAK frames is negligible. The sequence numbers are 8 bits.
Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions)for protocol 6 on a heavily loaded 50-kbps satellite channel with dataframes...
372
views
comment edited
Apr 2, 2017
Computer Networks
computer-networks
tanenbaum
+
–
1
answer
3
tanenbaum
Consider an error-free 64-kbps satellite channel used to send 512-byte data frames in one direction, with very short acknowledgements coming back the other way. What is the maximum throughput for window sizes of 1, 7, 15, and 127? The earth-satellite propagation time is 270 msec
Consider an error-free 64-kbps satellite channel used to send 512-byte data frames inone direction, with very short acknowledgements coming back the other way. What isthe...
781
views
commented
Apr 2, 2017
Computer Networks
computer-networks
tanenbaum
+
–
1
answer
4
NPTEL sliding window protocol
559
views
comment reshown
Apr 2, 2017
8
answers
5
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
23.9k
views
commented
Apr 2, 2017
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
1
answer
6
ravula test series
Which of the following statements is/are TRUE? S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt on an infinite number of strings. S2: The language A'TM={⟨M,w⟩ | M does not accept w} is Turing recognizable.
Which of the following statements is/are TRUE?S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt o...
902
views
commented
Jan 17, 2017
0
answers
7
test series
Consider the following code: S1 Parbegin Begin S2:S4 End; Begin S3; Parbegin S5; Begin S6:S8 End Parend End S7 Parend S9 Find the precedence graph?
Consider the following code:S1ParbeginBeginS2:S4End;BeginS3;ParbeginS5;BeginS6:S8EndParendEndS7ParendS9Find the precedence graph?
391
views
commented
Jan 14, 2017
2
answers
8
multilevel paging
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. What is the size of a page table for a process that has 256K of memory starting at address 0? How to solve such questions?? please someone answer it with proper explanation
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit8-bit6-bit8 bitWe use a 3-level page table, such that the first 10-bit are for the...
3.2k
views
commented
Jan 9, 2017
Operating System
multilevel-paging
paging
multilevel
operating-system
+
–
3
answers
9
Test by Bikram | Computer Networks | Test 1 | Question: 27
A sliding window protocol uses Selective Repeat. The sender sliding window size is $32$. After receiving the first $100$ frames, the acknowledgement number that is piggybacked by the receiver along with data frame is _______.
A sliding window protocol uses Selective Repeat. The sender sliding window size is $32$. After receiving the first $100$ frames, the acknowledgement number that is piggyb...
1.8k
views
commented
Jan 5, 2017
Computer Networks
tbb-cn-1
numerical-answers
+
–
2
answers
10
Test by Bikram | Computer Networks | Test 1 | Question: 26
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ frames ___________
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ fra...
839
views
commented
Jan 5, 2017
Computer Networks
tbb-cn-1
numerical-answers
+
–
1
answer
11
fork behaviour
#include <stdio.h> #include <sys/types.h> #define MAX_COUNT 200 void ChildProcess(void); /* child process prototype */ void ParentProcess(void); /* parent process prototype */ void main(void) { pid_t pid; pid = fork(); if (pid == 0) { int x1= 112; float ... printf(" *** Child process ***\n"); } void ParentProcess(void) { printf("*** Parent*****\n"); }
#include <stdio.h>#include <sys/types.h>#define MAX_COUNT 200void ChildProcess(void); /* child process prototype */void ParentProcess(void); ...
733
views
commented
Jan 1, 2017
Operating System
programming-in-c
fork-system-call
operating-system
+
–
4
answers
12
GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u...
11.3k
views
commented
Dec 8, 2016
Algorithms
gateit-2007
algorithms
graph-algorithms
normal
ugcnetcse-june2012-paper3
+
–
1
answer
13
maximum distance
Apply single source shortest path algorithm on the given graph using vertex ‘A’ as the source. What is the maximum possible distance between vertex A to vertex G. (Assume exclude infinity). Ans is 28.
Apply single source shortest path algorithm on the given graph using vertex ‘A’ as the source. What is the maximum possible distance between vertex A to vertex G. (As...
717
views
commented
Nov 17, 2016
Algorithms
algorithms
shortest-path
+
–
1
answer
14
ace test series
A TCP sender choses its initial sequence number as 1093 and sends 1460 bytes of data to the reciever The reciever has an initial sequence number 391 and acknowledges the data of sender The acknowledgment number sent by the receiver is_______ ?
A TCP sender choses its initial sequence number as 1093 and sends 1460bytes of data to the reciever The reciever has an initial sequence number391 and acknowledges the ...
422
views
commented
Aug 23, 2016
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register