Idea of Algorithmic Efficiency in Python MCQ for Class 12 CBSE

Idea of Algorithmic Efficiency in Python MCQ for CBSE Class 12 Computer Science students. Important Objective Questions Answers from NCERT and Sumita Arora Python Book for examination point of view

Introduction to Idea of Algorithmic Efficiency

Idea of Algorithmic Efficiency in Python MCQ for Class 12 CBSE.An algorithm is a method or procedure for accomplishing a specific task, and which is sufficiently precise and that can be programmed on computer. In Computer Science, it is important to measure efficiency of algorithms before applying then on a large scale i.e., on bulk of data. Performance of an algorithm depends on many internal and external factors.

Q.1. What are internal factors specify algorithm’s efficiency.
a) Time required to run
b) Size of the input to the algorithm
c) Speed on the computer on which it is run
d) Quality of the compiler.

Show Answer
a) Time required to run

Q.2. What are internal factors specify algorithm’s efficiency.
a) Space required to run
b) Size of the input to the algorithm
c) Speed on the computer on which it is run
d) Quality of the compiler.

Show Answer
a) Space required to run

Q.3. What are internal factors specify algorithm’s efficiency.
a) Space required to run
b) Size of the input to the algorithm
c) Speed on the computer on which it is run
d) Quality of the compiler.

Show Answer
a) Space required to run

Q.4. What are External factors specify algorithm’s efficiency.
a) Space required to run
b)Time required to run
c) Speed on the computer on which it is run
d) Quantity of computer

Show Answer
c) Speed on the computer on which it is run

Q.5.what is efficiency ?
a)Above 90 percent successful output
b)Above 50 percent successful output
c)Algorithm carries out its intended function correctly.
d)The algorithm should be correct with the best possible performance.

Show Answer
d)The algorithm should be correct with the best possible performance.

Q.6.what is effectiveness ?
a)Above 90 percent successful output
b)Above 50 percent successful output
c)Algorithm carries out its intended function correctly.
d)The algorithm should be correct with the best possible performance.

Show Answer
c)Algorithm carries out its intended function correctly.

Q.7. The time taken is usually considered the more important than memory for efficiency.
a) True
b) False

Show Answer
True

Q.8. Complexity is absolute measure it is not a bounding function characterizing the behaviour of the algorithm as the size of the data set set increases.
a) True
b) False

Show Answer
b) False

Q.9.How Time complexity is defined?
a)watch calculates the time taken.
b)Elementary operation are counted
c)size of the program
d)memory used for processing

Show Answer
b)Elementary operation are counted

Q.10. Big-O notation is used to depict.
a)output size
b)size of memory
c)Growth rate
d)incremental iteration

Show Answer
c)Growth rate

Q.11.The growth rate determines the algorithm’s performance when its input size grows.
a)True
b)False

Show Answer
a)True

Q.12. Algorithm takes O(n2 )time means-
a)total time taken squared
b)output is calculated
c)task is taking N2 steps for input size N.
d)n is n.o of steps

Show Answer
c)task is taking N2 steps for input size N

Q.13.Which complexity is higher O(n2 ) and O(2n ) in input above 10.
a) O(n2 )
b) O(2n )
c) Equal
d) Below zero

Show Answer
b) O(2n )

Q.14.Read and Remember this table.

Common Growth Rates

Time complexity Example

Time ComplexityExampleExample
O(1)constantAdding to the front of list
O(log N)LogFinding an entry in a sorted array
O(N)LinearFinding an entry in an unsorted array
O(N log N)n log nSorting n items by ‘ divide-and-conquer’
O(N2 )quadraticshortest path between two nodes in a graph
O(N3 )cubicSimultaneous linear equations
O(2n)exponentialThe Tower of Hanoi problem

Q.15. calculate the time complexity of following Python program
c is constant. N is input.

x=x+1
for i in range(n):
m=m+2
for j in range(n):
for k in range(n):
a=a+1

a) c
b) cN
c) c2 N
d) cN2

Show Answer
d)cN2

Q.16.The worst case complexity provides an upper-bound on running time .
a)True
b)False

Show Answer
a)True


Thank you for attempting Idea of Algorithmic Efficiency in Python MCQ for Class 12 CBSE !!!!

Similar post




Leave a Comment

Your email address will not be published.