PROGRAMMING CONCEPTS

What is the correct syntax to declare a variable in Python?

• variable x = 5

• int x = 5;

• x = 5

• declare x = 5

Answer explanation

declaring variable in python, don't need to have data type and semi colon ";"

Which data type is mutable in Python?

• Tuple

• String

• List

• Integer

Answer explanation

This means we can change an item in a list by accessing it directly as part of the assignment statement

What does the elif statement do in Python?

• Ends the program

• Runs a loop

• Checks another condition if the previous one is false

• Defines a function

What will print(3 * "hello") output?

• hellohellohello

• hello * 3

• A storage location for data

• error

Answer explanation

n Python, the * operator can be used with strings to repeat them a specified number of times.

3 * "hello" means "hello" is repeated 3 times.

So, "hello" * 3 evaluates to "hellohellohello" (without spaces).

What is debugging?

• Removing unnecessary comments from code

• Fixing errors in a program

• Writing new code

• Running a program without stopping

Which of the following is a valid way to access an element in a list?

• list[1]

• list(1)

• list{1}

• list.1

Answer explanation

In Python, elements in a list are accessed using indexing with square brackets ([]).

The "if" statement is used for looping.

• REYAL

• FAKEY

Object-oriented programming (OOP) is based on functions only.

• REYAL

• FAKEY

If a problem involves finding the maximum value in a list, which approach is best?

• Sort the list and take the last element

• Use a loop to compare each element

• Multiply all elements together

• Convert the list to a set

Answer explanation

To find the maximum value in a list efficiently, the best approach is to iterate through the list, keeping track of the largest number found so far.

Which algorithm is best for searching a sorted list?

• Linear Search

• Bubble Sort

• Binary Search

• Selection Sort

Answer explanation

Binary Search is the most efficient way to find an element.
How Binary Search Works:

1. 1. Start with the middle element of the list.

2. 2. If the middle element is the target, return it.

3. 3. If the target is smaller, search the left half of the list.

4. 4. If the target is larger, search the right half.

5. 5. Repeat this process until the element is found or the search space is empty.