Question
Three Statements are given followed by four conclusions
numbered 1, 2, 3,and 4. Assuming the statements to be true, even if they seem to be at variance with commonly known facts, decide which of the conclusions logically does NOT follow(s) from the statements. Statements: All P are G. Some G are B. All B are C. Conclusions: 1) All P being C is a possibility. 2) Some P are B. 3) Some C are G. 4) Some G are P.Solution
All P are G (A) + Some G are B (I) → Probable conclusion → Some P are B (I) + All B are C (A) → Some P are C (I) → Probable conclusion → All P may be C (A). Hence conclusion I follows but conclusion II does not follow. Some G are B (I) + All B are C (A) → Some G are C (I) → Conversion → Some C are G (I). Hence conclusion III follows. All P are G (A) → Conversion → Some G are P (I). Hence conclusion IV follows.
Which of the following CPU scheduling algorithms is optimal for minimizing average waiting time but requires knowledge of future process execution times...
Which of the following sorting algorithms has the best average-case time complexity?
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...What is the primary purpose of a digital signature in cryptography?
Which command is TCL command
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
Which graph traversal technique is commonly used for topological sorting?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
Depth-First Search (DFS) typically uses which data structure implicitly or explicitly?
What is the worst-case time complexity of Bubble Sort?
