Dark Mode

Answers by aambazinga

1 vote

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.

answered in CO and Architecture Feb 11, 2019

266 views

1 vote

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 _________.

answered in Digital Logic Jan 19, 2019

3.0k views

7 votes

3

TIFR CSE 2019 | Part A | Question: 11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, ... $2 \mid \text{Odd} \mid - \mid \text{Even} \mid$

answered in Analytical Aptitude Dec 18, 2018

1.3k views

1 vote

4

Minimal DFA
Given following NFA find the minimal equivalent DFA

answered in Theory of Computation Dec 14, 2018

981 views

1 vote

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?

answered in Databases Nov 30, 2018

251 views

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

answered in Operating System Nov 25, 2018

1.1k views

1 vote

7

# binding in c
what is binding in c ??

answered in DS Sep 8, 2018

180 views

1 vote

8

True#false
Pipelining reduces memory requirements of prog ???

answered in CO and Architecture Aug 3, 2018

185 views

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) ?

answered in Algorithms Aug 2, 2018

274 views

0 votes

10

answered in Computer Networks Aug 1, 2018

172 views

0 votes

11

Program in C
Iam unable to execute the code below please help me to solve this and to execute. 0 909 89098 7890987 678909876 56789098765 4567890987654 345678909876543 23456789098765432 1234567890987654321 #include<stdio.h> int main() { int i,j; printf("0\n"); for(i=9;i<=1;i--) { ... ;0"); for(j=9;j>=i;j--) printf("%d",j); printf("\n"); } return 0; }

answered in Programming Jul 28, 2018

172 views

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"); } }

answered in Programming Jul 19, 2018

322 views

0 votes

13

Compiler design

answered in Compiler Design Jul 19, 2018

160 views

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

answered in Theory of Computation Jul 17, 2018

294 views

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

answered in Computer Networks Jul 15, 2018

166 views