Sunday, September 13, 2015

Amcat previous questions (papers)

Aspiring Minds Computer Adaptive Test (AMCAT) study materials for all the candidates who are starring for a perfect job is here with no cost. This assessment test score is now really considered to be valued by all leading companies to sort out unique candidates with all required skills. Getting the big AMCAT score will not going to be easy for all the test takers. We suggest you all the students and job seekers to utilize our set of AMCAT question papers 2017 with answers to make it easy from now.

Find Everything on our Website - www.GeekPlacement.com
What is unique here? 
Since all are providing AMCAT sample papers with answers for this computer adaptive test, we made some specific upgrades here, give a look here.
  • Previous year and model papers available for all MBA, MCA, EEE, Mechanical, CSE, ECE, Civil, instrumentation and other engineering candidates.
  • All the PDF study material will be available for free.
Deep  knowledge in the AMCAT syllabus and exam pattern will help you prepare easily. So go through it before you download last year papers with solutions.
Keep your eye’s open:
  • The AMCAT test paper includes two modules, one is compulsory and another is optional.
  • Compulsory section contains language and aptitude modules, whereas optional contains domain specific modules.
For example: If you choose computer programming, then will be considered to be aiming for IT companies.
Now you can download your AMCAT previous Papers with answers in PDF for electronics, electrical, CSE and for other various modules for your preparation.
The Mindtree, Mphasis, Cognizant (CTS), Accenture, HCL, NTT data, Wipro and other top MNC’s are now taking this Aspiring Mind’s test score as a part in their interview screening. To become more well versed in all questions keep preparing with the last year and model papers. Also try more mock test available online.
List of subjects for AMCAT Exam:
Compulsory Subjects
  • English
  • Quantitative Ability Tech
  • Logical Ability
  • Aspiring Minds Personality Inventory (AMPI)
  • Information Gathering & Synthesis
  • Excel (compulsory only for Management Graduates)
  • Quantitative Ability Non Tech
General Subjects
  • Computer Programming
  • Marketing
  • Finance and Accounting
  • Banking & Financial Services
  • Human Resources (HR)
  • Operations
  • Engineering Subjects
  • Computer Programming
  • Computer Science
  • Electronics and Semiconductors
  • Telecommunication
  • Electrical Engineering
  • Mechanical Engineering
  • Civil Engineering
  • Instrumentation Engineering
  • Management Subjects
  • Banking & Financial Services
  • Marketing
  • Human Resources (HR)
  • Operations
  • Basic Statistics

Saturday, September 12, 2015

AMCAT Logical ability previous questions and solutions(answers)-19

Ques 1 : If 'GLOSSORY' is coded as 97533562 and GEOGRAPHY' = 915968402, then 'GEOLOGY' can be coded as
Option 1 : 915692
Option 2 : 9157592
Option 3 : 9057592

Option 4 : 9157591

Ques 2 : Choose the correct alternative from the following options as given below for the Assertion (A) and Reason (R) given in each of the questions.

Assertion (A)
Amartya Sen was awarded the nobel prize for Economics.
Reason (R)
Amartya Sen has made an invaluable contribution in the field of developmental Economics.

Option 1 : if both A and R are true and R is the correct explanation of A
Option 2 : if both A and R are true and R is not the correct explanation of A
Option 3 : if A is true but R is false
Option 4 : if A is false but R is true

Ques 3 : Choose the correct alternative from the following options as given below for the Assertion (A) and Reason (R) given in each of the questions.
Assertion (A)
The world bank is a leading International Financial Institution.
Reason (R)
Ever, since its formation, it has played a major role in disbursing aid and support to economies across the world.

Option 1 : if both A and R are true and R is the correct explanation of A
Option 2 : if both A and R are true and R is not the correct explanation of A
Option 3 : if A is true but R is false
Option 4 : if A is false but R is true

Ques 4 : Choose the correct alternative from the following options as given below for the Assertion (A) and Reason (R) given in each of the questions.
Assertion (A)
In the Indian democratic system, the cabinet ministers are appointed by the President.
Reason (R)
The Prime Minister plays an advisory role.

Option 1 : if both A and R are true and R is the correct explanation of A
Option 2 :if both A and R are true and R is not the correct explanation of A
Option 3 :if A is true but R is false
Option 4 :if A is false but R is true

Ques 5 : Choose the correct alternative from the following options as given below for the Assertion (A) and Reason (R) given in each of the questions.
Assertion (A)
India is a country of diverse cultures, customs and languages.
Reason (R)
What we now call India is the modern version of Bharat.

