Syllabus:PGEntranceTestforadmissiontoMTech(CSE) SectionI:MathematicalAspectsofComputerScience(30Marks) Combinatorics:Permutations,combinations,counting,summation; TheoryofProbability:AxiomaticdefinitionofProbability,conditionalprobability,BayesTheorem, random variables, Functions of random variables. Expectation, Probability distributions: Binomial Poisson,ExponentialandNormaldistributionandtheirmomentgeneratingfunctions.

. Discrete Mathematics : Sets, relations, functions, lattices, Boolean algebra, induction, recurrence relations.Groups,Subgroups,Homomorphisms,Normalandsubnormalsubgroups. LinearAlgebra:Reviewofmatrices,ConsistencyofsystemofLinearequations.Vectorspacesand subspace,linearindependenceanddependenceofvectors,Basisanddimensions.Rankandnullity ofalineartransformation,EigenvaluesandeigenvectorsofaMatrix,diagonalization. OptimizationTechniques:LinearProgramming:Graphicalmethod,Simplexmethod,DualityTheory andSensitivityAnalysis.TransportationandAssignmentProblem:InitialBasicFeasibleSolutionsof BalancedandUnbalancedProblems,OptimalSolutions.NetworkAnalysis:ShortestPathproblem. MinimumSpanningTreeProblem.MaximumFlowProblem.MinimumCostFlowProblem. Numerical Techniques : Number systems, Solution of nonlinear equations, solution of system of linearequations,curvefitting,interpolation,numericaldifferentiationandintegration,solutionsof IVP. SectionII:ConceptsofComputerScience(70Marks) DigitalElectronics:NumberRepresentation,binaryarithmetics,Logicgates,Combinationalcircuits, Sequentialcircuits,memorydevices. Computer Organization : Machine instructions and addressing modes, ALU and datapaths, hardwired and microprogrammed control pipelining , memory interface, I/O interfaces, serial communicationinterface,parallelprocessing,memorymanagement Structuredandobjectorientedprogrammingconcepts(withreferencetoC/C++): Programcontrol,functions,recursion,scope,binding,parameterpassing,pointers,arrayhandling, structuresandunions,filehandling,conceptsofObjectOrientedProgramming. Data Structures : Notion of abstract data types, stacks, queues, linked lists, trees, heap, graphs, Treeandgraphtraversals,hashing,sorting,searching. Theory of Computation : Regular languages and finite automata, context free languages and pushdownautomata,Turingmachines. ComplierDesign:Lexicalanalysis,parsing,syntaxdirectedtranslation,runtimeenvironment,code generation,linking. OperatingSystems: Definition and significance of OS, OS asresource manager, Classical concepts processes,concurrency,synchronization,deadlock,threadsandinterprocesscommunication,CPU scheduling, memory management, file systems, I/O systems, protection and security, DOS, UNIX andwindows. DatabaseManagementSystems:Relationalmodel,ERdiagram,relationalalgebra,databasedesign, normalization,SQL,transactionsmanagementandconcurrencycontrol. ComputerNetworks:OSIreferencemodel,slidingwindowprotocols,LANtechnologies(Ethernet, Token ring), TCP/UDP, IP, Networking addresses, transmission medias, Networking devicesHub, switches.gatewaysandrouters. Software Engineering: Basics of s/w engineering, Software Process models, software project planningandmanagement.