DSA Diaries 2.0

Which data structure follows the Last In, First Out (LIFO) principle?

• Stack

• Queue

• Linked List

• Array

Which technique is suitable for solving problems with overlapping sub-problems?

• Memoization

• Tabulation

• Searching

• Sorting

What is the process of combining two or more sorted arrays into a single sorted array called?

• Merging

• Sorting

• Insertion

• Partitioning

Memoization might be preferred over tabulation when ?

• Handling Infinite Recursions

• Space Efficiency

• Bottom Up Approach

• Simplicity

What is 4 + 6?

• 9

• 10

• 12

• 24

In a recursive call of F(5) to calculate the Fibonacci series, how many times will we calculate F(3)? Given DP is not used.

• 1 time

• 2 times

• 3 times

• 4 times

What is 1+1?

• Good Question

• I prefer not to answer

• 10

• Unfortunately I don't have an answer to that

Which sorting algorithm works by repeatedly selecting the largest element and placing it at the end of the array?

• Bubble Sort

• Merge Sort

• Quick Sort

• Selection Sort

What is the process of rearranging elements in an array from the lowest to the highest value called?

• Sorting

• Searching

• Merging

• Swapping

In the 0-1 knapsack problem, what is the base condition that helps terminate the recursive calls during dynamic programming?

• When the knapsack's weight capacity is zero

• When there are no more items left to consider

• When the knapsack's weight capacity is negative

• When all items have been included in the knapsack.