Question
If the length and breadth of a rectangle are each
increased by 4 m, its area increases by 224 m². The ratio of the perimeter of the square to that of the rectangle is 1:2. Find the side of the square.Solution
Let length = x m, breadth = y m (x + 4)(y + 4) – xy = 224 ⇒ 4x + 4y + 16 = 224 ⇒ 4x + 4y = 208 ⇒ x + y = 52 Perimeter of rectangle = 2(x + y) = 104 m Perimeter of square = (1/2) × 104 = 52 m Side of square = 52 ÷ 4 = 13 m
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
Dynamic Programming is preferred over recursion when:
In the context of searching, what is the primary advantage of using hashing?
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?    Â
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...Which sorting algorithm is best suited for a nearly sorted array, exhibiting O(N) time complexity in its best case?
Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?
For a comparison-based sorting algorithm, which lower bound applies to the worst-case number of comparisons?
Which is not true about minimum spanning tree?
What is the worst-case time complexity of a linear search algorithm on an array of 'N' elements?
Relevant for Exams:
