There were Two Papers:
Mathemtical and Logical Ability (Objective)
There were 40 questions in all. 2.5 marks for each correct answer and (-1) for each incorrect answer.
20 questions were of elementary maths like geometry, mensuration, trigonometry, quadratic equation etc.
20 were of logical ability.
I don't remember all the questions but I am posting as much as I remember.
1. It takes t times to paint a cube of volume V. How much time it will take to paint a cube of Volume 8V.
a) 8t
b) 6t
c) 4t
d) 2t
2. Hoe many real roots does the quadratic equations x² + √x - 2 = 4 have ?
a) 1 real root.
b) 2 real roots.
c) no real roots, only imaginary.
d) None of these.
3. For two sets to be equal, which of the following must be true:
a) Both sets must have equal number of elements.
b) Both sets must have same elements.
Two more options were there, I don remember.
4.
Computer Programming (Subjective)
Instructions: You can write program in any programming language but the program should have minimum
complexity both time and space. You can also write the pseudo code.
Following four programs were asked and the time was 90 minutes:
1. You have a two dimensional array of size m*n. The elements in the rows are sorted and every row has unique elements means( in a row no two elements are same) but the elements can repeat across the rows.
For example:
you have following 2-D array:
2 5 7 9 14 16
3 6 8 10 15 21
4 7 9 15 22 35
7 8 9 22 40 58
You are supposed to write an efficient function which will take upper 2-D array as input and will return a
one-dimensional array with following properties:
a) the 1-D array must contain all the elements of above 2-D array.
b) the 1-D array should not have any repeated elements.
c) all the elements should be in sorted order.
For example:
for the above 2-D array, the output should be:
A [ ] = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 15, 16, 21, 22, 35, 40, 58 }
Function Prototype should be :
int [ ] MergeAndSort( int[ ][ ] inputArray )
2. You have a String of characters say
you have char[ ] c = " Hello! How are you? "
You are given another set of characters say
you have char[ ] s = "eoh"
Write an efficient function to delete all the occurrences of all the letters of set of characters s from the
string c.
For example:
for the above string and set of characters, your output should be
" ll! w ar yu? "
Note: you should not use extra memory to hold the characters of the String or the set of characters to be removed.
Function Prototype should be :
char[ ] RemoveCharacters( char[ ] inputString, char[ ] setOfCharactersToBeRemoved )
3. Write an efficient algorithm/program to find the 4th highest number from an array.
For Example:
For the Array int A[ ] = { 23, 34, 12, 45, 65, 37, 67, 49, 96 }
the output should be: 49
Function Prototype should be :
int FindFourthHighest( int[ ] inputArray )
4. This was the typical one.
Cool Numbers are those whose digits can be partitioned into two sets in such a way that sum of the digits of either one is equal to other.
For example:
in 2493, 9 = 2 + 3 + 4
in 13730, 7 = 1 + 3 + 3 + 0
in 46389, 4 + 3 + 8 = 6 + 9
in 75354, 7 + 5 = 5 + 3 + 4
Your task is to check for a given number, whether it is cool number or not.
Function Prototype should be:
Bool CheckCoolNumber( int number )