Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Bhupendra
1
votes
0
answers
1
prime Imp
Consider the function f(P,Q,R,S)=Σ(0,5,7,8,10,13,15) + Σd(1,2,3,9). The number of prime implicants for the function is
Consider the function f(P,Q,R,S)=Σ(0,5,7,8,10,13,15) + Σd(1,2,3,9). The number of prime implicants for the function is
592
views
asked
Jan 4, 2019
Digital Logic
digital-logic
prime-implicants
+
–
0
votes
0
answers
2
dbms nptel
Q6:Which of the following statements are not true? A. Superset of a superkey is also a superkey. B. Superset of a candidate key is a superkey. C. Subset of a candidate key can be a superkey. D. Proper subset of a candidate key is also a candidate key
Q6:Which of the following statements are not true?A. Superset of a superkey is also a superkey.B. Superset of a candidate key is a superkey.C. Subset of a candidate key c...
373
views
asked
Jan 4, 2019
Databases
databases
+
–
0
votes
0
answers
3
dbms-key
Q6:Which of the following statements arenottrue? A. Superset of a superkey is also a superkey. B. Superset of a candidate key is a superkey. C. Subset of a candidate key can be a superkey. D. Proper subset of a candidate key is also a candidate key
Q6:Which of the following statements arenottrue?A. Superset of a superkey is also a superkey.B. Superset of a candidate key is a superkey.C. Subset of a candidate key can...
674
views
asked
Jan 4, 2019
0
votes
0
answers
4
DLD maximum clock frequency doubt
How to approach this kind of problem ?please provide the detailed approach .
How to approach this kind of problem ?please provide the detailed approach .
691
views
asked
Dec 21, 2018
Digital Logic
digital-logic-clock-frequency
+
–
0
votes
0
answers
5
pushdownauto
Consider the below mentioned PDA M1 (Q, ∑, Г, δ, q0, Z, F) which accepts thelanguage L. Where: Q={q0, q1, q2, q3, q4} Σ={a,b} Г={a,b,Z} Z=initial pushdown symbol F=set of final states, empty in this case as the string is accepted by null store. Choose the correct Grammar ... . 1. S → aaBb|aab, B → aaBb|aab 2. None of the above. 3. S →aaBb|∊, B →aaBb|aab 4. S →aaBb|aab|∊, B →aaBb|aab
Consider the below mentioned PDA M1 (Q, ∑, Г, δ, q0, Z, F) which accepts thelanguage L.Where:Q={q0, q1, q2, q3, q4}Σ={a,b}Г={a,b,Z}Z=initial pushdown symbolF=set of...
167
views
asked
Oct 13, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
6
push down automata
Consider the below mentioned PDA M1 (Q, ∑, Г, δ, q0, Z, F) which accepts thelanguage L. Where: Q={q0, q1, q2, q3, q4} Σ={a,b} Г={a,b,Z} Z=initial pushdown symbol F=set of final states, empty in this case as the string is accepted by null store. Choose the correct ... 1. S → aaBb|aab, B → aaBb|aab 2. None of the above. 3. S →aaBb|∊, B →aaBb|aab 4. S →aaBb|aab|∊, B →aaBb|aab
Consider the below mentioned PDA M1 (Q, ∑, Г, δ, q0, Z, F) which accepts thelanguage L.Where:Q={q0, q1, q2, q3, q4}Σ={a,b}Г={a,b,Z}Z=initial pushdown symbolF=set of...
177
views
asked
Oct 13, 2018
0
votes
0
answers
7
dfa and nfa
Let M1 be a NFA with “k1” states and the corresponding DFA of M1 have “k2”states. Then which of the following option is necessarily false in every case. 1.k2 = k1 2.k2 ≤2k1 3.k2<k1 4. None of the above
Let M1 be a NFA with “k1” states and the corresponding DFA of M1 have “k2”states. Then which of the following option is necessarily false in every case.1.k2 = k12...
289
views
asked
Oct 13, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
8
Closure property
If L and Lc both are CFL, then L must be regular.True or False.
If L and Lc both are CFL, then L must be regular.True or False.
158
views
asked
Oct 13, 2018
2
votes
1
answer
9
best fit
Suppose a fixed partitioning memory system with partitions of 100K, 500K, 200K, 300K, and 600K (in memory order) exists. All five partitions are currently available. Using the best fit algorithm, find how much internal and external fragmentation exists in this system after processes of 212K, 417K, 112K, and 350K (in request order) arrive.
Suppose a fixed partitioning memory system with partitions of 100K, 500K, 200K, 300K, and 600K (in memory order) exists. All five partitions are currently available. Usin...
700
views
asked
Oct 7, 2018
Operating System
fragmentation-os
+
–
1
votes
1
answer
10
fork()
The value of z after the execution of the following program is void f(int x) { staticint z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; }
The value of z after the execution of the following program isvoid f(int x) {staticint z;z=z+x;}int main() {int y=10;fork();fork();f(y);return 0;}
672
views
asked
Aug 23, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register