Question
There are three distinct numbers ‘a’, ‘b’ and
‘c’. If, a = 150, (a + b) = 450 and (c – b) = 60, then find the average of a, b and c.Solution
Given, a = 150, (a + b) = 450 and (c – b) = 60 Therefore, b = 450 – 150 = 300 And, c = 300 + 60 = 360 Required average = (150 + 300 + 360)/3 = 270
Which of the following is NOT a greedy algorithm?
Which sorting algorithm divides the array into halves recursively?
Which of the following operations on a data structure refers to the removal of an element from the front of a queue?
The time complexity of searching in a hash table with chaining is:
For which problem is dynamic programming NOT generally an applicable technique because it lacks overlapping subproblems?
Which algorithm finds the shortest paths between all pairs of vertices in a weighted graph?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?
Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:
In which case is QuickSort’s performance worst?
Which command is used to undo the changes
Relevant for Exams:
