Curriculum
- 52 Sections
- 465 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 ] - Ability Extra9
- 23.1Introduction to Verbal Ability + Tenses Part #112 Minutes
- 23.2Tenses Part #111 Minutes
- 23.3Tenses [ Notes + Solved Examples + Practice Problem ]
- 23.4Error Detection and Correction + Sentence Completion #114 Minutes
- 23.5Sentence Completion Part #213 Minutes
- 23.6Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- 23.7Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- 23.8Assumption in Verbal Reasoning14 Minutes
- 23.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
- 31.1Seating Arrangement Part #18 Minutes
- 31.2Seating Arrangement Part #212 Minutes
- 31.3Seating Arrangement Part #311 Minutes
- 31.4Seating Arrangement Part #46 Minutes
- 31.5Seating Arrangement Part #57 Minutes
- 31.6Seating Arrangement Part #66 Minutes
- 31.7Seating Arrangement [Notes]
- 31.8Seating Arrangement [ Practice Problem ]
- Section A [ Reasoning ] - Visual Reasoning6
- Section A - Computer Fundamental12
- 33.11. Introduction10 Minutes
- 33.22. Computer Memory and its types14 Minutes
- 33.33. Motherboard and its component8 Minutes
- 33.44. Ports, Cables and Graphic Card9 Minutes
- 33.55. Storage Devices7 Minutes
- 33.66. Number System11 Minutes
- 33.77. Machine Language6 Minutes
- 33.88. Operating Systems10 Minutes
- 33.99. AR and VR7 Minutes
- 33.1010. Computer Virus8 Minutes
- 33.11Computer Fundamental [Notes]
- 33.12Computer Fundamental Practice Problem
- Section B - [ C Programming ]32
- 34.1C Programming Part #110 Minutes
- 34.2C Programming Part #212 Minutes
- 34.3C Programming Part #316 Minutes
- 34.4C Programming Part #421 Minutes
- 34.5C Programming Part #523 Minutes
- 34.6C Programming Part #615 Minutes
- 34.7C Programming Part #715 Minutes
- 34.8C Programming Part #814 Minutes
- 34.9C Programming Part #915 Minutes
- 34.10C Programming Part #1016 Minutes
- 34.11C Programming Part #1112 Minutes
- 34.12C Programming Part #1212 Minutes
- 34.13C Programming Part #1319 Minutes
- 34.14C Programming Part #1413 Minutes
- 34.15C Programming Part #1515 Minutes
- 34.16C Programming Part #1612 Minutes
- 34.17C Programming Part #1713 Minutes
- 34.18C Programming Part #1811 Minutes
- 34.19C Programming Part #1916 Minutes
- 34.20C Programming Part #2013 Minutes
- 34.21C Programming Part #2123 Minutes
- 34.22C Programming Part #2215 Minutes
- 34.23C Programming Part #2314 Minutes
- 34.24C Programming Part #2417 Minutes
- 34.25C Programming Part #2511 Minutes
- 34.26C Programming Part #2613 Minutes
- 34.27C Programming Part #2714 Minutes
- 34.28C Programming Part #2810 Minutes
- 34.29C Programming Part #2910 Minutes
- 34.30C Programming Part #3011 Minutes
- 34.31C Programming [Notes]
- 34.32C Programming Practice Problem
- Section B - [ C Snippet Problems with Solutions Video]10
- 35.1Code Snippet 1 – 522 Minutes
- 35.2Code Snippet 6 -1020 Minutes
- 35.3Code Snippet 11 – 1519 Minutes
- 35.4Code Snippet 16 – 2015 Minutes
- 35.5Code Snippet 21 – 2524 Minutes
- 35.6Code Snippet 26 – 3018 Minutes
- 35.7Code Snippet 31 – 3525 Minutes
- 35.8Code Snippet 36 – 4025 Minutes
- 35.9Code Snippet 41 – 4513 Minutes
- 35.10Code Snippet 46 – 5018 Minutes
- Section B - [ Object Oriented Programming (C++) ]27
- 36.1Object Oriented Programming (C++) Sample
- 36.2Object Oriented Programming (C++)
- 36.3Object Oriented Programming (C++) Practice Problem
- 36.4Introduction to C++11 Minutes
- 36.5Input & Output in C++14 Minutes
- 36.6Difference between Structure in C & C++14 Minutes
- 36.7Class & Objects C++14 Minutes
- 36.8Inspector, Mutators, Facilitators16 Minutes
- 36.9Contructor & Destructor15 Minutes
- 36.10Default Arguments & Inline Function16 Minutes
- 36.11Array of Objects16 Minutes
- 36.12Dynamic Memory Allocation15 Minutes
- 36.13Static Member and function15 Minutes
- 36.14Exception handling18 Minutes
- 36.15Composition22 Minutes
- 36.16Friend Class and function13 Minutes
- 36.17Function Overloading15 Minutes
- 36.18Operator Overloading13 Minutes
- 36.19Copy Constructor5 Minutes
- 36.20Inheritance15 Minutes
- 36.21Pure Virtual Function13 Minutes
- 36.22Types of Inheritance26 Minutes
- 36.23Virtual Function12 Minutes
- 36.24Template15 Minutes
- 36.25RTTI11 Minutes
- 36.26Casting Operators19 Minutes
- 36.27Dynamic Array of Object13 Minutes
- Section B - [ Operating System ]52
- 37.1Introduction to Operating System [ Operating System Overview ]9 Minutes
- 37.2Monolithic and Micro Kernel Architecture [ Operating System Overview ]6 Minutes
- 37.3User Space and Kernel Space [ Operating System Overview ]6 Minutes
- 37.4PCB (Process Control Block) [ Process And Process Scheduling ]6 Minutes
- 37.5Process State Transition Diagram [ Process And Process Scheduling ]11 Minutes
- 37.6FCFS ( First come first serve ) [ Process And Process Scheduling]8 Minutes
- 37.7SJF Preemptive with solved example [ Process And Process Scheduling ]9 Minutes
- 37.8SJF (non preemptive ) with solved [ Process And Process Scheduling ]5 Minutes
- 37.9Preemptive Priority Process Scheduling [ Process And Process Scheduling ]8 Minutes
- 37.10ROUND ROBIN SCHEDULING ALGORITHM with solved example [ Process And Process Scheduling ]12 Minutes
- 37.11Producer Consumer Problem [ Process Synchronization and Deadlock ]8 Minutes
- 37.12Critical Section Problem [ Process Synchronization and Deadlock ]7 Minutes
- 37.13Dead Lock with Necessary and Sufficient Condition for Deadlock [ Process Synchronization and Deadlock ]4 Minutes
- 37.14Bankers algorithm with solve example part 1 [ Process Synchronization and Deadlock ]13 Minutes
- 37.15Bankers (Resource Request algorithm) with solve example part 2 [ Process Synchronization and Deadlock ]9 Minutes
- 37.16Dead Lock Recovery [ Process Synchronization and Deadlock ]5 Minutes
- 37.17Dining philosopher Problem [ Process Synchronization and Deadlock ]8 Minutes
- 37.18Introduction to Memory in Operating system [ Memory Management ]8 Minutes
- 37.19Memory management Part #1 [ Memory Management ]7 Minutes
- 37.20Memory management Part #2 [ Memory Management ]5 Minutes
- 37.21Memory management Part #3 [ Memory Management ]8 Minutes
- 37.22Loading and Linking [ Memory Management ]4 Minutes
- 37.23FIFO, LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS [ Memory Management ]20 Minutes
- 37.24Disk scheduling Algorithm [ Input / Output Management ]6 Minutes
- 37.25FCFS Disk Scheduling Algorithm [ Input / Output Management ]13 Minutes
- 37.26SSTF Disk Scheduling Algorithm [ Input / Output Management ]7 Minutes
- 37.27SCAN Disk Scheduling Algorithm [ Input / Output Management ]6 Minutes
- 37.28CSCAN Disk Scheduling Algorithm [ Input / Output Management ]5 Minutes
- 37.29Look Disk Scheduling Algorithm [ Input / Output Management ]4 Minutes
- 37.30CLook Disk Scheduling Algorithm [ Input / Output Management ]4 Minutes
- 37.31FCFS SSTF SCAN CSCAN LOOK CLOOK Overview [ Input / Output Management ]8 Minutes
- 37.32Connection Oriented vs Connection-Less [ OSI Layers ]8 Minutes
- 37.33OSI Reference model [ OSI Layers ]6 Minutes
- 37.34TCP-IP Reference model [ OSI Layers ]6 Minutes
- 37.35OSI vs TCP-IP model comparision [ OSI Layers ]7 Minutes
- 37.36IP address vs Mac address [ IP Addressing ]8 Minutes
- 37.37IPv4 vs IPv6 Comparison [ IP Addressing ]9 Minutes
- 37.38IPv4 header format [ IP Addressing ]12 Minutes
- 37.39Routing Algorithms Part #1 [ IP Addressing ]11 Minutes
- 37.40Routing Algorithms Part #2 [ IP Addressing ]9 Minutes
- 37.41ARP And RARP [ IP Addressing ]7 Minutes
- 37.42Leaky Bucket Algorithm [ IP Addressing ]5 Minutes
- 37.43Token Bucket Algorithm [ IP Addressing ]4 Minutes
- 37.44Domain Name System (DNA) [ Common TCP/IP Stack Protocols ]6 Minutes
- 37.45Hypertext Transfer Protocol – HTTP [ Common TCP/IP Stack Protocols ]8 Minutes
- 37.46Simple Mail Transfer Protocol – SMTP [ Common TCP/IP Stack Protocols ]5 Minutes
- 37.47File Transfer Protocol – FTP [ Common TCP/IP Stack Protocols ]5 Minutes
- 37.48Operating System Sample [Notes]
- 37.49Operating System [Notes]
- 37.50Operating System Practice Problem
- 37.51Computer Network [Notes]
- 37.52Computer Network Practice Problem
- Section B - [ Data Structures ]92
- 38.101 – Introducton [DSA Introduction]8 Minutes
- 38.202 – Types Of Data Structures [DSA Introduction]6 Minutes
- 38.303 – Operations Of Data Structures [DSA Introduction]6 Minutes
- 38.404 – Concept Of Abstract Data Type [DSA Introduction]6 Minutes
- 38.505 – Arrays – Part 1 [DSA Introduction]16 Minutes
- 38.606 – Arrays – Part 2 [DSA Introduction]19 Minutes
- 38.707 – Introduction To Stack [Stacks]4 Minutes
- 38.808 – Operations Of Stack ADT [Stacks]6 Minutes
- 38.909 – Stack Implementation Using Array Part – 1 [Stacks]10 Minutes
- 38.1010 – Stack Implementation Using Array Part – 2 [Stacks]12 Minutes
- 38.1112 – Operations Of Queue ADT [Queues]4 Minutes
- 38.1211 – Introduction Of Queue [Queues]4 Minutes
- 38.1313 – Queue Implementation Using Array Part – 1 [Queues]11 Minutes
- 38.1414 – Queue Implementation Using Array Part-2 [Queues]9 Minutes
- 38.1515 – Circular Queue Implementation Part – 1 [Queues]12 Minutes
- 38.1616 – Circular Queue Implementation Part – 2 [Queues]9 Minutes
- 38.1717 – Introduction To Linked List [Linked Lists]5 Minutes
- 38.1818 – Array Vs Linked List [Linked Lists]7 Minutes
- 38.1919 – Linked List Implementation Part – 1 [Linked Lists]17 Minutes
- 38.2020 – Linked List Implementation Part – 2 [Linked Lists]10 Minutes
- 38.2121 – Linked List Implementation Part – 3 [Linked Lists]10 Minutes
- 38.2222 – Linked List Implementation Part – 4 [Linked Lists]14 Minutes
- 38.2323 – Linked List Implementation Part – 5 [Linked Lists]9 Minutes
- 38.2424 – Linked List Implementation Part – 6 [Linked Lists]10 Minutes
- 38.2525 – Stack Implementation Using Linked List – Part 1 [Linked Lists]9 Minutes
- 38.2626 – Stack Implementation Using Linked List – Part 2 [Linked Lists]6 Minutes
- 38.2727 – Queue Using Linked List Part – 1 [Linked Lists]10 Minutes
- 38.2828 – Queue Using Linked List Part – 2 [Linked Lists]7 Minutes
- 38.2929 – Circular Queue Using Linked List [Linked Lists]10 Minutes
- 38.3030 – Implementation Of Doubly Linked List – Part 1 [Linked Lists]14 Minutes
- 38.3131 – Implementation Of Doubly Linked List – Part 2 [Linked Lists]8 Minutes
- 38.3232 – Implementation Of Doubly Linked List – Part 3 [Linked Lists]10 Minutes
- 38.3333 – Implementation Of Doubly Linked List – Part 4 [Linked Lists]10 Minutes
- 38.3434 – Implementation Of Doubly Linked List – Part 5 [Linked Lists]12 Minutes
- 38.38Data Structures And Algorithms Sample
- 38.39Data Structures And Algorithms
- 38.40Data Structures And Algorithms Practice Problem
- 38.41Binary Tree Implementation Part 1 – Insertion & Traversing [Trees]14 Minutes
- 38.42Introduction to Tree Data Structure & Binary Tree [Trees]6 Minutes
- 38.43Binary Tree Implementation Part 2 – Traversing & Deletion [Trees]12 Minutes
- 38.44Binary tree Traversal [Trees]14 Minutes
- 38.45Tree traversal methods: Pre, post and in-order traversal [Trees]14 Minutes
- 38.46(Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [Trees]11 Minutes
- 38.47Height Balaced Binary Search Tree12 Minutes
- 38.48AVL Tree [Trees]16 Minutes
- 38.49AVL Tree Solved Example – #1 [Trees]17 Minutes
- 38.50AVL Tree Solved Example – #2 [Trees]17 Minutes
- 38.51B-Tree Introduction [Trees]12 Minutes
- 38.52B-Tree Solved Example – #114 Minutes
- 38.53B-Tree Solved Example – #2 [Trees]12 Minutes
- 38.54Huffman Coding [Trees]7 Minutes
- 38.55BFS & DFS – #1 [Graphs]14 Minutes
- 38.56Topological Sorting [Graphs]11 Minutes
- 38.57Graphs Introduction [Graphs]13 Minutes
- 38.58BFS & DFS – #2 [Graphs]12 Minutes
- 38.59Topological Sorting – Solved Example [Graphs]9 Minutes
- 38.60Linear Search [Recursion and Storage Management]5 Minutes
- 38.61Recursion – Winding & Unwinding [Recursion and Storage Management]12 Minutes
- 38.62Binary Search [Recursion and Storage Management]11 Minutes
- 38.63Introduction to Buddy System [Recursion and Storage Management]10 Minutes
- 38.64Problems on Buddy System [Recursion and Storage Management]8 Minutes
- 38.65Hashing Collision [Searching & Sorting]12 Minutes
- 38.66Hashing concept [Searching & Sorting]6 Minutes
- 38.67Linear Probing – #2 [Searching & Sorting]12 Minutes
- 38.68Linear Probing – #1 [Searching & Sorting]13 Minutes
- 38.69Linear Probing With Collisions – Solved [Searching & Sorting]10 Minutes
- 38.70Linear + Quadratic Probing – Solved Example [Searching & Sorting]15 Minutes
- 38.71Searching & Sorting Introduction [Searching & Sorting]12 Minutes
- 38.72Selection Sorting – #2 [Searching & Sorting]12 Minutes
- 38.73Selection Sorting – #1 [Searching & Sorting]12 Minutes
- 38.74Insertion Sort – #1 [Searching & Sorting]12 Minutes
- 38.75Insertion Sort – #2 [Searching & Sorting]12 Minutes
- 38.76Merge Sort – #2 [Searching & Sorting]12 Minutes
- 38.77Merge Sort – #1 [Searching & Sorting]12 Minutes
- 38.78Merge Sort – #3 [Searching & Sorting]10 Minutes
- 38.79Quick Sort – #1 [Searching & Sorting]10 Minutes
- 38.80Quick Sort – #2 [Searching & Sorting]9 Minutes
- 38.81Radix Sort – #1 [Searching & Sorting]10 Minutes
- 38.82Radix Sort – #2 [Searching & Sorting]10 Minutes
- 38.83Heap Data Structure [Applications of Data Structures]11 Minutes
- 38.84Min & Max Heap [Applications of Data Structures]12 Minutes
- 38.85Infix Notation & Conversion [Applications of Data Structures]11 Minutes
- 38.86Prefix, Postfix Notation & Conversion [Applications of Data Structures]12 Minutes
- 38.87Prim’s & Kruskal’s #1 [Applications of Data Structures]19 Minutes
- 38.88Prim’s & Kruskal’s #2 [Applications of Data Structures]10 Minutes
- 38.89Viva Questions – Data Structures
- 38.90[Soln] Mod 1 – Stack, Queue & Linked List [MU – Dec-2024 Importance Solutions]
- 38.91[Soln] Mod 2 – Trees [MU – Dec-2024 Importance Solutions]
- 38.92[Soln] Mod 3 – Graphs [MU – Dec-2024 Importance Solutions]
- 38.93[Soln] Mod 4 – Recursion & Storage Management [MU – Dec-2024 Importance Solutions]
- 38.94[Soln] Mod 5 – Searching & Sorting [MU – Dec-2024 Importance Solutions]
- 38.95[Soln] Mod 6 – Application Of Data Structures [MU – Dec-2024 Importance Solutions]
- Section B - [ Basics of Big Data and Artificial Intelligence ]20
- 39.1Agent and Peas Description [ Artificial Intelligence ]8 Minutes
- 39.2Introduction to Fuzzy Logic [ Artificial Intelligence ]4 Minutes
- 39.3Types of Agent [ Artificial Intelligence ]8 Minutes
- 39.4Learning Agent [ Artificial Intelligence ]8 Minutes
- 39.5Introduction to Machine Learning [ Artificial Intelligence ]12 Minutes
- 39.6Types of Machine Learning [ Artificial Intelligence ]5 Minutes
- 39.7Introduction to Neural Network [ Artificial Intelligence ]6 Minutes
- 39.8Genetic Algorithm [ Artificial Intelligence ]5 Minutes
- 39.9Introduction to Big Data [ Big Data ]6 Minutes
- 39.10Hadoop Part 1 [ Big Data ]10 Minutes
- 39.11Hadoop Part 2 [ Big Data ]10 Minutes
- 39.12Map Reduce [ Big Data ]11 Minutes
- 39.13Introduction to No SQL [ Big Data ]8 Minutes
- 39.14Introduction to Datawarehouse [ Big Data ]10 Minutes
- 39.15Meta Data [ Big Data ]4 Minutes
- 39.16Data mart [ Big Data ]6 Minutes
- 39.17Architecture of Data Warehouse [ Big Data ]7 Minutes
- 39.18What is Olap Operation [ Big Data ]8 Minutes
- 39.19OLAP vs OLTP [ Big Data ]7 Minutes
- 39.20ETL – Extract Transform and Load [ Big Data ]8 Minutes
- Section B - [ AI Notes ]2
- Section B - [ Big Data Notes ]5
- Section B - [ AI Notes for CCAT Exam ]5
- Section B - [ Big Data Notes for CCAT Exam ]1
- Quiz6
- Previous Year Leak Papers6
- CCAT Previous Year Leak Paper Solution8
- Section A [ Verbal ] - Sentence Corrections2
- Section A [ Verbal ] - Error Identification1
- Section A [ Verbal ] - Sentence Completion1
- Section A [ Verbal ] - Sentence Rearrangement2
- Section A [ Verbal ] - Paragraph1
- Section A [ Verbal ] - Fill in the Blanks4

CPP Programming
1. Introduction To C++
• Limitations Of C Language
• A Brief History of C++ And Characteristics
• C++ Organization
• Object Oriented Programming
• Basic I/O in C++
• Data Types In C++
• Variable
• Escape sequences
• Constants And Keywords
2.
Object Oriented Programming System in C++
• OOPS in C++
• Classes in C++
• Objects in C++
• Abstraction In C++
• Encapsulation In C++
• Inheritance in C++
• Polymorphism in C++
3.
Functions, Constructors, Structures and
Keywords in C++
• Function definition

• Constructors In C++
• Structures in C++
• const Keyword in C++
• static Keyword in C++
4. [Bonus] Extra Topic
• Exception Handling in C++
• Initializer List in C++
• Header Guards in C++

1. Introduction To C++
★ Limitations Of C Language
The limitations of C programming languages are as follows:
• Difficult to debug.
• C allows a lot of freedom in writing code, and that is why you can put an
empty line or white space anywhere in the program. And because there is no
fixed place to start or end the line, so it isn't easy to read and understand the
program.
• C compilers can only identify errors and are incapable of handling exceptions
(run-time errors).
• C provides no data protection.
• It also doesn't feature the reusability of source code extensively.
• It does not provide strict data type checking (for example, an integer value can
be passed for floating datatype).
Categorisation Of High Level Languages
High-level programming languages
The high-level programming languages can be categorized into different types on
the basis of the application area in which they are employed as well as the
different design paradigms supported by them. The high-level programming
languages are designed for use in a number of areas. Each high-level language is
designed by keeping its target application area in mind. Some of the high-level
languages are best suited for business domains, while others are apt in the scientific
domain only. The high-level language can be categorized on the basis of the various
programming paradigms approved by them. The programming paradigms refer to the
approach employed by the programming language for solving the different types of
problem.
1. Categorisation based on Application
On the basis of application area the high level language can be divided into the
following types:
i) Commercial languages
These programming languages are dedicated to the commercial domain and are
specially designed for solving business-related problems. These languages can be

used in organizations for processing handling the data related to payroll, accounts
payable and tax building applications. COBOL is the best example of the commercial
based high-level programming language employed in the business domain.
ii) Scientific languages
These programming languages are dedicated to the scientific domain and are
specially designed for solving different scientific and mathematical problems. These
languages can be used to develop programs for performing complex calculation
during scientific research. FORTRAN is the best example of scientific based
language.
iii) Special purpose languages
These programming languages are specially designed for performing some dedicated
functions. For example, SQL is a high-level language specially designed to interact
with the database programs only. Therefore we can say that the special purpose
high-level language is designed to support a particular domain area only.
iv) General purpose languages
These programming languages are used for developing different types of software
applications regardless of their application area. The various examples of general
purpose high-level programming languages are BASIC, C, C++, and java.
2.
Categorisation based on Design paradigm
On the basis of design paradigms the high level programming languages can be
categorised into the following types:
i) Procedure-oriented languages
These programming languages are also called an imperative programming language.
In this language, a program is written as a sequence of procedures. Each procedure
contains a series of instructions for performing a specific task. Each procedure can be
called by the other procedures during the program execution. In this type of
programming paradigms, a code once written in the form of a procedure can be used
any number of times in the program by only specifying the corresponding procedure
name. Therefore the procedure-oriented language allows the data to move freely
around the system. The various examples of procedure-oriented language are
FORTRAN, ALGOL, C, BASIC, and ADA.
ii) Logic-oriented languages
These languages use logic programming paradigms as the design approach for
solving various computational problems. In this programming paradigm predicate

