I Semester M.C.A.

Pre-Final Examination, June 2021

1MCA1: THE ART OF COMPUTER PROGRAMMING

Duration: 3 Hrs Max Marks: 70

Part- A
Answer any five of the following. Each question carries 6 marks. (5 X 6 = 30)

1. What are the features of an efficient algorithm?

2. Explain about array and multidimensional array.
3. Explain what is the difference between best case scenario and worst case scenario of
an algorithm?
4. Differentiate between break and continue with examples.
5. Explain about different kinds of loop statements.
6. What is Hashing? What is a collision in hashing?
7. Write an algorithm to reverse the digits of a decimal number.
8. Write a short note on standard input - output format in C programming.

Part- B
Answer any four of the following. Each question carries 10 marks. (4 X 10 = 40)

9. What is an algorithm? What is an algorithm to analyze?

10. Discuss the asymptotic notations. How does one measure the efficiency of the
algorithm?
11. Differentiate between Binary and hash search with a suitable example.
12. Write an algorithm to compute the Fibonacci series for ‘n’ terms.
13. Write an algorithm to exchange the values of two variables.
14. Explain Pattern search and its types with an example.