DSA Advanced And Miscellaneous : MCQs & PYQs with Explanation

Option C

Spatial Locality is a principle of memory access that states if a memory location is accessed, nearby memory locations are likely to be accessed soon. Since arrays store data in contiguous memory locations, accessing elements sequentially benefits heavily from spatial locality. Thus, arrays highly utilize this concept.

Option D

A data structure is indeed a particular way of organizing and storing data so that it can be accessed and modified efficiently. This is true.
Subtraction of two pointers gives the difference in terms of number of elements (blocks) between them, not bytes. This is true.
A function is a block of statements used to perform a specific task. This is true.
Since all the given statements (A), (B), and (C) are true, there is no false statement among them.

Option C

NP-Complete problems are a class of computational problems that are considered difficult because, while a proposed solution can be verified quickly (in polynomial time), there is no known algorithm that can solve all instances of the problem efficiently. Examples include the Traveling Salesman Problem (TSP), which involves finding the shortest possible route visiting all cities, and the Boolean Satisfiability Problem (SAT), which asks whether a boolean formula can be satisfied.
The Shortest Path Problem, which finds the minimum path between nodes in a graph, is not NP-Complete, because it can be solved efficiently in polynomial time using algorithms like Dijkstra’s or Bellman-Ford.

Option D

NP-Complete problems are computational problems that are difficult to solve efficiently.
Clique Problem, Hamiltonian Cycle Problem, and Travelling Salesman Problem are NP-Complete problems.
The Shortest Path Problem is not NP-Complete because efficient algorithms like Dijkstra’s Algorithm can solve it in Polynomial Time.