Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shikharV
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by shikharV
1
answer
1
From where should I study view serializability?
481
views
answer selected
Apr 14, 2016
Databases
view-serializable
databases
+
–
2
answers
2
What is the consequence of not attending IISC interview call?
I have got 49th rank in GATE 2016 (thanks to gateoverflow!!). I have applied for IISC Mtech program. Since I kept Computational Science as one of the preferences I have got an interview letter for the same. But I am not ... CSE. I want to know if I didn't attend the interview will I be considered for future iteration of Mtech CSE?
I have got 49th rank in GATE 2016 (thanks to gateoverflow!!). I have applied for IISC Mtech program. Since I kept Computational Science as one of the preferences I have g...
3.5k
views
commented
Apr 9, 2016
IISc/IITs
iisc
mtech
gate-2016-admission
+
–
4
answers
3
Identifying self dual function
Given answer: D I am not getting how to approach this question.
Given answer: DI am not getting how to approach this question.
4.7k
views
answer selected
Mar 8, 2016
Digital Logic
digital-logic
dual-function
ace-test-series
+
–
1
answer
4
How much marks one must score in set 1/2 to get ME in IISC?
532
views
asked
Mar 4, 2016
Written Exam
iisc
+
–
1
answer
5
What is the cut off score/rank in Gate for admission in MS in CS at IISc ?
8.5k
views
commented
Mar 3, 2016
IISc/IITs
iisc
ms
+
–
20
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 _____________.
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 ...
51.6k
views
commented
Feb 26, 2016
Digital Logic
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
+
–
1
answer
7
Rank estimation for GATE 2016
Can someone give some estimate of rank distribution according to marks based on the difficulty of the question paper set-1?
Can someone give some estimate of rank distribution according to marks based on the difficulty of the question paper set-1?
4.1k
views
asked
Feb 17, 2016
Others
gate2016
+
–
21
answers
8
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
41.7k
views
commented
Feb 13, 2016
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
12
answers
9
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.3k
views
answered
Feb 13, 2016
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
2
answers
10
General doubt in computer architecture
I want to know whether after executing HALT instruction is PC incremented or not?
I want to know whether after executing HALT instruction is PC incremented or not?
312
views
commented
Feb 2, 2016
CO and Architecture
co-and-architecture
+
–
7
answers
11
GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...
22.2k
views
commented
Feb 2, 2016
Computer Networks
gatecse-2014-set3
computer-networks
error-detection
+
–
0
answers
12
Question on calculating total transmission time between two hosts
I am not able to convince myself why transmission time needs to be added for each link if store and forward is not being forward. Please check
I am not able to convince myself why transmission time needs to be added for each link if store and forward is not being forward. Please check
528
views
asked
Feb 1, 2016
Computer Networks
computer-networks
+
–
7
answers
13
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...
56.8k
views
commented
Jan 30, 2016
Graph Theory
gatecse-2008
graph-theory
normal
graph-planarity
+
–
1
answer
14
Question on finding number of cycles to execute instructions
Q).We have two dsigns $D1$ and $D2$ for a synchronous pipeline processor, $D1$ has $5$ pipeline stages with execution times of $3 \text{nsec}$ $2\text{nsec}$ ,$4 \text{nsec}$ ,$2 \text{nsec}$ ... for executing $100$ instructions ? 196 nsec (integer value only) .The correct answer is 202 Please check how the answer would be 202.
Q).We have two dsigns $D1$ and $D2$ for a synchronous pipeline processor, $D1$ has $5$ pipeline stages with execution times of $3 \text{nsec}$ $2\text{nsec}$ ,$4 \text{n...
537
views
answer selected
Jan 30, 2016
CO and Architecture
co-and-architecture
clock-time
+
–
3
answers
15
Question on hamming code with even parity
Please check how the correct answer is B.
Please check how the correct answer is B.
5.0k
views
commented
Jan 30, 2016
Computer Networks
computer
computer-networks
hamming-code
+
–
0
answers
16
Couldn't understand how to approach this problem on digital logic
Q) What is the maximum clock frequency that the sequential circuit which has the longest flip-flops delay of $2 \text{ns}$ , the longest setup time and hold time among the flip-flops of $1.5\text{ns}$ and $1\text{ns}$, and the ... $(31.74) $ $\text{MHz}$(correct to two decimal places).
Q) What is the maximum clock frequency that the sequential circuit which has the longest flip-flops delay of $2 \text{ns}$ , the longest setup time and hold time among th...
254
views
asked
Jan 30, 2016
Digital Logic
digital-logic
+
–
5
answers
17
Formula for calculating efficiency of ethernet
What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$​ I saw three versions for calculating the same thing in different places. I want to know which one is correct.
What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$​I saw three versions for calculating...
16.4k
views
answer selected
Jan 29, 2016
Computer Networks
computer-networks
ethernet
+
–
3
answers
18
GATE IT 2008 | Question: 11
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE? If X can be solved in polynomial time, then so can Y X is NP-complete X is NP-hard X is in NP, but not necessarily NP-complete
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?If X can be solved in polynomial time, then so can YX is NP-c...
7.0k
views
commented
Jan 28, 2016
Algorithms
gateit-2008
algorithms
p-np-npc-nph
normal
out-of-syllabus-now
+
–
7
answers
19
GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes?$5$$4$$3$$2$
51.5k
views
commented
Jan 28, 2016
Graph Theory
gateit-2008
normal
graph-connectivity
+
–
2
answers
20
GATE CSE 2009 | Question: 10
The essential content(s) in each entry of a page table is / are Virtual page number Page frame number Both virtual page number and page frame number Access right information
The essential content(s) in each entry of a page table is / areVirtual page numberPage frame numberBoth virtual page number and page frame numberAccess right information
11.5k
views
commented
Jan 28, 2016
Operating System
gatecse-2009
operating-system
virtual-memory
easy
+
–
6
answers
21
GATE CSE 2010 | Question: 20
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? $2$-phase locking Time-stamp ordering I only II only Both I and II Neither I nor II
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?$2$-phase lockingTime-stamp orderingI onlyII onlyBoth ...
22.5k
views
commented
Jan 27, 2016
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
4
answers
22
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with d...
15.5k
views
commented
Jan 27, 2016
Algorithms
gatecse-2011
algorithms
dynamic-programming
normal
+
–
7
answers
23
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...
38.1k
views
commented
Jan 26, 2016
Computer Networks
gatecse-2012
computer-networks
congestion-control
normal
+
–
3
answers
24
GATE CSE 2013 | Question: 13
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $\langle M, \sigma \rangle$, and sends it to $Y$, where it is decrypted. Which one of the following sequences of keys is used for the operations? Encryption: $X's$ ... : $X's$ private key followed by $Y's$ public key; Decryption: $Y's$ private key followed by $X's$ public key
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $\langle M, \sigma \rangle$, and sends it to $Y$, where it is decrypted. Which one...
9.0k
views
commented
Jan 26, 2016
Computer Networks
gatecse-2013
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
4
answers
25
GATE CSE 2013 | Question: 12
The transport layer protocols used for real time multimedia, file transfer, $\textsf{DNS}$ and email, respectively are $\textsf{TCP, UDP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{UDP, TCP, TCP}\; \text{and}\; \textsf{UDP}$ $\textsf{UDP, TCP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{TCP, UDP, TCP}\;\text{and}\; \textsf{UDP}$
The transport layer protocols used for real time multimedia, file transfer, $\textsf{DNS}$ and email, respectively are$\textsf{TCP, UDP, UDP}\; \text{and}\; \textsf{TCP}$...
11.9k
views
commented
Jan 26, 2016
Computer Networks
gatecse-2013
computer-networks
tcp
udp
easy
+
–
7
answers
26
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
16.4k
views
commented
Jan 25, 2016
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
+
–
15
answers
27
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
19.2k
views
answered
Jan 25, 2016
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
12
answers
28
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
17.0k
views
answered
Jan 24, 2016
Theory of Computation
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
+
–
9
answers
29
GATE CSE 2015 Set 1 | Question: 19
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is $m,$ then the sequence number of the subsequent segment is always ... always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?If the sequence number ...
18.7k
views
answered
Jan 24, 2016
Computer Networks
gatecse-2015-set1
computer-networks
tcp
normal
+
–
3
answers
30
GATE CSE 2015 Set 1 | Question: GA-5
Which one of the following combinations is incorrect? Acquiescence - Submission Wheedle - Roundabout Flippancy - Lightness Profligate - Extravagant
Which one of the following combinations is incorrect?Acquiescence - SubmissionWheedle - RoundaboutFlippancy - LightnessProfligate - Extravagant
5.0k
views
commented
Jan 24, 2016
Verbal Aptitude
gatecse-2015-set1
verbal-aptitude
difficult
word-pairs
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register