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

Operating System
/Operating+System/background02.jpg)
1. Computer Fundamentals
Q1: What is Computer?
Ans: A computer is a machine that can be programmed to carry out sequences of arithmetic
or logical operations automatically. Modern computers can perform generic sets of
operations known as programs. These programs enable computers to perform a wide range
of tasks.
Q2: What is Computer Architecture?
Ans: computer architecture is a set of rules and methods that describe the functionality,
organization, and implementation of computer systems. The architecture of a system refers
to its structure in terms of separately specified components of that system and their
interrelationships.
Q3: What are the differences between Computer Architecture and
Computer Organization?
Ans:

Q4: What are the functions of computers?
Ans:
Functions of computers:
i)Input Function
ii)Processing Data
iii)Storing Data
iv)Output Function
i)Input or inserting data and instructions:Data input is the most basic function of a
computer. It's what allows you to transfer information into the system via a mouse,
keyboard, scanner, external hard drive, HDMI port, USB drive or software. Users can
enter this data into a spreadsheet, database, online forms and more.
ii)Processing:This processing function is the 2nd step that offers the process and handling
of the input data instructed by the user. To process the user input data the computer needs a’
Central Processing Unit‘ (CPU).
The computer CPU, of course, is primarily obliged to process the entire process data of the
computer. The CPU takes data and instructions from the input devices and performs all
types of calculations based on the instructions given.It consists of manipulating the data in
different ways, performing calculations, modifying the instructions, coding, and executing
the actions. All this process is done on the motherboard with the help of the processor,
power supply unit and RAM presented in the CPU.
iii)Storing Data:The computer must store the data permanently so that it is available while
processing data temporarily. The function of data storage is an important component for the
proper functioning of computer systems.Basically, there are two types of storage in the CPU
of a Computer - One is RAM (used for processing the input data temporarily ) and the
second is ROM (used to store processed data permanently).
The computer must need both RAM and ROM for functioning the entire computer system
present in the CPU. RAM has low memory temporarily while ROM has a large storage
capacity for storing all the large data, information, video, images, documents, and software
in the computer permanently.
iv)Output Function:The fourth and last function of the computer is the output that means
the results generated by the computer once the processing of CPU is completed, based on
the instruction given by the user.The output is in the form of documents, videos, audio,
graphs, images, etc. that you see from the output devices such as computer monitor, printer,
speakers, headphones, screen projector, etc.
/Operating+System/background04.jpg)
Q5: What are the components of a computer system?
Ans:
(Figure 1.1: Block diagram of a computer system)
A computer system consists of four major components. And they are: central processing
unit, input/output devices and Memory as shown in figure above:
i)Input Device: Input is any data or instruction that a computer collects from the
outside world. The input can be in the form of text, programs, commands, and user
responses.
The device that collects the input and sends it to the computer is called an input device.
Input devices include the keyboard, mouse, scanners, digital cameras, microphone, etc.
ii)CPU:The central processing unit(CPU) is the main information processor in a digital
computer capable of executing a program. The manipulation of the raw data based on
the instruction is called processing. A computer processes data in a device called the
central processing unit. It is a very complex integrated circuit, containing millions of
miniaturized electronic components.
The CPU serves as a ‘brain' of the computer. The speed of the CPU is measured in
Hertz(MHz, GHz, etc). The various types of CPU chips are intel Celeron, intel core i3,
i5, i7, etc.
Major components of CPU are Arithmetic Logic Unit(ALU),Registers,Control
Unit(CU) and Instruction Execution Unit.

iii)Storage/Memory: A computer has a huge data storage capacity. Storage is the place
where data is held in an electromagnetic or optical form for access by a computer
processor.Storage has been divided into:
a)Primary Storage:Primary storage holds data in memory. The primary storage (also
known as main memory, internal memory, or prime memory), also known as memory, is
the only one that is directly accessible to the CPU. e.g. Random Access Memory or
RAM
b)Secondary Storage:Secondary storage holds data on hard disks, tapes, and other
devices requiring input-output operations. Secondary storage (also known as external
memory or auxiliary storage) differs from primary storage where it is inaccessible to the
CPU directly.
iv)Output device:The output device is any peripheral device that receives or displays
output from a computer. Output is any computer-generated information displayed
on-screen or printed on paper. It can be in the form of words, numbers, graphics, sound,
videos, and animations.
Q6: What are Registers? What are the types of Registers?
Ans: Registers are a type of computer memory used to quickly accept, store, and
transfer data and instructions that are being used immediately by the CPU. The registers
used by the CPU are often termed as Processor registers.
A processor register may hold an instruction, a storage address, or any data .
Types of Registers:
● Accumulator: This is the most common register, used to store data taken out
from the memory.
● General Purpose Registers: This is used to store data intermediate results during
program execution. It can be accessed via assembly programming.
● Special Purpose Registers: Users do not access these registers. These registers
are for Computer system,
○ MAR: Memory Address Register are those registers that hold the address for
the memory unit.
○ MBR: Memory Buffer Register stores instruction and data received from the
memory and sent from the memory.
○ PC: Program Counter points to the next instruction to be executed.
○ IR: Instruction Register holds the instruction to be executed
/Operating+System/background06.jpg)
(Figure 1.2: CPU registers)
Q7: Define i)Gates , ii)Memory cell.
Ans: i)Gates:Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output. The
relationship between the input and the output is based on a certain logic. Based on this,
logic gates are named as AND gate, OR gate, NOT gate etc.
ii)Memory cell:The memory cell is the fundamental building block of computer
memory. The memory cell is an electronic circuit that stores one bit of binary
information and it must be set to store a logic 1 (high voltage level) and reset to store a
logic 0 (low voltage level).
(Figure 1.3: Memory cell operation a)Write,b)Read)
/Operating+System/background07.jpg)
Q8: What is Interrupt?
Ans: Interrupt is a signal emitted by hardware or software when a process or an event
needs immediate attention. It alerts the processor to a high-priority process requiring
interruption of the current working process. In I/O devices one of the bus control lines is
dedicated for this purpose and is called the Interrupt Service Routine (ISR).
Q9: What do you mean by interconnection structure?
Ans: The processors must be able to share a set of main memory modules & I/O devices
in a multiprocessor system. This sharing capability can be provided through
interconnection structures. The interconnection structure that is commonly used can be
given as follows - Time-shared / Common Bus.
Q10: Discuss the bus structure.
Ans:
(Figure 1.4: Bus interconnection)
Each line is assigned a particular meaning or function.
The lines can be classified into 3 functional groups
1. Data line
2.Address line
3.Control line
1. Data line:
● Provide a path for moving data between system modules.
● These lines, collectively, are called the data bus
● Data bus may consist of from 32 to 100 separated line
● Each line can carry only one bit at a time
● Number of line in the bus determine the data rate and overall the system performance
2. Address line:
● Used to designate the source or destination of the data on the data bus
● The width of the address bus determines the maximum possible memory capacity of
the system.

3. Control line:
● Used to control the access to and the use of the data and address lines
● Since the data and the address line shared by all the components, there must be a
means of controlling their use
● Control signal transmit both commands and timing information between the modules
● Typical control lines include
1. Memory write
2. Memory read
3. I/O write
4. I/O read
5. Clock
6. Reset
7. Bus request
8. Bus grant
9. Interrupt request
10. Interrupt ACK
11. Transfer ACK
Q11: Discuss the computer memory system.
Ans: The computer memory is one of the most important elements in a computer system. It
stores data and instructions required during the processing of data and output results.
Storage may be required for a limited period of time, instantly or for an extended period of
time. Computer memory refers to the electronic holding place for instructions and data
where the processor can read quickly.
Memory Hierarchy:The memory is characterised on the basis of two key factors; capacity
and access time. The lesser the access time, the faster is the speed of memory.
The computer uses a hierarchy of memory that is organised in a manner to enable the fastest
speed and largest capacity of memory as shown in figure.
/Operating+System/background09.jpg)
Types of Memory:
In general, memory is classified into two categories.
1. Primary memory or Main memory.
2. Secondary memory or Auxiliary memory.
1.Primary memory or main memory:The memory unit that communicates directly with
the CPU is called main memory. The primary memory allows the computer to store data for
immediate manipulation and to keep track of what is currently being processed. It is volatile
in nature, it means that when the power is turned off, the contents of the primary memory
are lost forever.
Primary memory is further classified in two categories.
1. Random Access Memory (RAM):
It is also known as read/write memory, that allows the CPU to read as well as write data and
instructions into it.
RAM is used for the temporary storage of input data, output data and intermediate results.
RAM is a microchip implemented using semiconductors.
There are two categories of RAM
(i)Dynamic RAM (DRAM) :It is made up of memory cells where each cell is composed of
one capacitor and one transistor. DRAM must be refreshed continually to store information.
The refresh operation occurs automatically thousands of times per second DRAM is slower,
less-expensive and occupies less space on the computer’s motherboard.
(ii) Static RAM (SRAM):It retains the data as long as power is provided to the memory
chip. It needs not be ‘refreshed’ periodically. SRAM uses multiple transistors for each
memory cell. It does not use a capacitor. SRAM is often used as cache memory due to its
high speed. SRAM is more expensive than DRAM.
Extended Data Output Dynamic RAM (EDO DRAM): It is a type of RAM chip. It is
used to improve the time to read content from memory and enhance the method of access.

