-
About the Course
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
CDAC CCAT Study Materials
Crack your CDAC CCAT Exams in first attempt with LMT Study Materials- 📚Complete Study Notes (Concepts & Solved Example)
- 📌 500+ Practice Problems
- 📝 Formula's and tricks
- 👣 Beginner Friendly
- ⭐️ Trusted by 1000+ Students
- 📑 Previous Year Question Papers
- 📚 Section A + Section B + Section C [ All Notes Available ]
The one-stop destination for everything you need for CDAC CCAT Exam Preparations
So let's dive in - Enroll today, Crack the exam & get into top Institute of CDAC and get to work with your Dream CompanyNo items in this section -
Section A [ Quantitative ] - Profit and Loss
-
Section A [ Quantitative ] - Decimal and Fractions
-
Section A [ Quantitative ] - Average
-
Section A [ Quantitative ] - Arithmetic Progression and Geometric Progression
-
Section A [ Quantitative ] - Ages Problems
-
Section A [ Quantitative ] - Alligations and Mixtures
-
Section A [ Quantitative ] - Boats and Streams
-
Section A [ Quantitative ] - Time, Speed and Distance
-
Section A [ Quantitative ] - Chain rule
-
Section A [ Quantitative ] - HCF and LCM
-
Section A [ Quantitative ] - Number System
-
Section A [ Quantitative ] - Percentage Problem
-
Section A [ Quantitative ] - Permutation and Combination
-
Section A [ Quantitative ] - Pipes and Cistern
-
Section A [ Quantitative ] - Perimeter, Area, Volume
-
Section A [ Quantitative ] - Probability
-
Section A [ Quantitative ] - Ratio and Proportion
-
Section A [ Quantitative ] - Simple and Compound Interest
-
Section A [ Quantitative ] - Time and Work
- Time and Work Part #1
- Time and Work Part #2
- Time and Work Part #3
- Time and Work Part #4
- Time and Work Part #1 [ Old Videos by Sumer ]
- Time and Work Part #2 [ Old Videos by Sumer ]
- Time and Work Part #3 [ Old Videos by Sumer ]
- Time and Work[Formula] —
- Time and Work [Practice Problems]
- Time and Work [Handmade Notes]
-
Section A [ Quantitative ] - Simplification and Approximation
-
Section A [ Quantitative ] - Train Problems
-
Section A [ Quantitative ] - Surds and Indices
-
Section A [ Quantitative ] - Time, Speed & Distance
-
Section A [ Quantitative ] - Odd man out and series
-
Section A [ Verbal ] - Roots words
-
Section A [ Verbal ] - Reading Comprehension
-
Section A [ Verbal ] - Subject Verb Agreement
-
Section A [ Verbal ] - Synonyms And Antonyms
-
Section A [ Verbal ] - Sentence Corrections
-
Section A [ Verbal ] - Fill in the Blanks
-
Section A [ Verbal ] - Paragraph
-
Section A [ Verbal ] - Error Identification
-
Section A [ Verbal ] - Sentence Rearrangement
-
Section A [ Verbal ] - Sentence Completion
-
Section A [ Verbal ] - Ability Extra
- Introduction to Verbal Ability + Tenses Part #1
- Tenses Part #1
- Tenses [ Notes + Solved Examples + Practice Problem ]
- Error Detection and Correction + Sentence Completion #1
- Sentence Completion Part #2
- Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- Assumption in Verbal Reasoning
- Deduction in Verbal Reasoning
-
Section A [ Verbal ] - Idioms & Phrases
-
Section A [ Reasoning ] - Blood Relation
-
Section A [ Reasoning ] - Verbal Reasoning : Analogy
-
Section A [ Reasoning ] - Calender
-
Section A [ Reasoning ] - Coding Decoding
-
Section A [ Reasoning ] - Data Sufficiency
-
Section A [ Reasoning ] - Clock Problems
-
Section A [ Reasoning ] - Direction
-
Section A [ Reasoning ] - Number Series
-
Section A [ Reasoning ] - Seating Arrangement
-
Section A [ Reasoning ] - Visual Reasoning
-
Section A - Computer Fundamental
-
Section A - Concepts of Programming
-
Section B - [ C Programming ]
- C Programming Part #1
- C Programming Part #2
- C Programming Part #3
- C Programming Part #4
- C Programming Part #5
- C Programming Part #6
- C Programming Part #7
- C Programming Part #8
- C Programming Part #9
- C Programming Part #10
- C Programming Part #11
- C Programming Part #12
- C Programming Part #15
- C Programming Part #14
- C Programming Part #13
- C Programming Part #16
- C Programming Part #17
- C Programming Part #18
- C Programming Part #19
- C Programming Part #20
- C Programming Part #21
- C Programming Part #22
- C Programming Part #23
- C Programming Part #24
- C Programming Part #25
- C Programming Part #26
- C Programming Part #27
- C Programming Part #28
- C Programming Part #29
- C Programming Part #30
- C Programming [Notes]
- C Programming Practice Problem
-
Section B - [ C Snippet Problems with Solutions Video]
-
Section B - [ Object Oriented Programming (C++) ]
- Object Oriented Programming (C++) Sample
- Object Oriented Programming (C++)
- Object Oriented Programming (C++) Practice Problem
- Introduction to C++
- Input & Output in C++
- Difference between Structure in C & C++
- Class & Objects C++
- Inspector, Mutators, Facilitators
- Contructor & Destructor
- Default Arguments & Inline Function
- Array of Objects
- Dynamic Memory Allocation
- Static Member and function
- Exception handling
- Composition
- Friend Class and function
- Function Overloading
- Operator Overloading
- Copy Constructor
- Inheritance
- Pure Virtual Function
- Types of Inheritance
- Virtual Function
- Template
- RTTI
- Casting Operators
- Dynamic Array of Object
-
Section B - [ Operating System ]
- Introduction to Operating System [ Operating System Overview ]
- Monolithic and Micro Kernel Architecture [ Operating System Overview ]
- System Calls and Its Types
- PCB (Process Control Block) [ Process And Process Scheduling ]
- Process State Transition Diagram [ Process And Process Scheduling ]
- Threading and Multi-Threading
- Scheduler and Types of Process Scheduling Algorithm
- FCFS ( First come first serve ) [ Process And Process Scheduling]
- SJF Preemptive with solved example [ Process And Process Scheduling ]
- SJF 2 Preemptive with solved example
- SJF (non preemptive ) with solved [ Process And Process Scheduling ]
- Preemptive Priority Process Scheduling [ Process And Process Scheduling ]
- ROUND ROBIN SCHEDULING ALGORITHM with solved example [ Process And Process Scheduling ]
- Producer Consumer Problem [ Process Synchronization and Deadlock ]
- User Space and Kernel Space [ Operating System Overview ]
- Critical Section Problem [ Process Synchronization and Deadlock ]
- Dead Lock with Necessary and Sufficient Condition for Deadlock [ Process Synchronization and Deadlock ]
- Bankers algorithm with solve example part 1 [ Process Synchronization and Deadlock ]
- Bankers (Resource Request algorithm) with solve example part 2 [ Process Synchronization and Deadlock ]
- Dead Lock Recovery [ Process Synchronization and Deadlock ]
- Dining philosopher Problem [ Process Synchronization and Deadlock ]
- Introduction to Memory in Operating system [ Memory Management ]
- Memory management Part #1 [ Memory Management ]
- Memory management Part #2 [ Memory Management ]
- Memory management Part #3 [ Memory Management ]
- Loading and Linking [ Memory Management ]
- FIFO, LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS [ Memory Management ]
- Disk scheduling Algorithm [ Input / Output Management ]
- FCFS Disk Scheduling Algorithm [ Input / Output Management ]
- SSTF Disk Scheduling Algorithm [ Input / Output Management ]
- SCAN Disk Scheduling Algorithm [ Input / Output Management ]
- CSCAN Disk Scheduling Algorithm [ Input / Output Management ]
- Look Disk Scheduling Algorithm [ Input / Output Management ]
- CLook Disk Scheduling Algorithm [ Input / Output Management ]
- FCFS SSTF SCAN CSCAN LOOK CLOOK Overview [ Input / Output Management ]
- Connection Oriented vs Connection-Less [ OSI Layers ]
- OSI Reference model [ OSI Layers ]
- TCP-IP Reference model [ OSI Layers ]
- OSI vs TCP-IP model comparision [ OSI Layers ]
- IP address vs Mac address [ IP Addressing ]
- IPv4 vs IPv6 Comparison [ IP Addressing ]
- IPv4 header format [ IP Addressing ]
- Routing Algorithms Part #1 [ IP Addressing ]
- Routing Algorithms Part #2 [ IP Addressing ]
- ARP And RARP [ IP Addressing ]
- Leaky Bucket Algorithm [ IP Addressing ]
- Token Bucket Algorithm [ IP Addressing ]
- Domain Name System (DNA) [ Common TCP/IP Stack Protocols ]
- Simple Mail Transfer Protocol – SMTP [ Common TCP/IP Stack Protocols ]
- Hypertext Transfer Protocol – HTTP [ Common TCP/IP Stack Protocols ]
- File Transfer Protocol – FTP [ Common TCP/IP Stack Protocols ]
- Operating System Sample [Notes]–
- Operating System [Notes]
- Operating System Practice Problem
- Computer Network [Notes]
- Computer Network Practice Problem
-
Section B - [ Basics of Big Data and Artificial Intelligence ]
- Agent and Peas Description [ Artificial Intelligence ]
- Types of Agent [ Artificial Intelligence ]
- Learning Agent [ Artificial Intelligence ]
- Introduction to Machine Learning [ Artificial Intelligence ]
- Types of Machine Learning [ Artificial Intelligence ]
- Introduction to Fuzzy Logic [ Artificial Intelligence ]
- Introduction to Neural Network [ Artificial Intelligence ]
- Genetic Algorithm [ Artificial Intelligence ]
- Introduction to Big Data [ Big Data ]
- Hadoop Part 1 [ Big Data ]
- Hadoop Part 2 [ Big Data ]
- Map Reduce [ Big Data ]
- Introduction to No SQL [ Big Data ]
- Key Value Stores
- Column Store Database
- Document Database
- Graph Database
- Data Stream Management System
- Sampling Technique – Part 1
- Sampling Technique – Part 2
- Introduction to Datawarehouse [ Big Data ]
- Meta Data [ Big Data ]
- Data mart [ Big Data ]
- Architecture of Data Warehouse [ Big Data ]
- OLAP vs OLTP [ Big Data ]
- ETL – Extract Transform and Load [ Big Data ]
- What is Olap Operation [ Big Data ]
-
Section B - [ AI Notes ]
-
Section B - [ Big Data Notes ]
-
Section B - [ Data Structures ]
Yet To Update
- Introduction [ Introduction ]
- Types Of Data Structures [ Introduction ]
- Operations Of Data Structures [ Introduction ]
- Concept Of Abstract Data Type [ Introduction ]
- Arrays – Part 1 [ Introduction ]
- Arrays – Part 2 [ Introduction ]
- Introduction To Stack [ Stacks ]
- Operations Of Stack ADT [ Stacks ]
- Stack Implementation Using Array Part – 1 [ Stacks ]
- Stack Implementation Using Array Part – 2 [ Stacks ]
- Introduction Of Queue [ Queues ]
- Operations Of Queue ADT [ Queues ]
- Queue Implementation Using Array Part – 1 [ Queues ]
- Queue Implementation Using Array Part – 2 [ Queues ]
- Circular Queue Implementation Part – 1 [ Queues ]
- Circular Queue Implementation Part – 2 [ Queues ]
- Introduction To Linked List [ Linked Lists ]
- Array Vs Linked List [ Linked Lists ]
- Linked List Implementation Part – 1 [ Linked Lists ]
- Linked List Implementation Part – 2 [ Linked Lists ]
- Linked List Implementation Part – 3 [ Linked Lists ]
- Linked List Implementation Part – 4 [ Linked Lists ]
- Linked List Implementation Part – 5 [ Linked Lists ]
- Linked List Implementation Part – 6 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 1 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 2 [ Linked Lists ]
- Queue Using Linked List Part – 1 [ Linked Lists ]
- Queue Using Linked List Part – 2 [ Linked Lists ]
- Circular Queue Using Linked List [ Linked Lists ]
- Doubly Linked List – Part 1 [ Linked Lists ]
- Doubly Linked List – Part 2 [ Linked Lists ]
- Doubly Linked List – Part 3 [ Linked Lists ]
- Doubly Linked List – Part 4 [ Linked Lists ]
- Doubly Linked List – Part 5 [ Linked Lists ]
- Introduction to Tree Data Structure & Binary Tree [ Trees ]
- Binary Tree Implementation Part 1 – Insertion & Traversing [ Trees ]
- Binary Tree Implementation Part 2 – Traversing & Deletion [ Trees ]
- Binary tree Traversal [ Trees ]
- Tree traversal methods: Pre, post and in-order traversal [ Trees ]
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Trees ]
- Height Balaced Binary Search Tree [ Trees ]
- AVL Tree [ Trees ]
- AVL Tree Solved Example – #1 [ Trees ]
- AVL Tree Solved Example – #2 [ Trees ]
- B-Tree Introduction [ Trees ]
- B-Tree Solved Example – #1 [ Trees ]
- B-Tree Solved Example – #2 [ Trees ]
- Huffman Coding [ Trees ]
- Graphs Introduction [ Graphs ]
- BFS & DFS – #1 [ Graphs ]
- BFS & DFS – #2 [ Graphs ]
- Topological Sorting [ Graphs ]
- Topological Sorting – Solved Example [ Graphs ]
- Binary Search [ Recursion and Storage Management ]
- Linear Search [ Recursion and Storage Management ]
- Recursion – Winding & Unwinding [ Recursion and Storage Management ]
- Introduction to Buddy System [ Recursion and Storage Management ]
- Problems on Buddy System [ Recursion and Storage Management ]
- Hashing Collision [ Searching & Sorting ]
- Hashing concept [ Searching & Sorting ]
- Linear Probing – #1 [ Searching & Sorting ]
- Linear Probing – #2 [ Searching & Sorting ]
- Linear Probing With Collisions – Solved [ Searching & Sorting ]
- Linear + Quadratic Probing – Solved Example [ Searching & Sorting ]
- Searching & Sorting Introduction [ Searching & Sorting ]
- Selection Sorting – #1 [ Searching & Sorting ]
- Selection Sorting – #2 [ Searching & Sorting ]
- Insertion Sort – #1 [ Searching & Sorting ]
- Insertion Sort – #2 [ Searching & Sorting ]
- Merge Sort – #1 [ Searching & Sorting ]
- Merge Sort – #2 [ Searching & Sorting ]
- Merge Sort – #3 [ Searching & Sorting ]
- Quick Sort – #1 [ Searching & Sorting ]
- Quick Sort – #2 [ Searching & Sorting ]
- Radix Sort – #1 [ Searching & Sorting ]
- Radix Sort – #2 [ Searching & Sorting ]
- Heap Data Structure [ Applications of Data Structures ]
- Min & Max Heap [ Applications of Data Structures ]
- Infix Notation & Conversion [ Applications of Data Structures ]
- Prefix, Postfix Notation & Conversion [ Applications of Data Structures ]
- Prim’s & Kruskal’s #1 [ Applications of Data Structures ]
- Prim’s & Kruskal’s #2 [ Applications of Data Structures ]
- Stack, Queue & Linked List [ Importance Solutions ]
- Trees [ Importance Solutions ]
- Graphs [ Importance Solutions ]
- Recursion & Storage Management [ Importance Solutions ]
- Searching & Sorting [ Importance Solutions ]
- Application Of Data Structures [ Importance Solutions ]
-
Section B - [ AI Notes for CCAT Exam ]
-
Section B - [ Big Data Notes for CCAT Exam ]
-
Section C - [ Digital Electronics ]
- 1 – Number System Intro
- 2 – Binary Number System
- 3 – Octal Number System
- 4 – Hexadecimal Number System
- 5 – POS and SOP
- 6 – K-Map 1
- 7 – K-Map 2
- 8 – Logic Gates – 1
- 9 – Logic Gates – 2
- 10 – Universal Gates
- 11. Arithmetic Operations in Binary
- 12 – Arithmetic Operations using 1_s and 2_s compliment
- 13 – Arithmetic Operations using 9s and 10s
- 14 – Excess – 3
- 15 – Gray Code
- 16 – Half and Full Adder
- 17 – Multiplexer and Demultiplexer
- 18 – SR Flip Flop
- 19 – JK Flip Flop
- 20 – D and T Flip Flop
- Digital Electronics [Notes]
- Digital Electronics Practice Problem
-
Section C - [ Computer Architecture ]
- 01 – Introduction
- 02 – Von Neumann Architecture
- 03 – Binary Numeric Data Representation
- 04 – IEEE-754 Floating Point Number Representation
- 05 – Booth’s Algorithm – Part 1
- 06 – Booth’s Algorithm – Part 2
- 07 – Booth’s Algorithm – Part 3
- 08 – Restoring Division – Part 1
- 09 – Restoring Division – Part 2
- 10 – Non-Restoring Division – Part 1
- 11 – Non-Restoring Division – Part 2
- 12 – Addressing Modes – Part 1
- 13 – Addressing Modes – Part 2
- 14 – Instruction Cycles & Interrupts Mechanism
- 15 – Hardwired Control Unit
- 16 – Microprogrammed Control Unit
- 17 – Hardwired vs Microprogrammed
- 18 – Wilkie’s Control
- 19 – RISC Microprocessor
- 20 – CISC Microprocessor
- 21 – Memory And It’s Characteristics
- 22 – DRAM
- 23 – SRAM
- 24 – Memory Hierarchy And Locality Of Reference
- 25 – Cache Memory
- 26 – Cache Coherence
- 27 – Cache Coherence Strategies
- 28 – MESI Protocol
- 29 – Interleaved Memory
- 30 – Virtual Memory & Paging Concept
- 31 – Demand Paging
- 32 – Memory Segmentation
- 33 – IO Module, Functions, Requirement & Types
- 34 – Programmed IO
- 35 – Interrupt Driven IO
- 36 – DMA Driven IO
- 37 – Bus & Bus Arbitration
- 38 – Daisy Chaining
- 39 – Polling Methods
- 40 – Bus Arbitration Independent Request
- 41 – Parallel Processing & Applications
- 42 – Flynn’s Classfication
- 43 – Instruction Level Parallelism
- 44 – Superscalar Architecture
- 45 – VLIW
- 46 – Superscalar vs VLIW
- 47 – Out Of Order Execution
- Computer Architecture [ Notes ]
- Computer Architecture MCQ
-
Section C - [ Microprocessor ]
- Introduction to microprocessor
- Von Neumann Architecture
- RISC Microprocessor
- CISC Microprocessor
- 8085 Architecture [8085]
- 8085 Arithmetic instructions [8085]
- 8085 logical instructions [8085]
- 8085 Data Transfer Instruction [8085]
- 8085 Register [8085]
- 8085 Rotate Instructions [8085]
- PIN Diagram of 8085 [8085]
- Push and POP instruction [8085]
- 8086 Addressing modes [8086]
- 8086 FLAG REGISTER [8086]
- 8086 Rotate instructions [8086]
- 8086 Branch instructions [8086]
- 8086 interrupts [8086]
- 8086 Maximum mode configuration [8086]
- 8086 Memory banking [8086]
- 8086 Memory segmentation [8086]
- 8086 Minimum mode configuration [8086]
- Architecture of 8086 [8086]
- 8259 Programmable Interrupt Controller [8086]
- IO Module, Functions, Requirement & Types [8086]
- Programmed IO [8086]
- Interrupt Driven IO [8086]
- DMA Driven IO [8086]
- Microprocessor [ Notes ]
- Microprocessor Practice Problem
-
Quiz
-
Previous Year Leak Papers
-
CCAT Previous Year Leak Paper Solution
This content is protected, please login and enroll course to view this content!