0 votes
1
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
–1 votes
2
0 votes
3
0 votes
4
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
0 votes
5
0 votes
6
0 votes
13
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________.Please ex...
0 votes
17
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overf...
0 votes
19
0 votes
20
Confusion regarding these log representations.1.(logn)22.log2n3.log(logn)4.log(n)2which of these are equal . Also explain meaning of each one.(Pls provide any source if p...
0 votes
21
0 votes
22
can anyone tell me wat is the right equation for carry generator in carry lookahead adder ?? Confused ..$ C_{i} = G_{i}+P_{i}C_{i-1}$$ C_{i+1}=G_{}i+P_{}iC_{}i$
9 votes
24
Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote
0 votes
29