Computer ScienceIteration
Learn Mode

Control Flow and Looping in Programming Quiz

Go to Quiz Page
#1

Which of the following statements is used to terminate the current iteration in a loop and proceed to the next iteration?

continue
Explanation

Skips the rest of the code in the current iteration and jumps to the next iteration in a loop.

#2

In Python, which looping construct is used when you want to iterate over a sequence of elements?

for loop
Explanation

Used for iterating over a sequence of elements.

#3

Which keyword is used to skip the rest of the code in the current iteration and jump to the next iteration in a loop?

continue
Explanation

Skips the rest of the code in the current iteration and jumps to the next iteration in a loop.

#4

In C programming, what does the 'break' statement do?

Ends the loop and transfers control to the statement immediately following the loop
Explanation

Terminates the loop and transfers control to the statement immediately following the loop.

#5

Which of the following looping constructs is more appropriate for situations where the number of iterations is unknown?

while loop
Explanation

Used when the number of iterations is unknown.

#6

What does the 'do-while' loop guarantee in C/C++ programming?

It guarantees that the loop will execute at least once, even if the condition is false initially
Explanation

Guarantees that the loop will execute at least once, even if the condition is false initially.

#7

Which of the following is NOT a valid loop control statement in Python?

skip
Explanation

There is no 'skip' loop control statement in Python.

#8

What is the output of the following code snippet in Python?

```
for i in range(3):
print(i)
else:
print('Loop executed successfully!')
```

0 1 2 Loop executed successfully!
Explanation

Outputs numbers from 0 to 2, then 'Loop executed successfully!' as the 'else' clause is executed after the loop completes normally.

#9

In Java, which loop is ideal for situations when you want the loop to run at least once, even if the condition is false?

do-while loop
Explanation

Guarantees that the loop will execute at least once, even if the condition is false initially.

#10

What is the output of the following code snippet in Python?

```
for i in range(5):
if i == 3:
break
print(i)
else:
print('Loop executed successfully!')
```

0 1 2 3
Explanation

Outputs numbers from 0 to 2, then terminates as 'break' is encountered.

#11

In Java, what is the difference between 'continue' and 'break' statements?

'continue' moves control to the next iteration of the loop, while 'break' terminates the loop and moves control to the statement after the loop
Explanation

'continue' moves control to the next iteration of the loop, while 'break' terminates the loop and moves control to the statement after the loop.

#12

What will be the output of the following code snippet in Python?

```
i = 5
while i > 0:
print(i)
i -= 2
```

5 3 1
Explanation

Outputs numbers starting from 5 and subtracting 2 each iteration until it reaches 1.

#13

In Java, what does the 'continue' statement do?

It skips the current iteration and continues with the next iteration of the loop
Explanation

Skips the current iteration and continues with the next iteration of the loop.

#14

What is the output of the following code snippet in Python?

```
i = 0
while i < 5:
print(i)
i += 1
```

0 1 2 3 4
Explanation

Outputs numbers from 0 to 4.

#15

What is the time complexity of finding an element in an unsorted array using linear search?

O(n)
Explanation

Linear time complexity, meaning it grows linearly with the size of the array.

#16

What is the time complexity of finding an element in a sorted array using binary search?

O(log n)
Explanation

Logarithmic time complexity, meaning it grows logarithmically with the size of the array.

#17

What is the worst-case time complexity of bubble sort algorithm?

O(n^2)
Explanation

Quadratic time complexity, meaning it grows quadratically with the size of the array.

#18

What is the average-case time complexity of quicksort algorithm?

O(n log n)
Explanation

Average-case time complexity, meaning it grows logarithmically with the size of the array.

#19

What is the worst-case time complexity of merge sort algorithm?

O(n log n)
Explanation

Logarithmic time complexity, meaning it grows logarithmically with the size of the array.

Test Your Knowledge

Craft your ideal quiz experience by specifying the number of questions and the difficulty level you desire. Dive in and test your knowledge - we have the perfect quiz waiting for you!