AMCAT exam syllabus

AMCAT exam syllabus 2015

There are two modules available,

§  Compulsory module

§  Optional module

Compulsory modules are given below,

§  English comprehension

§  Quantitative ability

§  Logical ability

§  AMPI (Aspiring Minds Personality Inventory)

Compulsory for general graduates

§  Attention to detail

Compulsory for management graduates

§  Excel

Optional modules

§  Computer literacy

§  Computer programming principles and application

§  Mechanical

§  Finance

§  Electronics and semiconductor

§  Civil engineering

AMCAT detailed test syllabus pattern

Compulsory module – English comprehension

§  Fill in the blanks

§  Error detection

§  Subject verb agreement

§  Antonyms

§  Synonyms

§  Tenses and articles

§  Ordering sentences

§  Passage questions

Compulsory module – Quantitative ability 

Basic numbers, word problems, power and logarithms, permutation-combination basic probability is the major divisions in this section. The divisions from the major divisions are,

§  Problems on numbers

§  Time and work

§  Time and distances

§  Problem on ages

§  Mixtures

§  HCF and LCM

§  Profit and loss

§  Logarithms

§  Permutations and combinations

For more topics click: Quantitative Aptitude questions

Compulsory module – Logical ability 

Deductive reasoning, inductive reasoning, abductive reasoning are the three major divisions. Under this following are the subdivisions.

§  Blood relation

§  Logical word sequence

§  Selection decision tables

§  Objective reasoning

§  Coding deductive logic

§  Analogy and classification pattern recognition

§  Data sufficiency

§  Number series

§  Critical Reasoning

More reasoning topic click: Logical ability

AMPI (Aspiring Minds Personality Inventory)

This module is for checking your skill on personality, i.e., candidate activity in interaction.

Optional modules – computer programming

§  Data structures and algorithm

§  Oops

Optional modules – computer literacy

§  Basic software and internet

§  Hardware usage and organization

Optional modules – electronics and semiconductor

§  Analog electronics

§  Digital electronics

Short descriptions of algoritms

Some short descriptions on each of the algorithms:-

Bubble Sort:-
Exchange two adjacent elements if they are out of order. Repeat until array is sorted. This is a slow algorithm.

 Selection Sort:-
Find the largest element in the array, and put it in the proper place. Repeat until array is sorted. This is also slow.

 Insertion Sort:-
Scan successive elements for out of order item, then insert the item in the proper place. Sort small array fast, big array very slowly.

Quick sort:-
Partition array into two segments. The first segment all elements are less than or equal to the pivot value. The second segment all elements are greater or equal to the pivot value. Sort the two segments recursively. Quicksort is fastest on average, but sometimes unbalanced partitions can lead to very slow sorting.

Merge sort:-
Start from two sorted runs of length 1, merge into a single run of twice the length. Repeat until a single sorted run is left. Mergesort needs N/2 extra buffer. Performance is second place on average, with quite good speed on nearly sorted array. Mergesort is stable in that two elements that are equally ranked in the array will not have their relative positions flipped.

Heap sort:-
Form a tree with parent of the tree being larger than its children. Remove the parent from the tree successively. On average, Heapsort is third place in speed. Heapsort does not need extra buffer, and performance is not sensitive to initial distributions.

Shell sort:-
Sort every Nth element in an array using insertion sort. Repeat using smaller N values, until N = 1. On average, Shellsort is fourth place in speed. Shellsort may sort some distributions slowly.

Combo Sort:-
Sorting algorithms can be mixed and matched to yield the desired properties. We want fast average performance, good worst case performance, and no large extra storage requirement. We can achieve the goal by starting with the Quicksort (fastest on average). We modify Quicksort by sorting small partitions by using Insertion Sort (best with small partition). If we detect two partitions are badly balanced, we sort the larger partition by Heapsort (good worst case performance). Of course we cannot undo the bad partitions, but we can stop the possible degenerate case from continuing to generate bad partitions.

How Linux Boots

You now know the physical structure of a Linux system, what the kernel is, and how to work with processes. This chapter teaches you how the system starts (boots) — that is, how the kernel gets into memory and how the regular system processes get started.

As it turns out, there isn't much to the boot process:

1. A boot loader finds the kernel image on the disk, loads it into memory, and starts it.
2. The kernel initializes the devices and its drivers.
3. The kernel mounts the root filesystem.
4. The kernel starts a program called init.
5. init sets the rest of the processes in motion.
6. The last processes that init starts as part of the boot sequence allow you to log in.

Identifying each stage of the boot process is invaluable in fixing boot problems and understanding the system as a whole. To start, zero in on the boot loader, which is the initial screen or prompt you get after the computer does its power-on self-test, asking which operating system to run. After you make a choice, the boot loader runs the Linux kernel, handing control of the system to the kernel.

There is a detailed discussion of the kernel which explains the role of the kernel, and , but this chapter covers the kernel initialization stage, the stage when the kernel prints a bunch of messages about the hardware present on the system. The kernel starts init just after it displays a message proclaiming that the kernel has mounted the root filesystem:

VFS: Mounted root (ext2 filesystem) readonly.

Soon after, you will see a message about init starting, followed by system service startup messages, and finally you get a login prompt of some sort.

Note

On Red Hat Linux, the init note is especially obvious, because it "welcomes" you to "Red Hat Linux." All messages thereafter show success or failure in brackets at the right-hand side of the screen.

Linux Commands

Table A-1: File Management Commands

Command	Description
chgrp	Changes a file's group
chmod	Changes a file's permissions
chown	Changes a file's user ownership
cp	Copies a file
dd	Converts and copies
df	Displays disk usage statistics
du	Displays directory space usage
file	Identifies a file type
find	Searches for a file
ln	Creates a symbolic or hard link
ls	Lists files
mkdir	Creates a directory
mkfifo	Creates a named pipe
mknod	Creates a special file
mv	Renames or moves a file
rm	Removes a file
touch	Creates a file or updates a file's timestamp

IT JAM Syllabus 2013

IT JAM Computer Applications Syllabus 2013

IIT JAM syllabus for Computer Applications ( CA ) test paper comprises of Mathematics, Computer awareness and Analytical ability and General awareness and they will be in the ration 4 : 2 : 1.

IIT JAM Mathematics Syllabus

Algebra : Set theory and its simple applications. Basic concepts of groups, fields and vector spaces.

Matrices : Rank of a matrix. Existence and uniqueness of solution of a system of linear equations. Eigenvalues and Eigenvectors. Inverse of a matrix by elementary transformations.

Differential Calculus : Differentiation, Partial differentiation, Taylor series and approximate calculations. Maxima and minima of functions of one and two variables.

Integral Calculus : Single and multiple integration. Definite integrals, Change of order and change of variables. Applications to evaluation of area, surface and volume.

Differential Equations : First order differential equations, linear differential equations of higher order with constant coefficients.

Vector Algebra : Addition, subtraction, dot product, cross product, triple product and their applications.

Numerical Analysis : Solution of non – linear equations using iterative methods. Interpolation ( Lagrange’s formula and Newton’s formula for equidistant points ). Numerical differentiation and integration ( Trapezoidal and Simpson’s rules ).

Probability : Basic concepts of probability theory. Binomial and Poisson distributions.

Linear Programming : Formulation and its graphical solution for two variable problems.

IIT JAM Computer Awareness

Elements of computers. Number systems. Basic electronic gates. Boolean algebra. Flip – Flops. Algorithmic approach to solve problems. Fundamentals of C language.

Analytical Ability and General Awareness of IIT JAM

Simple questions will be asked to test the analytical ability and general awareness of candidates.