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 Sahil1994
0
votes
0
answers
1
Test Series
We need to draw DFA for it. and then NFA.? Please tell the approach?
We need to draw DFA for it. and then NFA.?Please tell the approach?
250
views
asked
Jan 31, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
1
answer
2
Test Series
Consider the following set of functional dependencies { (Eid, pno) --> hours, Eid --> Ename, Pno --> (Pname, Plocation), Pname --> Plocation } in a relation R (Eid, Pno, hours, Ename, Pname, Plocation). After decomposition, the relation R1 (Pno, Pname, Plocation) is in __ BCNF 3NF but not in BCNF 1NF
Consider the following set of functional dependencies{(Eid, pno) hours,Eid Ename,Pno (Pname, Plocation),Pname Plocation}in a relation R (Eid, Pno,...
433
views
asked
Jan 29, 2018
Databases
databases
+
–
1
votes
0
answers
3
Test Series
Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page. ... purpose? <4,12,12,12> < 2, 12, 12, 12 > <4,14,14,14> <10,12,14,14>
Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a s...
631
views
asked
Jan 26, 2018
Operating System
operating-system
paging
+
–
2
votes
0
answers
4
Test Series
Consider the circuit with initial state Q0=0,Q1=0 and Q2=0. Then which of the following sequence of output is correct? a)4, 6, 3 b) 1, 3, 7 c) 3, 6, 4 d) 7, 3, 1
Consider the circuit with initial state Q0=0,Q1=0 and Q2=0.Then which of the following sequence of output is correct?a)4, 6, 3b) 1, 3, 7c) 3, 6, 4d) 7, 3, 1
455
views
asked
Jan 26, 2018
Digital Logic
digital-logic
+
–
1
votes
1
answer
5
Computer Networks
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both None Que 2 which protocol has flow control but not error control? Stop-and-Wait Simplest Go-Back-N ARQ Selective-Repeat ARQ
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both NoneQue 2 which protocol has flow control but not error control? Stop-and-Wai...
1.4k
views
asked
Jan 3, 2018
Computer Networks
computer-networks
+
–
1
votes
0
answers
6
View Seializability
Can anyone explain or give any link to study View Serializability ... Will be really thankful..
Can anyone explain or give any link to study View Serializability ... Will be really thankful..
253
views
asked
Dec 22, 2017
Databases
databases
view-serializable
+
–
2
votes
1
answer
7
SELF DOUBT
Hi Can any one explain by Diagram. It will be more Easy to understand Thanks, Let R represents an one to many relationship between entities E1 and E2 and the set A, B attributes represent the key of R (A is key for E1 and B is key for E2) then which of the following ... is correct The FD, A→B will only holds The FD, B→A will only holds (a) and (b) hold together Neither (a) nor (b) holds
Hi Can any one explain by Diagram. It will be more Easy to understandThanks,Let R represents an one to many relationship between entities E1 and E2 and the set A, B attri...
385
views
asked
Dec 21, 2017
Databases
databases
er-diagram
+
–
0
votes
1
answer
8
#TOC DOUBT
A)Is it useful to draw FA if we need to tell the language of the following grammar...? B)What is the language of the following grammar..? C) What will be the final state Of FA and what is the criteria to find out final state.if a given a regular grammar.? S→aB|bA A→aS|bAA|a B→bS|aBB|b
A)Is it useful to draw FA if we need to tell the language of the following grammar...?B)What is the language of the following grammar..?C) What will be the final state O...
829
views
asked
Dec 12, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
1
votes
1
answer
9
#CD Doubt
What is the diffrence between Lexical error , Syntax error and semantic error..? Please explain with this example void main() { int total-value, Num=2,sum=5,var1; 5=Num; var1=2; sum=num*1; if(sum=var1) { sum=sum+1 } }
What is the diffrence between Lexical error , Syntax error and semantic error..?Please explain with this examplevoid main(){int total-value, Num=2,sum=5,var1;5=Num;var1=2...
624
views
asked
Dec 12, 2017
Compiler Design
compiler-design
lexical-analysis
descriptive
+
–
0
votes
1
answer
10
#TOC DOUBT
Let L be the set of letters {_,A,B,...Z,a,b,…z} and D be the set of digits {0,1…9}. Then which of the following regular expression represents the set of valid C identifiers. Assume that any C keyword is also allowed as variable name. L*(L+D)* LL*D* L(L+D)* None of the above Please explain with valid reason..? Thanks,
Let L be the set of letters {_,A,B,...Z,a,b,…z} and D be the set of digits {0,1…9}. Then which of the following regular expression represents the set of valid C ident...
1.1k
views
asked
Dec 12, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
0
answers
11
#selfDount
int main() { int i=1;j=1; j=i++<=5; // doubt here printf("%d%d",i,j); } i know that first i is tested that it is less than 5 thats true than value of i will be incremented and then result(0 or 1) will be strored in j and ... increment we give priority to unary operator(++a) i want to ask that both are consider as unary operator(a++ or ++a) but behaving diffrently.. Thanks
int main(){int i=1;j=1;j=i++<=5; // doubt hereprintf("%d%d",i,j);}i know that first i is tested that it is less than 5 thats true than value of i will be incremented and ...
175
views
asked
Dec 12, 2017
1
votes
1
answer
12
#self doubt
What will be the output of following program:- Size of int is 4 bytes #incude<stdio.h> int main() { int a; for(a=1;a<=2147483647;a++) printf("%d\n",a); return 0; } a) will it print till its limit 2147483647 b) it will go to indefinate loop c) compile time error
What will be the output of following program:-Size of int is 4 bytes#incude<stdio.h>int main(){ int a; for(a=1;a<=2147483647;a++) printf("%d\n",a); r...
590
views
asked
Dec 11, 2017
Programming in C
programming-in-c
loop
+
–
1
votes
1
answer
13
Identify Class of Grammar
Hi mates, Please Identify Class of grammr with suitable Explanation, 1) L={WXW,/ W,X{a,b}*} 2) L={WXW,/ W,X{a,b}+} 3) L={WXWY,/ W,X,Y{a,b}+} 4)L={WXYW,/ W,X,Y{a,b}+} Thanks,
Hi mates,Please Identify Class of grammr with suitable Explanation,1) L={WXW,/ W,X{a,b}*}2) L={WXW,/ W,X{a,b}+}3) L={WXWY,/ W,X,Y{a,b}+}4)L={WXYW,/ W,X,Y{a,b}+}Thanks,
577
views
asked
Dec 7, 2017
Theory of Computation
theory-of-computation
identify-class-language
context-free-language
regular-language
+
–
0
votes
1
answer
14
Grammars
HI Mates, Is it true or false..? If yes or no please explain..? Every Regular set has a LR(1) Grammar....?
HI Mates, Is it true or false..? If yes or no please explain..?Every Regular set has a LR(1) Grammar....?
321
views
asked
Nov 30, 2017
Theory of Computation
theory-of-computation
grammar
+
–
0
votes
0
answers
15
#context free languages
Hi mates, Difference between 1) xcy {x, y € (0,1)*} 2) xcx {x €(0,1)*} and c is a terminal symbol and c is not 0,1
Hi mates,Difference between 1) xcy {x, y € (0,1)*}2) xcx {x €(0,1)*} and c is a terminal symbol and c is not 0,1
249
views
asked
Nov 29, 2017
Theory of Computation
context-free-language
theory-of-computation
+
–
0
votes
0
answers
16
Compiler design
Hi mates, Show that it is ambiguous grammar TIA S->aAB/bBA A->bS/a B->aS/b
Hi mates, Show that it is ambiguous grammar TIAS->aAB/bBAA->bS/aB->aS/b
240
views
asked
Nov 23, 2017
Compiler Design
compiler-design
ambiguous
+
–
0
votes
1
answer
17
Regular Expression
Hi Mates, Is it true or false..? The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a+b)*..? Please answere with explanation. Thanks
Hi Mates,Is it true or false..?The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a+b)*..?Please answere with explanation.Thanks
785
views
asked
Nov 15, 2017
2
votes
1
answer
18
Regular Expression
HI mates, I know the expansion of (a+b)* = { epsilon, a,b, aa,ab,ba,bb .............} then what will be the expansion of a* + b*...? . will be equal as of (a+b)*...? TIA
HI mates,I know the expansion of (a+b)* = { epsilon, a,b, aa,ab,ba,bb .............}then what will be the expansion of a* + b*...? .will be equal as of (a+b)*...?TIA
2.7k
views
asked
Nov 12, 2017
Theory of Computation
theory-of-computation
regular-expression
normal
+
–
0
votes
1
answer
19
Removing E productions
We need to remover E productions from the grammar Vertices-{A,B,C,S} Terminals={a,b,c,E} S->ABAC A->aA/E B->bB/E C->c
We need to remover E productions from the grammarVertices-{A,B,C,S} Terminals={a,b,c,E}S->ABACA->aA/EB->bB/EC->c
352
views
asked
Oct 9, 2017
Theory of Computation
theory-of-computation
grammar
+
–
1
votes
1
answer
20
Theory Of Computation
Hi. please tell me the Regular Expresion of image given DFA below
Hi. please tell me the Regular Expresion of image given DFA below
556
views
asked
Sep 3, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register