Question
What is the term for an algorithmic technique that solves a problem by breaking it into overlapping subproblems and storing their results to avoid recomputation?
More Data Structure Questions
- Which of the following correctly describes the primary difference between Cross-Site Request Forgery (CSRF) and Cross-Site Scripting (XSS)?
- Which data structure is used internally to implement function calls and recursion in a program's runtime environment?
- Which sorting algorithm has O(n log n) average case?
- Union-Find with Path Compression achieves nearly:
- Which sorting algorithm is the most efficient for large datasets and uses a divide-and-conquer approach?
- In a data warehouse, which of the following best describes the concept of "data granularity"?
- What is the time complexity for performing `push` and `pop` operations on a stack implemented using a linked list?
- Which of the following accurately describes the role of a "foreign key" in a relational database system?
- Which of the following is NOT one of the defining properties that a valid Red-Black Tree must satisfy?
- In a dynamic array (such as Python's list or Java's ArrayList) that doubles its capacity whenever it becomes full, what is the amortized time complexity of...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)