-
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 Company -
Section A [ Quantitative ] - Number System
- [ New Video ] Number System – 1
- [ New Video ] Number System – 2
- [ New Video ] Number System – 3
- [ New Video ] Number System – 4
- Number System Part #1
- Number System Part #2
- Number System Part #3
- Number System Part #4
- Number System Part #5
- Number System Part #6
- Number System Part #7
- Number System Part #8
- Number System Part #9
- Number System Part #10
- Number System, LCM & HCF Practice Problem
-
Section A [ Quantitative ] - Simple and Compound Interest
-
Section A [ Quantitative ] - Decimal and Fractions
-
Section A [ Quantitative ] - Time, Speed and Distance
-
Section A [ Quantitative ] - Odd Man Out and Series
-
Section A [ Quantitative ] - Perimeter, Area, Volume
-
Section A [ Quantitative ] - Simplification and Approximation
-
Section A [ Quantitative ] - Probability
-
Section A [ Quantitative ] - Calender
-
Section A [ Quantitative ] - Clock Problems
-
Section A [ Quantitative ] - Boats and Streams
-
Section A [ Quantitative ] - Profit and Loss
-
Section A [ Quantitative ] - Average
-
Section A [ Quantitative ] - Arithmetic Progression and Geometric Progression
-
Section A [ Quantitative ] - Surds and Indices
-
Section A [ Quantitative ] - Ages Problems
-
Section A [ Quantitative ] - Alligations and Mixtures
-
Section A [ Quantitative ] - Chain rule
-
Section A [ Quantitative ] - HCF and LCM
-
Section A [ Quantitative ] - Percentage Problem
-
Section A [ Quantitative ] - Permutation and Combination
-
Section A [ Quantitative ] - Pipes and Cistern
-
Section A [ Quantitative ] - Ratio and Proportion
-
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 ] - Train Problems
-
Section A [ Verbal ] - Reading Comprehension
-
Section A [ Verbal ] - Synonyms And Antonyms
-
Section A [ Verbal ] - Sentence Rearrangement
-
Section A [ Verbal ] - Error Identification
-
Section A [ Verbal ] - Paragraph
-
Section A [ Verbal ] - Sentence Corrections
-
Section A [ Verbal ] - Sentence Completion
-
Section A [ Verbal ] - Fill in the Blanks
-
Section A [ Verbal ] - Subject Verb Agreement
-
Section A [ Verbal ] - Roots words
-
Section A [ Verbal ] - Idioms & Phrases
-
Section A [ Verbal ] - 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 [ Reasoning ] - Blood Relation
-
Section A [ Reasoning ] - Coding Decoding
-
Section A [ Reasoning ] - Data Sufficiency
-
Section A [ Reasoning ] - Direction
-
Section A [ Reasoning ] - Number Series
-
Section A [ Reasoning ] - Seating Arrangement
-
Section A [ Reasoning ] - Visual Reasoning
-
Section A [ Reasoning ] - Verbal Reasoning - Analogy
-
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 #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 - [ 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 - [ C Snippet Problems with Solutions Video]
-
Section B - [ Operating System ]
- 1. Introduction of Operation System , Function , Objectives
- 2. OS Structure [ Monolithic , Layer , Microkernel ]
- 3. System Call its Types
- 4. Process State Transition Diagram
- 5. PCB ( Process Control Block )
- 6. Threading and Multi-Threading
- 7. Scheduler and Types of Process Scheduling Algorithm
- 8. Various Scheduling Criteria
- 9. SJF – Scheduling Criteria
- 10. Priority Scheduling Non-Preemptive
- 11. SRTN Scheduling Algo
- 12. Round Robin Scheduling Criteria
- 13. Priority Scheduling Preemptive
- 14. Process Syncronization and IPC
- 15. Deadlock
- 15. 1 – Dead Lock Recovery
- 15.2 – Bankers algorithm with Solve Example Part 1
- 15.3 – Bankers Algorithm Part 2 (Resource Request algorithm)
- 16. Semaphore Producer Consumer Problem
- 17. OS Reader Writer & Dinning Philospher Problem
- 18. Memory Management & Partitioning
- 19. Memory Allocation Techniques
- 20. Paging & TLB
- 21. Segmentation
- 22. Virtual Memory & Demand Paging
- 23. Pagen Replacement Algorithms
- 24. File Managment File System
- 25. Disk Allocation Methods
- 26. Disk scheduling Algorithm
- 27. FCFS Disk Scheduling Algorithm
- 28. SSTF Disk Scheduling Algorithm
- 29. SCAN Disk Scheduling Algorithm
- 30. C SCAN Disk Scheduling Algorithm
- 31. Look Disk Scheduling Algorithm
- 32. C Look Disk Scheduling Algorithm
- 33. All in One ( FCFS SSTF SCAN CSCAN LOOK CLOOK )
- 34. Input Output Management
- Operating System Sample [Notes]–
- Operating System [Notes]
- Operating System Practice Problem
-
Section B - [ Data Structures ]
- 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 Linked List #1 [ Linked Lists ]
- Stack Linked List #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 ]
- Hashing Concept [ Searching & Sorting ]
- Hashing Collision [ 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 ]
- Introduction to Buddy System [Recursion and Storage Management]
- Problems on Buddy System [Recursion and Storage Management]
- Recursion – Winding & Unwinding [Recursion and Storage Management]
- Binary Search [Recursion and Storage Management]
- Linear Search [Recursion and Storage Management]
- Recursion – Winding & Unwinding [Recursion and Storage Management]
- Heap Data Structure
- Min & Max Heap
- Infix Notation & Conversion
- Prefix, Postfix Notation & Conversion
- Prim’s & Kruskal’s #1
- Prim’s & Kruskal’s #2
- Divide & Conquer With Example
- DP Approaches -1
- DP Approaches -2
- Asymptotic Notations
- Time Complexity and Big O
- Space Complexity
- Data Structures & Algorithms
- Practice Problems Set 1 – Data Structures & Algo
- Practice Problems Set 2 – Data Structures & Algo
-
Section B -[Data Community & Networking]
- 1. Introduction To Computer Networks
- 2. Network Topology Types
- 3. Network Connecting Devices [ Repeater , Hub , Bridge , Switch ]
- 4. Types of Network – LAN, MAN, WAN
- 5. Virtual LAN
- 6. OSI Reference Model
- 7. TCP-IP Reference model
- 8. IPv4 Header Format
- 9. IP Address v/s MAC Address
- 10. IPv4 v/s IPv6
- 11. ARP & RARP
- 12. Simple Mail Transfer Protocol – SMTP
- 13. User Datagram Protocol
- 14. File Transfer Protocol – FTP
- 15. Domain Name Server – DNS
- 16. Hypertext Transfer Protocol – HTTP
- Computer Network [Notes]
- Computer Network Practice Problem
-
Section B - [ AI Notes ]
-
Section B - [ Big Data Notes ]
-
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 for CCAT Exam ]
-
Section B - [ Big Data Notes for CCAT Exam ]
-
Quiz
-
Previous Year Leak Papers
-
CCAT Previous Year Leak Paper Solution
Q.1:
In what ratio should two varieties of sugar of Rs.18 per kg and Rs.24 kg be mixed together to get a mixture whose cost is Rs.20 per kg?
| A) 1:3 | B) 3:1 |
| C) 1:2 | D) 2:1 |
Answer & Explanation
Q.2:
In what ratio must a grocer mix two varieties of pulses costing Rs. 15 and Rs. 20 per kg respectively so as to get a mixture worth Rs. 16.50 kg?
| A) 3 : 7 | B) 5 : 7 |
| C) 7 : 3 | D) 7 : 5 |
Answer & Explanation
Q.3:
The ratio in which the price at Rs.7.20 a kg be mixed with rice at Rs. 5.70 a kg to produce a mixture worth Rs.6.30 a kg is:
| A) 1:3 | B) 2:3 |
| C) 3:4 | D) 4:5 |
Answer & Explanation
Q.4:
In what ratio must a grocer mix teas worth Rs.60 a kg and Rs.65 a kg.So that by selling the mixture at Rs. 68.20 a kg, He may gain 10%?
| A) 3:2 | B) 3:4 |
| C) 3:5 | D) 4:5 |
Answer & Explanation
Q.5:
How many kg of Sugar at 50 P per kg must a man mix with 25 kg of sugar at 34P per kg so that by selling the mixture at 44P per kg he gains 10% on the outlay?
| A) 10 kg | B) 15 kg |
| C) 20 kg | D) 18 kg |
Answer & Explanation
Q.6:
How much sugar at Rs. 9.5 a kg should be added to 17 kg of tea at Rs. 20 a kg so that the mixture be worth Rs. 13 a kg.?
| A) 11 kg | B) 17 kg |
| C) 21 kg | D) 34 kg |
Answer & Explanation
Q.7:
How many kg of custard powder costing Rs. 42 per kg must be mixed with 16 kg of custard powder costing Rs. 60 per kg so that 20 % may be gained by selling the mixture at Rs. 60 per kg?
| A) 11 kg | B) 14 kg |
| C) 12 kg | D) 20 kg |
Answer & Explanation
Q.8:
How much chicory at Rs. 5 a kg should be added to 20 kg of coffee at Rs. 12 a kg so that the mixture be worth Rs. 7.50 a kg.?
| A) 21 kg | B) 15 kg |
| C) 36 kg | D) 42 kg |
Answer & Explanation
Q.9:
Cost of two types of pulses is Rs.15 and Rs, 20 per kg, respectively. If both the pulses are mixed together in the ratio 2:3, then what should be the price of mixed variety of pulses per kg?
| A) Rs. 22 per kg | B) Rs. 30 per kg |
| C) Rs. 10 per kg | D) Rs. 18 per kg |
Answer & Explanation
Q.10:
A dealer has 1000 kg sugar and he sells a part of it at 8% profit and the rest of it at 18% profit. The overall profit he earns is 14%. What is the quantity which is sold at 18% profit?
| A) 250 kg | B) 600 kg |
| C) 620 kg | D) 400 kg |
Answer & Explanation
Q.11:
A mixture of 150 liters of wine and water contains 20% water. How much more water should be added so that water becomes 25% of the new mixture?
| A) 7 liters | B) 15 liters |
| C) 10 liters | D) 9 liters |
Answer & Explanation
Q.12:
How many liters of oil at Rs.40 per liter should be mixed with 240 liters of a second variety of oil at Rs.60 per liter so as to get a mixture whose cost is Rs.52 per liter?
| A) 120 liters | B) 180 liters |
| C) 110 liters | D) 160 liters |
Answer & Explanation
Q.13:
In a can, there is a mixture of milk and water in the ratio 4 : 5. If it is filled with an additional 8 litres of milk the can would be full and ratio of milk and water would become 6 : 5. Find the capacity of the can?
| A) 40 | B) 44 |
| C) 48 | D) 52 |
Answer & Explanation
Q.14:
A container contains 40 litres of milk. From this container 4 litres of milk was taken out and replaced by water. This process was repeated further two times. How much milk is now contained by the container?
| A) 26.34 Litre | B) 27.36 Litre |
| C) 28 Litre | D) 29.16 Litre |
Answer & Explanation
Q.15:
A mixture of 70 litres of milk and water contains 10% water. How many litres of water should be added to the mixture so that the mixture contains 12 1/2% water?
| A) 2 | B) 8 |
| C) 4 | D) 5 |
Answer & Explanation
Q.16:
Five litres of wine is removed from a cask full of wine and is replaced with water. Five litres of this mixture is then removed and replaced with water. If the ratio of wine to water in the cask is now 16 : 9, how much wine did the cask hold ?
| A) 25 litres | B) 50 litres |
| C) 100 litres | D) 150 litres |
Answer & Explanation
Q.17:
In a mixture of milk and water, there is only 26% water. After replacing the mixture with 7 liters of pure milk , the percentage of milk in the mixture become 76%. The quantity of mixture is:
| A) 65 liters | B) 91 liters |
| C) 38 liters | D) None of these |
Answer & Explanation
Q.18:
Two vessels P and Q contain 62.5% and 87.5% of alcohol respectively. If 2 litres from vessel P is mixed with 4 litres from vessel Q, the ratio of alcohol and water in the resulting mixture is?
| A) 16 : 5 | B) 14 : 5 |
| C) 16 : 7 | D) 19 : 5 |
Answer & Explanation
Q.19:
In what ratio must water be mixed with milk to gain 16 2/3 % by selling the mixture at cost price?
| A) 1:6 | B) 2:3 |
| C)4:3 | D) 6:1 |
Answer & Explanation
Q.20:
How much water must be added to a bucket which contains 40 liters of milk at the cost price of Rs.3.50 per liter so that the cost of milk reduces to Rs.2 per liter?
| A) 25 liters | B) 28 litres |
| C) 30 liters | D) 35 liters |
Answer & Explanation