Question
In the following questions assuming the given
statements to be true, find which of the conclusion among given conclusions is/are definitely true and then give your answers accordingly. Statements: A < B; C = D; B >E ≥ C Conclusions: I. A < C II. E = DSolution
Given statements: A < B; C = D; B > E ≥ C On combining: B > E ≥ C = D; A < B Conclusions: I. A < C → False (as A < B, B > E and E ≥ C → there is no clear relation between A and C) II. E = D → False (as E ≥ C = D → E ≥ D) Hence, none of the given conclusion is true.
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
The amortized time for inserting into a dynamic array (like C++ vector) is:
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which of the following is substring of “IXAMBEE”?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?
