Log In

Recent activity by Rohan Ghosh

3 answers
Q). Ethernet implements ________ service for its operation (a). Connection oriented (b). Connection less (c). a and b (d). a or c
commented Nov 7, 2015 in Computer Networks 1.4k views
1 answer
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?
commented Nov 7, 2015 in Computer Networks 364 views
2 answers
The following code fragment: int x, y= 2, z, a; x= (y* =2) + (z= a =y); printf(“%d”, x); (a) prints 8 (b) prints 6 (c) prints 6 or 8 depending on the compiler implementation (d) is syntactically wrong
commented Nov 6, 2015 in Programming 1.7k views
1 answer
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
commented Nov 3, 2015 in Operating System 1.1k views
1 answer
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?
answered Oct 16, 2015 in Computer Networks 285 views
5 answers
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
answered Oct 12, 2015 in Programming 2.7k views
5 answers
The for loop for (i=0; i<10; ++i) printf("%d", i&1); prints 0101010101 0111111111 0000000000 1111111111
answered Oct 12, 2015 in Programming 3.4k views
5 answers
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
answered Oct 12, 2015 in Programming 4.2k views
2 answers
P0 wait(s); wait(q); Signal (s); signal(q);... P1[ wait(q);wait(s);} signal(q);signal(s);.... whether progress is guarnteed or not ???
commented Oct 10, 2015 in Operating System 306 views
2 answers
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.
answered Oct 8, 2015 in Study Resources 2.9k views
2 answers
If a synchronization mechanism satisfies Bounded Waiting but no Progress and also it is a busy waiting solution so will there be any starvation ?
answered Oct 6, 2015 in Operating System 510 views
1 answer
for example array contain a[1 2 3 3 3 3 3 4 5] then retun(1)
answered Oct 6, 2015 in Algorithms 628 views
2 answers
Can someone describe what is a viable prefix with an example?
commented Sep 29, 2015 in Compiler Design 6.1k views
2 answers
4 answers
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 \%$
answered Sep 15, 2015 in CO and Architecture 4.1k views
1 answer
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 ?
answered Aug 28, 2015 in Computer Networks 377 views
3 answers
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 ?
answered Aug 27, 2015 in Computer Networks 2.6k views
1 answer
[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 " ?
commented Jul 27, 2015 in Verbal Ability 142 views
1 answer
[A]. I could not put up in a hotel [B]. because the boarding and lodging charges [C]. were exorbitant. [D]. No error.
answered Jul 25, 2015 in Verbal Ability 135 views
3 answers
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 ?
commented Jul 22, 2015 in Programming 1.7k views
3 answers
Answer is 2 minimal and 2 canonical covers. Please give full explanation of how to solve.
answered Jul 22, 2015 in Databases 810 views
1 answer
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 .
answered Jul 22, 2015 in Programming 1.1k views
3 answers
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.
answered Jul 20, 2015 in Combinatory 1.3k views
3 answers
Hit ratio of the cache memory read request is 85% and the cache memory is 5 times faster than main memory. Block size in memory organization is 4 words. The access time of the main memory is 72 ns per word. Write through protocol (simultaneous memory ... remaining for write operation. What is the average access time (in ns) of the memory when considering both read and write operations?
answered Jul 19, 2015 in CO and Architecture 1.2k views
1 answer
If I take a problem instance in unary representation then will the algorithm take exponential time and what if the problem instance is converted into binary representation then will the time complexity remain same or will it be polynomial in time ?
commented Jul 18, 2015 in Algorithms 117 views
1 answer
minimum number of states required to detect n-bit sequence are ( for sequence detector) log2n , 2n , n-1 , n ??
answered Jul 18, 2015 in Digital Logic 177 views