Polynomial Arithmetic

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the worst case analysis used for?

a: Used to find an upper bound on algorithm performance for large problems (large n) Explanation

Explanation

b: Used to find the upper bound on algorithm performance for small problems (small n) Explanation

Explanation

c: Used to find the lower bound on algorithm performance for small problems (small n) Explanation

Explanation

d: None of these Explanation

Explanation

2. Time complexity expresses the relation between the size of the input and runtime for the algorithm

a: True Explanation

Explanation

b: False Explanation

Explanation

3. Given two polynomials converted to linked list representation with nodes ‘m’ and ‘n’ respectively. What is the time complexity for adding them?

a: O (m) Explanation

Explanation

b: O (n) Explanation

Explanation

c: O (m+n) Explanation

Explanation

d: O (log n) Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)