MIDTERM TOPICS

Question 1

is used to rearrange a given array or list of elements according to a comparison operator on the elements

Answer 1

Sorting Algorithm

Question 2

refers to rearrangement of a given array or list of elements according to a comparison operator on the elements.

Answer 2

Sorting

Question 3

Sorting Terminology:

Answer 3

In-place Sorting
Internal Sorting
External Sorting
Stable sorting
Unstable sorting

Question 4

uses constant space for producing the output (modifies the given array only) or copying elements to a temporary storage

Answer 4

In-place Sorting

Question 5

is when all the data is placed in the main memory or internal memory

Answer 5

Internal Sorting

Question 6

is when all the data that needs to be sorted cannot be placed in memory at a time

Answer 6

External Sorting

Question 7

when two same items appear in the same order in sorted data as in the original array

Answer 7

Stable sorting

Question 8

When two same data appear in the different order in sorted data

Answer 8

Unstable sorting

Question 9

Characteristics of Sorting Algorithms

Answer 9

Time Complexity
Auxiliary Space
Stability
In-Place Sorting
Adaptivity

Question 10

a measure of how long it takes to run an algorithm, is used to categorize sorting algorithms

Answer 10

Time Complexity

Question 11

This is the amount of extra space (apart from input array) needed to sort

Answer 11

Auxiliary Space

Question 12

A sorting algorithm is said to be stable if the relative order of equal elements is preserved after sorting

Answer 12

Stability

Question 13

is one that does not require additional memory to sort the data. This is important when the available memory is limited or when the data cannot be moved.

Answer 13

In-Place Sorting

Question 14

is one that takes advantage of pre-existing order in the data to improve performance.

Answer 14

Adaptivity

Question 15

Applications of Sorting Algorithms:

Answer 15

Searching Algorithms
Data management
Database optimization
Machine learning
Data Analysis
Operating Systems

Question 16

Sorting is often a crucial step in search algorithms like binary search and Ternary Search. A lot of Greedy Algorithms use sorting as a first step to apply Greedy Approach

Answer 16

Searching Algorithms

Question 17

Sorting data makes it easier to search, retrieve, and analyze. For example the order by operation in SQL queries requires sorting.

Answer 17

Data management

Question 18

Sorting data in databases improves query performance. We preprocess the data by sorting so that efficient searching can be applied.

Answer 18

Database optimization

Question 19

Sorting is used to prepare data for training machine learning models

Answer 19

Machine learning

Question 20

Sorting helps in identifying patterns, trends, and outliers in datasets. It plays a vital role in statistical analysis, financial modeling, and other data-driven fields.

Answer 20

Data Analysis

Question 21

Sorting algorithms are used in __ ___ for tasks like task scheduling, memory management, and file system organization.

Answer 21

operating systems

Question 22

is a simple and efficient sorting algorithm that works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the list and moving it to the sorted portion of the list.

Answer 22

Selection sort

Question 23

is one of the most popular sorting algorithms that is based on the principle of Divide and Conquer Algorithm.

Answer 23

Merge Sort

Question 24

divide a problem into subproblems. When the solution to each subproblem is ready, we ‘combine’ the results from the subproblems to solve the main problem.

Answer 24

Divide and Conquer

Question 25

repeatedly divides the array into two halves until we reach a stage where we try to perform

Answer 25

MergeSort Algorithm

Question 26

Given a list, take the current element and exchange it with the smallest element on the right hand side of the current element

Answer 26

Selection Sort

Question 27

Given a list, take the current element and insert it at the appropriate position of the list, adjusting the list every time you insert. It is similar to arranging the cards in a Card game.

Answer 27

Insertion Sort

Question 28

Time Complexity of selection sort is always

Answer 28

n(n - 1)/2

Question 29

is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of “First in, First out” (FIFO), where the first element added to the queue is the first one to be removed.

Answer 29

Queue Data Structure

Question 30

It operates like a line where elements are added at one end (rear) and removed from the other end (front).

Answer 30

First-In-First-Out (FIFO)

Question 31

Basic Operations of Queue Data Structure

Answer 31

Enqueue (Insert) Dequeue (Delete) Peek Empty Full size

Question 32

Adds an element to the rear of the queue

Answer 32

Enqueue (Insert)

Question 33

Removes and returns the element from the front of the queue.

Answer 33

Dequeue (Delete)

Question 34

Returns the element at the front of the queue without removing it

Answer 34

Peek

Question 35

Checks if the queue is empty.

Answer 35

Empty

Question 36

Checks if the queue is full.

Answer 36

Full

Question 37

This operation returns the size of the queue i.e. the total number of elements it contains

Answer 37

size

Question 38

Applications of Queue

Answer 38

Task scheduling Data transfer Simulation Priority queues

Question 39

Implementation of Queues

Answer 39

Array Linked List

Question 40

is the index up to which the elements are stored in the array including the rear index itself.

Answer 40

rear

Question 41

is the index of the first element of the array

Answer 41

front

Question 42

is a comparison-based sorting technique based on Binary Heap Data Structure. It can be seen as an optimization over selection sort where we first find the max (or min) element and swap it with the last (or first).

Answer 42

Heap sort

Question 43

convert the array into a max heap

Answer 43

heapify

Question 44

is defined as a type of Heap Data Structure in which each internal node is greater than or equal to its children.

Answer 44

Max-Heap

Question 45

Advantages of Heap Sort

Answer 45

Efficient Time Complexity Memory Usage Simplicity

Question 46

Disadvantages of Heap Sort

Answer 46

Costly Unstable Inefficient