Question
I. 2x2 + 5x + 2 = 0 II. 4y2
= 1Solution
I. 2x2 + 5x + 2 = 0 2x2 + 4x + x + 2 = 0 2x(x + 2) + 1(x + 2) = 0 (2x + 1) (x + 2) = 0 x = - 1/2 , - 2 II. 4y² = 1 y² = 1/4 y = ± 1/2 Hence, x ≤ y
What is a "collision" in the context of hashing?
In the context of system analysis, which of the following best defines the "use case" diagram?
Which of the following is NOT a type of graph representation?
In a compiler's code flow, which operation is primarily used to manage function call contexts (local variables, return addresses) during program execution?
Which sorting algorithm is the most efficient for large datasets and uses a divide-and-conquer approach?
Which of the following is a key advantage of digital signatures?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
Deletion in Red-Black Tree may require:
Tarjan’s algorithm is used to find:
Which of the following is a key objective of the Requirement Analysis phase in the Software Development Lifecycle (SDLC)?
