MOCK TEST 2


1. Which of the following statement is false for a turing machine?

 
 
 
 

2. The problem, which is not NP-hard, is

 
 
 
 

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”);

}

 
 
 
 

4. What is the following program doing?

                   main ()

         { int d = 1;

         do

                    printf(“%d\n”, d++);

         while (d < = 9);}                       

 
 
 
 

5. What is a Cybernetics?

 
 
 
 

6. What is a heuristic function?

 
 
 
 

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

 
 
 
 

8. One of the fault base testing techniques is

 
 
 
 

9. All the modules of the system are integrated and tested as complete system in the case of

 
 
 
 

10. Modules X and Y operate on the same input and output data, then the cohesion is

 
 
 
 

11. The number of processes completed per unit time is known as __________

 
 
 
 

12. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?

 
 
 
 

13. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________

 
 
 
 

14. When an instruction is read from the memory, it is called

 
 
 
 

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

 
 
 
 

16. Cache memory works on the principle of

 
 
 
 

17. Which option will be used with ps command to slow the entire command line of the process being run?

 
 
 
 

18. On executing a statement set -3+1

 
 
 
 

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

 
 
 
 

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.

 
 
 
 

Question 1 of 20

 

Leave a comment