Register
Filter

Questions by Shreya2002

0 votes
1 answer
2
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-
1 votes
1 answer
3
Made easy || Database
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.
0 votes
0 answers
4
Database: Minimum number of tuples
Consider a relation schema r(A, B, C). Number of elements in domain of attributes A, B and C are 4, 10 and 17 respectively. “ Minimum ” number of tuples possible in an instance of relation r is ________.
Consider a relation schema r(A, B, C). Number of elements in domain of attributes A, B and C are 4, 10 and 17 respectively. “ Minimum ” number of tuples possible in a...