Register
Filter

Questions by manisha11

1 votes
1 answer
1
B TRees DBMS Self doubt
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought
In case of B Trees we split a node on insertion in case of overflow,is there any possible case in which this may lead to underflow also? as a key is promoted to parent th...
4 votes
4 answers
2
C Program Output and Explaination
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
1 votes
1 answer
3
pda self doubt
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack. DPDA with empty stack accepts LR(0) grammar. Can someone explain in depth/or give good reference links?
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack.DPDA with empty stack accepts LR(0) grammar.Can someone explain in depth/...
0 votes
1 answer
4
self doubt dfa
Given an algorithm to tell whether a regular language L contains at least 100 strings
Given an algorithm to tell whether a regular languageL contains at least 100 strings
0 votes
3 answers
6
Self Doubt CPU
In Multi-processing Operating Systems: (a) Maximum utilization of CPU can be achieved (b) Maximum throughput is achieved (c) Maximum security can be achieved (d) Not suitable for Real time Applications
In Multi-processing Operating Systems:(a) Maximum utilization of CPU can be achieved(b) Maximum throughput is achieved(c) Maximum security can be achieved(d) Not suitable...
0 votes
0 answers
7
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
Turing machine,language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| 0}.
0 votes
0 answers
8
selfdoubt
Show how to do the following statement c = a[2] + b[0] a) using register direct, imm, register indirect b) using register direct, imm, absolute addressing c) using register direct, imm, register indirect with displacement
Show how to do the following statement c = a + b[0]a) using register direct, imm, register indirectb) using register direct, imm, absolute addressingc) using register di...
0 votes
0 answers
9
selfdoubt
Show this by following ways : c = a[2] + b[0] a) using register direct, imm, register indirect b) using register direct, imm, absolute addressing c) using register direct, imm, register indirect with displacement
Show this by following ways : c = a + b[0]a) using register direct, imm, register indirectb) using register direct, imm, absolute addressingc) using register direct, imm...
0 votes
0 answers
13
Digital
0 votes
0 answers
14
DLD cse
0 votes
1 answer
15
Computer Network
20 Gbps link each user using 5Gbps when active<20% time the user is active> Max. users that the network can be used by? Using circuit switching?
20 Gbps link each user using 5Gbps when active<20% time the user is active>Max. users that the network can be used by?Using circuit switching?
0 votes
0 answers
16
gate 2019
Value of Z, for SRTF ques? So that WT avg is 1ms?
Value of Z, for SRTF ques?So that WT avg is 1ms?
0 votes
0 answers
17
Self Doubt
What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?
What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?
0 votes
1 answer
18
self doubt
$\lim_{x\rightarrow \frac{\pi }{2}}cosx^{cosx}$ can we straight away say $0^{0}=0$ ?
$\lim_{x\rightarrow \frac{\pi }{2}}cosx^{cosx}$can we straight away say $0^{0}=0$ ?
0 votes
0 answers
19
self doubt
If A = {1,2,3 …. n} then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
If A = {1,2,3 …. n}then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
0 votes
0 answers
20
self doubt
In an undirected graph a self loop counts to how many edges? I read somewhere that in case of undirected graph we consider self loop to have 2 edges?
In an undirected graph a self loop counts to how many edges?I read somewhere that in case of undirected graph we consider self loop to have 2 edges?
Page: