Data Types
Control Flow
Functions
OOPs concept
Algorithms
100

This data type is used to store whole numbers in most programming languages

What is an integer?

100

A keyword that is used to execute a block of code only if a certain condition is true

What is "if"?

100

It is a keyword used to define a function in python.

What is "def"?

100

It is the full form of OOP.

What is object-Oriented Programming?

100

It is the simplest search algorithm that checks every element until a match is found.

What is linear search?

200

This data type is used for storing a sequence of characters

What is a String?

200

A keyword that is used to repeat a block of code for a specific number of iterations

What is "for"?

200

It is a term for a function that does not return a value. 

What is a void function?

200

A term for a blueprint from which individual objects are created.

What is a class?

200
It is the sorting algorithm that compares and swaps adjacent elements to sort a list.

What is bubble sort?

300

This data type can only have two possible values, typically representing true and false

What is a boolean?

300

A control flow structure that is used to execute a block of code as Long as a condition is true

What is a "while" loop?

300

They are the variables listed in a function's definition.

What are parameters?

300

It is the process called when an object takes on properties or methods of another class. 

What is inheritance?

300

An algorithm used to find the shortest path between nodes in a graph 

What is Dijkstra's algorithm?

400
This data structure is used to store multiple items of the same type in a fixed-size structure in memory

What is an array?

400
This keyword is used to terminate a loop or switch statement. 

What is "break"?

400

It is the concept of passing a function as an argument to another function.

What is a higher-order function?

400

It is called when different objects are accessed through the same interface, often seen as a form of method overriding. 

What is polymorphism?

400

It is the algorithm used to sort data by dividing it into smaller subarrays based on a pivot value. 

What is quicksort?

500

It is the difference between a process and a thread

What is the lightweight unit of execution within a program that is called a process in execution

500

It is the difference between stack and queue.

What are linear data structures that follow Last-In-First-Out (LIFA) and First-In-First-Out (FIFO)?

500

It is the purpose of the hash function in data structures. 

What function is used in data structures to create a unique identifier for each element?

500

It is the concept of memorization in dynamic programming. 

What is the concept in dynamic programming that involves storing the results of subproblems to avoid recomputing them?

500

The time complexity of the merge sort algorithm. 

What is O(n log n)?

M
e
n
u