MOCK TEST 2This entry was posted in MOCK TEST SERIES on April 5, 2017 by nikhilarora 1. Which of the following statement is false for a turing machine? There exists an equivalent deterministic turing machine for every non-deterministic turing machine Turing decidable languages are closed under intersection and complementation Turing recognizable languages are closed under union and intersection Turing recognizable languages are closed under union and complementation 2. The problem, which is not NP-hard, is Finding bi-connected problem of a graph The graph colouring problem Hamiltonian circuit problem The 0/1 Knapsack problem 3. What is the output of the following program? main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf (“z1”); printf(“z2”); } z2 z1z2 Compilation error None of these 4. What is the following program doing? main () { int d = 1; do printf(“%d\n”, d++); while (d < = 9);} Adding 9 integers Adding integers from 1 to 9 Displaying integers from 1 to 9 None of these 5. What is a Cybernetics? Study of communication between two machines Study of communication between human and machine Study of communication between two humans Study of Boolean values 6. What is a heuristic function? A function to solve mathematical problems A function which returns an object A function whose return type is nothing A function that maps from problem state descriptions to measures of desirability. 7. he travelling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is O(n) O(n2) O(n!) O(n/2) 8. One of the fault base testing techniques is unit testing. beta testing. Stress testing mutation testing. 9. All the modules of the system are integrated and tested as complete system in the case of Bottom up testing Top-down testing Sandwich testing Big-Bang testing 10. Modules X and Y operate on the same input and output data, then the cohesion is Sequential Communicational Procedural Logical 11. The number of processes completed per unit time is known as __________ Output Throughput Efficiency Capacity 12. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy? Time-sharing SPOOLing Preemptive scheduling Multiprogramming 13. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________ Process Blocking Context Switch Time Sharing None of the above 14. When an instruction is read from the memory, it is called Memory Read cycle Fetch cycle Instruction cycle Memory write cycle 15. If a register containing data (11001100)2 is subjected to arithmetic shift left operation, then the content of the register after ‘ashl’ shall be (11001100)2 (1101100)2 (10011001)2 (10011000)2 16. Cache memory works on the principle of Locality of reference Locality of memory Locality of reference & memory none 17. Which option will be used with ps command to slow the entire command line of the process being run? -4 -f -1 -5 18. On executing a statement set -3+1 $1 would be -3 $1 would be – $1 would be set This command would result into an error 19. Consider the following rooted tree with the vertex P labeled as root The order in which the nodes are visited during in-order traversal is SQPTRWUV SQPTURWV SQPTWUVR SQPTRUWV 20. The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable. 6 7 8 9 Loading … Question 1 of 20