1.APM-arithemetic progression matrices 36 questions -40 minutes
2.computer basis -like OP,UNIX,cobol,....(only basic questions )-40 questions
-30 minutes.,for all branches the pattern is samefor APM they gave a booklet
author-j.v.raven(not sure )very easy even though those who didn't receive call
letter after applying don't worry it will end in a walkin. computer questions
ex:why goto statement must be avoided,function of engineering reversal,
specification&design are related by (followed by venn diagram),some questions in
pascal...two c program using while and for staements,
------------------------------------------------------------
--------------------
The first part is entirely from this particular book. Look for it at the second
hand book sellers.
They give you 40 mins for 36 questions."Advanced Progressive Matrices - JC
Raven"
http://www.jcravenltd.com/productrpm.htm is the website about this book.
The second part is of 30 minutes and covers various (IMHO irrelevant) topics.
Some more questions.
Remember all are multiple choice questions with either 4 or 5 options so you
have at least a 20-25% chance of being right even if you are clueless. No
negative marking.
1. what is an inode in unix?
2. small program in pascal to add a node to a linked list. (You have totell what
the program does)
3. C strcmp program (You have to tell what the program does)
4. set of dos commands testing basic familiarity with dir, ren *.t?t, cd etc.
5. what is the order of binary search?
6. what is the order of strassens matrix multiplication?
7. you have to maintain the sorted order of integers and insert integers . which
data structure would you use? (tree, list, queue, array?)
8. There are two lists of integers to be merged. Which method would you not use?
9. In an online database system when is data written to disk? (on pressing
enter, when commit
or update is encountered, at end of data, all of the above) (was clueless! )
10. Small prolog function which prints 2345true. You need to tell output.
11. Convert this binary into octal. 010 100 101
12. Lisp program given. what does it do? (GCD, LCM, Multiplies mxn?)
13. What is paging?
14. what is segmentation?
15. 2/3 questions on equivalence class, associative and commutative properties.
16. question on poset.
17. one figure given, give regular expression for it (very basic)
------------------------------------------------------------
--------------------
Sample Paper 2
1. a( [ B ( [A^ C]]
where '(' and '^' are symbols related to SET and '^' is not exact
symbol , it is curved not conical(due to limitation of
key board ), represents"union"
a. has no sense
b.It is associative as well as commutative
2.2's complement of given Binary number
3. Octal Equivalent of a Binary number
4.Given --
Ac + AB + BC =
a. AC
--
b. BC+AC
