SRI KRISHNA INSTITUTE OF TECHNOLOGY
Accredited by NAAC, Approved by AICTE, New Delhi, Recognised by Govt of Karnataka & Affiliated to VTU, Belagavi
#57, Chimney Hills, Hesaraghatta Main Road, Chikkabanavara Post, Bengaluru- 560090
────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
IA - 1
Dept: CSE Sem / Div: 7 / A Course: AIML Elective: NLP
Date: 2025-08-26 Time: 3 Hrs C Code: 18CS71 Max Marks: 100
Note: Answer all full questions. All questions carry 25 marks.
[Link] Questions CO Level Marks Module
1 a. What is an algorithm? Explain the fundamentals of algorithmic problem solving. 1 L2 10 1
b. What is an algorithm? Explain the fundamentals of algorithmic problem solving. 1 L2 10 1
c. Define Order of growth? Explain basic efficiency classes and also arrange the same
1 L2 5 1
in increasing order of their magnitudes.
OR
2 a. Define Order of growth? Explain basic efficiency classes and also arrange the same
1 L2 5 1
in increasing order of their magnitudes.
b. Give the general plan for analyzing the efficiency of the recursive algorithm.
Develop recursive algorithm for computing factorial of a positive number. Calculate 1 L2 10 1
the efficiency in terms of order of growth.
c. Develop an algorithm to search an element in an array using sequential search.
1 L2 10 1
Calculate the best case, worst case and average case efficiency of this algorithm.
3 a. Develop an algorithm to search an element in an array using sequential search.
1 L2 10 1
Calculate the best case, worst case and average case efficiency of this algorithm.
b. Give the general plan for analyzing the efficiency of the recursive algorithm.
Develop recursive algorithm for computing factorial of a positive number. Calculate 1 L2 10 1
the efficiency in terms of order of growth.
c. For each of the following pairs of functions, indicate whether the first function of
each of the following pairs has a lower, same, or higher order of growth (to within a 1 L2 5 1
constant multiple) than the second function.
OR
4 a. Develop an algorithm to search an element in an array using sequential search.
1 L2 10 1
Calculate the best case, worst case and average case efficiency of this algorithm.
b. What is an algorithm? Explain the fundamentals of algorithmic problem solving. 1 L2 10 1
c. For each of the following functions, indicate how much the functions value will
1 L2 5 1
change if its argument is increased Fourfold. a. log 2 n b. √n c. n d. n 2 e. n 3 f. 2 n
Certificate
I hereby certify that I have completed the specified syllabus for the CIE exam. I have referred the specified Text &
Reference books / I have referred additional books and notes. Questions are set to cover the Course Outcomes and
Blooms learning levels specified for the CIE.
Name:
Signature:
Prepared by Checked by Approved