In MCQ they mostly ask for the output of the code. make sure your basics are clear for C/C++ and operator associativity. In 2nd round 5 questions was given 1. generate the n term of modified fibonacci series. in their fibonacci. next term will be the sum of last three terms. series like 1 2 3 6 11 20.. 2. Given a number n(in string) and a digit k, add the k in each digit of n (e.g. n=234 k=3 result 589 3. Given an 2D array representing the product record like product_id name qty price. sort the array according to the price. but there was a condition I am missing that. 4. not remember 5. Was based on Class n Object. given a incomplete code for quiz program. complete it 3rd round 1. given an integer array. find the nearest prime number of each element in the array. (like array is [15,28,33] than nearest prime of 15 is 13(backside) and 17(frontside) but both are at same position (difference of 2) so we can pick anyone, for 28 nearest prime is 23 and 29, 29 is close so pick the 29.. given an integer array, find the longest increasing sequence from it. search this on geeksforgeeks given doubly linkedlist, write the logic of inserting the node at specific position. (I told him I don't know doubly so he gave me to do this in singly linkedlist, I did) and some basic concept of OOP like method overloading riding with example to write the code. access modifier, specially protected. with example constructor etc.
