Syllabus for the Executive Trainee- IT

Total Marks – 150

Part A (120 marks)
1. Engineering Mathematics • Matrix Algebra: Matrices (Hermitian and skew-
Hermitian matrices, Unitary matrix, Rank of a
matrix, Normal form of a matrix, Eigen values, Eigen
vectors.
• Differential Calculus: Limits, Continuity and
Differentiability, Mean Value Theorem, Partial
Differentiation, Maxima and minima.
• Integral Calculus: Double Integrals, Change of
Variables.
• Vector Calculus: Differentiation of vectors,
Velocity and acceleration, Divergence and Curl,
Theorems of Green, Stokes and Gauss.
• Probability and Statistics: Random Variables,
uniform, normal, exponential, poisson, binomial
distributions, mean, median, mode, bayes theorem.
• Discrete Mathematics:
Graph Theory: Warshall"s algorithm: shortest path,
Eulerian paths and circuits, Hamiltonian paths and
circuits, Graph colorings.
Binary Trees: Traversing binary tree, binary search
tree, Heaps, Huffman's algorithm.
Basics of Structures: Semi group, Monoid, Group
and Sub group Langranges's theorem, rings, integral
domains, fields.
Logic and Recursion: Propositional calculus-
propositions, logical operators, truth tables, Lattice.
2. Object Oriented Programming • Concepts of Object-Oriented Programming:
Object Oriented Programming Paradigm, Basic
concepts of OOPs.
• Arrays, Pointers and Functions: Arrays, Storage
of arrays in memory, Initializing Arrays,
MultiDimensional Arrays, Pointers, accessing array
elements through pointers, passing pointers as
function arguments, Arrays of pointers, Pointers to
pointers, Functions, Arguments, Inline functions,
Function Overloading Polymorphism.
• Classes and Objects: Arrays, strings, constructors,
destructors, operator overloading, type conversion.
Storage classes: Fixed vs. Automatic declaration,
Scope, Global variables, register specifier, Dynamic
memory allocation.
• Inheritance: Inheritance, single Inheritance,
Multiple Inheritance, Multi-level, hierarchical
 inheritance, hybrid inheritance, Virtual functions.
Streams and Files: File pointers and their
manipulations, Sequential Input and output
operations, Array class, List class, Queue class, User
defined class, Generic Class.
• Exception Handling: List of exceptions, catching
exception, handling exception.
• Standard Template Library: Algorithms,
Iterators, Other STL Elements, Container Classes,
General Theory of Operation, Vectors.
3. Digital Electronics and Logic • Introduction: Analog versus Digital, Analog to
Design Digital and Digital to Analog converter circuits;
Number systems and their inter-conversion, Binary
Arithmetic, BCD codes, Excess-code, Gray code,
Hamming code, Error Detection and Correction.
• Logic Gates and Logic Families: Digital Logic
Gates, Various Logic Families: RTL, DTL, TTL and
ECL; Working and their characteristics.
• Combinational Logic Design: Boolean Algebra,
Karnaugh- Map method, Sum of Products and
Product of Sums Simplification, NAND and NOR
implementation, Determination of Prime implicants,
finding a minimal cover.
• MSI and PLD Components: Binary Adder and
Subtractor; Decoders and Encoders; Multiplexers and
DEMultiplexers circuits; Read Only Memory.
• Sequential Logic Design: Flip-flops: Truth Table
& Excitation Table of flip-flops, Registers and
Counters
4. Programming & Data Structures • Introduction: Complexity, asymptotic complexity,
big O notation, obtaining the complexity of an
algorithm.
•Development of Algorithms: Notations and
Analysis, Arrays, Stacks and Queues
• Linked Lists: Singly linked lists, Linked stacks and
queues, operations on Polynomials, Doubly Linked
Lists, Circularly Linked Lists, Operations on linked
lists- Insertion, deletion and traversal, dynamic
storage management - Garbage collection and
compaction.
•Trees: General Trees, Binary Trees, Tree
Traversing: in-order, pre-order and post-order
traversal, building a binary search tree, Operations on
Binary Trees, AVL, B-trees, B+-trees.
• Graphs: Directed and undirected graphs, the
single-source shortest path problem, the all-pair
 shortest path problem, traversals of directed and
undirected graphs, directed acyclic graphs, minimum
cost spanning trees.
• Sorting and Searching Techniques: Bubble,
Insertion, Selection, Shell, Merge, Heap and Heap
sort, Quick, Radix, Bucket, Sequential searching,
Binary Searching, Index searching, Hash table.
• Programming Fundamentals: Number system
and binary arithmetic, hardware, software, firmware,
types of programming language-compiler,
interpreter. Storage classes, scope rules and visibility,
arrays, pointers, dynamic storage allocation,
structures and unions.
• C Language
5. Computer Organization and •General System Architecture: Structure
Architecture organization (CPU, Caches, Main memory,
Secondary memory unit & I/O), Instruction Set
Architecture, RISC, CISC.
•I/O Organization & Memory Hierarchy:
Programmed, Interrupt driven & Direct Memory
Access, Synchronous & synchronous data transfer,
Locality of reference principle, Memory Hierarchy,
cache, main and secondary.
• Cache memory organizations: Techniques for
reducing cache misses; Virtual memory organization,
mapping and management techniques, memory
replacement policies.
• Introduction to Parallelism: Goals of parallelism,
Instruction level parallelism, pipelining, superscaling,
Processor level parallelism, Multiprocessor system
overview.
6. Software Engineering • Introduction: Need for software engineering, issue
in the design of large software, software life cycle
models, overview of software development process
• Software Requirement Analysis and
Specification-
Requirements Engineering, Crucial process step,
State of the practice, problem analysis, Data
dictionaries, Entity relationship diagram, code object
diagram, approaches to problem analysis, Structured
requirements definition, structured analysis & design
techniques, Software prototyping, Software
requirements specification, Nature of SRS,
characteristics of good SRS. Organization of the
SRS,
Specifying behavioural requirements, finite state
 machines, decision tables & tree, PDL.
• Software Matrices: What and why: Definition,
areas of applications, problems during
implementation, size matrices. The basic information
flow model, the more sophisticated information Flow
Model, Metrics analysis using statistics for
Assessment, problems with metric data, The common
of pool of data. A pattern for successful applications.
The common of pool of data. A pattern for successful
applications.
sub cycle.
• Software Project Planning: Cost estimation:
Models, Static single variable model, Static
multivariable model, The constructive cost model:
Basic model, International model, Detailed
COCOMO Model, The Putnam resource allocation
model: The trade off- -of-time versus cost,
development sub cycle.
• Software Risk Management: what is Risk, typical
software risks, Risk management Activities, Risk
identification, Risk management activity.
7. Operating System • Evolution of Operating Systems: Types of
operating systems.
• CPU Scheduling: Scheduling concepts, scheduling
algorithms.
• Concurrent Programming and Deadlocks:
Critical regions, Conditional critical regions,
Monitors, Interprocess communication, Messages,
Pipes, Semaphores, Modularization, Synchronization,
Concurrent languages. Deadlocks: Characterization,
Prevention, Avoidance, Detection and Recovery,
Combined approach to Deadlock Handling,
precedence graphs.
• Memory Management: Memory Management,
Contiguous allocation, static-swapping overlays,
dynamic partitioned memory allocation, demand
paging, page replacement, segmentation.
Noncontiguous allocation, paging, Hardware support,
Virtual Memory.
• File Systems: A Simple file system, Physical file
system, Allocation strategy module Device handlers,
Disk scheduling.
8. Theory of Computation • Machines: FSM, Deterministic and
nondeterministic FSMS. Equivalence of DFA and
NDFA, Mealy and Moore machines, minimization of
finite automata, Two-way finite automata.
 • Regular Sets and Regular Grammars: Alphabet,
words, Operations, Regular sets, Finite automata and
regular expression, Pumping lemma and regular sets,
Application of pumping lemma, closure properties of
regular sets.
• Formal Grammars and Languages: Chomsky
hierarchy.Regular grammars, context free & context
sensitive grammars, context free languages, non-
context free languages, Chomsky normal forms,
binary operations on languages. Simplification of
CFG, Elimination of Useless symbols, Unit
productions, Null productions, Greiback Normal
form, Chomsky normal form.
• Turing Machines and Pushdown Automata: TM
model, representation and languages acceptability of
TM Design of TM, Universal TM and Other
modification, composite and iterated TM, Pushdown
automata, Acceptance by PDA.
•Undecidibility: Properties of recursive &
recursively enumerable languages, Universal Turing
machine and undecidable problem
9. Analysis and Design of • Algorithms Introduction: Asymptotic Notations.
Algorithms • Divide and Conquer Approach: Structure of
divide-and-conquer algorithms: sets and disjoints
sets: Union and Find algorithms, Quick Sort, finding
the maximum and minimum, Quick Sort, Merge sort,
Heap and heap sort.
• Greedy Algorithms: Knapsack problem, Job
sequencing with deadlines, Minimum Spanning trees:
Prim’s algorithm and Kruskal's algorithm, Huffman
codes.
• Graph Algorithms: BFS, DFS, Topological sort,
strongly connected components; single source
shortest paths: Bellmen-Ford algorithm, Dijkstra's
algorithm; All pairs shortest path: The Warshall's
algorithm.
• Dynamic Programming: Matrix chain
multiplication, longest common sequence, 0/1
knapsack.
•Backtracking: 8-Queen Problem, Sum of subsets,
graph coloring, Hamiltonian cycles.
• Computational Complexity: Complexity
measures, Polynomial vs. nonpolynomial time
complexity: NP-hard and NP-complete classes
10. Data Base Management Systems • Basic Concepts: DBMS architecture, ER model.
• Relational Models: SQL, relational model
 constraints, relational algebra, queries in SQL,
RDBMS-Updates, Views, Integrity and Security,
Functional dependences and Normalization for
Relational Databases, normal forms based on primary
keys, (1NF, 2NF, 3NF & BCNF), lossless join and
dependency preserving decomposition.
• Data Storage and query Processing: Different
types of Indexes- B-Tree - B+ Tree,
• Transaction Management: Schedule and
Recoverability, Serializability and Schedules;
Concurrency Control, Types of Locks, Two Phases
locking, Deadlock, Time stamp based concurrency
control, Recovery Techniques, Immediate Update-
Deferred Update, Shadow Paging.
11. Compiler Design • Introduction to Compilers: Structure of a
compiler, lexical analysis, syntax Analysis. Shift-
reduce parsing, predictive parsing.
• Automatic Construction of Efficient Parsers: LR
parsers, canonical collection of LR(0) items,
construction canonical LR parsing tables,
construction LALR and SLR parsing tables using
ambiguous grammars, an automatic parser generator,
implementation of LR parsing tables, construction
LALR sets of items.
• Syntax-Directed Translation: Syntax directed
translation schemes, implementation of syntax
directed translation, intermediate code, postfix
notation parse trees and syntax trees, three address
code, postfix translation with top down parser.
• Symbol Tables: Contents of a table, lexical-phase
errors, syntax-phase errors, semantic errors.
• Introduction to Code optimization: Loop
optimization, DAG representation of basic blocks,
Code Generation, machine model, simple code
generator, register allocation and assignment, code
generation from DAG's, peephole optimization.
12. Computer Networks • Introductory Concepts: LAN, WAN, MAN,
Wireless network, OSI model, TCP/IP model.
• Physical Layer: Circuit switching, Virtual Circuit
Switching. Packet.
• Data Link Layer:, Framing, Error control, Flow
control, Error detection and correction, Simplex
protocol, Sliding Window protocols, go-back-N, A
protocol using selective repeat.
• Medium Access Sublayer: ALOHA, WDMA
protocols, Wireless protocols, Collision free
 protocols.
• Network Layer: Routing algorithms, Congestion
Control Algorithms, Internetworking.
• Transport Layer: Flow & Congestion Control,
TCP, UDP.
• Session, Presentation and Application Layer:
Remote procedure call.
• Presentation & Application Layer: DNS, SMTP,
HTTP, FTP, Email.

Part B (30 marks)

1. General Knowledge
2. General Aptitude
3. Reasoning
4. Mathematics
5. Language & Behavioural Aptitude