0 votes
0 answers
1
explain how to solve the above question !
0 votes
0 answers
2
every sublattice of a distributive lattice is also a distributive lattice?explain above line if possible then take an example..!
0 votes
1 answer
6
"edge disjoint spanning tree" means ?
0 votes
1 answer
7
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
2 votes
0 answers
8
Express it in terms of logic, here in question i am confused how i use implications, i am unable to distinguish between option a and b .. need help. ..!
0 votes
0 answers
9
a subcube of 2^m cell is possible if and only if ,in that subcube for every cell m number of cells must be adjacent cell .please explain what is adjacent cell, here ??...
1 votes
5 answers
11
0 votes
1 answer
12
0 votes
0 answers
13
0 votes
0 answers
14
what is the work of " logical address " (which is generated by cpu) what is the perfect meaning of the logical address .and same doubt in physical address ..??please expl...
1 votes
1 answer
15
difference between #define and typedef ???please give logical answer not general answer
1 votes
1 answer
16
0 votes
1 answer
17
Why B or B+ tree is prefer for database indexing rather than AVL tree ????
0 votes
0 answers
18
What is the disadvantage of avl tree over b tree ??
0 votes
0 answers
19
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???
2 votes
1 answer
20
How to remove extraneous attributes ??Que - find the minimal cover of the functional dependency setA->BCDEF BC->ADEF B->F D->E explain whlole procedure please