Register
Filter

Questions by cse23

1 votes
2 answers
61
made easy DBMS
R(ABCD) having set of FDs: {AB->C ,C->D and D->A} if R is decomposed into R1(CD), R2(AC) and R3(BC) This is in BCNF or not???
R(ABCD) having set of FDs: {AB->C ,C->D and D->A}if R is decomposed into R1(CD), R2(AC) and R3(BC)This is in BCNF or not???
0 votes
2 answers
62
#doubt#
Can we have having clause without group by clause? if yes then when..? when columns appearing in group by clause may not be in select clause?
Can we have having clause without group by clause? if yes then when..?when columns appearing in group by clause may not be in select clause?
1 votes
1 answer
64
can someone explain with example..
Intersection of recursively enumerable language is REL but is not closed under complementation..
Intersection of recursively enumerable language is REL but is not closed under complementation..
1 votes
1 answer
67
Gate Question
Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies F = { {P, R} → {S,T}, {P, S, U} → {Q, R} } Which of the following is the trivial functional dependency in F+ is closure of F? A {P,R}→{S,T} B {P,R}→{R,T} C {P,S}→{S} D {P,S,U}→{Q
Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies F = { {P, R} → {S,T}, {P, S, U} → {Q, R} }Which of the...
–2 votes
2 answers
68
made easy
int main { int * str ="2017"; printf("%d", madeEasy(str)); return 0; } int maseEasy(int * p1) { int * p2 = p1; while(*++p1); return (p1-p2); } assume object of data type int occupies 2 bytes then output of the program is.............??
int main{int * str ="2017";printf("%d", madeEasy(str));return 0;}int maseEasy(int * p1){int * p2 = p1;while(*++p1);return (p1-p2);}assume object of data type int occupies...
0 votes
1 answer
69
Linked_List
To insert a node at the end of double linked list we need to modify two pointers right??But answer given is one pointer. can someone clarify?
To insert a node at the end of double linked list we need to modify two pointers right??But answer given is one pointer.can someone clarify?
2 votes
2 answers
71
Q. about regular language
Let L be a regular language Is the language L2={y: there exist x and z such that |x|=|z| and xyz belons to L} regular?
Let L be a regular languageIs the language L2={y: there exist x and z such that |x|=|z| and xyz belons to L} regular?
4 votes
4 answers
72
TOC
L = {ambn | m+n is even or odd}, L is regular or not???
L = {ambn | m+n is even or odd}, L is regular or not???
1 votes
0 answers
73
MADE EASY DEMO TEST #Q NO. 13
which of below is recursively enumerable language: a. <M | M is turing macjine and there exist a input whose length is less than 100, on which M halts> b.{M is a turing machine and L(M) ={00,11} } c.{M1, M2, M3 | L(M1) = L(M2) U L(M3) } d. none of these
which of below is recursively enumerable language:a. <M | M is turing macjine and there exist a input whose length is less than 100, on which M halts>b.{M is a turing mac...
7 votes
2 answers
74
time complexity
find TC : $T(n)= 2T(\sqrt{n}) + 1$
find TC : $T(n)= 2T(\sqrt{n}) + 1$
1 votes
0 answers
76
can someone explain about checksum with appropiate examples....
Page: