Curriculum
- 55 Sections
- 561 Lessons
- 24 Weeks
Expand all sectionsCollapse all sections
- About the Course/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment{ display: none !important; } .thim-course-landing-button { display: none !important; }
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 Company0 - Section A [ Quantitative ] - Profit and Loss6
- Section A [ Quantitative ] - Average4
- Section A [ Quantitative ] - Arithmetic Progression and Geometric Progression5
- Section A [ Quantitative ] - Ages Problems6
- Section A [ Quantitative ] - Alligations and Mixtures5
- Section A [ Quantitative ] - Boats and Streams5
- Section A [ Quantitative ] - Chain rule4
- Section A [ Quantitative ] - HCF and LCM6
- Section A [ Quantitative ] - Number System10
- 10.1Number System Part #113 Minutes
- 10.2Number System Part #212 Minutes
- 10.3Number System Part #37 Minutes
- 10.4Number System Part #410 Minutes
- 10.5Number System Part #510 Minutes
- 10.6Number System Part #610 Minutes
- 10.7Number System Part #77 Minutes
- 10.8Number System Part #87 Minutes
- 10.9Number System Part #99 Minutes
- 10.10Number System Part #109 Minutes
- Section A [ Quantitative ] - Percentage Problem8
- Section A [ Quantitative ] - Permutation and Combination6
- Section A [ Quantitative ] - Pipes and Cistern5
- Section A [ Quantitative ] - Probability4
- Section A [ Quantitative ] - Ratio and Proportion7
- Section A [ Quantitative ] - Simple and Compound Interest8
- 16.1Simple and Compound Interest Part #19 Minutes
- 16.2Simple and Compound Interest Part #213 Minutes
- 16.3Simple and Compound Interest Part #38 Minutes
- 16.4Simple and Compound Interest Part #414 Minutes
- 16.5Fastest Method to Solve Compound Interest7 Minutes
- 16.6Simple Interest and compound [Formula] —
- 16.7Simple and Compound Interest [Notes]
- 16.8Simple and Compound Interest [Practice Problems]
- Section A [ Quantitative ] - Time and Work6
- Section A [ Quantitative ] - Train Problems6
- Section A [ Verbal ] - Roots words2
- Section A [ Verbal ] - Reading Comprehension4
- Section A [ Verbal ] - Subject Verb Agreement2
- Section A [ Verbal ] - Synonyms And Antonyms4
- Section A [ Verbal ] - Sentence Corrections2
- Section A [ Verbal ] - Fill in the Blanks4
- Section A [ Verbal ] - Paragraph1
- Section A [ Verbal ] - Error Identification1
- Section A [ Verbal ] - Sentence Rearrangement2
- Section A [ Verbal ] - Sentence Completion1
- Section A [ Verbal ] - Ability Extra9
- 29.1Introduction to Verbal Ability + Tenses Part #112 Minutes
- 29.2Tenses Part #111 Minutes
- 29.3Tenses [ Notes + Solved Examples + Practice Problem ]
- 29.4Error Detection and Correction + Sentence Completion #114 Minutes
- 29.5Sentence Completion Part #213 Minutes
- 29.6Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- 29.7Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- 29.8Assumption in Verbal Reasoning14 Minutes
- 29.9Deduction in Verbal Reasoning26 Minutes
- Section A [ Reasoning ] - Blood Relation6
- Section A [ Reasoning ] - Calender4
- Section A [ Reasoning ] - Coding Decoding7
- Section A [ Reasoning ] - Data Sufficiency3
- Section A [ Reasoning ] - Clock Problems6
- Section A [ Reasoning ] - Direction8
- Section A [ Reasoning ] - Number Series6
- Section A [ Reasoning ] - Seating Arrangement8
- 37.1Seating Arrangement Part #18 Minutes
- 37.2Seating Arrangement Part #212 Minutes
- 37.3Seating Arrangement Part #311 Minutes
- 37.4Seating Arrangement Part #46 Minutes
- 37.5Seating Arrangement Part #57 Minutes
- 37.6Seating Arrangement Part #66 Minutes
- 37.7Seating Arrangement [Notes]
- 37.8Seating Arrangement [ Practice Problem ]
- Section A [ Reasoning ] - Visual Reasoning6
- Section A - Computer Fundamental12
- 39.11. Introduction10 Minutes
- 39.22. Computer Memory and its types14 Minutes
- 39.33. Motherboard and its component8 Minutes
- 39.44. Ports, Cables and Graphic Card9 Minutes
- 39.55. Storage Devices7 Minutes
- 39.66. Number System11 Minutes
- 39.77. Machine Language6 Minutes
- 39.88. Operating Systems10 Minutes
- 39.99. AR and VR7 Minutes
- 39.1010. Computer Virus8 Minutes
- 39.11Computer Fundamental [Notes]
- 39.12Computer Fundamental Practice Problem
- Section B - [ C Programming ]32
- 40.1C Programming Part #110 Minutes
- 40.2C Programming Part #212 Minutes
- 40.3C Programming Part #316 Minutes
- 40.4C Programming Part #421 Minutes
- 40.5C Programming Part #523 Minutes
- 40.6C Programming Part #615 Minutes
- 40.7C Programming Part #715 Minutes
- 40.8C Programming Part #814 Minutes
- 40.9C Programming Part #915 Minutes
- 40.10C Programming Part #1016 Minutes
- 40.11C Programming Part #1112 Minutes
- 40.12C Programming Part #1212 Minutes
- 40.13C Programming Part #1515 Minutes
- 40.14C Programming Part #1413 Minutes
- 40.15C Programming Part #1319 Minutes
- 40.16C Programming Part #1612 Minutes
- 40.17C Programming Part #1713 Minutes
- 40.18C Programming Part #1811 Minutes
- 40.19C Programming Part #1916 Minutes
- 40.20C Programming Part #2013 Minutes
- 40.21C Programming Part #2123 Minutes
- 40.22C Programming Part #2215 Minutes
- 40.23C Programming Part #2314 Minutes
- 40.24C Programming Part #2417 Minutes
- 40.25C Programming Part #2511 Minutes
- 40.26C Programming Part #2613 Minutes
- 40.27C Programming Part #2714 Minutes
- 40.28C Programming Part #2810 Minutes
- 40.29C Programming Part #2910 Minutes
- 40.30C Programming Part #3011 Minutes
- 40.31C Programming [Notes]
- 40.32C Programming Practice Problem
- Section B - [ C Snippet Problems with Solutions Video]10
- 41.1Code Snippet 1 – 521 Minutes
- 41.2Code Snippet 6 -1020 Minutes
- 41.3Code Snippet 11 – 1519 Minutes
- 41.4Code Snippet 16 – 2015 Minutes
- 41.5Code Snippet 21 – 2523 Minutes
- 41.6Code Snippet 26 – 3018 Minutes
- 41.7Code Snippet 31 – 3525 Minutes
- 41.8Code Snippet 36 – 4025 Minutes
- 41.9Code Snippet 41 – 4513 Minutes
- 41.10Code Snippet 46 – 5018 Minutes
- Section B - [ Object Oriented Programming (C++) ]27
- 42.1Object Oriented Programming (C++) Sample
- 42.2Object Oriented Programming (C++)
- 42.3Object Oriented Programming (C++) Practice Problem
- 42.4Introduction to C++11 Minutes
- 42.5Input & Output in C++14 Minutes
- 42.6Difference between Structure in C & C++14 Minutes
- 42.7Class & Objects C++14 Minutes
- 42.8Inspector, Mutators, Facilitators16 Minutes
- 42.9Contructor & Destructor15 Minutes
- 42.10Default Arguments & Inline Function16 Minutes
- 42.11Array of Objects16 Minutes
- 42.12Dynamic Memory Allocation15 Minutes
- 42.13Static Member and function15 Minutes
- 42.14Exception handling18 Minutes
- 42.15Composition22 Minutes
- 42.16Friend Class and function13 Minutes
- 42.17Function Overloading15 Minutes
- 42.18Operator Overloading13 Minutes
- 42.19Copy Constructor5 Minutes
- 42.20Inheritance15 Minutes
- 42.21Pure Virtual Function13 Minutes
- 42.22Types of Inheritance26 Minutes
- 42.23Virtual Function12 Minutes
- 42.24Template15 Minutes
- 42.25RTTI11 Minutes
- 42.26Casting Operators19 Minutes
- 42.27Dynamic Array of Object13 Minutes
- Section B - [ Operating System ]52
- 43.1Introduction to Operating System [ Operating System Overview ]9 Minutes
- 43.2Monolithic and Micro Kernel Architecture [ Operating System Overview ]6 Minutes
- 43.3User Space and Kernel Space [ Operating System Overview ]6 Minutes
- 43.4PCB (Process Control Block) [ Process And Process Scheduling ]6 Minutes
- 43.5Process State Transition Diagram [ Process And Process Scheduling ]11 Minutes
- 43.6FCFS ( First come first serve ) [ Process And Process Scheduling]8 Minutes
- 43.7SJF Preemptive with solved example [ Process And Process Scheduling ]9 Minutes
- 43.8SJF (non preemptive ) with solved [ Process And Process Scheduling ]5 Minutes
- 43.9Preemptive Priority Process Scheduling [ Process And Process Scheduling ]8 Minutes
- 43.10ROUND ROBIN SCHEDULING ALGORITHM with solved example [ Process And Process Scheduling ]12 Minutes
- 43.11Producer Consumer Problem [ Process Synchronization and Deadlock ]8 Minutes
- 43.12Critical Section Problem [ Process Synchronization and Deadlock ]7 Minutes
- 43.13Dead Lock with Necessary and Sufficient Condition for Deadlock [ Process Synchronization and Deadlock ]4 Minutes
- 43.14Bankers algorithm with solve example part 1 [ Process Synchronization and Deadlock ]13 Minutes
- 43.15Bankers (Resource Request algorithm) with solve example part 2 [ Process Synchronization and Deadlock ]9 Minutes
- 43.16Dead Lock Recovery [ Process Synchronization and Deadlock ]5 Minutes
- 43.17Dining philosopher Problem [ Process Synchronization and Deadlock ]8 Minutes
- 43.18Introduction to Memory in Operating system [ Memory Management ]8 Minutes
- 43.19Memory management Part #1 [ Memory Management ]7 Minutes
- 43.20Memory management Part #2 [ Memory Management ]5 Minutes
- 43.21Memory management Part #3 [ Memory Management ]8 Minutes
- 43.22Loading and Linking [ Memory Management ]4 Minutes
- 43.23FIFO, LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS [ Memory Management ]20 Minutes
- 43.24Disk scheduling Algorithm [ Input / Output Management ]6 Minutes
- 43.25FCFS Disk Scheduling Algorithm [ Input / Output Management ]13 Minutes
- 43.26SSTF Disk Scheduling Algorithm [ Input / Output Management ]7 Minutes
- 43.27SCAN Disk Scheduling Algorithm [ Input / Output Management ]6 Minutes
- 43.28CSCAN Disk Scheduling Algorithm [ Input / Output Management ]5 Minutes
- 43.29Look Disk Scheduling Algorithm [ Input / Output Management ]4 Minutes
- 43.30CLook Disk Scheduling Algorithm [ Input / Output Management ]4 Minutes
- 43.31FCFS SSTF SCAN CSCAN LOOK CLOOK Overview [ Input / Output Management ]8 Minutes
- 43.32Connection Oriented vs Connection-Less [ OSI Layers ]8 Minutes
- 43.33OSI Reference model [ OSI Layers ]6 Minutes
- 43.34TCP-IP Reference model [ OSI Layers ]6 Minutes
- 43.35OSI vs TCP-IP model comparision [ OSI Layers ]7 Minutes
- 43.36IP address vs Mac address [ IP Addressing ]8 Minutes
- 43.37IPv4 vs IPv6 Comparison [ IP Addressing ]9 Minutes
- 43.38IPv4 header format [ IP Addressing ]12 Minutes
- 43.39Routing Algorithms Part #1 [ IP Addressing ]11 Minutes
- 43.40Routing Algorithms Part #2 [ IP Addressing ]9 Minutes
- 43.41ARP And RARP [ IP Addressing ]7 Minutes
- 43.42Leaky Bucket Algorithm [ IP Addressing ]5 Minutes
- 43.43Token Bucket Algorithm [ IP Addressing ]4 Minutes
- 43.44Domain Name System (DNA) [ Common TCP/IP Stack Protocols ]6 Minutes
- 43.45Hypertext Transfer Protocol – HTTP [ Common TCP/IP Stack Protocols ]8 Minutes
- 43.46Simple Mail Transfer Protocol – SMTP [ Common TCP/IP Stack Protocols ]5 Minutes
- 43.47File Transfer Protocol – FTP [ Common TCP/IP Stack Protocols ]5 Minutes
- 43.48Operating System Sample [Notes]–
- 43.49Operating System [Notes]
- 43.50Operating System Practice Problem
- 43.51Computer Network [Notes]
- 43.52Computer Network Practice Problem
- Section B - [ Basics of Big Data and Artificial Intelligence ]20
- 44.1Agent and Peas Description [ Artificial Intelligence ]8 Minutes
- 44.2Introduction to Fuzzy Logic [ Artificial Intelligence ]4 Minutes
- 44.3Types of Agent [ Artificial Intelligence ]8 Minutes
- 44.4Learning Agent [ Artificial Intelligence ]8 Minutes
- 44.5Introduction to Machine Learning [ Artificial Intelligence ]12 Minutes
- 44.6Types of Machine Learning [ Artificial Intelligence ]5 Minutes
- 44.7Introduction to Neural Network [ Artificial Intelligence ]6 Minutes
- 44.8Genetic Algorithm [ Artificial Intelligence ]5 Minutes
- 44.9Introduction to Big Data [ Big Data ]6 Minutes
- 44.10Hadoop Part 1 [ Big Data ]10 Minutes
- 44.11Hadoop Part 2 [ Big Data ]10 Minutes
- 44.12Map Reduce [ Big Data ]11 Minutes
- 44.13Introduction to No SQL [ Big Data ]8 Minutes
- 44.14Introduction to Datawarehouse [ Big Data ]10 Minutes
- 44.15Meta Data [ Big Data ]4 Minutes
- 44.16Data mart [ Big Data ]6 Minutes
- 44.17Architecture of Data Warehouse [ Big Data ]7 Minutes
- 44.18What is Olap Operation [ Big Data ]8 Minutes
- 44.19OLAP vs OLTP [ Big Data ]7 Minutes
- 44.20ETL – Extract Transform and Load [ Big Data ]8 Minutes
- Section B - [ AI Notes ]2
- Section B - [ Big Data Notes ]5
- Section B - [ Data Structures ]Yet To Update88
- 47.1Introduction [ Introduction ]8 Minutes
- 47.2Types Of Data Structures [ Introduction ]6 Minutes
- 47.3Operations Of Data Structures [ Introduction ]6 Minutes
- 47.4Concept Of Abstract Data Type [ Introduction ]6 Minutes
- 47.5Arrays – Part 1 [ Introduction ]16 Minutes
- 47.6Arrays – Part 2 [ Introduction ]19 Minutes
- 47.7Introduction To Stack [ Stacks ]
- 47.8Operations Of Stack ADT [ Stacks ]6 Minutes
- 47.9Stack Implementation Using Array Part – 1 [ Stacks ]10 Minutes
- 47.10Stack Implementation Using Array Part – 2 [ Stacks ]12 Minutes
- 47.11Operations Of Queue ADT [ Queues ]4 Minutes
- 47.12Introduction Of Queue [ Queues ]4 Minutes
- 47.13Queue Implementation Using Array Part – 1 [ Queues ]11 Minutes
- 47.14Queue Implementation Using Array Part – 2 [ Queues ]9 Minutes
- 47.15Circular Queue Implementation Part – 1 [ Queues ]12 Minutes
- 47.16Circular Queue Implementation Part – 2 [ Queues ]9 Minutes
- 47.17Introduction To Linked List [ Linked Lists ]5 Minutes
- 47.18Array Vs Linked List [ Linked Lists ]7 Minutes
- 47.19Linked List Implementation Part – 1 [ Linked Lists ]17 Minutes
- 47.20Linked List Implementation Part – 2 [ Linked Lists ]10 Minutes
- 47.21Linked List Implementation Part – 3 [ Linked Lists ]10 Minutes
- 47.22Linked List Implementation Part – 4 [ Linked Lists ]14 Minutes
- 47.23Linked List Implementation Part – 5 [ Linked Lists ]9 Minutes
- 47.24Linked List Implementation Part – 6 [ Linked Lists ]10 Minutes
- 47.25Stack Implementation Using Linked List – Part 1 [ Linked Lists ]9 Minutes
- 47.26Stack Implementation Using Linked List – Part 2 [ Linked Lists ]6 Minutes
- 47.27Queue Using Linked List Part – 1 [ Linked Lists ]10 Minutes
- 47.28Queue Using Linked List Part – 2 [ Linked Lists ]7 Minutes
- 47.29Circular Queue Using Linked List [ Linked Lists ]10 Minutes
- 47.30Doubly Linked List – Part 1 [ Linked Lists ]14 Minutes
- 47.31Doubly Linked List – Part 2 [ Linked Lists ]8 Minutes
- 47.32Doubly Linked List – Part 3 [ Linked Lists ]10 Minutes
- 47.33Doubly Linked List – Part 4 [ Linked Lists ]10 Minutes
- 47.34Doubly Linked List – Part 5 [ Linked Lists ]12 Minutes
- 47.35Introduction to Tree Data Structure & Binary Tree [ Trees ]6 Minutes
- 47.36Binary Tree Implementation Part 1 – Insertion & Traversing [ Trees ]14 Minutes
- 47.37Binary Tree Implementation Part 2 – Traversing & Deletion [ Trees ]12 Minutes
- 47.38Binary tree Traversal [ Trees ]14 Minutes
- 47.39Tree traversal methods: Pre, post and in-order traversal [ Trees ]14 Minutes
- 47.40(Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Trees ]11 Minutes
- 47.41Height Balaced Binary Search Tree [ Trees ]12 Minutes
- 47.42AVL Tree [ Trees ]16 Minutes
- 47.43AVL Tree Solved Example – #1 [ Trees ]17 Minutes
- 47.44AVL Tree Solved Example – #2 [ Trees ]17 Minutes
- 47.45B-Tree Introduction [ Trees ]13 Minutes
- 47.46B-Tree Solved Example – #1 [ Trees ]14 Minutes
- 47.47B-Tree Solved Example – #2 [ Trees ]12 Minutes
- 47.48Huffman Coding [ Trees ]7 Minutes
- 47.49Graphs Introduction [ Graphs ]13 Minutes
- 47.50BFS & DFS – #1 [ Graphs ]14 Minutes
- 47.51BFS & DFS – #2 [ Graphs ]12 Minutes
- 47.52Topological Sorting [ Graphs ]11 Minutes
- 47.53Topological Sorting – Solved Example [ Graphs ]9 Minutes
- 47.54Binary Search [ Recursion and Storage Management ]11 Minutes
- 47.55Recursion – Winding & Unwinding [ Recursion and Storage Management ]12 Minutes
- 47.56Linear Search [ Recursion and Storage Management ]5 Minutes
- 47.57Introduction to Buddy System [ Recursion and Storage Management ]10 Minutes
- 47.58Problems on Buddy System [ Recursion and Storage Management ]8 Minutes
- 47.59Hashing Collision [ Searching & Sorting ]12 Minutes
- 47.60Hashing concept [ Searching & Sorting ]6 Minutes
- 47.61Linear Probing – #1 [ Searching & Sorting ]13 Minutes
- 47.62Linear Probing – #2 [ Searching & Sorting ]12 Minutes
- 47.63Linear Probing With Collisions – Solved [ Searching & Sorting ]10 Minutes
- 47.64Linear + Quadratic Probing – Solved Example [ Searching & Sorting ]15 Minutes
- 47.65Searching & Sorting Introduction [ Searching & Sorting ]12 Minutes
- 47.66Selection Sorting – #1 [ Searching & Sorting ]12 Minutes
- 47.67Selection Sorting – #2 [ Searching & Sorting ]12 Minutes
- 47.68Insertion Sort – #1 [ Searching & Sorting ]12 Minutes
- 47.69Insertion Sort – #2 [ Searching & Sorting ]12 Minutes
- 47.70Merge Sort – #1 [ Searching & Sorting ]12 Minutes
- 47.71Merge Sort – #2 [ Searching & Sorting ]12 Minutes
- 47.72Merge Sort – #3 [ Searching & Sorting ]10 Minutes
- 47.73Quick Sort – #1 [ Searching & Sorting ]10 Minutes
- 47.74Quick Sort – #2 [ Searching & Sorting ]9 Minutes
- 47.75Radix Sort – #1 [ Searching & Sorting ]10 Minutes
- 47.76Radix Sort – #2 [ Searching & Sorting ]10 Minutes
- 47.77Heap Data Structure [ Applications of Data Structures ]11 Minutes
- 47.78Min & Max Heap [ Applications of Data Structures ]12 Minutes
- 47.79Infix Notation & Conversion [ Applications of Data Structures ]11 Minutes
- 47.80Prim’s & Kruskal’s #1 [ Applications of Data Structures ]19 Minutes
- 47.81Prim’s & Kruskal’s #2 [ Applications of Data Structures ]10 Minutes
- 47.82Prefix, Postfix Notation & Conversion [ Applications of Data Structures ]12 Minutes
- 47.83Stack, Queue & Linked List [ Importance Solutions ]
- 47.84Trees [ Importance Solutions ]
- 47.85Graphs [ Importance Solutions ]
- 47.86Recursion & Storage Management [ Importance Solutions ]
- 47.87Searching & Sorting [ Importance Solutions ]
- 47.88Application Of Data Structures [ Importance Solutions ]
- Section B - [ AI Notes for CCAT Exam ]5
- Section B - [ Big Data Notes for CCAT Exam ]1
- Section C - [ Digital Electronics ]22
- 50.11 – Number System Intro11 Minutes
- 50.22 – Binary Number System11 Minutes
- 50.33 – Octal Number System9 Minutes
- 50.44 – Hexadecimal Number System7 Minutes
- 50.55 – POS and SOP13 Minutes
- 50.66 – K-Map 117 Minutes
- 50.77 – K-Map 210 Minutes
- 50.88 – Logic Gates – 112 Minutes
- 50.99 – Logic Gates – 212 Minutes
- 50.1010 – Universal Gates13 Minutes
- 50.1111. Arithmetic Operations in Binary8 Minutes
- 50.1212 – Arithmetic Operations using 1_s and 2_s compliment13 Minutes
- 50.1313 – Arithmetic Operations using 9s and 10s10 Minutes
- 50.1414 – Excess – 35 Minutes
- 50.1515 – Gray Code7 Minutes
- 50.1616 – Half and Full Adder13 Minutes
- 50.1717 – Multiplexer and Demultiplexer6 Minutes
- 50.1818 – SR Flip Flop7 Minutes
- 50.1919 – JK Flip Flop5 Minutes
- 50.2020 – D and T Flip Flop6 Minutes
- 50.21Digital Electronics [Notes]
- 50.22Digital Electronics Practice Problem
- Section C - [ Computer Architecture ]49
- 51.101 – Introduction9 Minutes
- 51.202 – Von Neumann Architecture13 Minutes
- 51.303 – Binary Numeric Data Representation7 Minutes
- 51.404 – IEEE-754 Floating Point Number Representation17 Minutes
- 51.505 – Booth’s Algorithm – Part 115 Minutes
- 51.606 – Booth’s Algorithm – Part 210 Minutes
- 51.707 – Booth’s Algorithm – Part 38 Minutes
- 51.808 – Restoring Division – Part 118 Minutes
- 51.909 – Restoring Division – Part 210 Minutes
- 51.1010 – Non-Restoring Division – Part 112 Minutes
- 51.1111 – Non-Restoring Division – Part 210 Minutes
- 51.1212 – Addressing Modes – Part 111 Minutes
- 51.1313 – Addressing Modes – Part 213 Minutes
- 51.1414 – Instruction Cycles & Interrupts Mechanism7 Minutes
- 51.1515 – Hardwired Control Unit8 Minutes
- 51.1616 – Microprogrammed Control Unit8 Minutes
- 51.1717 – Hardwired vs Microprogrammed10 Minutes
- 51.1818 – Wilkie’s Control10 Minutes
- 51.1919 – RISC Microprocessor12 Minutes
- 51.2020 – CISC Microprocessor9 Minutes
- 51.2121 – Memory And It’s Characteristics9 Minutes
- 51.2222 – DRAM7 Minutes
- 51.2323 – SRAM8 Minutes
- 51.2424 – Memory Hierarchy And Locality Of Reference13 Minutes
- 51.2525 – Cache Memory7 Minutes
- 51.2626 – Cache Coherence11 Minutes
- 51.2727 – Cache Coherence Strategies9 Minutes
- 51.2828 – MESI Protocol11 Minutes
- 51.2929 – Interleaved Memory10 Minutes
- 51.3030 – Virtual Memory & Paging Concept10 Minutes
- 51.3131 – Demand Paging11 Minutes
- 51.3232 – Memory Segmentation10 Minutes
- 51.3333 – IO Module, Functions, Requirement & Types11 Minutes
- 51.3434 – Programmed IO12 Minutes
- 51.3535 – Interrupt Driven IO11 Minutes
- 51.3636 – DMA Driven IO13 Minutes
- 51.3737 – Bus & Bus Arbitration11 Minutes
- 51.3838 – Daisy Chaining8 Minutes
- 51.3939 – Polling Methods7 Minutes
- 51.4040 – Bus Arbitration Independent Request4 Minutes
- 51.4141 – Parallel Processing & Applications13 Minutes
- 51.4242 – Flynn’s Classfication10 Minutes
- 51.4343 – Instruction Level Parallelism8 Minutes
- 51.4444 – Superscalar Architecture10 Minutes
- 51.4545 – VLIW10 Minutes
- 51.4646 – Superscalar vs VLIW5 Minutes
- 51.4747 – Out Of Order Execution9 Minutes
- 51.48Computer Architecture [ Notes ]
- 51.49Computer Architecture MCQ
- Section C - [ Microprocessor ]29
- 52.1Introduction to microprocessor5 Minutes
- 52.2Von Neumann Architecture13 Minutes
- 52.3RISC Microprocessor12 Minutes
- 52.4CISC Microprocessor9 Minutes
- 52.58085 Architecture [8085]7 Minutes
- 52.68085 Arithmetic instructions [8085]24 Minutes
- 52.78085 logical instructions [8085]10 Minutes
- 52.88085 Data Transfer Instruction [8085]22 Minutes
- 52.98085 Register [8085]17 Minutes
- 52.108085 Rotate Instructions [8085]10 Minutes
- 52.11PIN Diagram of 8085 [8085]10 Minutes
- 52.12Push and POP instruction [8085]4 Minutes
- 52.138086 Addressing modes [8086]13 Minutes
- 52.148086 FLAG REGISTER [8086]17 Minutes
- 52.158086 Rotate instructions [8086]12 Minutes
- 52.168086 Branch instructions [8086]17 Minutes
- 52.178086 interrupts [8086]14 Minutes
- 52.188086 Maximum mode configuration [8086]10 Minutes
- 52.198086 Memory banking [8086]10 Minutes
- 52.208086 Memory segmentation [8086]7 Minutes
- 52.218086 Minimum mode configuration [8086]12 Minutes
- 52.22Architecture of 8086 [8086]14 Minutes
- 52.238259 Programmable Interrupt Controller [8086]15 Minutes
- 52.24IO Module, Functions, Requirement & Types [8086]11 Minutes
- 52.25Programmed IO [8086]12 Minutes
- 52.26Interrupt Driven IO [8086]11 Minutes
- 52.27DMA Driven IO [8086]13 Minutes
- 52.28Microprocessor [ Notes ]
- 52.29Microprocessor Practice Problem
- Quiz6
- Previous Year Leak Papers6
- CCAT Previous Year Leak Paper Solution8

TENSES
Tense can be defined as a word form used to indicate the time of occurrence of an
incident with reference to the moment of speaking. It indicates the completion or
continuance of an activity.
Types of Tenses
● Past
● present
● Future
These tenses can further be categorized into 4 types:
● Simple Tense
● Continuous Tense
● Perfect Tense
● Perfect Continuous Tense
Past Tense Rules
Past tense is used to describe a past activity or action. It is a form of the verb that defines the
events that have already occurred. Examples
● Reema attended the wedding functions.
● He left before I reached.
● Priya wrote a letter to her friends from camp.
Present Tense Rules
The present tense is used to describe the current or present being, situation, or event. It is a
form of the verb that defines the events that are currently happening. Examples
● I am going to the office
● She has been part of this group for 4 years now.
● The concert is amazing.

Future Tense Rules
The future tense is used to describe the future events that haven’t occurred but possibly will
occur in the future. It is a form of the verb that will occur in the future & not exist currently.
Examples
● She will be dancing to classical music.
● We will be shifting to the house upstate tomorrow morning.
● The train will leave in 10 minutes.
Tenses
Tenses Rule
Past simple tense
Subject + V2 + Object
Past Perfect tense
Subject + had + V3 + Object

Past Continuous tense
Subject + was + V1 + ing +
Object (Singular)
Subject + were + V1 + ing +
Object (Plural)
Past perfect continuous
Subject + had been + V1 +
tense
ing + Object
Present Simple tense
Subject + V1 + s/es + Object
(Singular) Subject +
V1 + Object (Plural)
Present Perfect tense
Subject + has + V3 + Object
(Singular) Subject +
have + V3 + Object
(Plural)
Present Continuous tense
Subject + is/am/are + V1 +
ing + object
Present perfect continuous
Subject + has been + V1 +
tense
ing + Object
(Singular)Subject +
have been + V1 + ing +
Object (Plural)
Future Simple tense
Subject + will/shall + V1 +
Object
Future Perfect tense
Subject + will have/shall
have + V3 + Object
Future Continuous tense
Subject + will be/shall be +
ing + V1 + Object
Future Perfect Continuous
Subject + will have been +
tense
V1 + ing + Object
V1 = first form of the verb
V2 = second form of the verb
V3 = third form of the verb

