Question
Which box is the
heaviest? Answer the questions based on the information given below. Seven boxes J, K, L, M, N, O and P have different weights. Only two boxes are heavier than box J. Equal number of boxes are heavier and lighter than box L. Box K is heavier than box M, which is heavier than box O, which is not the lightest. Box N is heavier than box K.Solution
Only two boxes are heavier than box J. So, box J must be 3 rd heaviest. Equal number of boxes are heavier and lighter than box L. So, box L must be 4 th heaviest. _ > _ > P > R > _ > _ > _ Β Box K is heavier than box M, which is heavier than box O, which is not the lightest. Box N is heavier than box K. So, box N must be heaviest box. Also, box P must be the lightest. N > K > J > L > M > O > P
In which of the following scenarios would the Floyd-Warshall algorithm be most suitable?
Which of the following is an example of unsupervised learning in AI?
A system uses a 32-bit logical address space and a page size of 4KB. If each page table entry (PTE) is 4 bytes, how many entries can a single-level page...
When choosing an algorithm for a specific task, what is the most important factor to consider first?
Bourne-style shells uses which below symbol
A recursive backtracking solution for the Subset Sum problem is generating duplicate subsets or missing valid subsets. Assuming the input array might co...
Backdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software ...
Consider a function foo(n) that calls foo(n-1) and foo(n-2). This pattern of calls is best visualized using a:
The following C++ code has a common inheritance-related issue. How can it be debugged to ensure the derived class constructor properly initializes the b...
Consider a simplified backtracking approach for generating permutations of [1, 2, 3]. If the current partial permutation is [1, 3], what is the next log...