Cache Memory:Cache memory is a storage buffer that stores the data that is used more
often. temporarily and makes them available to CPU at a fast rate.
The data and instructions that are required during the processing of data are brought from
the secondary storage devices and stored in the RAM. For processing it is required that the
data and instructions are accessed from the RAM and stored in the registers.
Cache memory is a very high speed memory placed in between RAM and CPU. Cache
memory increases the speed of processing.
Cache memory is very expensive, so it is smaller in size. Generally. Computers have cache
memory of sizes 256 KB to 2 MB.
2. Read Only Memory (ROM):
It is also known as non-volatile memory or permanent storage. It does not lose its content
when the power is switched off.ROM has only read capability, no write capability. ROM
can have data and instructions written to it only one time. Once a ROM chip is programmed
at the time of manufacturing, it cannot be reprogrammed or rewritten.
There are three categories of ROM.
(i) Programmable ROM (PROM): It is also non-volatile in nature. Once a PROM has
been programmed, its contents can never be changed. It is a one-time programmable device.
PROMs are manufactured blank and can be programmed at buffer, Final test or in system.
These types of memories are found in video game consoles, mobile phones, implantable
medical devices and high definition multimedia interfaces. PROM was invented by Wen
Tsing Chow in 1956.
(ii) Erasable Programmable ROM (EPROM): It is similar to PROM, but it can be erased
by exposure to strong ultraviolet light,then rewritten. So,it is also known as Ultraviolet
Erasable Programmable ROM (UV EPROM).EPROM was invented by Dov Frohman of
Intel in 1971.
(iii) Electrically Erasable Programmable ROM (EEPROM):It is similar to EPROM, but
it can be erased electrically, then rewritten electrically and the burning process is reversible
by exposure to electric pulses.
2.Secondary Memory (Auxiliary Memory/Storage Devices):The secondary memory
stores much larger amounts of data and information for extended periods of time. Data in
secondary memory cannot be processed directly by the CPU, it must first be copied into
primary storage i.e, RAM.Secondary storage is used to store data and programs when they
are not being processed. It is also non-volatile in nature. Due to this, the data remains in the
secondary storage as long as it is not overwritten or deleted by the user. It is a permanent
storage device i.e., device.

Secondary memory devices include.
i)Magnetic Disks :
● Hard Disk Drive.
● Floppy Disk.
● Memory Stick.
ii)Optical Disk:
● CD
● DVD
● Blue-ray Disk
iii)Solid State Disks:
● Pen/Flash Drive
Q12: What are the key characteristics of a computer memory system?
Ans: The key characteristics of memory devices or memory system are as follows:
1. Location
2. Capacity
3. Unit of Transfer
4. Access Method
5. Performance
6. Physical type
7. Physical characteristics
8. Organization
1. Location:
It deals with the location of the memory device in the computer system. There are three
possible locations:
● CPU : This is often in the form of CPU registers and small amount of cache
● Internal or main: This is the main memory like RAM or ROM. The CPU can
directly access the main memory.
● External or secondary: It comprises secondary storage devices like hard disks,
magnetic tapes. The CPU doesn’t access these devices directly. It uses device
controllers to access secondary storage devices.
2. Capacity:
The capacity of any memory device is expressed in terms of: i)word size ii)Number of
words

