Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
suryaprakash
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by suryaprakash
0
votes
1
ER tables
Number of tables in case of 1)1:N + total participation (on n side) 2) 1:N + partial participation
Number of tables in case of 1)1:N + total participation (on n side)2) 1:N + partial participation
505
views
answered
Jul 28, 2019
Databases
databases
er-diagram
+
–
0
votes
2
ER Diagram- min no of relations
How the correct answer is 2?
How the correct answer is 2?
833
views
answered
Jul 28, 2019
Databases
databases
er-diagram
er-to-relational
relational
rdbms
+
–
0
votes
3
GATE 1997-2.7 Small change in given data
Consider the schema R = (S T U V) and the dependencies S → T, T → U, U → V and V → S. Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 = ϕ. (In the actual gate question it was R1∩R2 ≠ ϕ) The decomposition is:- not in 2NF in 2NF but not 3NF in 3NF but not in 2NF in both 2NF and 3NF
Consider the schema R = (S T U V) and the dependencies S → T, T → U, U → V and V → S. Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 = ϕ. (In the act...
1.2k
views
answered
Jul 28, 2019
Databases
usergate-1997
database-normalization
databases
+
–
0
votes
4
ER Diagram to table 2
Please Explain in detail i am weak in this topic
Please Explain in detail i am weak in this topic
1.6k
views
answered
Jul 27, 2019
Databases
databases
er-diagram
+
–
0
votes
5
Ace Test Series: DBMS - ER Diagram To Table
699
views
answered
Jul 26, 2019
Databases
ace-test-series
databases
er-diagram
+
–
3
votes
6
RDMS table
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
452
views
answered
Jul 26, 2019
Databases
er-diagram
er-to-relational
+
–
0
votes
7
GATE IT 2005 | Question: 4
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ ... TRUE? It is necessarily regular but not necessarily context-free. It is necessarily context-free. It is necessarily non-regular. None of the above
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ respectively. Whi...
7.7k
views
answered
Jun 15, 2018
Theory of Computation
gateit-2005
theory-of-computation
normal
identify-class-language
+
–
0
votes
8
parsing
which of the following statements is true? A) right recursion is needed for termination in predictive parser B) left recursion is required more stack space than right recursion C) left recursion works fine in BUP 1)A & B 2) A & C 3) B & C 4) All
which of the following statements is true?A) right recursion is needed for termination in predictive parserB) left recursion is required more stack space than right recur...
1.1k
views
answered
Jun 14, 2018
Compiler Design
parsing
+
–
0
votes
9
GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors
Consider line number $3$ of the following C-program.int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ }Identify the compiler’s response ab...
21.3k
views
answered
Jun 14, 2018
Compiler Design
gatecse-2005
compiler-design
compilation-phases
normal
+
–
0
votes
10
GATE CSE 1991 | Question: 17,a
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
5.7k
views
answered
Jun 14, 2018
Theory of Computation
gate1991
theory-of-computation
descriptive
identify-class-language
proof
+
–
0
votes
11
Bottom up parsing SDT
1.4k
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
0
votes
12
no of inedequate states in Compiler design
For the below given grammar: S→-S S→S-a S→a The number of inadequate states (states which have conflicts) and number of shift reduce conflicts are _____ and _____ respectively.
For the below given grammar:S→-SS→S-aS→aThe number of inadequate states (states which have conflicts) and number of shift reduce conflicts are _____ and _____ respe...
1.1k
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
13
Compiler design
Power of Predictive parser and recursive decent parser is same?
Power of Predictive parser and recursive decent parser is same?
263
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
14
SR,RR conflicts
4.6k
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
ace-test-series
+
–
0
votes
15
Is below grammar clr and lalr?
A -> AA+ A -> a I think it's both clr and lalr . Can someone draw the diagram and answer it please because I want to verify the lookaheads of some states.
A - AA+A - aI think it's both clr and lalr . Can someone draw the diagram and answer it please because I want to verify the lookaheads of some states.
1.2k
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
16
LL1 grammer
543
views
answered
Jun 13, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
0
votes
17
Parsing
The grammar $A\rightarrow AA|\left ( A \right )|\epsilon$ is not suitable for predictive parsing because the grammar is (A) Ambiguous (B) Left Recursive (C) Right Recursive (D) an operator grammar
The grammar $A\rightarrow AA|\left ( A \right )|\epsilon$ is not suitable for predictive parsing because the grammar is(A) Ambiguous(B) Left Recursive(C) Right Recursive(...
1.5k
views
answered
Jun 13, 2018
Compiler Design
parsing
compiler-design
+
–
0
votes
18
Identify the grammar
S $\rightarrow A$ A $\rightarrow AB/$\epsilon$ B $\rightarrow aB/b$ is this grammar LALR(1) ?
S $\rightarrow A$A $\rightarrow AB/$$\epsilon$B $\rightarrow aB/b$is this grammar LALR(1) ?
395
views
answered
Jun 12, 2018
Compiler Design
grammar
parsing
+
–
2
votes
19
Compiler: Bottom Up Parser
Given answer is (D), how?
Given answer is (D), how?
995
views
answered
Jun 12, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
0
votes
20
Compiler Design: Parsing
750
views
answered
Jun 12, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
0
votes
21
Regular Grammars
$S\rightarrow AB$ $A\rightarrow a$ $B\rightarrow b$ The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular language.Now,since the given grammar generates a regular language then it must be a ... grammar but again it is not in the form of TYPE 3 or regular grammar,then how to identify if the grammar is regular or not?
$S\rightarrow AB$$A\rightarrow a$$B\rightarrow b$The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular ...
1.6k
views
answered
Jun 10, 2018
Theory of Computation
regular-grammar
theory-of-computation
finite-automata
+
–
–1
votes
22
tm has more than 7 states
l = { <M> | M is a TM and M has more than 7 states } Is this decidable /undecidable/R.E /non R.e.??
l = { <M | M is a TM and M has more than 7 states }Is this decidable /undecidable/R.E /non R.e.??
1.6k
views
answered
Jun 5, 2018
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
23
Turing Recognizable and Turing Decidable
Caption Can someone give a clear explanation to this answer?
CaptionCan someone give a clear explanation to this answer?
686
views
answered
Jun 2, 2018
Theory of Computation
turing-machine
theory-of-computation
decidability
+
–
0
votes
24
MadeEasy Subject Test: Theory of Computation - Decidability
Consider the following languages : L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}. L2 : {< M >|M is a Turing Machine, |M|< 200 where |M|is number of states in machine}. Which of the following is decidable please explain decidability for L1
Consider the following languages :L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}.L2 : {< M >|M is a Turing Machine, |M|< 200 wher...
541
views
answered
Jun 2, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
–1
votes
25
ACE TEST SERIES- THEORY OF COMPUTATION- DECIDABILITY
580
views
answered
Jun 2, 2018
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
26
Is this decidable or undecidable
A = { (M, w) | M is a TM that on input w, tries to move its head past the left end of the input } B = { (M, w) | M is a TM that on input w, moves its head left at least once, at some point} how to decide that a problem is decidable or undecidable , recognisable or unrecognisable ??
A = { (M, w) | M is a TM that on input w, tries to move its head past the left end of the input }B = { (M, w) | M is a TM that on input w, moves its head left at least on...
1.8k
views
answered
Jun 2, 2018
Theory of Computation
theory-of-computation
decidability
turing-machine
+
–
0
votes
27
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
Which of the following languages below are NOT recursively enumerable ?L1 = {<M / M is a TM that accepts all even numbers }.L2 = {<M / M does not accept all even numbers ...
978
views
answered
Jun 2, 2018
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
0
votes
28
Why L = { w x w ∣ w , x ∈ ( a + b ) + } is not regular?
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
5.5k
views
answered
Jun 2, 2018
Theory of Computation
theory-of-computation
regular-language
decidability
+
–
0
votes
29
The Infiniteness Problem
what is the Infiniteness Problem?
what is the Infiniteness Problem?
818
views
answered
Jun 1, 2018
Theory of Computation
theory-of-computation
algorithms
decidability
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register