1) Check all those functions from the list below that are big O of log(n).

log(log(n))

(log(n))^2

n^n

ln(n^2)

ln(ln(n^2))

2)How many comparisons are necessary to merge the following two stacks by using the Mergesort procedure?

Stack A:[113, 163, 173, 193, 223, 233, 263, 283, 293, 313, 353, 373, 383, 433, 443, 463, 503, 523, 563, 593, 613, 643, 653, 673, 683, 733, 743, 773, 823, 853, 883, 953, 983]

Stack B:[101, 107, 199, 127, 131, 137, 139, 149, 151, 157, 167, 179, 181, 191, 197, 199, 211, 227, 229, 239, 241, 251, 257, 269, 271, 277, 281, 307, 311. 317, 331, 337, 347, 349]

3) How many vertices does a binary tree (1 vertex of valence 2, all others of valence 3 or of valence 1 (leaves)) with 720 leaves have?

4)1000 records are stored in the director's office. The records are ordered by increasing social security number.
How many comparisons will it take, in the worst case, to find a record with a particular social security number on it, if
a binary search is used?
5) Select the statements below which are true:

n*log(n) is big O of log(n!)

log(n!) is big O of n*log(n)

n*log(n) is not big O of log(n!)

log(n!) is not big O of n*log(n)

    • 10 years ago
    100% correct answer A++ work Guaranteed the best Tutorial
    NOT RATED

    Purchase the answer to view it

    blurred-text
    • attachment
      coursehero8.pdf