ISRO CSE 2014
Q61.
Consider the following sorting algorithms.I. QuicksortII. HeapsortIII> MergesortWhich of them perform in least time in the worst case?Q62.
Which of the following is NOT represented in a subroutine's activation record frame for a stack-based programming language?Q63.
Consider the following Java code fragment: public class While { public void loop() { int x = 0; while(1) { System.out.println("x plus one is" +(x+1)); } } }Q64.
The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item isQ65.
Which of the following is FALSE with respect to possible outcomes of executing a Turing Machine over a given input?Q66.
What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: