The online exam was based on previous years pattern.

Taken on software
called Qubex.THERE WAS NO NEGATIVE MARKING.

3 sections:-

1.)VOCAB:-

duration:20 min.
10 antonynms+ 10 synonyms
2 passeges easy but long.

for this section prepare GRE barrons high frequency word list.
but more importantly prepare excercises given in antonynms
chapter(CH-4,barrons 15th edition).
i got only 2-3 from high frequncy word list but 4-5 from excercises
and TWO FROM EXAMPLES given in the antonynms chapter as it is without
any changes.

so prepare these things well.WORDS WERE NOT REPEATED FROM PREVIOUS

YEARS PAPRES(not even single).

there is no cut off in this section.

if you do 8 out of 20(10 ant + 10 syn) you have done resonably well.

divide your time well in advance.

you should be through with 10 syn + 10 ant in less than or at most 10
min.spend next 6- 8 minutes answering the passage.its easy if you can
read and comprehend fast.
spend next 1- 1.5 min reading and answering the second passage.

in last 30 seconds just forget everything and mark all answers as

there is no negative marking.
ATEMPT ALL QUESTIONS do not leave any.
most of people in our coillege who got through in written(including
me) attenpted all questions.

2.)APTITUDE:-

duration : 40 min.
38 mathematics and logical questions.

this section is very easy but requires fast calculations.

for this section prepare previous years papers well.90 % of questions
were repeated.
practice all papers so that you remember all answers without
calculations becoz even figures of 90 % questions were unchanged.

if you do this its pretty easy.

however,be careful.there is a cut off in this section.so at least
check your answers before you mark your remembered answers and be sure
figures are not changed.

3.)CRITICAL REASONING:-

MOST DIFFICULT SECTION.

duration : 30 min.
3 questions of puzzle type(1 easy,1 good level and 1 very difficult)
all repeated from prevoius years papers.

dont try to remember answers to these puzzles as there are huge in

no.just practice and try to develop your puzzle solving techniques.

refer RS agg(verbel and non verbel aptitude) for these type of

practice questions.

i got 1 question - ocean view ,harbour view,hotel ,rooms - you can

find it in prevoius year papers.

rest two i dont remember.

TRY TO FOGURE OUT THE EASIEST ONE BY READING FIRST PARA OF EACH
PUZZLE IN HURRY.

be sure to be through with easiest question in less than 10 minutes.

solve the medium level puzzle by spending 15 - 17 minutes.

BE SURE TO SOLVE THESE TWO PUZZLES RIGHTLY AND YOU ARE THROUGH.

spend next two minutes reading all the stuff of third puzzle and try
to answer it.
well if you dont get anything just do this - MARK ALL ANSWERS OF LAST
PUZZLE WITHOUT READING IN THE LAST MINUTE.

technical questions in interview

Java:
Why classes are imported?
What is a class?
Structure of a class?
What is an object?
C:
Define Data structures?
Linked Lists?
Node?
Swapping done in nodes?
DBMS:
define constraints?
Foreign Key
Primary key

02021A0505:
Selected for:TCS

what is your favourate subject?

Define sequence diagram?
Differentiate between data structures and binary trees,trees and graphs?
What is a binary tree? Why it is used instead of graphs & where it is used.
How will u represent classes in UML
Explain use case diagram?
Give one example of use case diagram?
explain the implementation of use case diagram in projects or programing
explain the use of UML where do u find its application?
Name some of the s/w u know
what are the fatures of rdbms?
explain about hte primary key and foriegn key and is their any difference between them
different features in RDBMS than in DBMS
define the function malloc and calloc and differentiate their applns
differences between stacks and queues?

02021A0506
Selected for:TCS

Give a brief lecture about paging for 1 min

what is memory mgmt
what is virtual memory
why C is used instead of COBOL,Fortran
What is TLAB?
Is associative mapping h/w or s/w approach
what is circular linked list ? What are its advantages
Explain the differences between UNIX and C
How to implement a Queue?