Karnataka PGCET Syllabus for M.Tech Computer Science & Engineering gives details of KEA PGCET exam syllabus. Karnataka Examination Authority (KEA) conducts PG Engineering Entrance Exams for admission into M.Tech in various private engineering colleges in Karnataka. For detail about the pattern of exam and general dates follow KEA PGCET details. For details about colleges and fee please visit M.Techcutoff tools at InI.
The Syllabus for KEA PGCET Computer Science & Engineering is as follows
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 1’heory & 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; l)esign 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 I)ata-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.
Databascs : Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, Be- 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, .NFFT systems; html, XML
Exam consist of two type of Question carrying 1 and 2 marks each. There are 50 one mark questions and 25 questions weighing 2 marks each. The question paper is for 100 marks.
All details and cutoffs for previous years are provided at Inspire n Ignite (InI). For all updates and please like us on Facebook and follow us on google plus.
Do share this with friends and in case of questions please feel free to drop the question in comments.