logic is used to describe the nature of a problem by defining the relationship between
rules and facts. Prolog is the best example of the logic-oriented programming
language.
iii) Object-oriented languages
These languages use object-oriented programming paradigms as the design approach
for solving a given problem. In this programming language, a problem is divided into
a number of objects which can interact by passing messages to each other. C++ and C# are
examples of object-oriented programming languages.
★ A Brief History of C++
• The history of C++ begins with C. The reason for this is easy to understand:
C++ is built upon the foundation of C. Thus, C++ is a superset of C.
• C++ expanded and enhanced the C language to support object-oriented
programming (which is described later in this module).
• C++ also added several other improvements to the C language, including an
extended set of library routines. However, much of the spirit and flavor of C++
is directly inherited from C. Therefore, to fully understand and appreciate C++,
you need to understand the “how and why” behind C.
• C++ is regarded as a middle-level language, as it comprises a combination of
both high-level and low-level language features.
• The C++ programming language was created by Bjarne Stroustrup and his team
at Bell Laboratories (AT&T, USA) to help implement simulation projects in an
object-oriented and efficient way. The earliest versions, which were originally
referred to as “C with classes,” date back to 1980. As the name C++ implies,
C++ was derived from the C programming language: ++ is the increment
operator in C.
Characteristics of C++
C++ is not a purely object-oriented language but a hybrid that contains the
functionality of the C programming language. This means that you have all the
features that are available in C:
• Universally usable modular programs
• Efficient, close to the machine programming
• Portable programs for various platforms.
★ C++ Organization

