#1
July 14th, 2014, 04:04 PM
| |||
| |||
Persistent Latest campus placement paper
Is there any buddy to provide me the Persistent Latest campus placement paper???? This is the Persistent Latest campus placement paper: A. Computer Algorithms 1. Time Complexity 2. Which of the following cannot be implemented efficiently in Linear Linked List 1. Quicksort 2. Radix Sort 3. Polynomials 4. Insertion Sort 5. Binary Search 3. In binary search tree , n=nodes, h=height of tree. What's complexity? 1. o(h) 2. o(n*h) 3. o(nLogn) 4. o(n*n) 5. None 4. 5. B. C Programs 1. Printf("%d%d",i++,i++); 1. Compiler Dependent 2. 4 4 3. 4 3 4. 3 4 5. None of Above 2. void main() { printf("persistent"); main(); } 1. Till stack overflows 2. Infinite 3. 65535 4. 34423 5. None 3. Swapping Last edited by Neelurk; February 25th, 2020 at 10:43 AM. |
|