CDAC C‑CAT Syllabus 2027 for PG‑DAC: Complete Section‑Wise Syllabus and Exam Pattern

Candidates targeting PG‑DAC can also strengthen their exam‑day performance with the AspirаntMitraa CDAC PG‑DAC Test Series 2027, which includes 10 full‑length C‑CAT mock tests built on the exact exam pattern with detailed solutions and performance analysis.

What is CDAC C‑CAT?

CDAC C‑CAT is a Computer Based Test conducted twice every year in January (for February batch) and July (for August batch) by the Centre for Development of Advanced Computing. It serves as the single admission gateway to all C‑DAC PG Certificate Programmes across India.

C‑DAC is a premier Research and Development organisation under the Ministry of Electronics and Information Technology (MeitY), Government of India. Its PG Certificate Programmes are NCVET‑approved 1200‑hour courses (40 credits) that have been consistently producing industry‑ready software professionals for over three decades.

The PG‑DAC (Post Graduate Certificate in Advanced Computing) is C‑DAC's flagship programme and the most sought‑after course among engineering and MCA graduates for its exceptional campus placement record with more than 400 companies participating in C‑DAC campus placements annually.

CDAC C‑CAT 2027: Exam Overview

CDAC C‑CAT Exam Pattern 2027 for PG‑DAC

PG‑DAC falls under Category III, which means candidates must attempt all three sections of the C‑CAT: Section A, Section B, and Section C. This is the most important thing to note before filling the application form selecting Category III is mandatory for PG‑DAC eligibility.

Section‑Wise Exam Pattern

Key Points About the Exam Pattern

• All questions are objective type (MCQ) with four options and one correct answer.
• Marking scheme is +3 for every correct answer and -1 for every wrong answer. Unlike CIL MT, negative marking is present here, so guessing blindly is risky.
• Each section is conducted as a separate test paper of one hour. Sections are held in order (A, then B, then C) on the exam day.
• The medium of the exam is English only.
• Category III candidates who obtain qualifying ranks in both Category II (Sections A+B) and Category III (Sections A+B+C) become eligible for all C‑DAC PG Certificate Programmes, giving them the widest choice during counselling.
• Once you select Category III in the application form, you cannot change it. Category II candidates cannot be considered for PG‑DAC.

Qualifying Criteria

Candidates must obtain a minimum qualifying score in the C‑CAT to be eligible for counselling. C‑DAC announces the qualifying cutoff after the exam based on the number of candidates and seats available. Both a section‑wise minimum and an overall cutoff must be cleared.

CDAC C‑CAT Syllabus 2027: Section A (Common to All Categories)

Section A is compulsory for all C‑CAT candidates regardless of the course they are applying for. It tests general aptitude skills and carries 50 questions for 150 marks.

1. English Language

The English section tests grammar, vocabulary, and reading comprehension. Key topics include:

• Grammar: Tenses, Articles, Prepositions, Conjunctions, Subject‑Verb Agreement, Active and Passive Voice, Direct and Indirect Speech
• Vocabulary: Synonyms, Antonyms, One Word Substitutions, Idioms and Phrases, Word Usage in Context
• Reading Comprehension: Passage‑based questions testing inference, main idea, and vocabulary in context
• Sentence Correction and Error Detection
• Para Jumbles (Sentence Rearrangement)
• Fill in the Blanks (Grammar and Vocabulary based)
• Cloze Test

Preparation Tip: Reading Comprehension and Vocabulary together account for a significant portion of English marks. Read one passage daily and maintain a vocabulary list of 10 new words per day. Focus especially on synonyms and antonyms as they appear repeatedly in C‑CAT papers.

2. Quantitative Aptitude

The Quantitative Aptitude section tests numerical problem‑solving ability. Topics include:

• Number Systems: HCF, LCM, divisibility, factors, fractions, decimals
• Percentage and its Applications
• Profit, Loss, and Discount
• Simple Interest and Compound Interest
• Ratio, Proportion, and Partnership
• Time and Work; Pipes and Cisterns
• Time, Speed, and Distance (including Trains, Boats and Streams)
• Averages and Weighted Averages
• Mixtures and Alligation
• Algebra: Linear equations, quadratic equations, inequalities
• Geometry and Mensuration: Area and perimeter of triangles, circles, rectangles; volume of cubes, cylinders, cones, spheres
• Permutation and Combination
• Probability
• Data Interpretation: Bar charts, pie charts, line graphs, tables

