You are on page 1of 2

SYLLABUS FOR COMPETITIVE EXAMINATION FOR RECRUITMENT OF

ASSISTANT PROFESSORS IN GOVERNMENT ENGINEERING COLLEGES
2013-2014
T E A C H E R S R E C R U I T ME N T B O A R D , C H E N N A I 6 0 0 0 0 6 Page 15
COMPUTER SCIENCE AND ENGINEERING / INFORMATION TECHNOLOGY
Unit 1: Engineering Mathematics
Mathematical Logic: Propositional Logic; First Order Logic.
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random
variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory and Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean
Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions;
recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; cut vertices & 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: LU decomposition for systems of linear equations; numerical solutions
of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods;
Numerical integration by trapezoidal and Simpson’s rules.
Calculus: Limit, Continuity & differentiability, Mean Value Theorems, Theorems of integral
calculus, evaluation of definite& improper integrals, Partial derivatives, Total derivatives,
maxima & minima.
Unit 2: Theory of Computation
Regular languages and finite automata, Context free languages and Push-down automata,
Recursively enumerable sets and Turing machines, Undecidability; NP-completeness.
Unit 3: Digital Logic
Logic Functions, Minimization, Design and synthesis of combinational and sequential
circuits; Number representation and computer arithmetic (fixed and floating point).
SYLLABUS FOR COMPETITIVE EXAMINATION FOR RECRUITMENT OF
ASSISTANT PROFESSORS IN GOVERNMENT ENGINEERING COLLEGES
2013-2014
T E A C H E R S R E C R U I T ME N T B O A R D , C H E N N A I 6 0 0 0 0 6 Page 16
Unit 4: Computer Organization and Architecture
Machine instructions and addressing modes, ALU and data-path, CPU control design,
Memory interface, I/O interface (interrupt and DMA mode), Instruction pipelining, Cache
and main memory, Secondary storage.
Unit 5: Programming and Data Structures
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data
types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Unit 6: Algorithms
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.
Unit 7: Compiler Design
Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate
and target code generation, Basics of code optimization.
Unit 8: Operating System
Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock,
CPU scheduling, Memory management and virtual memory, File systems, I/O systems,
Protection and security.
Unit 9: Databases
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+ trees), Transactions and concurrency control.
Unit 10: Computer Networks
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, and
routers.