Memoization is a technique used to eliminate redundant computations by storing and reusing previously computed results. In the context of dynamic programming algorithms like computing Fibonacci numbers, it helps optimize the overall computation.

A hash table typically consists of an array of buckets and a hash function that maps keys to indices in the array. The array is divided into buckets, each capable of holding multiple key-value pairs. The hash function determines which bucket a key should go to.

No, DFS does not guarantee finding the shortest path in a graph. It can find a path, but it may not be the shortest. BFS is more suitable for finding the shortest path as it explores nodes level by level.

Yes, BFS can be used to find the shortest path between two nodes in an unweighted graph. As BFS explores the graph level by level, the first time the destination node is reached, it guarantees the shortest path as it explores nodes in order of their distance from the source.

The main difference lies in their objectives. The coin change problem aims to find the number of ways to make a specific amount, while the knapsack problem focuses on maximizing the total value considering weight constraints.

Array manipulation involves operations such as insertion and deletion to modify array elements. Insertion adds elements at a specific position, and deletion removes elements from a given position, helping to manage the array's content dynamically.

Topological sorting is often used in Scheduling resolution, particularly in systems involving tasks with dependencies. It helps in determining the order of execution for tasks based on their dependencies, ensuring a systematic and correct execution flow.

An array is a linear structure that stores a collection of homogeneous elements. It means that all elements in the array are of the same data type.

Linear search is not very efficient for searching large datasets. Since it checks each element sequentially, it may take a long time to find the desired element in a large dataset, making it less suitable for scenarios where efficiency is crucial.

Proper memory management in arrays involves automatically releasing memory when it is no longer needed. This process, known as deallocation or freeing memory, prevents memory leaks and ensures efficient memory usage.