Question
In an adjacency matrix, checking whether edge (u,v) exists takes:
More Data Structure Questions
- Which algorithm is used for shortest path in graphs?
- What is the tight asymptotic time complexity of building a binary min-heap from an unsorted array of n elements using the standard bottom-up heapify approa...
- A hash table of size 7 uses h(k) = k mod 7 with linear probing. The keys 15, 22, 29, 8 and 36 are inserted in this order. In which slot does key 36 get sto...
- Which SOLID principle emphasizes that a class should have only one reason to change?
- Which of the following techniques is primarily used to address overfitting in machine learning models?
- A connected undirected graph has 15 vertices and 20 edges. What is the minimum number of edges that must be removed to convert this graph into a spanning t...
- In an adjacency matrix, checking whether edge (u,v) exists takes:
- Using the Master Theorem, what is the time complexity of the recurrence T(n) = 3T(n/2) + n²?
- Deletion in Red-Black Trees maintains balance using:
- What is the maximum number of edges possible in a simple undirected graph (no self-loops, no parallel edges) containing 7 vertices?
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)