GATE CSE 2022 Admissions, Results and Placement Responses

In mathematics such pairs $(A[i], i)$ are known as fixed points. All this problem asks is that given a non-strict monotone sequence find all its fixed points. The fastest algorithm would be Binary Search with a sanity check to remove collisons with duplicate elements for if the returning value in the search is same as the returnee (i.e, the base case would need a check), still a O(1) check.So assuming the array is already available, the time complexity would be $O(\text{log} \;n)$ [...]

Ans : B,C,D are false L1 is classic example of not CFL . But Compliment of {WW} is CFL . L2 is DCFL as for every b we will pop a and will do nothing on c . L3 is DCFL as for every c we will pop b do nothing on a. CFL/DCFL  is not closed under Intersection .   [...]

In the first level = 19 index In the second level = (20) * 19 = 380 In the third level = (20*20) * 19 = 7600 Total = 7999 I have seen this question many times seems like the options are wrong all other answers were also giving the same result. [...]

B [...]

9 [...]

Given information: - Dick is thrice as old as Tom. Let Tom's age be x. - Harry is twice as old as Dick. - Dick's age is 1 year less than the average age of all three. Step 1: Express Dick's age in terms of Tom's age (x). Dick's age = 3x Step 2: Express Harry's age in terms of Dick's age. Harry's age = 2 × Dick's age = 2 × 3x = 6x Step 3: Set up an equation for Dick's age being 1 year less than the average age of all three. Dick's age = (Tom's age [...]