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
Recent activity by chandankannaujia
6
answers
1
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...
17.8k
views
commented
Dec 25, 2016
Databases
gateit-2004
databases
database-normalization
normal
+
–
5
answers
2
ISRO2015-77
In $\text{X = (M + N }\times \text{O)/(P} \times \text{Q})$, how many one-address instructions are required to evaluate it? $4$ $6$ $8$ $10$
In $\text{X = (M + N }\times \text{O)/(P} \times \text{Q})$, how many one-address instructions are required to evaluate it?$4$$6$$8$$10$
7.1k
views
comment edited
Nov 18, 2016
CO and Architecture
memory-interfacing
co-and-architecture
machine-instruction
isro2015
+
–
14
answers
3
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
38.2k
views
commented
Oct 12, 2016
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
3
answers
4
GATE CSE 2015 Set 3 | Question: 23
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T...
12.1k
views
commented
Oct 9, 2016
Set Theory & Algebra
gatecse-2015-set3
set-theory&algebra
set-theory
normal
+
–
1
answer
5
find prime and essential applicant morris mano
F(A, B, C, D) = (2, 3, 4, 5, 6, 7, 9, 11, 12, 13)
F(A, B, C, D) = (2, 3, 4, 5, 6, 7, 9, 11, 12, 13)
492
views
commented
Sep 16, 2016
1
answer
6
Calculate the FIRST and FOLLOW for each non Terminal
Consider the Following Grammar P - > S S - > A | A ;S A - > id = E E - > E+E | E-E | E*E | E/E | (E) | T T - > id | num Calculate FIRST and FOLLOW for each non terminal.
Consider the Following GrammarP - SS - A | A ;S A - id = EE - E+E | E-E | E*E | E/E | (E) | TT - id | numCalculate FIRST and FOLLOW for each non terminal.
1.5k
views
commented
Aug 29, 2016
Compiler Design
compiler-design
grammar
parsing
first-and-follow
descriptive
+
–
2
answers
7
ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii
An ambiguous grammar is one that producesmore than one left most derivation for the same sentence.more than one right most derivation for the same sentence.more than one ...
4.0k
views
commented
Aug 28, 2016
Unknown Category
parsing
compiler-design
grammar
ambiguous
+
–
4
answers
8
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
Consider the following statements about the context free grammar$$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$$G...
28.8k
views
commented
Aug 28, 2016
Compiler Design
gatecse-2006
compiler-design
context-free-language
normal
isro2016
+
–
4
answers
9
ISRO2014-52
Consider the following grammar. $S \rightarrow AB$ $A \rightarrow a$ $A \rightarrow BaB$ $B \rightarrow bbA$ Which of the following statements is FALSE? The length of every string produced by this grammar is even No string produced by this grammar has three ... $B$ is always odd No string produced by this grammar has four consecutive $b's$
Consider the following grammar.$S \rightarrow AB$$A \rightarrow a$$A \rightarrow BaB$$B \rightarrow bbA$Which of the following statements is FALSE?The length of every ...
6.5k
views
commented
Aug 28, 2016
Compiler Design
isro2014
compiler-design
grammar
parsing
+
–
3
answers
10
Compiler Design LR(0) Checking
Is E --> E+T / T , T --> i is LR(0) grammar ?
Is E E+T / T , T i is LR(0) grammar ?
2.4k
views
commented
Aug 28, 2016
Compiler Design
compiler-design
grammar
lr-parser
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register