20-10-2012, 06:00 PM
Aspiring Minds Computer Adaptive Test
Aspiring Minds Computer Adaptive Test.pdf (Size: 79.91 KB / Downloads: 112)
Quantitative Ability
The Quantitative Ability assesses the ability of the candidate in the following two
aspects:
a. Basic understanding of numbers and applications
This section tests whether the candidate has understanding of basic number
system, i.e., fractions, decimals, negative, positive, odd, even numbers, rational
numbers, etc. The candidate should know how to do basic operations on these
numbers, understand concepts of factors/divisibility and have good practice on
algebra.
Apart from operations on numbers, the candidate should know how to convert a
real-world problem into equations, which could be solved to find an unknown
quantity. The candidate is tested on Word Problems representing various
scenarios to assess the same.
Logical Ability
The logical ability section assesses capacity of an individual to interpret things
objectively, to be able to perceive and interpret trends to make generalizations and be
able to analyze assumptions behind an argument/statement. These abilities are primary
for success of a candidate in the industry. Specifically, these are divided into following
sections:
a. Deductive Reasoning: Assesses the ability to synthesize information and derive
conclusions.
b. Inductive Reasoning: Assesses the ability to learn by example, imitation or hit-andtrial.
This also provides an indication of how creative the individual is.
c. Abductive Reasoning: Assesses the critical thinking ability of an individual to see
through loopholes in an argument or group of statements.
All these abilities are tested both using numerical and verbal stimuli. Coachable questions
have been identified and removed.
Computer Programming Principles and Application
The Computer Programming Principles and Algorithms Module evaluate the suitability
of the candidate in the software industry. It not only tests the knowledge and application
of basic constructs of programming, but also concepts of data structures, algorithm
analysis and object-oriented-programming.
The test is language-independent and all programming questions use a pseudo-code.
Significant effort has been made to exclude memory-based and rote-learning questions.
The test contains questions on debugging programs, finding the output of programs,
completing incomplete programs, finding complexity of algorithms, questions on
implementation and operations on different data structures, etc.
The test contains the following sections:
A. Structure and constructs of Computer Programs
1. Programming flow, Procedures, Functions and Arguments, Methods
2. Data-types, how data is stored in computers, input/outpu, manipulation, methods
of referencing and assessing data (including pointers).
3. Iteration, decision-making, recursions
4. Algorithm Complexity: Space and time Complexity, Asymptotic Notation
5. Compilation, Linking and Execution; debugging, kinds of errors.
B. Data-structures and Basics Algorithms
1. Data Storage Methods: Linked lists, Arrays, Queues, Stacks, Trees, Heaps, Hash
tables, graphs; Stress on which data structure to use for a given application
2. Data retrieval, Insertion of new data, merging of data from two data structures
3. Data search and sorting, Methods of array sorting and trade-off