Documente Academic
Documente Profesional
Documente Cultură
1 Mark Questions
2 Mark Question
Total Marks
Mathematics
3-6
6-15
16-35
Digital Logic
1-4
0-5
2-14
Computer Organization & Architect
1-4
3-12
8-24
C Programming & Data Structure
1-5
3-10
7-25
Algorithm Design & Analysis
28
6 15
15 32
Theory of Computation
1-4
3-7
9-16
Compiler Design
1-4
0-8
1-20
Operating System
1-3
2-8
4-17
DBMS
0-3
3-6
5-12
Computer Network
1-5
2-6
5-14
Software Engineering
0-1
1-2
2-5
Web Technology
0-1
0
0-1
From the above subject wise weightage, we can see the Mathematics(including aptitude + English) has the highest
weightage. The subjects like Algorithm , Computer Organization, C programming and Data Structure and Theory of
Computation should not be ignored.
Subject
2013
[100]
2012
[100]
2011
[100]
2010
[100]
2009
[100]
2008
[150]
2007
[150]
Avg.
Digital Logic
13
Language Skills
Analytical Skills
11
22
13
10
10
12
13
Algorithms
14
32
25
14
Theory of Computation
15
12
Compiler Design
11
Operating System
12
16
13
15
11
Databases
11
10
12
12
Computer Networks
10
10
14
Web technologies
87
84
86
84
84
123
123
95
Total
Engineering Mathematics
Mathematical Logic
functions , Recurrence
Graph Theory
Connectivity , Spanning trees , Cut vertices and edges , Covering , Matching , Independent
sets ,Colouring , Planarity , Isomorphism
Linear Algebra
Algebra of matrices , Determinants , Systems of linear equations , Eigen values and Eigen
vectors
Numerical Methods
Machine instructions and addressing modes , ALU and data-path , CPU control
design , Memory interface , IO interface (Interrupt and DMA mode) , Instruction
pipelining , Cache and main memory ,Secondary storage
Programming and Data Structures [09]
Analysis , Asymptotic notation , Notions of space and time complexity , Worst and average
case analysis, Design , Greedy approach , Dynamic programming , Divide-and-conquer , Tree
and
graph
traversals ,Connected
components , Spanning
trees , Shortest
paths , Hashing , Sorting , Searching , Asymptotic analysis (best, worst, average cases) of
time and space , Upper and lower bounds , Basic concepts of complexity classes P, NP, NPhard , NP-complete
Theory of Computation [09]
Regular languages and finite automata , Context free languages and Push-down
automata , Recursively enumerable sets and Turing machines , Undecidability
Compiler Design [05]
ER-model , Relational model (relational algebra, tuple calculus) , Database design (integrity
constraints, normal forms) , Query languages (SQL) , File structures (sequential files,
indexing, B and B plus trees) ,Transactions and concurrency control
Information Systems and Software Engineering [03]
Information gathering , Requirement and feasibility analysis , Data flow diagrams , Process
specifications , Input Output design , Process life cycle , Planning and managing the
project , Design ,Coding , Testing , Implementation , Maintenance
Computer Networks [09]
ISO-OSI stack , LAN technologies (Ethernet, Token ring) , Flow and error control
techniques , Routing
algorithms , Congestion
control , TCP-UDP
and
sockets , IP(v4) , Application layer protocols (icmp, dns, smtp, pop, ftp, http) , Basic concepts
of hubs , Switches , Gateways , Routers , Network security basic concepts of public key and
private key cryptography , Digital signature , Firewalls
Web technologies [00]
General Aptitude
Language Skills [06]
Analytical Skills [09]