DCSN04C midterms

Question 1

is used to rearrange a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.

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. The comparison operator is used to decide the new order of elements in the respective data structure.

Answer 2

Sorting

Question 3

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

Answer 3

In-place Sorting

Question 4

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

Answer 4

Internal Sorting

Question 5

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

Answer 5

External Sorting

Question 6

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

Answer 6

Stable sorting

Question 7

When two same data appear in the different order in sorted data it is called

Answer 7

Unstable sorting

Question 8

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

Answer 8

Time Complexity

Question 9

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

Answer 9

Auxiliary Space

Question 10

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

Answer 10

Stability

Question 11

is one that does not require additional memory to sort the data.

Answer 11

In-Place Sorting

Question 12

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

Answer 12

Adaptive sorting

Question 13

Sorting is often a crucial step in search algorithms like binary search and Ternary Search.

Answer 13

Searching Algorithms

Question 14

Sorting data makes it easier to search, retrieve, and analyze.

Answer 14

Data management

Question 15

Sorting data in databases improves query performance

Answer 15

Database optimization

Question 16

Sorting is used to prepare data for training machine learning models.

Answer 16

Machine learning

Question 17

Sorting helps in identifying patterns, trends, and outliers in datasets.

Answer 17

Data Analysis

Question 18

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

Answer 18

Operating Systems

Question 19

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 19

Selection sort

Question 20

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

Answer 20

Merge Sort

Question 21

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 21

Insertion Sort

Question 22

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 22

Queue Data Structure

Question 23

A queue is a linear data structure that follows the _____ principle. It operates like a line where elements are added at one end (rear) and removed from the other end (front).

Answer 23

First-In-First-Out (FIFO)

Question 24

Adds an element to the rear of the queue.

Answer 24

Enqueue (Insert)

Question 25

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

Answer 25

Dequeue (Delete)

Question 26

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

Answer 26

Peek

Question 27

Checks if the queue is empty.

Answer 27

Empty

Question 28

Checks if the queue is full.

Answer 28

Full

Question 29

we iterate over all the elements of the array and check if it the current element is equal to the target element.

Answer 29

Sequential Search/Linear Search

Question 30

is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.

Answer 30

Bubble Sort

Question 31

is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. Then, you pick a card from the unsorted group and put it in the right place in the sorted group.

Answer 31

Insertion sort

Question 32

is a sorting algorithm that follows the divide-and-conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array.

Answer 32

Merge sort

Question 33

is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.

Answer 33

Selection Sort

Question 34

is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.

Answer 34

Selection Sort