Register
Filter

Answers by aambazinga

1 votes
1
#BookRecommendation
For Memory Addressing and Pipelining portion which standard book should I refer? Or any good resource to have crystal clear understanding,please suggest.
For Memory Addressing and Pipelining portion which standard book should I refer?Or any good resource to have crystal clear understanding,please suggest.
1 votes
2
GATE-ECE-2018
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2...
1 votes
5
Made easy test series
Consider the following two schedules: S1: R1(X),W2(Y),R2(X),W1(Y),commit1,commit2. S2: R1(X),R2(Y),W1(z),commit1,R3(Y), R3(z),W2(Y),W3(X),commit2,commit3. Which of the above schedules is allowed by 2PL?
Consider the following two schedules:S1:R1(X),W2(Y),R2(X),W1(Y),commit1,commit2.S2:R1(X),R2(Y),W1(z),commit1,R3(Y), R3(z),W2(Y),W3(X),commit2,commit3.Which of the above s...
0 votes
6
Operating System: Fork
A process executes the following segment of code: int main() { fork(); fork() && fork(); } The number of new processes created is __________ Can someone pls explain me the solution
A process executes the following segment of code:int main() { fork(); fork() && fork();}The number of new processes created is __________Can someone pls explain...
1 votes
7
# binding in c
what is binding in c ??
what is binding in c ??
1 votes
8
True#false
Pipelining reduces memory requirements of prog ???
Pipelining reduces memory requirements of prog ???
0 votes
9
Slowness and Fastness of any algorithm
How the slowness and the fastness of any algorithm depends ? Is (n/logn) is slower than log(logn) ?
How the slowness and the fastness of any algorithm depends ?Is (n/logn) is slower than log(logn) ?
0 votes
10
LAN Technology
0 votes
12
C programming
How many times will the loop execute? What is the general expression in terms of 'n'? for( i=1; i<=n; i=i*3) { for( j=i; j<=n; j++) { printf ( "ravi"); } }
How many times will the loop execute?What is the general expression in terms of 'n'?for( i=1; i<=n; i=i*3) { for( j=i; j<=n; j++) { printf ...
2 votes
14
Regular language
A^n | n>=1 In this language 'n' is unbounded so I want to understand why it comes under finite automata as language is infinite. As finite automata has finite memory. Please suggest Thanks Mayank
A^n | n>=1In this language 'n' is unbounded so I want to understand why it comes under finite automata as language is infinite.As finite automata has finite memory.Please...
0 votes
15
true/false
Suppose that the last sampleRTT in a TCP connection is equal to 1 second. Then timeout for the connection will necessarily be set to a value >= 1 second. please also give reason
Suppose that the last sampleRTT in a TCP connection is equal to 1 second. Then timeout for the connection will necessarily be set to a value >= 1 second.please also give ...