Question
I. 2p2 + 5p + 2 = 0Â Â Â Â Â Â Â Â II.
2q2 + 11 q + 14 = 0 In each question two equations are provided. On the basis of these you have to find out the relation between p and q. Give answer.Solution
I. 2p2 + 5p + 2 = 0  (2p + 1) (p + 2) = 0  p = - (1/2) or -2  II. 2q2 + 11 q + 14 = 0  (q + 2) (2q + 7) = 0  q = -2 or - (7 /2)  Hence, p ≥ q  Alternate Method:  if signs of quadratic equation is +ve and +ve respectively then the roots of equation will be -ve and -ve. So, roots of first equation = p = -1/2, -2 if signs of quadratic equation is +ve and +ve respectively then the roots of equation will be -ve and -ve. So, roots of second equation = q = -2, -7/2 After comparing roots of quadratic eqution we can conclude that p ≥ q.
Which algorithm is used for computing Max-Flow in a network?
Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?
class Node {Â Â Â Â Â in...Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?
Tarjan’s algorithm is used to find:
In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?
Time complexity of heap sort is:
Which of the following is true about triggers in a relational database?
What is the primary purpose of an abstract class?