Option 1 : if both A and R are true and R is the correct explanation of A
Option 2 : if both A and R are true and R is not the correct explanation of A
Option 3 : if A is true but R is false
Option 4 : if A is false but R is true

Ques 6 : Choose the correct alternative from the following options as given below for the Assertion (A) and Reason (R) given in each of the questions.
Assertion (A)
The ozone layer present in the upper atmosphere of Earth is beneficial for sustaining life on the Earth.
Reason (R)
The ozone layer blocks the harmful ultraviolet rays from the Sun and thus proctects life on the Earth.
Option 1 : if both A and R are true and R is the correct explanation of A
Option 2 : if both A and R are true and R is not the correct explanation of A
Option 3 : if A is true but R is false
Option 4 : if A is false but R is true

Ques 7 : She does not get a call when there is a strong network.
(i) She gets a call.
(ii) There is a strong network.
(iii) There is no network.
(iv) She does not get a call.

Option 1 : (ii) (i)
Option 2 : (iii) (iv)
Option 3 : (i) (iii)
Option 4 : (iv) (ii)

Ques 8 : When Baby wears only sari, Crazy goes bungee jumping.
(i) Baby wore sari.
(ii) Crazy went bungee jumping.
(iii) Baby wore only sari
(iv) Crazy did not go bungee jumping.

Option 1 :  (i)
Option 2 : (ii) (iii)
Option 3 : (ii) (i)
Option 4 : (i) (ii)

Ques 9 : If Raman works the late night shift, his sister makes coffee
(i) Raman works the late night shift.
(ii) Raman works the morning shift.
(iii) His sister makes coffee.
(iv) His sister makes tea.
Option 1 : (iii) (i)
Option 2 : (ii) (iv)
Option 3 : (iv) (ii)
Option 4 : (i) (iii)

Ques 10 : All ineligible candidates do not get admission if they submit the form.
(i) Ineligible student did not admission.
(ii) Eligible student got admission.
(iii) He submitted the form.
(iv) He did not submit the form.
Option 1 : (iii) (ii)
Option 2 : (iii) (i)
Option 3 : (i) (iii)
Option 4 : (ii) (iii)

Ques 11 : Anu needs no clothes or she goes shopping
(i) Anu needs clothes.
(ii) She goes shopping.
(iii) Anu needs no clothes.
(iv) She does not go shopping.

Option 1 : (iii) (iv)
Option 2 : (iii) (i)
Option 3 : (iii) (ii)
Option 4 : (ii) (i)


Friday, September 4, 2015

Techmahindra Interview experience (MITS) 2016 -1



Hi friends........
This is sathya from MITS i was recently placed in TechM. The company follows just three rounds written, technical and HR the written exam consists of 130 questions 70 verbal and 60 aptitude these were segregated in to five modules with sectional cutoff. Generally they conduct 170 questions but for us it was suddenly reduced still many of us got eliminated because of sectional cutoff but, for my surprise i was passed. The written also consists of essay writing which is an eliminating round where they give the topics at the instant my topic was the proudest moment of my life that should be written in 10 minutes i did well and went to the next round the technical was so simple they asked all about my project and it was like an HR round i answered well even got compliments from them but to my surprise they kept me on hold i was very much tensed but, still didn't lose my self confidence they tested my patience again they called me for technical round to another panel there they asked me about processors, controllers, diodes as i was from ece background they even asked me to write fibanoci series successfully completed and went to the HR round there it was so simple he just asked me about my self and why should i need this job i did well there it self he asked whether i can relocate any place i immediately said yes then he asked me to get ready to sign the bond.
Communication skills and confidence is more recquired to crack the interview.
concentrate on more verbal part sub verb agreement,prepositions,synonyms,antonyms,articles
non verbal blood relations,seating arrangement,basic aptitude is more than enough to get in. 

elitmus assessment(exam) test pattern



Elitmus’s PH test is also one of the hiring criterias used by leading corporate giants in various fields like IT security, IT product, software services and R&D. PH test is an aptitude test. It is a pen and paper test and not online.
Let us get into the details of the test.The duration of the test is 2 hours and has 3 sections.
Quantitative- 20 questions
Verbal- 20 questions
Analytical- 20 questions
The maximum marks of the test is 600. All the questions will be multiple choice. The marking scheme is not the same for all the questions. It varies with the level of difficulty of the question. The question’s difficulty level is not a random one but it is arrived in comparison to peers who have attempted that particular question.
Negative marking
They follow a unique way in deduction of the negative marks. If you attempt more than 25% of the questions wrongly then half mark will  be deducted for the wrong answers anyway there will be no negative marks for the first 25% wrong answers.
For example
-If you attempt 16 questions and get 3 wrong then there is no negative mark since incorrect answers percentage is less than 25
-If you attempt 16 questions and get 5 wrong then there will be negative mark of ½ for 1 question. Again here there is no negative mark for the first 25% wrong answers.
Coming to the areas in which they test the candidates, we shall see the topics the cover in various sections.
Quantitative Aptitude:
–Number system
–Percentages
–Profit and Loss
–Time and work
–Time speed Distance
–Inequalities and Equations
–Permutation and Combination
–Probability
–Geometry
Analytical
–Data interpretation
–Crypt arithmetic
–Seating Arrangement(Linear and circular)
–Directions
Verbal Ability:
–Reading Comprehension
–Parajumbles
–Last Line questions
–Vocabulary

Overall the difficulty level of the test in high when compared to AMCAT. So some serious preparation is needed topic wise before taking the test. Regarding the cut offs 60% percentage attempts in each section with 90% percent accuracy will fetch 90 percentile which means 12 attempts with 10-11 correct answers should do it. So overall attempt of 36 with 30-32 right answers will fetch a 90 percentile.

Techmahindra selection pattern ( exam pattern) 2016

TechMahindra Selection Process:

Round-1:

Section
No. Of Questions
Time Allotted(min)
English Language General 1
10




50
English Language General 2
20
English Language Comprehension
5
Quant
11
Verbal Reasoning General
21
Verbal Reasoning Paragraph
3
Non-Verbal Reasoning
5
Total
75

Round-2: Story writing based on a given image - 200 words - 15 min

Round-3: Technical Interview

Round-4: HR interview

Thursday, September 3, 2015

cocubes previous questions(coding programs)

2015 & 2016 Batch Freshers Registration Link

JOIN MY FACEBOOK GROUP FOR UPDATES 

Cocubes previous coding programs

You are given a function,
int* ReverseArray(int* arr, int length);

The function takes an integer array and its length as input. Implement the function to return the array such that the array is reversed i.e. the first element of the array occupies the last position, second element occupies the second last position and so on.

Note:
The re-arrangement is to be done in-place i.e you cannot use another array.

Assumption:
You may assume that the array is of even length.

Example:

Input:
2 4 6 8 20 15 10 5

Output:
5 10 15 20 8 6 4 2


int* ReverseArray(int* arr, int length)
{
          int t,i;
          for(i=0;i<length/2;i++)
          {
                   t=arr[i];
                   arr[i]=arr[length-i-1];
                   arr[length-i-1]=t;
          }
    return arr;
}

**************************************************
You are given a function,

int FindMaxProduct(int** arr, int n);

The function takes a two-dimensional array having equal number of rows and columns (i.e. a square matrix) and its dimension, 'n', as input. Implement the function such that it returns the maximum product that can be formed from four adjacent numbers. Numbers can be adjacent to each other in either of the given directions: up, down, left, right, diagonal or anti-diagonal. Ensure that four adjacent numbers are chosen in such a way that the direction does not change while choosing the numbers. Assume 'n' >= 4.

Example:

Input:
5
1 2 3 4 5
6 7 8 9 1
2 3 4 5 6
7 8 9 1 0
9 6 4 2 3

Output:
3024

Explanation:
Here, the numbers 6, 7, 8, 9 in the second row, which are horizontally adjacent form the product 3024 which is the maximum product of any four adjacent numbers in the given array.


int FindMaxProduct(int** arr, int n)
{
          int i,max=0,prod,j,
          for(i=0;i<n;i++)
          {
                   for(j=0;j<n;j++)
                   {
                             if((j-3)>=0) /* left and right */
{
                                       prod=arr[i][j]*arr[i][j-1]*arr[i][j-2]*arr[i][j-3];
                                       if(max<prod)
                                                max=prod;
}
                             if((i-3)>=0) /* up and down */
{
                                       prod=arr[i][j]*arr[i-1][j]*arr[i-2][j]*arr[i-3][j];
                                       if(max<prod)
                                                max=prod;
}
                             if((i-3)>=0 && (j-3) >=0) /* Diagonal and anti-diagonal */
{
                                       prod=arr[i][j]*arr[i-1][j-1]*arr[i-2][j -2]*arr[i-3][j-3];
                                       if(max<prod)
                                                max=prod;
}       

                   }
          }
          return max;
}


*********************************

You are given a function,
void FindOnesInBinaryString(char* str);
 The function takes a binary string i.e. a string comprising of '0's and '1's as input. Implement the function such that it prints the indices of the first occurrences of three equi-spaced ones, to the standard output (STDOUT). The algorithm to find out the indices of the evenly spaced ones is given as follows:

