The syllabus for admission in M Tech Computer Science and Engineering (MTCSE) program through Central Universities Common Entrance Test (CUCET) in CU Rajasthan is as follows:

The Question paper will have common Part A and subject specific Part B

Part A: It will be of 45 minutes duration and will have 35 Multiple Choice Questions (MCQs), with four options: only one correct. Part A is intended to test the applicants; general awareness, reasoning, basic language skills (English) and analytical skills.

Part B: will be subject specific, of 75 minutes duration and will have 65 MCQs with four Options: only one correct.

Syllabus / Topics for Subject Specific Part B:

1. Engineering Mathematics: Sets, Relations, Functions, Partial Orders, Boolean Algebra. Permutations, Combinations, Counting, Summation, generating functions, recurrence relations. Probability, Conditional Probability, Mean, Median, Mode and Standard Deviation, Random Variables, Distributions (uniform, normal, exponential, Poisson, Binomial). Algebra of matrices, determinants, systems of linear equations, LU decomposition for systems of linear equations. Limit, Continuity & differentiability, Mean value Theorems, Evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

2. Digital Logic: Logic functions, K-map, Minimization, Design and synthesis of combinational and sequential circuits, Binary arithmetic – Number representation, fixed and floating point numbers.

3. Computer Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, hardwired and micro-programmed control, Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache and main memory, Secondary storage.

4. Programming in C: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Programming Methodology – Program control (iteration, recursion, Functions), Elementary concepts of Object oriented, Functional and Logic Programming.

5. Data structures and Algorithms: Abstract data types, Array, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph. Design: Greedy approach, Dynamic programming, Divide-andconquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Notions of space and time complexity, analysis (best, worst, average cases) of time and space, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

6. Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

7. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, LL and LR Parsing, Intermediate code, target code generation, Basics of code optimization.

8. Operating System: Virtual machine, Resource manager; Processes, Threads, Inter-process communication; Concurrency, Synchronization, Deadlock; CPU scheduling; Memory management and virtual memory; File systems; I/O systems; Protection and security.

9. Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

10. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic concepts of public key and private key cryptography, digital signature, firewalls.