Show that the function f(n) defined by if (I) = 1 f(n) = f(n-1) + 1/n for n>1, has the complexity O (log n) Let the size of the elements stored in an 8*3 matrix be 4 bytes each. If the base address ...
eduhilfe Latest Questions
a) four pointer exchanges b) two pointer exchanges c) one pointer exchanges d) np pointer exchange.
f( 1 )=1 f( n )= f(n-1)+ for n > 1 has the complexity O (log n). Define Big-O,
a) Stack pointer b) Address latch c) Program counter d) General purpose register.
a) Resolution b) offset error c) Monotonicity d) Settling error e) Percentage resolution.
G(A, B, C, D) =(1, 2, 3, 5, 6, 11, 12 ) + d( 7, 8, 10, 14).
a) Sorting records on the basis of multiple keys b) Worst case performances of sorting algorithm c) Sorting alpha numeric keys as they are likely to be the same d) None of these.
a) 8421 b) Excess-3 c) Gray d) ASCII.
a) Generate square wave b) Convert sine to square wave c) Convert triangular to sine wave d) Convert triangular to square wave.
a) Stack b) Dequeue c) AVL tree d) Binary Search.