Syllabus for Computer Science and
Information Technology (CS)
ENGINEERING MT!EMTICS
Mathematical "ogic: Propositional Logic; First Order Logic.
#robability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random
Variables; Distribtions; ni!orm, normal, e"ponential, Poisson, #inomial.
Set Theory $ lgebra: Sets; Relations; Fnctions; $rops; Partial Orders; Lattice; #oolean
%lgebra.
Combinatory: Permtations; Combinations; Conting; Smmation; generating !nctions;
recrrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Ct vertices & edges; covering; matc'ing;
independent sets; Coloring; Planarity; (somorp'ism.
"inear lgebra: %lgebra o! matrices, determinants, systems o! linear e)ations, *igen vales
and *igen vectors.
Numerical Methods: L+ decomposition !or systems o! linear e)ations; nmerical soltions o!
non,linear algebraic e)ations by Secant, #isection and -e.ton,Rap'son Met'ods; -merical
integration by trape/oidal and Simpson0s rles.
Calculus: Limit, Continity & di!!erentiability, Mean vale 1'eorems, 1'eorems o! integral
calcls, evalation o! de!inite & improper integrals, Partial derivatives, 1otal derivatives,
ma"ima & minima.
C%M#&TER SCIENCE N' IN(%RMTI%N TEC!N%"%G)
'igital "ogic* Logic !nctions, Minimi/ation, Design and synt'esis o! combinational and
se)ential circits; -mber representation and compter arit'metic 2!i"ed and !loating point3.
Computer %rgani+ation and rchitecture* Mac'ine instrctions and addressing modes, %L+
and data,pat', CP+ control design, Memory inter!ace, (4O inter!ace 2(nterrpt and DM% mode3,
(nstrction pipelining, Cac'e and main memory, Secondary storage.
#rogramming and 'ata Structures* Programming in C; Fnctions, Recrsion, Parameter
passing, Scope, #inding; %bstract data types, %rrays, Stac5s, 6ees, Lin5ed Lists, 1rees, #inary
searc' trees, #inary 'eaps.
lgorithms* %nalysis, %symptotic notation, -otions o! space and time comple"ity, 7orst and
average case analysis; Design8 $reedy approac', Dynamic programming, Divide,and,con)er;
1ree and grap' traversals, Connected components, Spanning trees, S'ortest pat's; 9as'ing,
Sorting, Searc'ing. %symptotic analysis 2best, .orst, average cases3 o! time and space, pper and
lo.er bonds, #asic concepts o! comple"ity classes : P, -P, -P,'ard, -P,complete.
%perating System* Processes, 1'reads, (nter,process commnication, Concrrency,
Sync'roni/ation, Deadloc5, CP+ sc'edling, Memory management and virtal memory, File
systems, (4O systems, Protection and secrity.
'atabases* *R,model, Relational model 2relational algebra, tple calcls3, Database design
2integrity constraints, normal !orms3, 6ery langages 2S6L3, File strctres 2se)ential !iles,
inde"ing, # and #; trees3, 1ransactions and concrrency control.
Information Systems and Soft,are Engineering8 in!ormation gat'ering, re)irement and
!easibility analysis, data !lo. diagrams, process speci!ications, inpt4otpt design, process li!e
cycle, planning and managing t'e pro<ect, design, coding, testing, implementation, maintenance.
Computer Net,or-s* (SO4OS( stac5, L%- tec'nologies 2*t'ernet, 1o5en ring3, Flo. and error
control tec'ni)es, Roting algorit'ms, Congestion control, 1CP4+DP and soc5ets, (P2v=3,
%pplication layer protocols 2icmp, dns, smtp, pop, !tp, 'ttp3; #asic concepts o! 'bs, s.itc'es,
gate.ays, and roters. -et.or5 secrity : basic concepts o! pblic 5ey and private 5ey
cryptograp'y, digital signatre, !ire.alls.
.eb technologies8 91ML, >ML, basic concepts o! client,server compting.
Theory of Computation* Reglar langages and !inite atomata, Conte"t !ree langages and
Ps',do.n atomata, Recrsively enmerable sets and 1ring mac'ines, +ndecidability.
Compiler 'esign* Le"ical analysis, Parsing, Synta" directed translation, Rntime environments,
(ntermediate and target code generation, #asics o! code optimi/ation.
