14 votes
3 answers
103
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression?If there then ple...
49 votes
10 answers
104
27 votes
4 answers
105
5 votes
1 answer
108
77 votes
5 answers
113
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$
1 votes
1 answer
114
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G...
33 votes
6 answers
116
5 votes
2 answers
117
83 votes
13 answers
119
56 votes
8 answers
120
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$