i)Word size: Words are expressed in bytes (8 bits). A word can however mean any
number of bytes. Commonly used word sizes are 1 byte (8 bits), 2bytes (16 bits) and 4
bytes (32 bits).
ii)Number of words: This specifies the number of words available in the particular
memory device. For example, if a memory device is given as 4K x 16.This means the
device has a word size of 16 bits and a total of 4096(4K) words in memory.
3. Unit of Transfer:
It is the maximum number of bits that can be read or written into the memory at a time.
In case of main memory, it is mostly equal to word size. In case of external memory, the
unit of transfer is not limited to the word size; it is often larger and is referred to as
blocks.
4. Access Methods:
It is a fundamental characteristic of memory devices. It is the sequence or order in
which memory can be accessed. There are three types of access methods:
● Random Access: If storage locations in a particular memory device can be
accessed in any order and access time is independent of the memory location
being accessed. Such memory devices are said to have a random access
mechanism. RAM (Random Access Memory) ICs use this access method.
● Serial Access: If memory locations can be accessed only in a certain
predetermined sequence, this access method is called serial access. Magnetic
Tapes, CD-ROMs employ serial access methods.
● Semi random Access: Memory devices such as Magnetic Hard disks use this
access method. Here each track has a read/write head thus each track can be
accessed randomly but access within each track is restricted to a serial access.
5. Performance: The performance of the memory system is determined using three
parameters
● Access Time: In random access memories, it is the time taken by memory to
complete the read/write operation from the instant that an address is sent to the
memory. For non-random access memories, it is the time taken to position the
read write head at the desired location. Access time is widely used to measure
performance of memory devices.
● Memory cycle time: It is defined only for Random Access Memories and is the
sum of the access time and the additional time required before the second access
can commence.

● Transfer rate: It is defined as the rate at which data can be transferred into or out
of a memory unit.
6. Physical type: Memory devices can be either semiconductor memory (like RAM) or
magnetic surface memory (like Hard disks).
7.Physical Characteristics:
● Volatile/Non- Volatile: If a memory device continues to hold data even if power
is turned off. The memory device is non-volatile else it is volatile.
8. Organization:
● Erasable/Non-erasable: The memories in which data once programmed cannot
be erased are called Non-erasable memories. Memory devices in which data in the
memory can be erased is called erasable memory.
E.g. RAM(erasable), ROM(non-erasable).
Q13: What is cache memory?
Ans: Cache memory, also called cache, supplementary memory system that temporarily
stores frequently used instructions and data for quicker processing by the central processing
unit (CPU) of a computer.
Q14: What is Disk Cache?
Ans: A disk cache is a mechanism for improving the time it takes to read from or write to a
hard disk. Today, the disk cache is usually included as part of the hard disk. A disk cache
can also be a specified portion of random access memory (RAM). The disk cache holds data
that has recently been read and, in some cases, adjacent data areas that are likely to be
accessed next. Write caching is also provided with some disk caches.
Q15: What are the techniques of I/O operations?
Ans:There are three technique for I/O operation , which are:
● Programmed I/O
● Interrupt driven I/O
Direct Memory Access
/Operating+System/background14.jpg)
● Programmed I/O :With programmed I/O, data are exchanged between the processor
and the I/O module. The processor executes a program that gives it direct control of
the I/O operation, including sensing device status, sending a read or write command,
and transferring the data. When the processor issues a command to the I/O module, it
must wait until the I/O operation is complete.
● Interrupt driven I/O :With interrupt-driven I/O, the processor issues an I/O command,
continues to execute other instructions, and is interrupted by the I/O module when the
latter has completed its work.
● Direct Memory Access :With direct memory access (DMA), the I/O module and
main memory exchange data directly without processor involvement.
Q16: What are the differences between RAM and ROM?
Ans:
Q17: What is the external I/O interface?
Ans: External interfaces are typically a product's lifeline to the outside world. Such
interfaces may be used for a number of purposes, including connecting to peripherals, field
programming, or testing during product manufacturing. Typical interfaces include FireWire,
USB , RS232, Ethernet, or JTAG IEEE 1149.1 ,InfiniBand.
Q18:Discuss the functions of the I/O module.
Ans: Functions of the I/O module:
● Processor communication - This involves a number of tasks, primarily the
transference of data between the processor and an I/O module, accepting and
decoding commands sent by the processor, reporting of current status, and an ability
for the I/O module to recognise its own unique address.
/Operating+System/background15.jpg)
● Device communication - It needs to be able to perform standard device
communications, such as reporting of status.
● Control and timing - An I/O module needs to be capable of managing data flow
between a computer’s internal resources and any connected external devices.
● Data buffering - A crucial function that manages the speed discrepancy that exists
between the speed of transfer of data between the processor and memory and
peripheral devices.
● Error detection - Detecting errors, whether mechanical (such as a printer
experiencing a paper jam) or data based, and reporting them to the processor is
another vital function of an I/O module.
Q19: What are the categories of external devices? Draw the external
device block diagram.
Ans :
We can broadly classify external devices into three categories:
1) Human readable: Suitable for communicating with the computer user. Ex: Video
Display Terminals (VDTs), printers.
2) Machine readable: Suitable for communicating with equipment. Ex: magnetic disk
and tape systems, and sensors and actuators, such as are used in a robotics application.
3) Communication: Suitable for communicating with remote devices. Communication
devices allow a computer to exchange data with a remote device, which may be a
human-readable device, such as a terminal, a machine-readable device, or even another
computer.
(Figure 1.6: Block diagram of an external device)
/Operating+System/background16.jpg)
The interface to the I/O module is in the form of control, data, and status signals.
Control signals determine the function that the device will perform, such as send data to
the I/O module (INPUT or READ), accept data from the I/O module (OUTPUT or
WRITE), report status, or perform some control function particular to the device (e.g.,
position a disk head). Data is in the form of a set of bits to be sent to or received from
the I/O module. Status signals indicate the state of the device. Examples are
READY/NOT-READY to show whether the device is ready for data transfer.
Control logic associated with the device controls the device’s operation in response to
direction from the I/O module. The transducer converts data from electrical to other
forms of energy during output and from other forms to electrical during input. Typically,
a buffer is associated with the transducer to temporarily hold data being transferred
between the I/O module and the external environment; a buffer size of 8 to 16 bits is
common.
Q20: Discuss the I/O module structure.
Ans:
(Figure 1.7: Block diagram of I/O module structure)
● The module connects to the rest of the computer through a set of system bus lines.
Data transferred to and from the module are buffered in one or more data registers.
One or more status registers provide current status information. A status register may
also function as a control register, to accept detailed control information from the
processor. The logic within the module interacts with the processor via a set of
control lines. The processor uses the control lines to issue commands to the I/O
module.