• C++ is designed as a bridge between the programmer and the raw computer.
• The idea is to let the programmer organize a program in a way that he or she
can easily understand.
• The compiler then translates the language into something the machine can use.
• Computer programs consist of two main parts: data and instructions. The
computer imposes little or no organization on these two parts.
• After all, computers are designed to be as general as possible. The idea is for
the programmer to impose his or her own organization on the computer and
not the other way around.
C++ Compilation Process
It is fundamental to know how C++ compilation works to understand how programs
are compiled and executed. Compiling C++ source code into machine-readable code
consists of the following four processes:
1. Preprocessing the source code.
2. Compiling the source code.
3. Assembling the compiled file.
4. Linking the object code file to create an executable file.
Let's start with a simple C++ program to understand how compilation happens.
#include <iostream>
int main(){
// This is a single line comment
/* This is a multi-line
comment */
std::cout << "Hello Universe" << std::endl;
return 0;
}
Let's demystify the C++ compilation process using the following diagram:
/Object+Oriented+Programming+(C%2B%2B)+Sample/background007.jpg)
1. When the C++ preprocessor encounters the #include <file> directive, it
replaces it with the content of the file creating an expanded source code file.
2. Then, this expanded source code file is compiled into an assembly language
for the platform.
3. The assembler converts the file that's generated by the compiler into the object
code file.
4. This object code file is linked together with the object code files for any
library functions to produce an executable file.
/Object+Oriented+Programming+(C%2B%2B)+Sample/background008.jpg)
Difference Between Header and Source Files
Source files contain the actual implementation code. Source files typically have the
extension .cpp, although other extensions such as .cc, .ccx, or .c++ are also quite
common.

On the other hand, header files contain code that describes the functionalities that are
available. These functionalities can be referred to and used by the executable code in
the source files, allowing source files to know what functionality is defined in other
source files.
Compiling And Linking Process
Compilation is a process that ensures that a program is syntactically correct, but it
does not perform any checks regarding its logical correctness. This means that a
program that compiles correctly might still produce undesired results:
Every C++ program needs to define a starting point, that is, the part of the code the
execution should start from. The convention is to have a uniquely named main
function in the source code, which will be the first thing to be executed. This function
is called by the operating system, so it needs to return a value that indicates the status of
the program; for this reason, it is also referred to as the exit status code.
★ Object-Oriented Programming
Central to C++ is object-oriented programming (OOP). As just explained, OOP was
the impetus for the creation of C++. Because of this, it is useful to understand OOP’s
basic principles before you write even a simple C++ program.
Object-oriented programming offers several major advantages to software
development:
• Reduced susceptibility to errors: an object controls access to its own data.
More specifically, an object can reject erroneous access attempts.
• Easy re-use: objects maintain themselves and can therefore be used as
building blocks for other programs.
• Low maintenance requirement: an object type can modify its own internal
data representation without requiring changes to the application.
A First Simple C++ Program
/* This is a simple C++ program. Call this file Sample.cpp. */
#include<iostream>
using namespace std;
// A C++ program begins at main().
int main()
{
cout << "C++ is power programming.";
/Object+Oriented+Programming+(C%2B%2B)+Sample/background010.jpg)
return 0;
}
Output
/* When run, the program displays the following output:*/
C++ is power programming.
★ Basic I/O in C++
The C++ standard libraries provide an extensive set of input/output capabilities which
we will see in subsequent chapters. This chapter will discuss very basic and most
common I/O operations required for C++ programming.
C++ I/O occurs in streams, which are sequences of bytes. If bytes flow from a device
like a keyboard, a disk drive, or a network connection etc. to main memory, this is
called input operation and if bytes flow from main memory to a device like a display
screen, a printer, a disk drive, or a network connection, etc., this is called output
operation.
I/O Library Header Files
There are following header files important to C++ programs −
The Standard Output Stream (cout)
The predefined object cout is an instance of ostream class. The cout object is said to
be "connected to" the standard output device, which usually is the display screen. The

