Karnataka PGCET is organized every year for admission to post graduate courses like M.E, M.Tech etc in various specializations like CSE and ECE as well as for M.Arch. The syllabus of exam for CSE Branch include Engineering Mathematics, Logic Design and Computer Organization, System software etc. The detailed syllabus of Karnataka PGCET entrance exam for CSE Branch is given below in the article.

Engineering Mathematics

• Mathematical Logic
• Conditional Probability
• Median
• Random Variables
• Distributions
• Normal
• Exponential
• Binomial
• Probability
• Sets
• Relations
• Functions
• Partial Orders
• Lattice
• Combinatory
• Permutations
• Counting
• Summation
• Recurrence relations
• Asymptotic
• Mean
• Mode and Standard Deviation
• Uniform
• Poisson
• Set Theory & Algebra
• Groups
• Boolean algebra
• Combinations
• Generating functions

Data Structures and Algorithms

• Notion of abstract data types
• Stack
• Queue
• Set
• String
• Binary search tree
• Heap
• Tree and graph traversals
• Connected components
• Shortest paths
• Hashing
• Searching
• Design techniques
• Time and space
• Upper and Lower bounds
• NP-completeness
• List
• Tree
• Graph
• Spanning trees
• Sorting
• Asymptotic analysis

Logic Design and Computer Organization

• Logic functions
• Minimization
• Number representation
• Computer Arithmetic
• ALU and Data-path
• Hardwired and micro-programmed control
• I/O interface
• Instruction pipelining
• Cache main and secondary storage
• Design and synthesis of Combinational and Sequential circuits
• Machine instructions and addressing modes
• Memory interface
• Serial communication interface

Formal Languages and Automata Theory

• Regular languages
• Finite automata
• Push-down automata
• Recursively enumerable sets
• Un-decidability
• Context free languages
• Turing machines

System software

• Lexical analysis
• Parsing
• Runtime environment
• Linking (static and dynamic)
• Syntax directed translation
• Code generation

Operating Systems

• Classical concepts
• Concurrency
• Deadlock
• Processes
• Inter-process communication
• CPU scheduling
• File systems
• Protection and security
• Synchronization
• Threads
• Memory management
• I/O systems

Databases

• Relational model
• ER-model
• Tuple calculus
• Integrity constraints
• Normal forms
• File structures
• Sequential files
• B+ trees
• Concurrency control
• Relational algebra
• Database design
• Query languages
• Indexing
• Transactions

Computer networks

• Data link control
• ISO
• OSI stack
• Ethernet
• Sliding window protocols
• LAN systems
• Application layer protocols and systems
• Ethernet
• Routing protocols
• Switches
• Gateways
• Packet switching
• Network security
• Data encoding and transmission
• LAN architecture
• Token ring
• Network devices
• TCP / UDP

Web technologies

• JSP
• ASP
• .NEET systems
• XML
• J2EE
• Html

Aspirants must be well prepared to pass this exam. They must find good reference books to prepare for this test. Special care must be given to Engineering Mathematics as there will be a lot of problems to solve from this area. Collect previous question papers and practice them. Good coaching centres are also available for providing further assistance in preparing for this test.