Dark Mode

Answers by AnilGoudar

0 votes

1

True or False Question regarding DPDA and prefix property
a) A DPDA which accepts by empty stack cannot accept all Regular Languages? b) All Regular Languages doesn't satisfy prefix property?

answered in Theory of Computation Sep 17, 2017

4.6k views

1 vote

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?

answered in Theory of Computation Sep 17, 2017

924 views

0 votes

3

er diagram
model----> make make----->model both none

answered in Databases Sep 11, 2017

348 views

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

answered in Computer Networks Aug 28, 2017

1.6k views

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)

answered in Compiler Design Aug 10, 2017

550 views

0 votes

6

#testbook test series

answered in Compiler Design Jul 24, 2017

632 views

2 votes

7

digital logic
Minimum number of 2 input NAND gate required to implement 4 input NAND gate is __________________

answered in Digital Logic Jul 20, 2017

744 views

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

answered in Digital Logic Jul 19, 2017

863 views

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

answered in Digital Logic Jul 17, 2017

1.2k views

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)+

answered in Databases Jul 17, 2017

505 views

1 vote

11

basic csma/cd
confusion ;- in csma/cd let there are many devices let the device wants to transmit a packet and channel is ideal than it will continue transfer the packet to channel. While during the transmission there is collision . Will the device do continuously transmit the packet or go to binary back off?

answered in Computer Networks Jul 17, 2017

213 views

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

answered in Operating System Jul 16, 2017

9.7k views

–1 vote

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$.

answered in Theory of Computation Jul 14, 2017

4.2k views

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

answered in Theory of Computation Jul 12, 2017

249 views

0 votes

15

propagation delay in NOT gate

answered in Digital Logic Jul 12, 2017

1.2k views

3 votes

16

DBMS Counting superkeys
R(ABCDEF) with candidate keys set { A,BC,CD}. Find number of superkeys?

answered in Databases Jul 11, 2017

445 views

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.

answered in Databases Jul 10, 2017

1.6k views

0 votes

18

Query
Hi Let the table be as, id Name 1102 n_1102/abc 1102 n_1102/xyz 1102 n_1102/pqr Please help to get the following data from the table, for each id, we have many names, but from the name, the first part ie. before '/' is common for all, so if i query as "Select ... all the names. i.e by executing a query for id = 1102, then i should i get name as n_1102 as a single row in the result set.

answered in Databases Jul 10, 2017

170 views

0 votes

19

Raghunath Tiwari(NPTEL NOC Chomsky Normal Form)
S->ASB A->aASA | a | ϵ B->SbS | A | bb Convert this grammar into Chomsky Normal Form

answered in Theory of Computation Jul 3, 2017

660 views

1 vote

20

CONFLICT SERIALIZABLE
What is the answer?

answered in Databases Jun 21, 2017

248 views

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 .

answered in Databases Jun 21, 2017

4.3k views

3 votes

22

answered in Digital Logic Jun 21, 2017

2.4k views

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

answered in Theory of Computation Jun 20, 2017

1.6k views

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?

answered in Databases Jun 15, 2017

477 views

1 vote

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

answered in Operating System Jun 13, 2017

587 views

0 votes

26

michael sipser chpater 1 3rd edition Q. 9 nfa
Give state diagrams of NFAs recognizing the concatenation of the languages a.) {w | the length of w is at most 5 } b.) {w | every odd position of w is 1 } The NFA has to be made by concatenating two different NFAs. how can this be done ?

answered in Theory of Computation Jun 12, 2017

493 views

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?

answered in Databases Jun 10, 2017

163 views

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

answered in Theory of Computation Jun 9, 2017

467 views

0 votes

29

Local Workbook
What will be the regular expression for this ?

answered in Theory of Computation Jun 8, 2017

194 views

1 vote

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.

answered in Databases Jun 8, 2017

532 views

Page:

1
2
3
next »