Week 3 - Algo Analysis (SY24-25/ITC202-203I)

Poll

As a programmer, do you design an algorithm (like a flowchart) before proceeding to coding?

• YES

• NO

Multiple Choice

It refers to estimating the performance of an algorithm based on actual measurements of an algorithm's performance on real data, providing empirical insights into its practical efficiency.

• Priori

• Posteriori

• Rough Estimate

• All of the mentioned

Multiple Choice

With this criterion the goal is to find algorithms with lower time complexity, indicating faster execution as the input size increases.

• Time complexity

• Space complexity

• Stability

• All of the mentioned

Multiple Choice

Given 2 algorithms performing the same task with N inputs

$$P1:10N\ and\ P2:\frac{N^2}{2}$$

which is faster and more efficient?

• P1

• P2

• P1 is faster p2 is efficient

• P2 is faster and P1 is efficient

Multiple Choice

Both the for and while loop structures in Python operate similarly.

• TRUE

• FALSE

Multiple Choice

When a programmer initializes a value to 0, it already counts an operation.

• TRUE

• FALSE

Multiple Choice

Is it possible to develop a program without passing through every step of the development life cycle?

• TRUE

• FALSE

Multiple Choice

Using a loop within the loop will always result into a time complexity of $$O\left(n^2\right)$$ .

• TRUE

• FALSE