Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User suryaprakash
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by suryaprakash
1
answer
1
ER tables
Number of tables in case of 1)1:N + total participation (on n side) 2) 1:N + partial participation
answered
in
Databases
Jul 28, 2019
544
views
databases
er-diagram
2
answers
2
ER Diagram- min no of relations
How the correct answer is 2?
answered
in
Databases
Jul 28, 2019
860
views
databases
er-diagram
er-to-relational
relational
rdbms
1
answer
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
answered
in
Databases
Jul 28, 2019
1.2k
views
usergate-1997
database-normalization
databases
3
answers
4
ER Diagram to table 2
Please Explain in detail i am weak in this topic
answered
in
Databases
Jul 27, 2019
1.6k
views
databases
er-diagram
1
answer
5
Ace Test Series: DBMS - ER Diagram To Table
answered
in
Databases
Jul 26, 2019
721
views
ace-test-series
databases
er-diagram
1
answer
6
RDMS table
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
answered
in
Databases
Jul 26, 2019
463
views
er-diagram
er-to-relational
4
answers
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
answered
in
Theory of Computation
Jun 15, 2018
7.7k
views
gateit-2005
theory-of-computation
normal
identify-class-language
2
answers
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
answered
in
Compiler Design
Jun 14, 2018
1.1k
views
parsing
2
answers
9
Gate Practice question check if grammar is LR(0)?
is it correct please tell me its urgent!
commented
in
Compiler Design
Jun 14, 2018
3.8k
views
compiler-design
parsing
lr-parser
9
answers
10
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
answered
in
Compiler Design
Jun 14, 2018
21.5k
views
gatecse-2005
compiler-design
compilation-phases
normal
5
answers
11
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.
answered
in
Theory of Computation
Jun 14, 2018
5.8k
views
gate1991
theory-of-computation
descriptive
identify-class-language
proof
2
answers
12
Bottom up parsing SDT
answered
in
Compiler Design
Jun 13, 2018
1.5k
views
compiler-design
parsing
test-series
2
answers
13
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.
answered
in
Compiler Design
Jun 13, 2018
1.1k
views
compiler-design
parsing
1
answer
14
Compiler design
Power of Predictive parser and recursive decent parser is same?
answered
in
Compiler Design
Jun 13, 2018
271
views
compiler-design
parsing
1
answer
15
SR,RR conflicts
answer edited
in
Compiler Design
Jun 13, 2018
4.6k
views
compiler-design
parsing
ace-test-series
1
answer
16
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.
answered
in
Compiler Design
Jun 13, 2018
1.2k
views
compiler-design
parsing
2
answers
17
LL1 grammer
answered
in
Compiler Design
Jun 13, 2018
573
views
compiler-design
parsing
test-series
1
answer
18
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
answered
in
Compiler Design
Jun 13, 2018
1.5k
views
parsing
compiler-design
0
answers
19
Average length of stack in parsing LR(1)
Consider the following grammar: $S \rightarrow A$ $S \rightarrow xb$ $A \rightarrow aAb$ $A \rightarrow B$ $B \rightarrow x$ The average length of the stack used while parsing the string "axb$" using LR(1) parser is _________. I am getting 5, but answer is 2.5.
commented
in
Compiler Design
Jun 13, 2018
665
views
compiler-design
made-easy-test-series
parsing
lr-parser
6
answers
20
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
commented
in
Theory of Computation
Jun 13, 2018
5.4k
views
gate1987
theory-of-computation
regular-expression
descriptive
1
answer
21
Identify the grammar
S $\rightarrow A$ A $\rightarrow AB/$\epsilon$ B $\rightarrow aB/b$ is this grammar LALR(1) ?
answered
in
Compiler Design
Jun 12, 2018
407
views
grammar
parsing
1
answer
22
GateForum Test Series: Compiler Design - Parsing
Which of the following statements is correct? (A) For any context free grammar there is a parser that takes at most O(n2) to parse a string for n terminals. (B) Recursive descent method can't be used to both parse and ... . (C) Software tools for generating parsers directly from grammars often use top-down methods. (D) None of the above.
commented
in
Compiler Design
Jun 12, 2018
474
views
gateforum-test-series
compiler-design
parsing
2
answers
23
VirtualGate-2018-I-19
Consider the grammar given S->AA A->aA / b How many entries will be blank in the GOTO table for SR(0) items? What is the meaning of SR(0) items?
commented
in
Compiler Design
Jun 12, 2018
1.4k
views
parsing
grammar
virtual-gate-test-series
2
answers
24
Compiler: Bottom Up Parser
Given answer is (D), how?
answered
in
Compiler Design
Jun 12, 2018
1.1k
views
compiler-design
parsing
test-series
5
answers
25
Compiler Design: Parsing
answered
in
Compiler Design
Jun 12, 2018
812
views
compiler-design
parsing
test-series
1
answer
26
DFA from reg ex
Construct a finite automata from 0*1*1 + 11*0*1
answer edited
in
Theory of Computation
Jun 11, 2018
457
views
theory-of-computation
finite-automata
2
answers
27
regular expressions
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
answer edited
in
Theory of Computation
Jun 10, 2018
747
views
theory-of-computation
regular-expression
regular-language
finite-automata
3
answers
28
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?
answered
in
Theory of Computation
Jun 10, 2018
1.6k
views
regular-grammar
theory-of-computation
finite-automata
3
answers
29
No of states in Minimal DFA
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
commented
in
Theory of Computation
Jun 10, 2018
3.2k
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
2
answers
30
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.??
answered
in
Theory of Computation
Jun 5, 2018
1.6k
views
theory-of-computation
decidability
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...