87) A binary tree in which every non-leaf node has non-empty left and right sub-trees is called a strictly binary tree. Such a tree with 20 leaves

cannot have more than 19 nodes

has exactly 19 nodes

has exactly 17 nodes

None of these

Answer is:

None of these

log (n+1)-1

log(n)

log (n-1) + 1

log(n) + 1

Answer is:

Processor and memory

Complexity and capacity

Time and space

Data and space

Answer is:

Counting microseconds

Counting the number of key operations

Counting the number of statements

Counting the kilobytes of algorithm

Answer is:

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

Answer is: