Page 122 - Computer science 868 Class 12
P. 122
Unsolved Questions
A. Tick ( ) the correct answer:
1. Which of the following feature of an algorithm indicates that it can be coded to any programming language giving the same
result?
a. Finiteness b. Input
c. Memory d. Language independence
2. Which of the following is a case that may arise during Big O notation calculation?
a. Good case b. Bad case
c. Average case d. Middle case
3. In recursive algorithm the method ………………… itself.
a. deletes b. writes
c. calls d. fills
4. A stack has ………………… ends.
a. two b. one
c. infinite d. no
5. Every step in an algorithm follows a ………………… sequence.
a. different b. infinite
c. logarithmic d. logical
B. Fill in the blanks:
1. ………………… is a representation of an algorithm in symbols.
2. Developing an algorithm is ………………… consuming.
3. An ………………… algorithm is one that will produce the correct output in minimum time and utilise less memory space.
4. Algorithms must produce the correct output after ………………… number of steps and terminate after that.
5. In ………………… case complexity the function takes the minimum time or the minimum number of steps required for execution.
C. Answer the following questions:
1. Define the following:
a. Algorithm
b. Pseudocode
c. Flowchart
2. Write the purpose of the following symbols in the flowchart.
a.
b.
c.
d.
e.
3. Write one similarity and one difference between pseudocode and flowchart.
4. Define the following:
a. Best case
b. Worst case
c. Average case complexity
5. Write an algorithm to accept the cost price and selling price of an item. Check whether it is profit or loss. Then, print the profit or
loss amount along with the profit or loss percentage.
120120 Touchpad Computer Science-XII