cout is used in conjunction with the stream insertion operator, which is written as <<
which are two less than signs as shown in the following example.
#include <iostream>
using namespace std;
int main() {
char str[] = "Hello C++";
cout << "Value of str is : " << str << endl;
}
When the above code is compiled and executed, it produces the following result −
Value of str is : Hello C++
The C++ compiler also determines the data type of variable to be output and selects
the appropriate stream insertion operator to display the value. The << operator is
overloaded to output data items of built-in types integer, float, double, strings and
pointer values.
The insertion operator << may be used more than once in a single statement as shown
above and endl is used to add a new-line at the end of the line.
The Standard Input Stream (cin)
The predefined object cin is an instance of istream class. The cin object is said to be
attached to the standard input device, which usually is the keyboard. The cin is used
in conjunction with the stream extraction operator, which is written as >> which are
two greater than signs as shown in the following example.
#include <iostream>
using namespace std;
int main() {
char name[50];
cout << "Please enter your name: ";
cin >> name;
cout << "Your name is: " << name << endl;
}
When the above code is compiled and executed, it will prompt you to enter a name.
You enter a value and then hit enter to see the following result −
Please enter your name: cplusplus

Your name is: cplusplus
The C++ compiler also determines the data type of the entered value and selects the
appropriate stream extraction operator to extract the value and store it in the given
variables.
The stream extraction operator >> may be used more than once in a single statement.
To request more than one datum you can use the following −
cin >> name >> age;
This will be equivalent to the following two statements −
cin >> name;
cin >> age;
The Standard Error Stream (cerr)
The predefined object cerr is an instance of ostream class. The cerr object is said to
be attached to the standard error device, which is also a display screen but the object
cerr is un-buffered and each stream insertion to cerr causes its output to appear
immediately.
The cerr is also used in conjunction with the stream insertion operator as shown in
the following example.
#include <iostream>
using namespace std;
int main() {
char str[] = "Unable to read
";
cerr << "Error message : " << str << endl;
}
When the above code is compiled and executed, it produces the following result −
Error message : Unable to read
The Standard Log Stream (clog)
The predefined object clog is an instance of ostream class. The clog object is said to
be attached to the standard error device, which is also a display screen but the object
clog is buffered. This means that each insertion to clog could cause its output to be
held in a buffer until the buffer is filled or until the buffer is flushed.
/Object+Oriented+Programming+(C%2B%2B)+Sample/background013.jpg)
The clog is also used in conjunction with the stream insertion operator as shown in
the following example.
#include <iostream>
using namespace std;
int main() {
char str[] = "Unable to read
";
clog << "Error message : " << str << endl;
}
When the above code is compiled and executed, it produces the following result −
Error message : Unable to read
You would not be able to see any difference in cout, cerr and clog with these small
examples, but while writing and executing big programs the difference becomes
obvious. So it is good practice to display error messages using cerr stream and while
displaying other log messages then clog should be used.
★ Datatypes In C++
There are 4 types of data types in C++ language.
Basic Data Types
The basic data types are integer-based and floating-point based. C++ language
supports both signed and unsigned literals.
The memory size of basic data types may change according to the 32 or 64 bit
operating system.
Let's see the basic data types. Its size is given according to 32 bit OS.
/Object+Oriented+Programming+(C%2B%2B)+Sample/background014.jpg)
Derived Data Types
/Object+Oriented+Programming+(C%2B%2B)+Sample/background015.jpg)
The data-types that are derived from the primitive or built-in datatypes are referred to
as Derived Data Types. These can be of four types namely:
1. Function
2. Array
3. Pointer
4. Reference
Abstract or User-Defined Data Types
These data types are defined by user itself. Like, defining a class in C++ or a
structure. C++ provides the following user-defined datatypes:
1. Class
2. Structure
3. Union
4. Enumeration
5. Typedef defined DataType
Datatype Modifiers
As the name implies, datatype modifiers are used with the built-in data types to
modify the length of data that a particular data type can hold.
Data type modifiers available in C++ are:
Signed
• Unsigned
• Short
• Long
Below table summarizes the modified size and range of built-in datatypes when
combined with the type modifiers:
/Object+Oriented+Programming+(C%2B%2B)+Sample/background016.jpg)
★ Variables
A variable is a name of memory location. It is used to store data. Its value can be
changed and it can be reused many times.
It is a way to represent memory location through symbol so that it can be easily
identified.
Let's see the syntax to declare a variable:
1. int x;
2. float y;

