Register
Filter

Answers by pC

0 votes
2
Is the college predictor for 2018 open?
Is the college predictor for 2018 open?
Is the college predictor for 2018 open?
0 votes
3
BARC2017
SYN packet is sent through options 1)Bind 2)Socket 3)Listen
SYN packet is sent throughoptions1)Bind2)Socket3)Listen
20 votes
5
Operand forwarding in pipeline
A $5$ stage pipelined processor has the following stages: $IF$ : instruction fetch $ID$ : instruction decode $EX$ : execute $MA$ : memory access $WB$ ... No. of cycles needed to execute these instructions using operand forwarding?
A $5$ stage pipelined processor has the following stages:$IF$ : instruction fetch$ID$ : instruction decode$EX$ : execute$MA$ : memory access$WB$ : write back$$\large\colo...
33 votes
10
GATE CSE 2004 | Question: 61
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below. To complete the circuit, the input $X$ should be $Q_2^c$ $Q_2 + Q_1$ $\left(Q_1 + Q_2\right)^c$ $Q_1 \oplus Q_2$
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below.To complete the circuit, the input $X$ sh...
1 votes
12
database explain
8 votes
13
C programming
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a'); the output of the above c code segment?
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a');the output of the above c code segment?
4 votes
15
Minimum and Maximum number of Tuples in the Following Relations
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / Examples R-S S-R R Left Join S R Natural Join S R/S S/R
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / ExamplesR-SS-RR Left Join SR Nat...
34 votes
21
GATE CSE 1996 | Question: 2.12
The recurrence relation $T(1) = 2$ $T(n) = 3T (\frac{n}{4}) +n$ has the solution $T(n)$ equal to $O(n)$ $O (\log n)$ $O\left(n^\frac{3}{4}\right)$ None of the above
The recurrence relation$T(1) = 2$$T(n) = 3T (\frac{n}{4}) +n$has the solution $T(n)$ equal to$O(n)$$O (\log n)$$O\left(n^\frac{3}{4}\right)$ None of the above
0 votes
25
theory of computation
State entry problem is undecidable or partially decidable?
State entry problem is undecidable or partially decidable?
1 votes
26
SPACE COMPLEXITY
Page: