Aptitude: 1. 2. 3. 4. 5. 6. Coding Question: 1. 2
Aptitude: 1. 2. 3. 4. 5. 6. Coding Question: 1. 2
Aptitude :
1. Parameter parallelogram
2. Find the fourth vertex, and so on
3. Angle of triangle sums then coming to analytical section
4. Data structure time complexity of bst.
5. Reasoning blood relation.
6. Syllogism sums
Coding Question :
1. Wildcard pattern problem.
2. Given a string and we have to remove 'COLG' from string if any string contains it,
but after removing if string is nsct ( something like this ) then string should remain
intact.
3. Generate the binary strings with the wildcards.
4. In the given college name 'colg' if search the return the college name all college name
should have cold while searching and return the string.
5. Remove the majority element from an array.
6. Reverse each word in the string.
7. Find length of invalid bracket sequence
8. merge sort.
9. one was to count frequency of each character in string.
10. write a program in array to print duplicates Array {2,5,4,2,4,5,2,2,7,2,3,2} Output
-2,5,4,3 Print duplicate only once.. Duplicate can't be print twice.
IndiaBix :
My set comprises of Following Sections:
1) Quantitative: It consists of 12 questions which include questions like:
A. 3 points are given and you have to find out which type of triangle it is. i.e. points are (4,
0), (-4, 0), (0, 3). And options were isosceles/right angles triangle/ scalene/ equilateral
triangle.
B. 3 vertices of a parallelogram are given, and you have to find 4 th vertex.
C. Find remainder when (41) ^8 - (18) ^8 gets divided by 23.
D. Simplify : 1 + 1/[1 + 1/ (1-x) ].
E. Length and breadth of a rectangle is given if its length is rotated to make a cylinder. Find
Volume of cyilnder?
F. A rectangle is given where l=2b. Then a right angled isosceles triangle is placed in front of
it. Find ratio of areas.
Four Questions of Data Sufficiency are there.
4) Programming section: It has 3 programs, out of which you have to attempt any 2 from
them. One has to be correct to qualify your aptitude questions. These programs are purely
based on String and arrays.
A. To find the Largest and Smallest number in an unsorted array.
B. To find any 2 elements from given array whose sum is close to zero, array elements are
positive and negative also.
C. A string is given, if any character recurs, so eliminate it & print remaining string.
Set 2 programs:
A. Find common elements from 2 given arrays.
B. Find whether given string is the anarchy of palindrome or not.
C. 2 strings are provided. Eliminate characters from 1st string which are present in 2nd.