Identification

Question 1

An algorithm known for its sorting method that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

Answer 1

Bubble Sort

Question 2

A type of algorithmic paradigm involves breaking down a problem into smaller subproblems, solving each subproblem, and combining the solutions.

Answer 2

Divide and Conquer

Question 3

A sorting algorithm has an average and worst-case time complexity of O(n log n) and is based on the divide-and-conquer strategy.

Answer 3

Merge Sort

Question 4

A searching algorithm works by repeatedly dividing the search range in half; requires the array to be sorted in order to efficiently search for an element by repeatedly dividing the search interval in half.

Answer 4

Binary Search

Question 5

An algorithmic approach involves solving a problem by solving smaller instances of the same problem and combining their solutions.

Answer 5

Recursion

Question 6

A data structure operates on a Last In, First Out (LIFO) principle.

Answer 6

Stack

Question 7

This algorithm is known for its efficiency in sorting small data sets and is an in-place, comparison- based sorting algorithm.

Answer 7

Insertion Sort

Question 8

A sorting algorithm that repeatedly selects the maximum element and puts it at the end of the list in each iteration.

Answer 8

Selection Sort

Question 9

It is a step-by-step procedure or a set of rules designed for solving a specific problem or accomplishing a particular task.

Answer 9

Algorithm

Question 10

It is a way of organizing and storing data to perform operations efficiently.

Answer 10

Data Structure

Question 11

This is a simple search algorithm that sequentially checks each element of the list until it finds the desired element.

Answer 11

Linear Search

Question 12

It does not necessarily find the shortest path in a graph. It explores as far as possible along each branch before backtracking.

Answer 12

Depth-First Search (DFS)

Question 13

It uses a queue data structure for traversal, not a stack. This ensures that nodes are visited in the order of their distance from the starting node.

Answer 13

Breadth-First Search (BFS)

Question 14

These are algorithms used to systematically visit every vertex and edge in a graph, typically starting from a specified vertex.

Answer 14

Graph Traversal Algorithms

Question 15

When evaluating an algorithm’s performance about the size of the input data it processes, which concept are you primarily concerned with?

Answer 15

Algorithm Complexity

Question 16

Which concept measures how the running time of an algorithm grows with the size of the input?

Answer 16

Time Complexity

Question 17

What term refers to the memory requirements of an algorithm as a function of the input size?

Answer 17

Space Complexity

Question 18

Which term describes step-by-step procedures or formulas for solving problems?

Answer 18

Algorithms

Question 19

What programming technique involves a function calling itself to solve smaller instances of the same problem?

Answer 19

Recursion

Question 20

Which strategy involves breaking a problem into smaller subproblems, solving them independently, and then combining their solutions to solve the original problem?

Answer 20

Divide and Conquer

Question 21

Which approach makes locally optimal choices at each step in the hope that the overall solution will be globally optimal?

Answer 21

Greedy Algorithm

Question 22

What technique breaks a problem into overlapping subproblems, solves each subproblem only once, and stores the solutions to subproblems in a table to avoid redundant computations?

Answer 22

Dynamic Programming

Question 23

Which method exhaustively searches through all possible solutions and selects the one that satisfies the problem constraints?

Answer 23

Brute Force

Question 24

What approach systematically searches through all possible solutions by making choices and backtracking when a choice leads to a dead end?

Answer 24

Backtracking

Question 25

In a scenario where you want to implement an algorithm that offers a degree of unpredictability while ensuring good performance, which option would you most likely consider?

Answer 25

Randomized Algorithm

Question 26

You're tasked with solving problems related to graphs. Which type of algorithm would you choose for this purpose?

Answer 26

Graph Algorithms

Question 27

Imagine you need to address issues concerning flow in networks, such as identifying maximum flow or minimum cut. Which algorithm category would you explore?

Answer 27

Network Flow Algorithms

Question 28

When describing how a function behaves as its input approaches infinity, which notation would you use?

Answer 28

Asymptotic Notation

Question 29

In determining the maximum amount of resources an algorithm requires for any input of a given size, what complexity concept would you examine?

Answer 29

Worst-Case Complexity/Worse-Case Complexity

Question 30

When discussing the average amount of resources an algorithm necessitates over all possible inputs of a given size, which complexity term would you refer to?

Answer 30

Average-Case Complexity

Question 31

In a system where elements can only be inserted or deleted at one end, what data structure would you employ?

Answer 31

Stack

Question 32

If you need a structure where items are inserted at one end and deleted at the other, what type of list would you utilize?

