-
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:
Ajay walks 24 km towards East and turns to right hand side and takes a drive of another 10 km. He then turning to his right (drives towards West) another 10 km. He then turns to his left & walks another 8 km. After that, he turns to his right & travels 14 km. How far is he from his initial point & in which direction?
| A) 20 km East | B) 18 km south |
| C) 16 km West | D) 10 km South. |
Answer & Explanation
Q.2:
Raju walks 80 ms towards south. Then, turns to his right & starts walking straight till he completes another 80 ms. Then, again turning to his left he walks for 60 metres. He then turns to his left & walks for 80 metres. How far is he from his initial position?
| A) 100 metres | B) 140 meters |
| C) 60 metres | D) 120 metres |
Answer & Explanation
Q.3:
Varun drove his car for 80 kms due North. Then he turned left and drove for 100 kms. Again he turned left & drove yet another 80 kms. Again he turned left and drove his car 120 kms. How far do you think he actually drove his car from the initial position?
| A) 20 kms | B) 100 kms |
| C) 60 kms | D) None of these |
Answer & Explanation
Q.4:
Sandeep walks 60m to the east, then he turns left and walks for 50 m, then turns right and went 70 m and then turns right again and went 50 m. How far was Sandeep from the starting point?
| A) 90 m | B) 70 m |
| C) 50 m | D) 130 m |
Answer & Explanation
Q.5:
One morning after sunrise, Amrit was standing facing a pole. The shadow of the pole was forming on the left side. Which direction was Amrit facing?
| A) East | B) West |
| C) South | D) North |
Answer & Explanation
Q.6:
One evening just before sunset two friends Sanju and Manju were talking to each other face to face. If Manjuβs shadow was exactly to her left side, which direction was Sanju facing?
| A) North | B) South |
| C) West | D) Data inadequate |
Answer & Explanation
Q.7:
In the evening, Ashmita started walking positioning his back towards the sun. After sometime, she turned left, then turned right and then towards the left again. In which direction is she going now?
| A) North | B) East |
| C) West | D) South |
Answer & Explanation
Q.8:
I drove 50 km towards east from a city βSβ and then turned right and drove another 30 km. Now I turned to my left & drove another 30 km. Finally I turned my right & drove 30 km to reach a city βFβ. Find the shortest straight distance between cities S and F.
| A) 20 km | B) 100 km |
| C) 30 km | D) 40 km |
Answer & Explanation
Q.9:
Ahmedabad is to the southwest of Bangalore, Chennai is to the east of Ahmedabad and southeast of Bangalore and Delhi is to the north of Chennai in line with Ahmedabad-Bangal;ore. In which direction of Bangalore is Delhi located ?
| A) South | B) Southwest |
| C) North | D) Northeast |
Answer & Explanation
Q.10:
Ajay drives 3 kilometres North. Then he turns right and drives 4 kilo metres. Now he turns right and drives 5 kilometres. Now turning left, he drives 2 kilometres. Again, he turns left and moves 2 kilometres. Finally turning left he again walks 2 kilometres. In which direction & how far is he from his starting position?
| A) 1.5 kilometres East | B) 4 kilometres East |
| C) 1.5 kilometres West | D) 4.5 metres West |
Answer & Explanation
Direction [ Practice Problem ]
Prev
Direction [ Notes ]