Preparation Tip: The Quantitative Aptitude section in C‑CAT is not GATE‑level; it tests application of standard formulas. Speed and accuracy matter more than depth. Practice at least 30 aptitude questions daily with a focus on reducing solving time per question.

3. Reasoning and Logical Ability

The Reasoning section tests analytical thinking. Topics include:

• Series: Number series, letter series, alpha‑numeric series
• Coding and Decoding
• Blood Relations
• Direction Sense and Distance Problems
• Analogies and Classification
• Syllogisms and Logical Deductions
• Statement and Conclusions / Assumptions
• Puzzles: Seating Arrangement (linear and circular), scheduling puzzles
• Input‑Output
• Data Sufficiency
• Non‑Verbal Reasoning: Mirror images, water images, pattern completion, embedded figures, cube and dice problems
• Venn Diagrams

4. Computer Fundamentals

Computer Fundamentals is a unique component of Section A that differentiates C‑CAT from general aptitude exams. Key topics include:

• Computer Organization: CPU, memory, input/output devices, storage devices
• Number Systems: Binary, octal, decimal, hexadecimal; conversions and basic arithmetic
• Boolean Algebra: Logic gates (AND, OR, NOT, NAND, NOR, XOR), truth tables, Boolean expressions
• Memory Types: RAM, ROM, Cache, registers; primary and secondary storage
• Operating System Basics: Types of OS, functions, process concept (introductory level)
• Internet and Web Basics: Web browsers, search engines, URLs, HTTP, email
• Computer Software: System software vs application software, types of programming languages
• Data Representation: ASCII, Unicode, BCD, floating point representation
• Computer Generations and History
• Flowcharts and Algorithms: Basic flowchart symbols, algorithm concepts, pseudocode

CDAC C‑CAT Syllabus 2027: Section B

Section B is attempted by both Category II and Category III candidates. It tests core Computer Science subjects at BE/B.Tech or MCA level. Section B carries 50 questions for 150 marks.

1. C Programming

C Programming is a critical topic in Section B and also feeds directly into Section C topics. Key areas include:

• Basics: Data types, variables, constants, operators, expressions
• Control Structures: if‑else, switch‑case, loops (for, while, do‑while), break, continue
• Functions: Function definition, declaration, call by value vs call by reference, recursion
• Arrays: 1D and 2D arrays, array operations, strings (character arrays)
• Pointers: Pointer basics, pointer arithmetic, pointers to arrays, pointers to functions, pointer to pointer
• Structures and Unions: Definition, accessing members, nested structures, arrays of structures
• File Handling: File open, close, read, write operations using standard library functions
• Dynamic Memory Allocation: malloc, calloc, realloc, free
• Preprocessor Directives: #define, #include, macros
• Storage Classes: auto, register, static, extern

High‑Priority Topics: Pointers and recursion appear very frequently in C‑CAT. Master pointer arithmetic and trace through recursive function calls manually.

2. Data Structures

Data Structures is one of the highest‑weightage topics in Section B. Key topics:

• Arrays and Strings: Linear search, binary search, sorting in arrays
• Linked Lists: Singly linked list, doubly linked list, circular linked list; insertion, deletion, traversal
• Stacks: Array and linked list implementation, applications (expression evaluation, infix to postfix conversion, parenthesis matching)
• Queues: Linear queue, circular queue, dequeue, priority queue
• Trees: Binary tree, Binary Search Tree (BST), tree traversals (inorder, preorder, postorder), AVL tree (rotation concepts), Heap tree
• Graphs: Representation (adjacency matrix and list), BFS, DFS, shortest path (Dijkstra's algorithm), minimum spanning tree (Kruskal and Prim)
• Sorting Algorithms: Bubble sort, selection sort, insertion sort, merge sort, quick sort, heap sort; time complexity of each
• Searching Algorithms: Linear search, binary search
• Hashing: Hash functions, collision resolution (chaining, open addressing)
• Algorithm Complexity: Big‑O, Big‑Omega, Big‑Theta notation; best, worst, average case

3. Object Oriented Programming (OOP) Using C++

OOP with C++ is consistently tested in Section B. Key topics:

• OOP Concepts: Encapsulation, Abstraction, Inheritance, Polymorphism
• Classes and Objects: Class definition, access specifiers (public, private, protected)
• Constructors and Destructors: Default, parameterized, copy constructors; destructor
• Inheritance: Single, multiple, multilevel, hierarchical, hybrid inheritance
• Polymorphism: Function overloading, operator overloading, virtual functions, pure virtual functions, abstract classes
• Interfaces and Abstract Classes
• Exception Handling: try, catch, throw; types of exceptions
• Templates: Function templates, class templates
• STL (Standard Template Library) basics: Vectors, lists, maps, sets
• Friend Functions and Friend Classes
• File Handling in C++

4. Operating Systems

Operating Systems is a core high‑weightage subject in Section B:

• Introduction: Functions of OS, types of OS (batch, time‑sharing, real‑time, distributed)
• Process Management: Process states and transitions, Process Control Block (PCB), threads vs processes
• CPU Scheduling Algorithms: FCFS, SJF (preemptive and non‑preemptive), Round Robin, Priority Scheduling; calculation of waiting time, turnaround time, response time
• Process Synchronization: Critical section problem, semaphores, monitors, Mutex
• Deadlock: Conditions (mutual exclusion, hold and wait, no preemption, circular wait), prevention, avoidance (Banker's Algorithm), detection and recovery
• Memory Management: Contiguous and non‑contiguous allocation, paging, segmentation, logical vs physical address
• Virtual Memory: Demand paging, page replacement algorithms (FIFO, LRU, Optimal), thrashing
• File Systems: File allocation methods (contiguous, linked, indexed), directory structures, disk scheduling algorithms (FCFS, SSTF, SCAN, C‑SCAN)
• I/O Management: Device drivers, spooling, buffering
• Inter‑Process Communication: Pipes, message queues, shared memory, sockets

5. Data Communication and Computer Networks

Computer Networks is a consistently tested high‑weightage subject:

• Network Basics: Types of networks (LAN, MAN, WAN), network topologies, transmission media
• OSI Model: All seven layers (Physical, Data Link, Network, Transport, Session, Presentation, Application) and their functions and protocols
• TCP/IP Model: Comparison with OSI model, protocols at each layer
• IP Addressing: IPv4 addressing, classes, subnetting, CIDR, NAT, IPv6 basics
• Routing: Static vs dynamic routing, routing protocols (RIP, OSPF, BGP)
• Transport Layer: TCP vs UDP, TCP connection establishment (3‑way handshake), flow control, congestion control
• Application Layer Protocols: HTTP, HTTPS, FTP, SMTP, POP3, IMAP, DNS, DHCP, SNMP, Telnet, SSH
• Network Devices: Hub, switch, router, bridge, gateway, repeater
• Data Link Layer: Framing, error detection (CRC, parity), error correction, MAC addresses, Ethernet
• Network Security: Cryptography basics (symmetric and asymmetric), firewalls, VPN, SSL/TLS, common attacks (DoS, phishing, man‑in‑the‑middle)
• Wireless Networks: Wi‑Fi standards (802.11), Bluetooth, 4G/5G basics

6. Basics of Big Data and Artificial Intelligence

This is a relatively newer addition to the C‑CAT Section B syllabus and carries a moderate but growing weightage:

• Big Data: Definition, 5 Vs (Volume, Velocity, Variety, Veracity, Value), Hadoop ecosystem basics, HDFS, MapReduce concepts
• Database Technologies: Introduction to NoSQL, types of NoSQL databases (document, key‑value, column‑family, graph)
• Artificial Intelligence: Introduction to AI, intelligent agents, types of AI (narrow, general)
• Machine Learning Basics: Supervised learning, unsupervised learning, reinforcement learning; common algorithms (linear regression, decision trees, k‑NN)
• Deep Learning Basics: Neural networks, activation functions, introduction to CNN and RNN
• Natural Language Processing: Basics and applications
• AI Applications: Image recognition, speech processing, recommendation systems, chatbots

CDAC C‑CAT Syllabus 2027: Section C (Category III PG‑DAC)

Section C is the distinguishing section for Category III candidates targeting PG‑DAC, PG‑DESD, PG‑DVLSI, PG‑DIoT, and PG‑DCSF. It covers more hardware‑oriented and mathematical CS subjects. Section C carries 50 questions for 150 marks.

1. Computer Architecture and Organization

• Functional Components: CPU, memory unit, I/O unit, data path, control path
• Instruction Set Architecture: RISC vs CISC, instruction formats, addressing modes
• ALU Design: Addition, subtraction, multiplication, division circuits
• Control Unit: Hardwired and microprogrammed control
• Memory Hierarchy: Registers, cache memory (mapping techniques: direct, associative, set‑associative), RAM, secondary storage
• Pipeline Processing: Stages of pipeline, pipeline hazards (structural, data, control), solutions
• I/O Organization: Programmed I/O, interrupt‑driven I/O, DMA (Direct Memory Access)
• Multiprocessors: SISD, SIMD, MISD, MIMD classification; parallel processing basics
• Performance Metrics: MIPS, MFLOPS, Amdahl's Law

2. Digital Electronics

• Number Systems Review: Binary arithmetic, 1's and 2's complement
• Boolean Algebra: Theorems, De Morgan's laws, simplification
• Combinational Circuits: Adders (half adder, full adder), subtractors, multiplexers, demultiplexers, encoders, decoders, comparators
• Karnaugh Maps: Simplification of Boolean expressions using K‑maps (up to 4 variables)
• Sequential Circuits: Flip‑flops (SR, JK, D, T), registers, counters (synchronous and asynchronous), shift registers
• Logic Families: TTL, CMOS basic characteristics
• Memory Devices: ROM, RAM, EPROM, EEPROM types and characteristics
• Programmable Logic Devices: PLA, PAL (basic concepts)
• Analog‑to‑Digital and Digital‑to‑Analog Converters (basic concepts)

3. Microprocessors

• 8085 Microprocessor Architecture: Registers, ALU, flags, bus structure
• 8085 Instruction Set: Data transfer, arithmetic, logical, branch, machine control instructions
• 8085 Programming: Writing simple assembly language programs
• Interrupts in 8085: Types of interrupts, interrupt service routine
• 8086 Microprocessor: Architecture overview, segment registers, memory segmentation, addressing modes
• Memory and I/O Interfacing: Memory mapped I/O vs I/O mapped I/O
• Introduction to 8051 Microcontroller (basic concepts)
• Comparison of Microprocessors and Microcontrollers

Note: Microprocessors (especially 8085 and 8086) is a subject many CS graduates underestimate for C‑CAT. It carries a significant number of questions in Section C and requires dedicated practice of assembly language programs and timing diagrams.

4. Database Management Systems (DBMS)

DBMS appears in Section C of C‑CAT for PG‑DAC candidates:

• Database Concepts: Purpose of DBMS, data models (hierarchical, network, relational, object‑oriented)
• Entity‑Relationship (ER) Model: Entities, attributes, relationships, ER diagrams, strong and weak entities
• Relational Model: Tables, keys (primary, candidate, super, foreign), referential integrity
• Relational Algebra: Select, project, union, intersection, difference, Cartesian product, join operations
• SQL: DDL (CREATE, ALTER, DROP), DML (SELECT, INSERT, UPDATE, DELETE), DCL (GRANT, REVOKE), TCL (COMMIT, ROLLBACK); Joins (INNER, LEFT, RIGHT, FULL OUTER); subqueries; aggregate functions (COUNT, SUM, AVG, MIN, MAX); GROUP BY and HAVING
• Normalization: Functional dependencies, 1NF, 2NF, 3NF, BCNF, decomposition
• Transactions: ACID properties (Atomicity, Consistency, Isolation, Durability)
• Concurrency Control: Lock‑based protocols, two‑phase locking, timestamp ordering, deadlock in transactions
• Indexing and Hashing: B‑tree and B+ tree indexing, dense and sparse indexes
• Query Optimization Basics

5. Discrete Mathematics

• Set Theory: Sets, subsets, power sets, operations (union, intersection, complement, difference), Venn diagrams
• Relations: Types of relations (reflexive, symmetric, antisymmetric, transitive), equivalence relations, partial and total order relations, Hasse diagrams
• Functions: Types of functions (injective, surjective, bijective), composition, inverse
• Mathematical Logic: Propositional logic, truth tables, logical connectives, logical equivalences, predicate logic, quantifiers
• Proof Techniques: Direct proof, proof by contradiction, mathematical induction
• Combinatorics: Permutations, combinations, pigeonhole principle, inclusion‑exclusion principle, recurrence relations
• Graph Theory: Types of graphs, paths, cycles, connectivity, Eulerian and Hamiltonian paths, planar graphs, graph coloring, trees and spanning trees
• Algebraic Structures: Groups, rings, fields (basic definitions and properties)
• Probability: Basic probability theory, conditional probability, Bayes' theorem, distributions (Binomial, Poisson, Normal basics)

CDAC C‑CAT 2027: Important Dates (Expected)

Based on the established pattern of two cycles per year:

Always check the official website at cdac.in for confirmed dates.

CDAC C‑CAT 2027: Eligibility Criteria for PG‑DAC

Candidates must satisfy the following eligibility to apply for C‑CAT and seek admission to PG‑DAC:

Educational Qualification: BE, B.Tech, or B.Sc (Engineering) in Computer Science, Information Technology, Electronics, Telecommunications, Electrical, or Instrumentation Engineering with minimum 55% marks. MCA or M.Sc (Computer Science / IT / Electronics) graduates are also eligible.

Minimum Marks: 55% aggregate in qualifying degree. CGPA holders must provide a percentage conversion certificate.

Final Year Students: Candidates in their final year/semester in 2026 or 2027 can apply provisionally, provided they submit final marksheets before the course commencement date.

Age Limit: There is no upper age limit for C‑CAT or C‑DAC PG Certificate Programmes.

Note: BCA holders without a postgraduate degree (MCA or M.Sc) are generally not eligible for the core PG Certificate Programmes.

CDAC PG‑DAC: Course Details and Placement Record

PG‑DAC is a 24‑week full‑time course of 1200 hours (including 300 hours of self‑study) covering advanced software development, system programming, and enterprise technologies. The course is delivered at C‑DAC centres across India including ACTS Pune, Sunbeam Pune, Mumbai, Bengaluru, Hyderabad, Noida, and Chennai, among others.

The campus placement record for PG‑DAC is outstanding. More than 400 companies participated in C‑DAC's campus placement drives in 2024 and 2025. Top recruiting companies include Infosys, TCS, Wipro, Cognizant, Capgemini, L&T Infotech, and several product‑based companies. ACTS Pune and Sunbeam Pune consistently have the highest placement rates and the most competitive C‑CAT rank cutoffs.

Application Fee for C‑CAT 2027

Fee is non‑refundable and paid online via credit/debit card or UPI.

Preparation Strategy for CDAC C‑CAT 2027 PG‑DAC

Phase 1: Build Subject Foundations Start with Section B subjects as they carry the highest overall weightage for PG‑DAC. Cover Data Structures, Operating Systems, and Computer Networks first. Then move to C Programming and OOP. For Section C, prioritize DBMS and Computer Architecture before Digital Electronics and Microprocessors.

Phase 2: Section A Parallel Preparation Do not neglect Section A. Spend 30‑40 minutes daily on aptitude and reasoning practice. Work on Computer Fundamentals alongside Section B as there is significant overlap.

Phase 3: Mock Test Practice Once 70‑80% of the syllabus is covered, shift to full‑length mock test practice. Attempting full‑length 3‑hour C‑CAT mock tests is essential to build stamina and time management with negative marking. Since there is -1 marking, you need to develop the judgment of when to attempt and when to skip uncertain questions.

The AspirаntMitraa CDAC PG‑DAC Test Series 2027 includes 10 full‑length mock tests covering all three sections in the exact C‑CAT pattern with negative marking simulation, detailed solutions, and performance analysis to help you track progress and benchmark against other aspirants.

Best Books for CDAC C‑CAT 2027 PG‑DAC Preparation

Frequently Asked Questions: CDAC C‑CAT Syllabus 2027 for PG‑DAC

Is PG‑DAC a Category II or Category III course? PG‑DAC is a Category III course. Candidates must attempt all three sections (A + B + C) and obtain a Category III rank to be eligible for PG‑DAC admission.

What is the total marks in CDAC C‑CAT for PG‑DAC? The total marks for Category III candidates is 450 (50 questions × 3 marks × 3 sections). Each wrong answer carries a penalty of -1 mark.

Does CDAC C‑CAT have negative marking? Yes. Unlike CIL MT, CDAC C‑CAT has a negative marking of -1 for every wrong answer. Unattempted questions carry no marks.

What is the syllabus for CDAC C‑CAT Section C? Section C covers Computer Architecture, Digital Electronics, Microprocessors (8085, 8086), DBMS, and Discrete Mathematics.

Can a Category II candidate apply for PG‑DAC? No. PG‑DAC requires a Category III rank. Category II candidates who attempt only Sections A and B are not considered for PG‑DAC.

How many times is CDAC C‑CAT conducted per year? C‑CAT is conducted twice a year - in January (for February batch) and July (for August batch).

What is the minimum percentage required for C‑CAT eligibility? Candidates need a minimum of 55% marks in their qualifying degree (BE/B.Tech/MCA/M.Sc in relevant disciplines).

Start your CDAC C‑CAT 2027 preparation with a clear understanding of the full syllabus and use regular mock test practice to sharpen your speed and accuracy under negative marking conditions. The AspirаntMitraa CDAC PG‑DAC Test Series 2027 offers 10 full‑length C‑CAT mock tests with detailed solutions, performance analysis, and attempt comparison everything you need to build exam confidence and crack C‑CAT for your PG‑DAC seat.