Register
Filter

Answers by AnilGoudar

1 votes
2
GNF Question
Can GNF contains ε example - S-----> aε is it in GNF i.e can a terminal have an ε afterwards and will that be in GNF?
Can GNF contains ε example - S - aε is it in GNF i.e can a terminal have an ε afterwards and will that be in GNF?
0 votes
3
er diagram
model----> make make----->model both none
model makemake ->modelbothnone
6 votes
4
Subnetting
Let host X has IP address 11.110.2.112 and host Y has IP address 11.110.2.92 and both hosts use the same netmask Z. which of the network masks Z given below can used if both hosts are in the same network? 255.255.255.224 255.255.255.252 255.255.255.193 255.255.128.0
Let host X has IP address 11.110.2.112 and host Y has IP address 11.110.2.92 and both hosts use the same netmask Z. which of the network masks Z given below can used if b...
2 votes
5
Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)
Ques. S Aa/bAc/dc A dWhich of them is correct. Please provide detailed information.a) LALR(1) but not SLR(1)b) Both SLR(1) and LALR(1)c) Grammar is Ambiguo...
2 votes
7
digital logic
Minimum number of 2 input NAND gate required to implement 4 input NAND gate is __________________
Minimum number of 2 input NAND gate required to implement 4 input NAND gate is __________________
0 votes
8
4,4bit CLA for 16 bit adder
How to calculate the total gate delay for 16 bit adder using 4, 4 bit CLA? Question source:https://en.wikipedia.org/wiki/Carry-lookahead_adder
How to calculate the total gate delay for 16 bit adder using 4, 4 bit CLA?Question source:https://en.wikipedia.org/wiki/Carry-lookahead_adder
0 votes
9
LOGICAL GATES
An XOR gate will act as __________ when one of its input is one and as ________ when one of its input is zero. a) buffer, buffer b) buffer, inverter c) inverter, buffer d) inverter, inverter
An XOR gate will act as __________ when one of its input is one and as ________ when one of its input is zero.a) buffer, buffer b) buffer, inverter c) inve...
0 votes
10
CANDIDATE KEYS
given R(ABCDE) AB -> C C -> D B ->E FIND CANDIDATE KEY Solution : AB will be candidate key because (AB)+ = R my question is do i have to check for (AC)+ ,(AD)+ , (AE)+ , (ACDE)+
given R(ABCDE)AB - CC - DB ->E FIND CANDIDATE KEY Solution : AB will be candidate key because (AB)+ = R my question is do i have to check for (AC)+ ,(AD)+ , (AE)+ ...
2 votes
12
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above
–1 votes
13
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$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
0 votes
14
theory of computation
which languages among regular lang CFL CSL REC REL have ambiguos grammar and which has unambiguos grammar and which can have both
which languages amongregular langCFLCSLRECREL have ambiguos grammar and which has unambiguos grammar and which can have both
0 votes
15
propagation delay in NOT gate
3 votes
16
DBMS Counting superkeys
R(ABCDEF) with candidate keys set { A,BC,CD}. Find number of superkeys?
R(ABCDEF) with candidate keys set { A,BC,CD}. Find number of superkeys?
0 votes
17
databases
Which of the following statements is TRUE ? A) Every primary index is also a clustered index. B) Every clustered index is also a primary index. C) Both primary index and clustered index are one and the same, D) An index can be either primary or clustered but not both.
Which of the following statements is TRUE ?A) Every primary index is also a clustered index.B) Every clustered index is also a primary index.C) Both primary index and clu...
1 votes
20
CONFLICT SERIALIZABLE
What is the answer?
What is the answer?
2 votes
21
Minimum keys in a B-tree of order of 3 which has height = 3?
I think answer is 7 ,if not then pls explain .
I think answer is 7 ,if not then pls explain .
3 votes
22
Bit Comparator
0 votes
23
FA with complement
Consider this FA: How many strings will be there in the complement of the language accepted by this Finite Automata? (a) Infinite (b) 2 (c) 3 (d) 0
Consider this FA:How many strings will be there in the complement of the language accepted by this Finite Automata?(a) Infinite(b) 2(c) 3(d) 0
0 votes
24
Candidate key
how many number of candidate keys in the following relation r = (a, b, c, d, e, h) on which the following functional dependencies hold: {a →bc, c d→ e, e → c,d → aeh,abh→ bd, dh → bc}. what are the candidate keys r?
how many number of candidate keys in the following relation r = (a, b, c, d, e, h) on which the following functional dependencies hold: {a →bc, c d→ e, e → c,d → ...
1 votes
25
DSSB_2017
Which contains the information about a file that is needed by the system programs that access the file records? 1.A file header 2.A file descriptor 3.Bootstrap 4.Both 1 and 2
Which contains the information about a file that is needed by the system programs that access the file records?1.A file header2.A file descriptor3.Bootstrap4.Both 1 and ...
2 votes
27
SQL QUERY
What is the answer of below query and please give detailed answer how exists work as i think it only check row in inner query exist or not?
What is the answer of below query and please give detailed answer how exists work as i think it only check row in inner query exist or not?
0 votes
28
toc gatebook test Q 2
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ is Always Regular Always Not Regular Sometimes Regular, but not always None
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ isAlways RegularAlways Not RegularSometimes Regular, but not...
0 votes
29
Local Workbook
What will be the regular expression for this ?
What will be the regular expression for this ?
1 votes
30
Normalisation
It is said that if a relation is in bcnf then it is also in 3nf. Then why a lossless and non-dependency preserving decomposition qualifies to be in bcnf but not in 3nf. I am not getting it. Please clear my concept.
It is said that if a relation is in bcnf then it is also in 3nf. Then why a lossless and non-dependency preserving decomposition qualifies to be in bcnf but not in 3nf. I...
Page: