This paper contain 2 sections only time 30 mins each section,no negative marking
Section 1 : Logical Reasoning
1. ABCDEFG are lessons… they need to be taught according to some 5-6 given conditions ….
a) Which is the correct order?
b)Which lesson is a must if only 4 need to be taught.
2.Two politicians…winner % votes recd of total votes…?
3.Batsman…average runs in first innings… (lengthy question).
3 or 4 questions on Sufficiency.. (a lil tricky)
5 questions on replace the mathematical operators and evaluate… (Do we use BODMAS here???)
Basically all the questions very easy… i f u preapred for CAT even for just 1 month u,d get thru. But the questions were very much not solvable in 30 mins..
Section 2 : Technical (Algorithms/GraphTheory/C)
2-3 code snippets were given.. had to choose the correct algo complexity (big O)
1 code completion snippet on DFS (depth first search) (very easy)
1 question where graph was drawn.. had to choose the shortest path!! (childs play!!!)
Q) const can be used with a)array b)identifirer c)array argument d)all
Q) Find the incorrect statement : ans : dynamic allocation is done at compile time. (false)
Q)same ques repeated twice ” what does adjacency matrix show?”
Q) 2-3 questions on prefix/postfix/infix conversion. (easy)
I finished the second section with 4 mins to spare. It was very easy. But the first was too lengthy and frustrating…besides they din tell me soon enough that there was no -ve marking.
Sir, plz tell my NDA results. My Roll No. 188904 and my p No. is 01992244167. Plz tell. thank u.