Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Arjun
33
votes
1601
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ...
46.3k
views
answered
Jan 17, 2015
CO and Architecture
gatecse-2005
co-and-architecture
pipelining
normal
+
–
97
votes
1602
GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...
18.4k
views
answered
Jan 17, 2015
CO and Architecture
gatecse-2014-set1
co-and-architecture
machine-instruction
instruction-format
numerical-answers
normal
+
–
3
votes
1603
Conditional probability
2.5k
views
answered
Jan 17, 2015
Quantitative Aptitude
probability
+
–
0
votes
1604
in op C : L1: a^n + b^m L2=R(L1)=a^m + b^n . So L1 U L2= a^(m+n) + b^(m=n) ----> How it is becoming Σ∗
585
views
answered
Jan 17, 2015
86
votes
1605
GATE CSE 2013 | Question: 31
Consider the following function: int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } The return value of the function is $\Theta(n^2)$ $\Theta(n^2\log n)$ $\Theta(n^3)$ $\Theta(n^3\log n)$
Consider the following function:int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); }The return value of the functio...
29.5k
views
answered
Jan 16, 2015
Algorithms
gatecse-2013
algorithms
identify-function
normal
+
–
1
votes
1606
Level 1 cache and level 2 cache
S1 is false ....but can any one plz explain about S2..?
S1 is false ....but can any one plz explain about S2..?
345
views
answered
Jan 16, 2015
36
votes
1607
GATE CSE 2011 | Question: 63
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same...
4.9k
views
answered
Jan 16, 2015
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
cost-market-price
normal
+
–
2
votes
1608
In computer network when we transfer data bw 2 stations, when we should take propagation time as 1 pt and when should we take it as 2pt while solving numericals
320
views
answered
Jan 16, 2015
37
votes
1609
GATE CSE 2007 | Question: 29
A minimum state deterministic finite automaton accepting the language $L=\{w\mid w \in \{0, 1\}^*,$ number of $0$s and $1$s in $w$ are divisible by $3$ and $5$, respectively $\}$ has $15$ states $11$ states $10$ states $9$ states
A minimum state deterministic finite automaton accepting the language$L=\{w\mid w \in \{0, 1\}^*,$ number of $0$s and $1$s in $w$ are divisible by $3$ and $5$, respective...
11.6k
views
answered
Jan 16, 2015
Theory of Computation
gatecse-2007
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
2
votes
1610
i am not getting confidence in combinatric. Please suggest some resources. Thanks in Advance.
350
views
answered
Jan 14, 2015
38
votes
1611
GATE CSE 2007 | Question: 76
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \frac{1}{32}, \frac{1}{32}$, respectively. Which of the following is the Huffman code for the letter $a, \,b, \,c, \,d, \,e, \,f$? $0$ ... $011$, $010$, $001$, $000$ $11$, $10$, $01$, $001$, $0001$, $0000$ $110$, $100$, $010$, $000$, $001$, $111$
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \frac{1}{32}, \frac{1}{32}$, respectively. Which...
10.9k
views
answered
Jan 14, 2015
Algorithms
gatecse-2007
algorithms
greedy-algorithm
normal
huffman-code
+
–
0
votes
1612
Semaphore
320
views
answered
Jan 14, 2015
47
votes
1613
GATE IT 2006 | Question: 48
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows $a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $h : 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? $110111100111010$ $fdheg$ $ecgdf$ $dchfg$ $fehdg$
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows$a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $...
13.1k
views
answered
Jan 14, 2015
Algorithms
gateit-2006
algorithms
greedy-algorithm
normal
huffman-code
+
–
154
votes
1614
GATE CSE 2013 | Question: 39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decompo...
28.5k
views
answered
Jan 13, 2015
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
17
votes
1615
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
131k
views
answered
Jan 13, 2015
Mathematical Logic
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
+
–
16
votes
1616
GATE CSE 2006 | Question: 56, ISRO2009-58
Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code. subroutine swap(ix,iy) it = ix L1 : ix = iy L2 : iy = it end ia = 3 ib = 8 call swap (ia, ib+5) print *, ia, ib end ... : The program will print 13 and -2 Exactly the following set of statement(s) is correct: S1 and S2 S1 and S4 S3 S1 and S5
Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code. subroutine swap(ix,iy) it = ix L1 : ix = iy L2 : iy ...
6.8k
views
answered
Jan 13, 2015
Programming in C
gatecse-2006
programming
parameter-passing
normal
out-of-syllabus-now
isro2009
+
–
17
votes
1617
GATE CSE 2006 | Question: 8
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flip-flops) will delay the phase of $f$ by $180°$?
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following...
18.6k
views
answered
Jan 13, 2015
Digital Logic
gatecse-2006
digital-logic
normal
circuit-output
+
–
0
votes
1618
Which of the following are true about associative memory.
Which of the following are true about associative memory. S1: Associative memory is fast memory. S2: Associative memory searches by content and not by accessing the address. a) Both S1 and S2 are true and S2 is correct explanation of S1 b) Both ... is not correct explanation of S1 c) S1 is true but S2 is false d) S1 is false but S2 is true
Which of the following are true about associative memory.S1: Associative memory is fast memory.S2: Associative memory searches by content and not by accessing the address...
2.6k
views
answered
Jan 13, 2015
CO and Architecture
associative-memory
+
–
54
votes
1619
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
18.6k
views
answered
Jan 8, 2015
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
46
votes
1620
General Doubt
the complement of every context-free language is recursive ? or recursive enumerable? or both?
the complement of every context-free language is recursive ? or recursive enumerable? or both?
13.4k
views
answered
Jan 7, 2015
Theory of Computation
general-topic-doubt
theory-of-computation
closure-property
+
–
3
votes
1621
Pumping lemma
To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ? Let Z=02n= 0n-1 0n 01 Take u= 0n-1 , v=0n, w=01 So, u (v)i w can be written as 0n-1 (0n)i 0 ...Take i=0, we get 0n-1.0=0n but 0n dont belong to language as n may be odd.So i am not getting it as regular...
To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ?Let Z=02n= 0n-1 0...
2.5k
views
answered
Jan 7, 2015
Theory of Computation
theory-of-computation
pumping-lemma
+
–
55
votes
1622
GATE CSE 2005 | Question: 40
Let $P, Q,$ and $R$ be three atomic propositional assertions. Let $X$ denote $( P ∨ Q ) → R$ and $Y$ denote $(P → R) ∨ (Q → R).$ Which one of the following is a tautology? $X ≡ Y$ $X → Y$ $Y → X$ $¬Y → X$
Let $P, Q,$ and $R$ be three atomic propositional assertions. Let $X$ denote $( P ∨ Q ) → R$ and $Y$ denote $(P → R) ∨ (Q → R).$ Which one of the following is a...
6.6k
views
answered
Jan 7, 2015
Mathematical Logic
gatecse-2005
mathematical-logic
propositional-logic
normal
+
–
72
votes
1623
GATE CSE 2001 | Question: 2.21
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table?$\text{16 ...
66.6k
views
answered
Jan 1, 2015
Operating System
gatecse-2001
operating-system
virtual-memory
normal
+
–
59
votes
1624
GATE CSE 2001 | Question: 2.9
Which is the most appropriate match for the items in the first column with the items in the second column: ... ), (Y, III), (Z, I) (X, III), (Y, II), (Z, I) (X, I), (Y, III), (Z, II)
Which is the most appropriate match for the items in the first column with the items in the second column:$$\begin{array}{|cl|cl|} \hline \text{X.} &\text{Indirect Addres...
7.5k
views
answered
Jan 1, 2015
CO and Architecture
gatecse-2001
co-and-architecture
addressing-modes
easy
match-the-following
+
–
9
votes
1625
fork() system call
Also please explain how many times "PROCESS" will be printed when we don't use fflush()...?
Also please explain how many times "PROCESS" will be printed when we don't use fflush()...?
1.9k
views
answered
Jan 1, 2015
40
votes
1626
GATE CSE 2006 | Question: 24
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min(\pi(B))$, where $\min(S)$ is the smallest integer in the set of integers $S$, and $\pi$(S) is the set of ... $n! \frac{|A ∩ B|}{|A ∪ B|}$ $\dfrac{|A ∩ B|^2}{^n \mathrm{C}_{|A ∪ B|}}$
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = ...
11.3k
views
answered
Jan 1, 2015
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
set-theory
+
–
63
votes
1627
GATE CSE 2004 | Question: 69
A 4-stage pipeline has the stage delays as $150$, $120$, $160$ and $140$ $nanoseconds$, respectively. Registers that are used between the stages have a delay of $5$ $nanoseconds$ ... be: $\text{120.4 microseconds}$ $\text{160.5 microseconds}$ $\text{165.5 microseconds}$ $\text{590.0 microseconds}$
A 4-stage pipeline has the stage delays as $150$, $120$, $160$ and $140$ $nanoseconds$, respectively. Registers that are used between the stages have a delay of $5$ $nano...
20.5k
views
answered
Jan 1, 2015
CO and Architecture
gatecse-2004
co-and-architecture
pipelining
normal
+
–
6
votes
1628
Variance
Variance of 1st n positive integers is a)(n2-1)/12 b)(n+1)/6 c)(n-1)(2n+1)/3 d)n(n-1)
Variance of 1st n positive integers isa)(n2-1)/12b)(n+1)/6c)(n-1)(2n+1)/3d)n(n-1)
2.0k
views
answered
Jan 1, 2015
Probability
variance
+
–
79
votes
1629
GATE IT 2008 | Question: 41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Re...
23.9k
views
answered
Dec 31, 2014
Operating System
gateit-2008
operating-system
page-replacement
normal
+
–
75
votes
1630
GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...
24.0k
views
answered
Dec 31, 2014
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
Page:
« prev
1
...
49
50
51
52
53
54
55
56
57
58
59
...
70
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register