Solved Examples
1) Air pollution caused by industrial effluents has been studied (A)/ for years, but only
recently has (B)/ the harmful effects of noise pollution become known.(C)/No error(D)
Correct Answer: B
Explanation: use have instead of has as harmful effects of noise pollution is plural.
2) The ministry was considered several proposals (A)/ for the development of small
and medium enterprises (B)/during Budget discussions.(C)/No error (D)
Correct Answer: A
Explanation: Use simple past tense. (The ministry considered several proposals)
3) Having work(A)/ in both public and private sector banks(B)/she is the most suitable
person to take over the post of the chairman.(C)/No error(D)
Correct Answer: A
Explanation: Replace work by worked as the sentence is of past tense.
4) Rohit started a very small business two years ago (A)/ but it grew very fast (B)/as
the country is experiencing a boom at that time.(C)/No error(D)
Correct Answer: C
Explanation: The sentence is in the past tense, so use was experiencing.
5) Keeping in mind the current market conditions (A)/ it has better for us (B)/ to invest
in the infrastructure structure. (C)/No error(D)
Correct Answer: B

Explanation: Replace it has better for us with ‘it is better for us’. The sentence is in
the present tense.
Practice Problems
1) Our equipment gets (A)/ damage very often in summer (B)/ because there are too
many power cuts. (C)/No error (D)
Correct Answer: B
Explanation: Use damaged instead of damage as the sentence is in passive voice. The
third form of the verb is used in passive voice.
2) Most children liked to rest in the afternoon (A)/ after they returned from school
(B)/but my son seems to have an inexhaustible source of energy. (C)/No error (D)
Correct Answer: C
Explanation: replace seems by seemed as the sentence is in the past tense.
3) The cutting down on costs (A)/was the main reason for the firm to survive (B)/even
during a very difficult period. (C)/No error (D)
Correct Answer: D
Explanation: No error
4) I will go (A)/ for the dance classes tomorrow (B)/ if I have recovered from fever.
(C)/No error. (D)
Correct Answer: C
Explanation: If I have recovered is to be replaced by if I recover. Sentences of future
beginning with if should be in simple present.
5) The principal announced (A)/ in the school assembly that the school fees (B)/ will
be hiked from the beginning of the next academic session. (C)/No error(D)
Correct Answer: C
Explanation: Replace will with would. (The sentence is in indirect speech)

