algorithm 11)Assume the time of an algorithm is T(n) = (log n)2. If the size is squared the time is

12)Array A= { 6,1,10, 9, 7, 4, 8, 2, 15 }; After applying the quick sort the split index after the first iteration is

15)Topological sorting is an example of

a. D & C

b. Dec & C by variable size

c. Dec & C by constant (1)

d. Dec & C by constant factor (half) 16)After generating the AVL tree from the list: 7, 10, 15, 25, 22, 13, 11, 5, 9, 3, 6, 1

The root is 17)if the time of an algorithm represented by the recurrence T(n) = 2T(n-1) + n , then the time of this algorithm is polynomial time(T/F) 18)Worst-case time of String matching Brute force is O (nm) (T/F) 20)If the undirected complete graph has n nodes then the number of edges without loop is