-
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 ] - Simple and Compound Interest
-
Section A [ Quantitative ] - Decimal and Fractions
-
Section A [ Quantitative ] - Perimeter, Area, Volume
-
Section A [ Quantitative ] - Simplification and Approximation
-
Section A [ Quantitative ] - Probability
-
Section A [ Quantitative ] - Calander
-
Section A [ Quantitative ] - Clock Problems
-
Section A [ Quantitative ] - Boats and Streams
-
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 ] - Time, Speed and Distance
-
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 ] - 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 ] - 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 ] - 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 ] - Odd man out and series
-
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 #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 - [ 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 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 - [ 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 - [ 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 ]
- Divide & Conquer With Example
- DP Approaches -1
- DP Approaches -2
- Asymptotic Notations
- Time Complexity and Big O
- Space Complexity
- 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 Stack [ Stacks ]
- Operations Of Stack ADT [ Stacks ]
- Operations Of Queue ADT [ Queues ]
- Stack Implementation Using Array Part – 1 [ Stacks ]
- 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
- Stack Linked List #2
- 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 ]
- Recursion – Winding & Unwinding [Recursion and Storage Management]
- Introduction to Buddy System [Recursion and Storage Management]
- Problems on Buddy System [Recursion and Storage Management]
- Binary Search [Recursion and Storage Management]
- Linear Search [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
- Data Structures & Algorithms
- Practice Problems Set 1 – Data Structures & Algo
- Practice Problems Set 2 – Data Structures & Algo
-
Section B - [ AI Notes ]
-
Section B - [ Big Data Notes ]
-
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 ]
-
Section C - [ Microprocessor ] 8086 (Module 1)
-
Section C - [ Microprocessor ] 8086 (Module 2)
- 8086 Addressing modes [8086]
- Data Transfer Instruction
- XLAT Translation
- DAA and AAA Instruction
- Push and POP Instruction
- String Instruction
- Logical Operation
- Arithmetic instructions
- 8086 Rotate instructions [8086]
- 8086 Branch instructions [8086]
- Programmer Model
- Basics of Programming- Addition of 2 Numbers
- ALP for Exchange Content of Two Memory Block
- Reverse a String- ALP Program
- Find a Character in the Given String
- ALP to Sort a Array of 10 in Ascending Order
- Previous Year ALP All Codes Solution Notes
-
Section C - [ Microprocessor ] 8086 (Module 3)
-
Section C - [ Microprocessor ] Notes
-
Quiz
-
Previous Year Leak Papers
-
CCAT Previous Year Leak Paper Solution
This content is protected, please login and enroll course to view this content!
Next
Analogy – 2