1
Q). Ethernet implements ________ service for its operation (a). Connection oriented (b). Connection less (c). a and b (d). a or c
2
if a link is using baseband transmission for e.g Ethernet....thats means one signal can pass through the link at a time.....that means a baseband transmission can never be full duplex??? can anyone explain what is the relation between baseband transmissions, broadband transmissions, full-duplex and half duplex link?
3
amount of time it would take to send 500 packets using 6-packet size window and without sliding window will be, when the time to send in one direction is 5 ms 31000, 5000 4600, 21600 5000, 30000 30000, 5000.......... pls explain the logic behind?
4
In which of the following order indefinite blocking may occur if we add and remove process from the list associated with a semaphore. a)LIFO b)FIFO
5
6
7
Consider the following program fragment if(a > b) if(b > c) s1; else s2; s2 will be executed if a <= b b > c b >= c and a <= b a > b and b <= c
8
The for loop for (i=0; i<10; ++i) printf("%d", i&1); prints 0101010101 0111111111 0000000000 1111111111
1 vote
9
If n has 3, then the statement a[++n]=n++; assigns 3 to a[5] assigns 4 to a[5] assigns 4 to a[4] what is assigned is compiler dependent
10
P0 wait(s); wait(q); Signal (s); signal(q);... P1[ wait(q);wait(s);} signal(q);signal(s);.... whether progress is guarnteed or not ???
11
Hi All, I have applied for GATE 2016 exam in the stream of CS. I haven't started preparation yet. Would it be possible to prepare for the exam in less than 110 days including solving previous papers? If yes how should it be scheduled. Can anyone help? To add a point, i have been away from books since 2 years as i am working as test engineer.
12
main(){ while(n>2) n=n/log(n); }
13
If a synchronization mechanism satisfies Bounded Waiting but no Progress and also it is a busy waiting solution so will there be any starvation ?
1 vote
14
for example array contain a[1 2 3 3 3 3 3 4 5] then retun(1)
1 vote
15
Caption
1 vote
16
17
Can someone describe what is a viable prefix with an example?
18
A DMA controller transfers $16$-bit word to memory using cycle stealing. The words assembled from a device that transmits characters at a rate of $2400$ characters per second. The CPU is fetching and executing instructions at an average rate of $1$ million instructions per second. By how much will the CPU be ... memory using cycle stealing? (A) $83 \%$ (B) $23 \%$ (C) $0.0833 \%$ (D) $17.33 \%$
19
Imagine 2 LAN bridges, both connecting a pair of 802.4 networks.The first bridge is faced with 100 512­ byte frames per seconds that must be forwarded. The second is faced with 200 4096 ­byte frame per second. Which bridge do you think will need the faster CPU? I ... all depends on the number of frames passing through point which is higher in second case.  So how is it that ans if first case ?
20
At some places it is written that Baud rate = 2 * Bit rate and some places its written that Bit rate = 2 * Baud rate? I am confused, what is the relation between the two ?
21
[A]. I could not put up in a hotel [B]. because the boarding and lodging charges [C]. were exorbitant. [D]. No error.
22
[A]. You can get [B]. all the information that you want [C]. in this book. [D]. No error. Answer given is option B but whats wrong in saying this "all the information that you want " ?
1 vote
23
Answer is 2 minimal and 2 canonical covers. Please give full explanation of how to solve.
1 vote
24
I am not getting that when head pointer has no information regarding the tail pointer then how is it that circular linked list will have a constant time for its concatenation with another circular linked list , wouldn't it take same time if we perform concatenation on a single or double linked list .
25
According to me when we perform the above operations we have to traverse the entire list so then why does it all take constant time ?
26
The least number of cables required to connect 8 computers to 4 printers to guarantee that 4 computers can directly access 4 different printers. At any given time 4 computers should be able to simultaneously access 4 printers. I assumed this was simple bipartite graph k(8,4) , 32 connections.That seems to be wrong.