Course Content\n01\nComputer Networks\nConcept of layering: OSI and TCP/IP Protocol Stacks\n\nBasics of the packet, circuit, and virtual circuit-switching\n\nDatalink layer: framing, error detection, \n\nMedium Access Control\n\nEthernet bridging; Routing protocols: shortest path, flooding, distance vector, and link-state routing\n\nFragmentation and IP addressing, IPv4, CIDR notation\n\nBasics of IP support protocols (ARP, DHCP, ICMP)\n\nNetwork Address Translation (NAT)\n\nTransport layer: flow control and congestion control, UDP, TCP, sockets\n\nApplication layer protocols: DNS, SMTP, HTTP, FTP, Email.\n\nFor Detailed Syllabus check the pdf linked below\n\n02\nComputer Organization and Architecture\nMachine instructions and addressing modes. \n\nALU,data-path, and control unit.\n\nInstruction pipelining, pipeline hazards.\n\nMemory hierarchy: cache, main memory, and secondary storage;\n\nI/O interface\n\nFor Detailed Syllabus check the pdf linked below\n\n03\nDigital Logic\nNumber System\n\nBoolean algebra. Combinational and sequential circuits.\n\nMinimization. \n\nNumber representations and computer arithmetic (fixed and floating-point)\n\nFor Detailed Syllabus check the pdf linked below\n\n04\nTheory of Computation\nRegular expressions and finite automata. \nContext-free grammars and push-down automata.\n\n Regular and context-free languages, pumping lemma. \n\nTuring machines and undecidability.\n\nFor Detailed Syllabus check the pdf linked below\n\n05\nDatabase Management Systems\nER ‐ model. \n\nRelational model: relational algebra, tuple calculus, SQL.\n\nIntegrity constraints, normalization.\n\nFile organization \n\nIndexing \n\nTransactions and concurrency control.\n\nFor Detailed Syllabus check the pdf linked below\n\n06\nCompiler Design\nLexical analysis, parsing, syntax-directed translation. \n\nRuntime environments.\n\nIntermediate code generation. \n\nLocal optimization\n\nData flow analyses: constant propagation, liveness analysis\n\nCommon subexpression elimination.\n\nFor Detailed Syllabus check the pdf linked below\n\n07\nOperating System\nSystem calls, processes, threads, inter‐process communication\n\nConcurrency and synchronization.\n\nDeadlock. CPU and I/O scheduling. \n\nMemory management and virtual memory. \n\nFile systems.\n\nFor Detailed Syllabus check the pdf linked below\n\n08\nProgramming and Data Structures\nProgramming in C. \n\nRecursion. \n\nArrays, stacks, queues, linked lists, trees, binary search trees,binary heaps, graphs.\n\nFor Detailed Syllabus check the pdf linked below\n\n09\nAlgorithms\nSearching, sorting, hashing. \n\nAsymptotic worst case time and space complexity. \n\nAlgorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.\n\nGraph traversals, minimum spanning trees, shortest paths.\n\nFor Detailed Syllabus check the pdf linked below\n\n10\nEngineering Mathematics\nCalculus\n\nLimits, continuity, and differentiability. \n\nMaxima and minima. Mean value theorem. \n\nIntegration.\n\nLinear Algebra\n\nMatrices & determinants\n\nsystem of linear equations\n\neigenvalues and eigenvectors\n\nLU decomposition.\n\nProbability and Statistics\n\nRandom variables. \n\nUniform, normal, exponential, Poisson, and binomial distributions. \n\nMean, median, mode, and standard deviation. \n\nConditional probability and Bayes theorem.\n\nDiscrete Mathematics\n\nPropositional and first-order logic.\n\n Sets, relations, functions, partial orders, and lattices\n\n Monoids, Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.\n\nFor Detailed Syllabus check the pdf linked below\n\n11\nGeneral Aptitude\nNumerical Ability\nVerbal Ability