Exploring Programming Techniques Quiz

In a flight booking app, users are asked to enter their departure airport, destination airport, departure date, return date, number of adults and number of children.

Passengers are allocated an available seat. A data structure named seats is used to store whether each seat is available (true) or unavailable (false).

The pseudocode design shows how an available seat is allocated.

Which piece of code correctly implements this design?

• 
• 
• 
• 

Which of the following is a fundamental concept of Object-Oriented Programming?

• Procedural Abstraction

• Inheritance

• Functional Programming

• Recursion

In Object-Oriented Programming, what is encapsulation?

• The ability to create a new class from an existing class

• The process of hiding the internal state and requiring all interaction to be performed through an object's methods

• The ability to define multiple methods with the same name but different implementations

• The process of breaking a problem into smaller sub-problems

Which data structure uses a Last In, First Out (LIFO) approach?

• Queue

• Stack

• Linked List

• Tree

What is the time complexity of searching for an element in a balanced binary search tree?

Which of the following is an example of a recursive function?

• A function that calls itself

• A function that uses a loop to iterate over a list

• A function that sorts an array using a for loop

• A function that calculates the sum of two numbers

What is the base case in a recursive function?

• The case where the function calls itself

• The condition under which the recursion stops

• The first call to the recursive function

• The case where the function returns a value without recursion

Which of the following is a characteristic of a queue data structure?

• First In, First Out (FIFO)

• Last In, First Out (LIFO)

• Random Access

• Hierarchical Structure

In Object-Oriented Programming, what is polymorphism?

• The ability to create a new class from an existing class

• The ability to define multiple methods with the same name but different implementations

• The process of hiding the internal state and requiring all interaction to be performed through an object's methods

• The process of breaking a problem into smaller sub-problems

Which algorithm is used to find the shortest path in a graph?

• Quick Sort

• Dijkstra's Algorithm

• Binary Search

• Merge Sort