2021 2022 Student Forum Karnataka PGCET M.Tech Syllabus – Computer Science and Engineering
 User Name Remember Me? Password

#1
29th November 2014, 01:09 PM
 Unregistered Guest
Karnataka PGCET M.Tech Syllabus – Computer Science and Engineering

I am searching for the Karnataka PGCET M.Tech Syllabus – Computer Science and Engineering? Can you please provide me Karnataka PGCET M.Tech Syllabus for CSE stream?
#2
1st December 2014, 08:12 AM
 Super Moderator Join Date: Apr 2013
Re: Karnataka PGCET M.Tech Syllabus – Computer Science and Engineering

The Karnataka Post Graduate Common Entrance Test is being conducted for the purpose of determining the eligibility/merit, for admission of Karnataka and Non-Karnataka candidates to the First year or First semester of

M.E
M.Tech
M.Arch

You are looking for the PGCET M.Tech Syllabus for CSE stream students. Here I am provide you the PGCET M.Tech Syllabus for CSE. This 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 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; Flashing, 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-cexipleteriess.

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, I34± trees), Transactions and concurrency control;

Computer networks : ISO / OS! 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, .NEET systems; html, XML

Message:
Options