1st Year Computer Chapter 2 Test2. Computational Thinking and Algorithms

Q1. Multiple choice questions (Attempt all · 8 × 1 = 8)

1. Trace method is used to ___________.
   1. Take input
   2. Hand simulate the execution algorithm
   3. Take a print
   4. Align margins
2. In the planning phase of computational artifact development following is included in.
   1. Logic
   2. Data Structures
   3. Control Structures
   4. Logic, Data and Control Structures
3. There are two algorithms suppose A takes 1.41 milliseconds while B takes 0.9 milliseconds, which one of them is better considering all other things the same?
   1. A is better than B
   2. B is better than A
   3. Both are equally good
   4. None of the mentioned
4. Trace Tables are used to _________.
   1. dry run algorithm
   2. test if algorithm is giving expected output
   3. show the variables change
   4. a, b and c
5. An algorithm can be represented through ___________.
   1. Flow charts
   2. Pseudo-codes
   3. Instructions in common language
   4. All of the mentioned above
6. Algorithms are evaluated using ___________.
   1. Correctness
   2. Efficiency
   3. a and b
   4. None of above
7. In computer science, the computational artifacts could include _________.
   1. Programs
   2. Simulations
   3. Videos
   4. Programs, Simulations and videos
8. A complexity of algorithm depends upon ____________.
   1. Time Only
   2. Space Only
   3. Both Time and Space
   4. None of above