Which sorting algorithm works by repeatedly selecting the minimum element and placing it in its correct position?
Merge Sort
Quick Sort
Bubble Sort
Selection Sort
What is the purpose of having a base address associated with an array in memory?
To store the value of the first element in the array.
To indicate the data type of elements stored in the array.
To store the length of the array.
To identify the starting memory location where the array is stored.
You need to search for an element in an array where elements are randomly placed. Which search algorithm is your only option?
Linear Search
Binary Search
None of the above.
Both can be used effectively.
Given an array of integers, how can you efficiently count the occurrences of a specific element?
All of the above methods are equally efficient.
Use a hash map to store the frequency of each element.
Iterate through the array and increment a counter for each occurrence.
Sort the array and use binary search.
How can you efficiently delete a specific element from the middle of a sorted array while maintaining the sorted order?
By swapping the element with the last element and then removing it.
By directly removing the element and leaving the space empty.
By shifting all the elements after the deleted element one position back.
Deletion in a sorted array always disrupts the order.
Consider a 2D array storing characters to represent a word search grid. You want to check if a given word exists in the grid horizontally or vertically. Which algorithm would be suitable for this task?
Depth First Search (DFS)
If you have an array of size 5 and you try to add a 6th element to it, what is a likely outcome?
The array will automatically resize to accommodate the new element.
The new element will overwrite the value at the first index (index 0).
The behavior is undefined and can lead to unpredictable program crashes.
An error or exception will occur indicating an out-of-bounds access.
What is the time complexity of finding the length of an array in most programming languages?
O(n^2) - Quadratic Time
O(log n) - Logarithmic Time
O(n) - Linear Time
O(1) - Constant Time
You are given a 2D array representing a matrix. What does transposing this matrix mean?
Reversing all elements in the matrix.
Sorting the matrix in ascending order.
Swapping rows and columns of the matrix.
Finding the sum of all elements in the matrix.
What is the main disadvantage of using bubble sort for large datasets?
It requires additional memory space.
It cannot handle duplicate values.
It has a high time complexity, making it inefficient.
It is difficult to implement.