Answer 32

Queues

Question 33

When representing each element of a data object in a cell or node, what list structure would you use?

Answer 33

Linked List

Question 34

In the context of arranging records in a particular order, what process would you employ?

Answer 34

Sorting

Question 35

Which sorting algorithm compares adjacent elements and swaps them if they're in the wrong order?

Answer 35

Bubble Sort

Question 36

What algorithm repeatedly selects the minimum element from an unsorted region and swaps it with the first element of the unsorted region?

Answer 36

Selection Sort

Question 37

Which algorithm builds a sorted array one element at a time by inserting each element into its correct position within the sorted region?

Answer 37

Insertion Sort

Question 38

Which divide-and-conquer algorithm selects a pivot element, partitions the array into two sub-arrays, and recursively sorts the sub-arrays?

Answer 38

Quick Sort

Question 39

What non-linear data structure organizes data in a hierarchical structure?

Answer 39

Trees

Question 40

Which search algorithm finds the position of a target value within a sorted array or list?

Answer 40

Binary Search

Question 41

What term defines a particular way of organizing and storing data efficiently?

Answer 41

Data Structure

Question 42

What is a collection of elements, each identified by an index or a key?

Answer 42

Arrays

Question 43

What term refers to the process of repeating a set of instructions or steps in a systematic way?

Answer 43

Iteration

Question 44

An algorithm must terminate after a finite number of steps.

Answer 44

Finiteness

Question 45

Each step of the algorithm must be precisely defined.

Answer 45

Definiteness

Question 46

An algorithm should have zero or more inputs.

Answer 46

Input

Question 47

An algorithm should produce one or more outputs.

Answer 47

Output

Question 48

Every step in an algorithm should be doable using basic operations.

Answer 48

Effectiveness

Question 49

These are basic data structures that directly operate upon the machine instructions.

Answer 49

Primitive Data Structures

Question 50

These are high-level data structures that model real-world entities and operations.

Answer 50

Abstract Data Structures

Question 51

A contiguous block of memory elements, each element is identified by an array index.

Answer 51

Arrays

Question 52

Elements are stored in nodes, each node pointing to the next node in the sequence.

Answer 52

Linked Lists

Question 53

Elements are stored in nodes, each node pointing to the next node in the sequence.

Answer 53

Linked Lists

Question 54

A Last In, First Out (LIFO) data structure where elements are inserted and removed from the same end.

Answer 54

Stacks

Question 55

A First In, First Out (FIFO) data structure where elements are inserted at the rear and removed from the front.

Answer 55

Queues

Question 56

It provides an upper bound on the growth rate of a function.

Answer 56

Big O Notation (O)

Question 57

It provides a lower bound on the growth rate of a function.

Answer 57

Omega Notation (Ω)

Question 58

It provides both upper and lower bounds, indicating tight bounds on the growth rate of a function.

Answer 58

Theta Notation (Θ)

Question 59

A data structure that implements an associative array abstract data type, where keys are mapped to values.

Answer 59

Hash Tables

Question 60

A specialized tree-based data structure that satisfies the heap property.

Answer 60

Heaps

Question 61

These are self-balancing tree data structures that maintain sorted data and are commonly used in databases and file systems for efficient insertion, deletion, and searching operations.

Answer 61

B- Trees and B+ Trees

Question 62

This is a data structure used to keep track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It supports two main operations: finding which set a particular element belongs to and merging two sets.

Answer 62

Disjoint Set/Union Find

Question 63

Also known as a prefix tree, is a tree-like data structure used to store a dynamic set of strings where the keys are usually strings. It supports efficient prefix-based searching and insertion operations.

Answer 63

Trie

Question 64

This is a tree data structure used for storing intervals or segments of data. It allows querying and updating the segments efficiently, often used in problems involving range queries and updates.

Answer 64

Segment Tree

Question 65

Also called a binary indexed tree, is a data structure that supports efficient prefix sum queries and updates over an array of numbers. It's particularly useful when dealing with cumulative frequency tables.

Answer 65

Fenwick Tree

Question 66

These are data structures used for efficiently storing and querying the suffixes of a string. Suffix arrays are arrays of the starting positions of suffixes sorted lexicographically, while suffix trees are trees that represent all suffixes of a string in a compressed form.

Answer 66

Suffix Array and Suffix Tree

Question 67

Systematically searches for an optimal solution by exploring the entire search space and pruning branches using bounding functions.

Answer 67

Branch and Bound