6) The terrorist did not (A)/ confessed his crime even till the very end (B)/of his trail
and said that he was innocent.(C) /No error (D)
Correct Answer: B
Explanation: Replace confessed with confess. (We use the first form of the verb with
did).
7) If the industrial sector continues to grow(A)/ at the same rate for the next few
months(B)/ I think it has a high growth rate this year.(C)/No error (D)
Correct Answer: C
Explanation: Replace I think it has with it will have as it is of the future tense.
8) Results find that girls (A)/ played not only more than boys(B)/ but also performed
better in many fields.(C)/No error (D)
Correct Answer: A
Explanation: Replace find with found as the sentence is of past tense.
9) Celebrating her fifteen long years in the film industry (A)/the actor announce that he
would be doing a new show (B)/on television which would be done completely free of
cost.(C)/No error (D)
Correct Answer: B
Explanation: Replace announce with announced as the sentence is of past tense.
10) Had I known (A)/ the weather forecast earlier (B)/I would not make plans to go
out. (C)/ No error (D)
Correct Answer: C
Explanation: replace ‘would not make’ with would not have made. (for imaginary
sentences of the past tense would have and the third form of the verb
is used). It’s a conditional sentence.

11) If you to talk to him on this sensitive matter(A)/ it is probable(B)/ that he will not
listen to you at all.(C)/ No error (D)
Correct Answer: D
Explanation: No error
12) On many occasions (A)/we did helped the poor (B)/ people by way of giving them
food to eat and clothes to put on. (C)/ No error (D)
Correct Answer: B
Explanation: Omit did
13) The farewell party continued (A)/till midnight as more and more(B)/ guests join in
the fun and frolic.(C)/ No error (D)
Correct Answer: C
Explanation: replace join with joined as the sentence is of past tense.
14) The market continues to be positive (A)/ and we expected the trend (B)/ to
continue in the next quarter also. (C)/No error (D)
Correct Answer: B
Explanation: Replace expect with expect as the latter part of the sentence is of future
tense.
15) Big zamindars in the villages(A)/ who were till now paid for electricity(B)/ at
subsidized rates will soon have to pay the government at full rates.(C)/ No error(D)
Correct Answer: B
Explanation: Replace paid with paying as the sentence is of past continuous tense.