companies

Given the sequence of numbers find the longest oscillating subsequence Solution The oscillating sequence is the sequence, when the 2 adjacent numbers are either greater than or smaller than the current number. So, for example following is the oscillating sequence: 1, 7, 4, 6, 2 So, 7 is greater than both 1 and 4, 4 is less than both 4 and 6 and so on. Now, given the sequence of number we have to find the longest oscillating subsequence. [Read More]

1. If all the 6 are replaced by 9, then the algebraic sum of all the numbers from 1 to 100(both inclusive) varies by Ans: 330 2. The total no. of numbers that are divisible by 2 or 3 between 100 and 200(both inclusive) are Ans:67 3. From a pack of cards Jack, Queen, King & ace are removed. Then the algebraic sum of rest of the cards is Ans:216 [Read More]

Question 1: If all the 6 are replaced by 9, then the algebraic sum of all the numbers from 1 to 100(both inclusive) varies by Answer: 330 Question 2: The total no. of numbers that are divisible by 2 or 3 between 100 and 200(both inclusive) are? Answer: 67 Question 3: From a pack of cards Jack, Queen, King & ace are removed. Then the algebraic sum of rest of the cards is? [Read More]