Find the distance between the first and second '1's and the second and third '1's. If these distances are equal, then their indices are the answer. Else repeat the process for the entire array until three such '1's are found.

Note:
1. Indices start from 0.
2. If no equi-spaced '1's are found, then print '-1'

Example:

Input:
011001001000001

Output:
2
5
8

Explanation:
The distance between the '1's at positions 2, 5 and 8 is 2, hence these are the indices of first occurrence of three equi-spaced 1's.
void FindOnesInBinaryString(char* str)
{
      Int I,first1=0,second1=0,third1=0,count=0,found=0;
      for(i=0;str[i]!=’\0’;i++)
      {
            If(str[i]==’1’)
            {
                  First1=Second1;
                  Second1=third1;
                  Third1=I;
                  Count++;
            }
            If(count>=3 && (second1-first1)==(third1 – second1 ))
            {
                  Found=1;
                  Break;
            }
      }
      If(found==1)
            Printf(“ %d %d %d”,first1,second1,third1);
      Else
            Printf(“-1”);
}


***********************

Least Common Multiple (LCM) of three integers x, y, z is the smallest positive integer that is divisible by all three numbers x, y and z.

You are given a function,
int FindLeastCommonMultiple(int x, int y, int z);

The function takes three integers 'x', 'y', 'z' as input. Implement the function to return the least common multiple of the three numbers.

Assumption:
You may assume that LCM of negative numbers is the same as that of their positive equivalents.

Example:

Input:
2
3
4

Output:
12

Explanation:
The smallest number divisible by 2, 3 and 4 is 12, hence it it the output.

int FindLeastCommonMultiple(int x, int y, int z)
{
      Int I;
      I=x;
      While(1)
      {
            If(i%x==0 && i%y==0 && I %z==0)
            {
                  Return I;
            }
            I=i+x;
      }
     
}


***********************

You are given a function,
int OctalToDecimal(int n);

The function takes an integer number, each of whose digits lies between 0 to 7, thus forming an octal number, as input. Implement the function to return its decimal equivalent. The algorithm to convert the octal number to its decimal equivalent is as follows:-
Multiply each digit of the octal number starting with the right most digit and moving leftwards, with increasing powers of 8 starting with 80.

Example:

Input:
127

Output:
87

Explanation:
While converting 127 to its decimal equivalent, we start from the right, multiplying
7 * 80 = 7
2 * 81 = 16
1 * 82 = 64

Adding up the results together, we get 7 + 16 + 64 = 87, which is the output.

int OctalToDecimal(int n)
{
      Int I=0,r,p,s=0;
      while(n>0)
{             
r=n%l0;
p=pow(8,i);
s=s+p*r;
i++;
n=n/10;
}
Return s;

}

Wednesday, September 2, 2015

Cocubes coding questions

Please write coding for the following two problems and submit code through comments. Thanks in advance

1.    You are given a function,

void FindOnesInBinaryString(char* str);

 The function takes a binary string i.e. a string comprising of '0's and '1's as input. Implement the function such that it prints the indices of the first occurrences of three equi-spaced ones, to the standard output (STDOUT). The algorithm to find out the indices of the evenly spaced ones is given as follows:

Find the distance between the first and second '1's and the second and third '1's. If these distances are equal, then their indices are the answer. Else repeat the process for the entire array until three such '1's are found.

Note:
1. Indices start from 0.
2. If no equi-spaced '1's are found, then print '-1'

Example:

Input:
011001001000001

Output:
2
5
8

Explanation:
The distance between the '1's at positions 2, 5 and 8 is 2, hence these are the indices of first occurrence of three equi-spaced 1's.

**********************************************

2. You are given a function, 

int FindMaxProduct(int** arr, int n);

The function takes a two-dimensional array having equal number of rows and columns (i.e. a square matrix) and its dimension, 'n', as input. Implement the function such that it returns the maximum product that can be formed from four adjacent numbers. Numbers can be adjacent to each other in either of the given directions: up, down, left, right, diagonal or anti-diagonal. Ensure that four adjacent numbers are chosen in such a way that the direction does not change while choosing the numbers. Assume 'n' >= 4.

Example:

Input:
5
1 2 3 4 5
6 7 8 9 1
2 3 4 5 6
7 8 9 1 0
9 6 4 2 3

Output:
3024

Explanation:
Here, the numbers 6, 7, 8, 9 in the second row, which are horizontally adjacent form the product 3024 which is the maximum product of any four adjacent numbers in the given array.