-
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 ] - 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 ] - 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 ] - Probability
-
Section A [ Quantitative ] - Ratio and Proportion
-
Section A [ Quantitative ] - Simple and Compound Interest
- Simple and Compound Interest Part #1
- Simple and Compound Interest Part #2
- Simple and Compound Interest Part #3
- Simple and Compound Interest Part #4
- Fastest Method to Solve Compound Interest
- Simple Interest and compound [Formula]
- Simple and Compound Interest [Notes]
- Simple and Compound Interest [Practice Problems]
-
Section A [ Quantitative ] - Time and Work
-
Section A [ Quantitative ] - Train Problems
-
Section A [ Verbal ] - Ability
- 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 ] - Roots words
-
Section A [ Verbal ] - Reading Comprehension
-
Section A [ Verbal ] - Subject Verb Agreement
-
Section A [ Verbal ] - Synonyms And Antonyms
-
Section A [ Reasoning ] - Blood Relation
-
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 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 #13
- C Programming Part #14
- C Programming Part #15
- 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 ]
- User Space and Kernel Space [ Operating System Overview ]
- PCB (Process Control Block) [ Process And Process Scheduling ]
- Process State Transition Diagram [ Process And Process Scheduling ]
- FCFS ( First come first serve ) [ Process And Process Scheduling]
- SJF Preemptive with solved example [ Process And Process Scheduling ]
- 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 ]
- 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 ]
- Hypertext Transfer Protocol – HTTP [ Common TCP/IP Stack Protocols ]
- Simple Mail Transfer Protocol – SMTP [ 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 - [ Data Structures ]
- 01 – Introducton [DSA Introduction]
- 02 – Types Of Data Structures [DSA Introduction]
- 03 – Operations Of Data Structures [DSA Introduction]
- 04 – Concept Of Abstract Data Type [DSA Introduction]
- 05 – Arrays – Part 1 [DSA Introduction]
- 06 – Arrays – Part 2 [DSA Introduction]
- 07 – Introduction To Stack [Stacks]
- 08 – Operations Of Stack ADT [Stacks]
- 09 – Stack Implementation Using Array Part – 1 [Stacks]
- 10 – Stack Implementation Using Array Part – 2 [Stacks]
- 12 – Operations Of Queue ADT [Queues]
- 11 – Introduction Of Queue [Queues]
- 13 – Queue Implementation Using Array Part – 1 [Queues]
- 14 – Queue Implementation Using Array Part-2 [Queues]
- 15 – Circular Queue Implementation Part – 1 [Queues]
- 16 – Circular Queue Implementation Part – 2 [Queues]
- 17 – Introduction To Linked List [Linked Lists]
- 18 – Array Vs Linked List [Linked Lists]
- 19 – Linked List Implementation Part – 1 [Linked Lists]
- 20 – Linked List Implementation Part – 2 [Linked Lists]
- 21 – Linked List Implementation Part – 3 [Linked Lists]
- 22 – Linked List Implementation Part – 4 [Linked Lists]
- 23 – Linked List Implementation Part – 5 [Linked Lists]
- 24 – Linked List Implementation Part – 6 [Linked Lists]
- 25 – Stack Implementation Using Linked List – Part 1 [Linked Lists]
- 26 – Stack Implementation Using Linked List – Part 2 [Linked Lists]
- 27 – Queue Using Linked List Part – 1 [Linked Lists]
- 28 – Queue Using Linked List Part – 2 [Linked Lists]
- 29 – Circular Queue Using Linked List [Linked Lists]
- 30 – Implementation Of Doubly Linked List – Part 1 [Linked Lists]
- 31 – Implementation Of Doubly Linked List – Part 2 [Linked Lists]
- 32 – Implementation Of Doubly Linked List – Part 3 [Linked Lists]
- 33 – Implementation Of Doubly Linked List – Part 4 [Linked Lists]
- 34 – Implementation Of Doubly Linked List – Part 5 [Linked Lists]
- Data Structures And Algorithms Sample
- Data Structures And Algorithms
- Data Structures And Algorithms Practice Problem
- Binary Tree Implementation Part 1 – Insertion & Traversing [Trees]
- Introduction to Tree Data Structure & Binary Tree [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
- AVL Tree [Trees]
- AVL Tree Solved Example – #1 [Trees]
- AVL Tree Solved Example – #2 [Trees]
- B-Tree Introduction [Trees]
- B-Tree Solved Example – #1
- B-Tree Solved Example – #2 [Trees]
- Huffman Coding [Trees]
- BFS & DFS – #1 [Graphs]
- Topological Sorting [Graphs]
- Graphs Introduction [Graphs]
- BFS & DFS – #2 [Graphs]
- Topological Sorting – Solved Example [Graphs]
- Linear Search [Recursion and Storage Management]
- Recursion – Winding & Unwinding [Recursion and Storage Management]
- Binary Search [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 – #2 [Searching & Sorting]
- Linear Probing – #1 [Searching & Sorting]
- Linear Probing With Collisions – Solved [Searching & Sorting]
- Linear + Quadratic Probing – Solved Example [Searching & Sorting]
- Searching & Sorting Introduction [Searching & Sorting]
- Selection Sorting – #2 [Searching & Sorting]
- Selection Sorting – #1 [Searching & Sorting]
- Insertion Sort – #1 [Searching & Sorting]
- Insertion Sort – #2 [Searching & Sorting]
- Merge Sort – #2 [Searching & Sorting]
- Merge Sort – #1 [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]
- Viva Questions – Data Structures
- [Soln] Mod 1 – Stack, Queue & Linked List [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 2 – Trees [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 3 – Graphs [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 4 – Recursion & Storage Management [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 5 – Searching & Sorting [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 6 – Application Of Data Structures [MU – Dec-2024 Importance Solutions]
-
Section B - [ Basics of Big Data and Artificial Intelligence ]
- Agent and Peas Description [ Artificial Intelligence ]
- Introduction to Fuzzy Logic [ 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 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 ]
- Introduction to Datawarehouse [ Big Data ]
- Meta Data [ Big Data ]
- Data mart [ Big Data ]
- Architecture of Data Warehouse [ Big Data ]
- What is Olap Operation [ Big Data ]
- OLAP vs OLTP [ Big Data ]
- ETL – Extract Transform and Load [ Big Data ]
-
Section B - [ AI Notes ]
-
Section B - [ Big Data Notes ]
-
Section B - [ AI Notes for CCAT Exam ]
-
Section B - [ Big Data Notes for CCAT Exam ]
-
Quiz
-
Previous Year Leak Papers
-
CCAT Previous Year Leak Paper Solution
This content is protected, please login and enroll course to view this content!