Register
Filter

Questions by kumar.dilip

0 votes
1 answer
1
Self Doubt
Consider the following relation: R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many super keys are there in R?
Consider the following relation:R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many superkeys are there in R?
1 votes
1 answer
2
Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.Ans: $\frac{8}{3}$
0 votes
1 answer
3
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
2 votes
1 answer
4
Self Doubt
If L is CFL then $\bar{L}$ is Recursive. ( True/False) If L is CFL then $\bar{L}$ is RE. (True/Flase).
If L is CFL then $\bar{L}$ is Recursive. ( True/False)If L is CFL then $\bar{L}$ is RE. (True/Flase).
0 votes
1 answer
5
Probablity
Suppose each of three men at a party throws his hat into the center of the room. The hats are first mixed up and each man randomly selects a hat. what is the probability that- a. All of three men select his own hat. b.None of three men select his own hats.
Suppose each of three men at a party throws his hat into the center of the room. The hats are first mixed up and each man randomly selects a hat. what is the probability...
0 votes
0 answers
6
Relational Algebra
Online Site For practicing Relational Algebra https://dbis-uibk.github.io/relax/calc.htm
Online Site For practicing Relational Algebrahttps://dbis-uibk.github.io/relax/calc.htm