Dark Mode

Recent activity by Bharani Viswas

11 answers

1

GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.

commented in DS Feb 27, 2017

20.2k views

9 answers

2

GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$

commented in Digital Logic Feb 14, 2017

13.0k views

0 answers

3

Token ring 802.5
Token ring is operating at 4Mbps and has a token holding time of 10. Milli seconds what is the longest frame that can be sent on this ring ?

asked in Computer Networks Dec 26, 2016

489 views

10 answers

4

GATE CSE 2006 | Question: 44
Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128\; \text{kbps}$ . What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$

commented in Computer Networks Dec 14, 2016

22.4k views

1 answer

5

insertion vs bubble sort
m trying to understand a few sorting algorithms, but I'm struggling to see the difference in the bubble sort and insertion sort algorithm. in a particular case where the elements are completly sorted

asked in Algorithms May 17, 2016

416 views

19 answers

6

GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.

answered in Digital Logic Mar 6, 2016

44.4k views

18 answers

7

GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________

answered in Algorithms Feb 14, 2016

29.2k views

8 answers

8

GATE CSE 2016 Set 1 | Question: 49
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.

commented in Operating System Feb 12, 2016

13.9k views

5 answers

9

GATE CSE 2016 Set 1 | Question: 23
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... database satisfies, but the old one does not? $\text{1NF}$ $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$

answered in Databases Feb 12, 2016

12.7k views

8 answers

10

GATE CSE 2016 Set 1 | Question: 32
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.

answered in CO and Architecture Feb 12, 2016

21.1k views

3 answers

11

GATE CSE 2016 Set 1 | Question: 47
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires $48$ bits, then the size of the per-process page table is __________ megabytes.

answered in Operating System Feb 12, 2016

10.4k views