-Some of the control lines may be used by the I/O module for status signals. Each I/O
module has a unique address or a unique set of addresses if it controls more than one
external device.
● An I/O module may hide the details of timing, formats, and the electro mechanics of
an external device so that the processor can function in terms of simple read and write
commands, and possibly open and close file commands. In its simplest form, the i/o
module may still leave much of the work of controlling a device (e.g., rewind a tape)
visible to the processor.
● An I/O module that takes on most of the detailed processing burden, presenting a
high-level interface to the processor, is usually referred to as an I/O channel or I/O
processor. An I/O module that is quite primitive and requires detailed control is
usually referred to as an I/O controller or device controller. I/O controllers are
commonly seen on microcomputers, whereas I/O channels are used on mainframes.
Q21: What is a Hard Disk Drive(HDD)?
Ans: A hard disk drive (HDD) is a non-volatile computer storage device containing
magnetic disks or platters rotating at high speeds. It is a secondary storage device used
to store data permanently, random access memory (RAM) being the primary memory
device. Non-volatile means data is retained when the computer is turned off.
A hard disk drive is also known as a hard drive.
Q22: What is Motherboard?
Ans:A motherboard (also called mainboard, main circuit board,or mobo) is the main printed
circuit board (PCB) in general-purpose computers and other expandable systems. It holds
and allows communication between many of the crucial electronic components of a system,
such as the central processing unit (CPU) and memory, and provides connectors for other
peripherals . Unlike a backplane, a motherboard usually contains significant sub-systems,
such as the central processor, the chipset's input/output and memory controllers, interface
connectors, and other components integrated for general use.
Motherboard means specifically a PCB with expansion capabilities. As the name suggests,
this board is often referred to as the "mother" of all components attached to it, which often
include peripherals, interface cards, and daughterboards: sound cards, video cards, network
cards , host bus adapters, TV tuner cards, IEEE 1394 cards; and a variety of other custom
components.

Similarly, the term mainboard describes a device with a single board and no additional
expansions or capability, such as controlling boards in laser printers, television sets,
washing machines, mobile phones, and other embedded systems with limited expansion
abilities.