ONLINE SUMMER TRAINING Online Courses Free Tutorials 
 Placement Preparation 
Artificial Intelligence(AI) & Machine Learning(ML) Training in Jaipur
0 like 0 dislike
in Examples, Exercises and Projects by (562 points)
edited by

Mcq's on algorithms and recursion along with answers most frequently asked in both the company's placement preparation and college semester examinations.

Goeduhub's Online Courses @Udemy

For Indian Students- INR 570/- || For International Students- $12.99/-


Course Name

Apply Coupon


Tensorflow 2 & Keras:Deep Learning & Artificial Intelligence

Apply Coupon


Computer Vision with OpenCV | Deep Learning CNN Projects

Apply Coupon


Complete Machine Learning & Data Science with Python Apply Coupon


Natural Language Processing-NLP with Deep Learning in Python Apply Coupon


Computer Vision OpenCV Python | YOLO| Deep Learning in Colab Apply Coupon


Complete Python Programming from scratch with Projects Apply Coupon

1 Answer

0 like 0 dislike
by (562 points)
selected by
Best answer

1) System defined data types are also called as

a) Primitive data types

b) Non-primitive data types

c) Identifiers

d) none

Ans:a(Primitive data types) 

2) What is the goal of the analysis of algorithms? 

Ans:The goal of the analysis of algorithms is to compare algorithms (or solutions) mainly in terms of running time but also in terms of other factors. 

3) What is an amortized analysis? 

Ans:Amortized analysis refers to determining the time-averaged running time for a sequence of operations. 

4) ∑i≤k≤n O(n), where O(n) stands for order n is:

a) O(n)

b) O(n 2

c) O(n3

d) none

Ans: b  ( ∑i≤k≤n O(n) = O(n) 

∑i≤k≤n 1 =O(n 2) ) 

5) Another name for lower bounding function is:

a) Omega Notation

b) Recursion

c) Big oh notation

d) None 

Ans:a(Omega notation) 

6) Why do you call algorithm analysis asymptotic analysis? 

Ans:In mathematics, we call such a curve an asymptotic curve. In other terms, g(n)  is the asymptotic curve for f(n). For this reason , we call algorithm analysis asymptotic analysis. 

7) To solve recursion problems, we use mostly which method? 

a) Master Method

b) Recursion

c) Substitution Method

d) none

Ans:a(Master  Method) 

8) The solution to the equation,  

T(n) =T(a  n) +T((1-a) n) +bn , 

where 0<a<1 and b>0 are constants , is

a) logn

b) O(nlogn) 

c) O(1) 

d) none


9) A function which calls itself is

a) Iteration

b) Recursion


d) none


10) What is Backtracking? 

Ans:Backtracking is an improvement of the brute force approach. It systematically searches for solution to a problem among all available choices. 

Our Mentors(For AI-ML)

Sharda Godara Chaudhary

Mrs. Sharda Godara Chaudhary

An alumna of MNIT-Jaipur and ACCENTURE, Pune


Ms. Nisha

An alumna of IIT-BHU


About Us | Contact Us || Terms & Conditions | Privacy Policy || Youtube Channel || Telegram Channel © Social::   |  |