With help of Karnataka PGCET 2020 M.Tech Syllabus of Computer Science and Engineering, candidates can prepare the examination in better way to crack the Entrance Test. Candidates can use the syllabus while preparing for Karnataka PGCET 2020 M.Tech in Computer Science and Engineering. To get more information about topics cover in the syllabus of M.Tech (Computer Science and Engineering) Entrance Test, check this article.
Karnataka PGCET 2020 M.Tech Syllabus – Computer Science and Engineering
Karnataka Examinations Authority Post Graduate Common Entrance Test (KEA PGCET) M.Tech Admissions 2020 Syllabus for Computer Science and Engineering is given below.
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 & Algebra: Sets; Relations, Functions; Groups; Partial Orders; Lattice; Boolean algebra. Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic.
Data Structures and Algorithms : Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Tree and graph traversals, connected components, Spanning trees, shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer); Asymptotic analysis (best, worst, average case) of time and space, Upper and Lower bounds on the complexity of specific problems, NP- completeness.
Logic Design and Computer Organization : Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point); Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache main and secondary storage.
Formal Languages and Automata Theory : Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Un-decidability;
System software : Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, linking (static and dynamic);
Operating Systems : Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
Databases : Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B± trees), Transactions and concurrency control;
Computer networks : ISO / OSI stack, Data encoding and transmission, data link control, sliding window protocols, LAN architecture, LAN systems, Ethernet, Token ring, routing protocols, Packet switching, Network devices – switches, gateways, TCP / UDP, application layer protocols and systems (http, smtp, dns, ftp), network security.
Web technologies : Three tier web based architectures; JSP, ASP, J2EE, .NET systems; html, XML
To get fastest exam alerts and government job alerts in India, join our Telegram channel.