Syllabus: Computer Science and Information Technology
Section1:EngineeringMathematics
DiscreteMathematics:Propositionalandfirstorderlogic.Sets,relations,functions,partialordersandlattices.Monoids,Groups.Graphs:
connectivity,matching, coloring. Combinatorics: counting, recurrence relations,generating functions.
LinearAlgebra:Matrices,determinants,systemoflinearequations,eigenvaluesandeigenvectors,LUdecomposition.
Calculus:Limits,continuityand differentiability.Maxima and minima.Mean value theorem.Integration.
ProbabilityandStatistics:Randomvariables.Uniform,normal,exponential,poissonandbinomialdistributions.Mean,median,modeandstandard
deviation.ConditionalprobabilityandBayestheorem.ComputerScienceandInformationTechnology
Section2:DigitalLogic:Booleanalgebra.Combinationalandsequentialcircuits.Minimization.Numberrepresentationsandcomputerarithmetic
(fixedandfloatingpoint).
Section3:ComputerOrganizationandArchitecture:Machineinstructionsandaddressingmodes.ALU,data‐pathandcontrolunit.
Instructionpipelining,pipelinehazards.Memoryhierarchy:cache,mainmemoryandsecondarystorage;I/Ointerface(interruptandDMAmode).
Section4:ProgrammingandDataStructures:ProgramminginC.Recursion.Arrays,stacks,queues,linkedlists,trees,binarysearchtrees,
binaryheaps,graphs.
Section5:Algorithms:Searching,sorting,hashing.Asymptoticworstcasetimeandspacecomplexity.Algorithmdesigntechniques:greedy,
dynamicprogramminganddivide‐and‐conquer.Graphtraversals,minimumspanningtrees,shortestpaths
Section6:TheoryofComputation:Regularexpressionsandfiniteautomata.Context-freegrammarsandpush-downautomata.Regularand
contex-freelanguages,pumpinglemma.Turingmachinesandundecidability.
Section7:CompilerDesign:Lexicalanalysis,parsing,syntax-directedtranslation.Runtimeenvironments.Intermediatecodegeneration.Local
optimisation,Dataflowanalyses:constantpropagation,livenessanalysis,commonsubexpressionelimination.
RamakantSoni, Assistant Professor, CS Dept., B K Birla Institute of Engineering & Technology, Pilani, Rajasthan
Ref: https://gate.iitb.ac.in/