3. char z;
Here, x, y, z are variables and int, float, char are data types.
We can also provide values while declaring the variables as given below:
1. int x=5,b=10; //declaring 2 variable of integer type
2. float f=30.8;
3. char c='A';
Rules for defining variables
1. A variable can have alphabets, digits and underscore.
2. A variable name can start with an alphabet and underscore only. It can't start
with a digit.
3. No white space is allowed within the variable name.
4. A variable name must not be any reserved word or keyword e.g. char, float
etc.
5. Valid variable names:
• int a;
• int _ab;
• int a30;
6. Invalid variable names:
• int 4;
• int x y;
• int double;
Scope Of Variables
In general, the scope is defined as the extent up to which something can be worked
with. In programming also the scope of a variable is defined as the extent of the
program code within which the variable can be accessed or declared or worked with.
There are mainly two types of variable scopes:
1. Local Variables
2. Global Variables
/Object+Oriented+Programming+(C%2B%2B)+Sample/background018.jpg)
Now let’s understand each of the scope at a greater detail:
Local Variables
Variables defined within a function or block are said to be local to those functions.
• Anything between ‘{‘ and ‘}’ is said to inside a block.
• Local variables do not exist outside the block in which they are declared, i.e.
they can not be accessed or used outside that block.
• Declaring local variables: Local variables are declared inside a block.
// CPP program to illustrate
// usage of local variables
#include<iostream>
using namespace std;
void func(){
// this variable is local to the
// function func() and cannot be
// accessed outside this function
int age=18;
}
int main() {
cout<<"Age is: "<<age;
return 0;
}

