Coding Interview Q&A

Consider that m elements are to be sorted. What is the worst case time complexity of bubble sort ? A. O(1) B. O(log n) C. O(n) D. O(n2)

The C declaration int A[5][7] Contains x elements, each of these elements is itself an array containing y integers. What is the value of 2x+y A. 17 B. 24 C. 35 D. None of these

What is the order to access the elements of a pushdown stack ? A. First In First Out B. Last In First Out C. Last In Last Out D. First In Last Out

Which of the following is the function/s of the database administration? A. Application checking B. Database access planning C. Computer applications management D. All of these

What of the following sorting procedure is the slowest? A. Bubble sort B. Quick sort C. Heap sort D. Shell sort

What is the function of application programs in the DBMS approach? A. processing functions B. storage functions C. access control D. None of these