Register
Filter

Answers by rishi71662data4

1 votes
4
computer network
In class C network 3 bits are 3 bits are borrowed for subnetting host id parts.Total possible number of subnet masks are ______ ?
In class C network 3 bits are 3 bits are borrowed for subnetting host id parts.Total possible number of subnet masks are ______ ?
1 votes
5
Decidability property.
Intersection of languages produced by two DCFG is a DCFL . Decidable or not ? Please give reference for your answer.
Intersection of languages produced by two DCFG is a DCFL . Decidable or not ? Please give reference for your answer.
2 votes
6
UGC NET CSE | December 2004 | Part 2 | Question: 34
Which activity is included in the first pass of two pass assemblers? Build the symbol table Construct the intermediate code Separate mnemonic opcode and operand fields None of these
Which activity is included in the first pass of two pass assemblers?Build the symbol tableConstruct the intermediate codeSeparate mnemonic opcode and operand fieldsNone o...
1 votes
7
dooubt
due to contiguous allocation we always suffer from external fragmentation // is it right to use word always here ,
due to contiguous allocation we always suffer from external fragmentation // is it right to use word always here ,
0 votes
8
computer networks
difference between circuit switching and virtual circuit switching ? do we have icmp in syllabus ?
difference between circuit switching and virtual circuit switching ?do we have icmp in syllabus ?
2 votes
10
LOGICAL ADDRESS
Can MAC address ne used as logical address at Network layer ? and can IP address be used as Physical address at DLL ?
Can MAC address ne used as logical address at Network layer ?and can IP address be used as Physical address at DLL ?
1 votes
11
regular
A) L : {a2n ; n>=0} regular or not? B) Let G1 and G2 are CFG's .... L(G1) intersection L(G2) = $\phi$ is decidable or not
A) L : {a2n ; n>=0} regular or not?B) Let G1 and G2 are CFG's .... L(G1) intersection L(G2) = $\phi$ is decidable or not
1 votes
12
Round robin response time.
Response time either increases or remains same if time quantum increases but never decreases. True or false?
Response time either increases or remains same if time quantum increases but never decreases.True or false?
1 votes
13
Self Doubt
Can Someone exlain this "In level triggering circuit the output may change several times in a single clock whereas in a edge triggering circuit the output will change only once in a single clock."
Can Someone exlain this"In level triggering circuit the output may change several times in a single clock whereas in a edge triggering circuit the output will change only...
0 votes
15
3.Array
Consider a stack is implemented using an array. What is worst case time complexity of push operation? give explanation
Consider a stack is implemented using an array. What is worst case time complexity of push operation?give explanation
3 votes
16
Self doubt
S -> AB | BAB A -> SA | ba B -> a | $\epsilon$ What are the follow of S, A, B?
S - AB | BABA - SA | baB - a | $\epsilon$What are the follow of S, A, B?
0 votes
17
If PEN – MEN = 87, then BOY – CAN =?
If PEN – MEN = 87, then BOY – CAN = ? (A) 256 (B) 169 (C) 345 (D) 318
If PEN – MEN = 87, then BOY – CAN = ?(A) 256(B) 169(C) 345(D) 318
0 votes
18
Indexing
16 votes
19
GATE CSE 1999 | Question: 1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
Booth's coding in $8$ bits for the decimal number $-57$ is:$0-100+1000$$0-100+100-1$$0-1+100-10+1$$00-10+100-1$
1 votes
20
Aymptotic notation
Consider $\sum_{i=0}^n{}$ i3 =x.what can be X 1.theta(n4) 2.theta(n5) 3.O(n5) 4.$\Omega$(n3)
Consider $\sum_{i=0}^n{}$ i3 =x.what can be X1.theta(n4)2.theta(n5)3.O(n5)4.$\Omega$(n3)
1 votes
21
#Parsing
How to check in the grammar that which parsing method works more efficient for it? For eg in the following grammar - S-> Aa/b S->a Options - a) Top - Down b) Bottom - up c) Both d) None of these Answer is b.
How to check in the grammar that which parsing method works more efficient for it?For eg in the following grammar -S- Aa/bS->aOptions -a) Top - Downb) Bottom - upc) Bothd...
0 votes
22
graph - self doubt
Graph G has atleast 1 edge then which are true a) G has a hamiltonian circuit b) Every cycle of G is of even length
Graph G has atleast 1 edge then which are truea) G has a hamiltonian circuitb) Every cycle of G is of even length
0 votes
23
number system
what is the probability of overflow occurring in addition of two 3-bit signed 2's complement number?
what is the probability of overflow occurring in addition of two 3-bit signed 2's complement number?