0 votes
1
formula for which maximum number of nodes will be present in complete n-array tree?
0 votes
3
6 votes
5
Match the following items$$\begin{array}{ll|ll}\hline \text{(i)} & \text{Backus-Naur form} & \text{(a)} & \text{Regular expressions} \\\hline \text{(ii)} & \text{Lexical...
0 votes
6
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sortB Selection sortC Merge s...
1 votes
7
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
1 votes
9
Which one is greater in asymptomatic notation?1)n 2)(log n)100