Output:
Error: age was not declared in this scope
The above program displays an error saying “age was not declared in this scope”. The
variable age was declared within the function func() so it is local to that function and
not visible to portion of program outside this function.
Rectified Program : To correct the above error we have to display the value of
variable age from the function func() only. This is shown in the below program:
// CPP program to illustrate
// usage of local variables
#include<iostream>
using namespace std;
void func()
{
// this variable is local to the
// function func() and cannot be
// accessed outside this function
int age=18;
cout<<age;
}
int main()
{
cout<<"Age is: ";
func();
return 0;
}
Output:
Age is: 18

Global Variables
As the name suggests, Global Variables can be accessed from any part of the
program.
• They are available throughout the lifetime of a program.
• They are declared at the top of the program outside all of the functions or
blocks.
• Declaring global variables: Global variables are usually declared outside of
all of the functions and blocks, at the top of the program. They can be
accessed from any portion of the program.
// CPP program to illustrate
// usage of global variables
#include<iostream>
using namespace std;
// global variable
int global = 5;
// global variable accessed from
// within a function
void display()
{
cout<<global<<endl;
}
// main function
int main()
{
display();
// changing value of global
// variable from main function
global = 10;
display();
}
Output:

5
10
In the program, the variable “global” is declared at the top of the program outside all
of the functions so it is a global variable and can be accessed or updated from
anywhere in the program.
What if there exists a local variable with the same name as that of global
variable inside a function?
Let us repeat the question once again. The question is : if there is a variable inside a
function with the same name as that of a global variable and if the function tries to
access the variable with that name, then which variable will be given precedence?
Local variable or Global variable? Look at the below program to understand the
question:
// CPP program to illustrate
// scope of local variables
// and global variables together
#include<iostream>
using namespace std;
// global variable
int global = 5;
// main function
int main()
{
// local variable with same
// name as that of global variable
int global = 2;
cout << global << endl;
}
Look at the above program. The variable “global” declared at the top is global and
stores the value 5 whereas that declared within the main function is local and stores a
value 2. So, the question is when the value stored in the variable named “global” is
printed from the main function then what will be the output? 2 or 5?
/Object+Oriented+Programming+(C%2B%2B)+Sample/background022.jpg)
• Usually when two variable with the same name are defined then the compiler
produces a compile time error. But if the variables are defined in different
scopes then the compiler allows it.
• Whenever there is a local variable defined with same name as that of a global
variable then the compiler will give precedence to the local variable
★ Escape Sequences
Escape sequences are used in the programming languages C and C++ , and their
design was copied in many other languages such as Java and C# . Escape sequences
are the special characters used in control string to modify the format of the output.
These characters are not displayed in output. These characters are used with
combination of backslash \. This backslash \ is called escape character.
Table of Escape sequence of C & C++ are as follows:
/Object+Oriented+Programming+(C%2B%2B)+Sample/background023.jpg)
★ Constants
Constants refer to fixed values that the program may not alter and they are called
literals.
Constants can be of any of the basic data types and can be divided into Integer
Numerals, Floating-Point Numerals, Characters, Strings and Boolean Values.
Again, constants are treated just like regular variables except that their values cannot
be modified after their definition.
Keywords
This is a list of reserved keywords in C++. Since they are used by the language, these
keywords are not available for re-definition or overloading.
/Object+Oriented+Programming+(C%2B%2B)+Sample/background024.jpg)