Beginner Programs Quiz

Complete this assessment with 100% score to master this chapter.

01In the provided Fibonacci program, which data type is used for 't1' and 't2' to handle large numbers?

02In a prime number check, why do we only need to test divisors up to the square root of N?

03What is the time complexity of the simple Bubble Sort algorithm?

04In the calculator program, why is a space used before '%c' in 'scanf(" %c", &op)'?

05What is the result of '5 % 2' in C?