Register
Filter

Recent activity by aambazinga

1 answer
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.
6 answers
5
GATE CSE 2019 | Question: 49
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum ...
1 answer
6
is it dangling pointer
is it dangling pointer ? int main(void) { int* p; printf("%d",*p); return 0; } https://ideone.com/IN77el
is it dangling pointer ?int main(void) { int* p;printf("%d",*p); return 0;} https://ideone.com/IN77el
0 answers
8
Length of production
A Grammer is said to be in 4-Standard form if all productions of the grammer are of type A → BCDE|a. If a grammer is in 4-Standard form how many steps in derivation of w will require if length of string w is 256 ?
A Grammer is said to be in 4-Standard form if all productions of the grammer are of type A → BCDE|a. If a grammer is in 4-Standard form how many steps in derivation of ...
0 answers
9
Previous gate
0 answers
12
First fit,Next fit assumptions
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
0 answers
14
#TOC #PumpingLemma
What is Pumping length? Why we consider pumping length of certain numbers? Can Pumping length be 0?
What is Pumping length?Why we consider pumping length of certain numbers?Can Pumping length be 0?
1 answer
16
MadeEasy Test Series 2019: Discrete Mathematics - Set Theory & Algebra
Which of the following are Well ordered set $\left [ Z^{+},\leq \right ]$ $\left [ Z^{-},\leq \right ]$ $\left [ Z^{+},\geq \right ]$ $\left [ Z^{-},\geq \right ]$
Which of the following are Well ordered set$\left [ Z^{+},\leq \right ]$$\left [ Z^{-},\leq \right ]$$\left [ Z^{+},\geq \right ]$$\left [ Z^{-},\geq \right ]$
0 answers
17
MadeEasy Subject Test 2019: Programming & DS - programming in C
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } } Count initially 0.What is value returned by foo(8)?
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } }Count initially 0.What is value returned by foo(8)?
2 answers
21
Compiler Design
Type of ERROR
Type of ERROR
2 answers
22
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...
0 answers
24
made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring } number of states in the minimal DFA of L’ is? i’m getting 3. please confirm if you are getting 3 or 4.
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring }number of states in the minimal DFA of L’ is?i’m getting 3. please confirm if you are ...
0 answers
27
ME- CBT1
0 answers
28
Madeeasy-CBT
1 answer
30
made easy cbt1
FIFO replacement policy ignores locality of reference. true/false
FIFO replacement policy ignores locality of reference.true/false