-
About the Course 0
CDAC CCAT Study Materials
Crack your CDAC CCAT Exams in first attempt with LMT Study Materials- πComplete Study Notes (Concepts & Solved Example)
- π 500+ Practice Problems
- π Formula's and tricks
- π£ Beginner Friendly
- βοΈ Trusted by 1000+ Students
- π Previous Year Question Papers
- π Section A + Section B + Section C [ All Notes Available ]
The one-stop destination for everything you need for CDAC CCAT Exam Preparations
So let's dive in - Enroll today, Crack the exam & get into top Institute of CDAC and get to work with your Dream CompanyNo items in this section -
Section A [ Quantitative ] - Simple and Compound Interest 7
-
Simple Interest Part #1 20 minLecture2.1
-
Simple Interest Part #2 19 minLecture2.2
-
Compound Interest Part #1 25 minLecture2.3
-
Compound Interest Part #2 23 minLecture2.4
-
Fastest Method to Solve Compound Interest 07 minLecture2.5
-
Simple and Compound Interest [Notes]Lecture2.6
-
Simple and Compound Interest [Practice Problems]Lecture2.7
-
-
Section A [ Quantitative ] - Decimal and Fractions 2
-
1. Decimal and Fractions 20 minLecture3.1
-
2. Decimal and Fractions 15 minLecture3.2
-
-
Section A [ Quantitative ] - Perimeter, Area, Volume 2
-
Perimeter, Area, Volume – 1 20 minLecture4.1
-
Perimeter, Area, Volume – 2 20 minLecture4.2
-
-
Section A [ Quantitative ] - Simplification and Approximation 2
-
Simplification – 1 11 minLecture5.1
-
SImplification – 2 11 minLecture5.2
-
-
Section A [ Quantitative ] - Probability 7
-
Probability Part #1 26 minLecture6.1
-
Probability Part #2 26 minLecture6.2
-
Probability Part #3 28 minLecture6.3
-
Probability Part #4 28 minLecture6.4
-
Probability [ Formula and Solved Examples ]Lecture6.5
-
Probability [Practice Problems]Lecture6.6
-
Probability All PPT_Lecture6.7
-
-
Section A [ Quantitative ] - Calander 7
-
Calendar-1 21 minLecture7.1
-
Calendar-2 14 minLecture7.2
-
Calendar-3 12 minLecture7.3
-
Calendar-4 13 minLecture7.4
-
Calendar Problem [Notes]Lecture7.5
-
Calendar Problem [Handmade Notes]Lecture7.6
-
Calendar Problem [ Practice Problem ]Lecture7.7
-
-
Section A [ Quantitative ] - Clock Problems 6
-
Clock Problems Part #1 13 minLecture8.1
-
Clock Problems Part #2 17 minLecture8.2
-
Clock Problems Part #3 10 minLecture8.3
-
Clock Problem [Handmade Notes]Lecture8.4
-
Clock Problem [ Notes]Lecture8.5
-
Clock Problem [ Practice Problem ]Lecture8.6
-
-
Section A [ Quantitative ] - Boats and Streams 7
-
Boats & Streams – 1 20 minLecture9.1
-
Boats & Streams – 2 25 minLecture9.2
-
Boats and Stream Part #1 20 minLecture9.3
-
Boats and Stream Part #2 25 minLecture9.4
-
Boat and Stream [Formula] —Lecture9.5
-
Boat and Stream [Handmade Notes]Lecture9.6
-
Boat and Stream [Practice Problems]Lecture9.7
-
-
Section A [ Quantitative ] - Number System 15
-
[ New Video ] Number System – 1 25 minLecture10.1
-
[ New Video ] Number System – 2 21 minLecture10.2
-
[ New Video ] Number System – 3 19 minLecture10.3
-
[ New Video ] Number System – 4 25 minLecture10.4
-
Number System Part #1 13 minLecture10.5
-
Number System Part #2 12 minLecture10.6
-
Number System Part #3 07 minLecture10.7
-
Number System Part #4 10 minLecture10.8
-
Number System Part #5 10 minLecture10.9
-
Number System Part #6 10 minLecture10.10
-
Number System Part #7 07 minLecture10.11
-
Number System Part #8 07 minLecture10.12
-
Number System Part #9 09 minLecture10.13
-
Number System Part #10 09 minLecture10.14
-
Number System, LCM & HCF Practice ProblemLecture10.15
-
-
Section A [ Quantitative ] - Time, Speed and Distance 4
-
Time, Speed & Distance – 1 18 minLecture11.1
-
Time, Speed & Distance – 2 22 minLecture11.2
-
Time, Speed & Distance – 3 28 minLecture11.3
-
Time, Speed & Distance – Practice Question 24 minLecture11.4
-
-
Section A [ Quantitative ] - Time and Work 10
-
Time and Work Part #1 26 minLecture12.1
-
Time and Work Part #2 26 minLecture12.2
-
Time and Work Part #3 27 minLecture12.3
-
Time and Work Part #4 22 minLecture12.4
-
Time and Work Part #1 [ Old Videos by Sumer ] 20 minLecture12.5
-
Time and Work Part #2 [ Old Videos by Sumer ] 13 minLecture12.6
-
Time and Work Part #3 [ Old Videos by Sumer ] 10 minLecture12.7
-
Time and Work [Formula] —Lecture12.8
-
Time and Work [Practice Problems]Lecture12.9
-
Time and Work [Handmade Notes]Lecture12.10
-
-
Section A [ Quantitative ] - Profit and Loss 9
-
[ New Video ] Profit & Loss – 1 16 minLecture13.1
-
[ New Video ] Profit & Loss – 2 26 minLecture13.2
-
[ New Video ] Profit & Loss – 3 18 minLecture13.3
-
Profit and Loss Part #1 09 minLecture13.4
-
Profit and Loss Part #2 21 minLecture13.5
-
Profit and Loss Part #3 15 minLecture13.6
-
Profit & Loss [Formula] —Lecture13.7
-
Profit and Loss [ Notes ]Lecture13.8
-
Profit and Loss [Practice Problems]Lecture13.9
-
-
Section A [ Quantitative ] - Average 5
-
Average full Concept and Tricks Part #1 11 minLecture14.1
-
Averages full Concept and Tricks Part #2 09 minLecture14.2
-
Averages full Concept and Tricks Part #3 09 minLecture14.3
-
Averages Practice Questions 26 minLecture14.4
-
Averages [ Notes ]Lecture14.5
-
-
Section A [ Quantitative ] - Arithmetic Progression and Geometric Progression 7
-
Arithmetic Progression Part #1 10 minLecture15.1
-
Arithmetic Progression Part #2 08 minLecture15.2
-
Geometric Progression Part #1 08 minLecture15.3
-
Geometric Progression Part #2 07 minLecture15.4
-
Sequence and Series # 1 [ AP – GP Practice Problem ] 25 minLecture15.5
-
Sequence and Series # 2 [ AP – GP – HP Practice Problem ] 22 minLecture15.6
-
Arithmetic Progression and Geometric Progression [ Notes ]Lecture15.7
-
-
Section A [ Quantitative ] - Surds and Indices 2
-
Section A [ Quantitative ] - Ages Problems 8
-
Ages Basic Concept with Solved Examples 09 minLecture17.1
-
Ages ConceptLecture17.2
-
Ages Part #1 12 minLecture17.3
-
Ages Part #2 08 minLecture17.4
-
Ages Practice Problems 18 minLecture17.5
-
Ages [ Formula ] —Lecture17.6
-
Ages Problem [ Notes]Lecture17.7
-
Ages Problem [Practice Problems]Lecture17.8
-
-
Section A [ Quantitative ] - Alligations and Mixtures 5
-
Alligation and Mixture Part #1 18 minLecture18.1
-
Alligation and Mixture Part #2 19 minLecture18.2
-
Alligation and Mixtures [Formula]Lecture18.3
-
Alligation and Mixtures [Handmade Notes]Lecture18.4
-
Alligation and Mixtures [Practice Problems]Lecture18.5
-
-
Section A [ Quantitative ] - Chain rule 4
-
Chain Rule 15 minLecture19.1
-
Chain rule [ Formula] —Lecture19.2
-
Chain Rule [Handmade Notes]Lecture19.3
-
Chain Rule [Practice Problems]Lecture19.4
-
-
Section A [ Quantitative ] - HCF and LCM 6
-
HCF and LCM Part #1 13 minLecture20.1
-
HCF and LCM Part #2 16 minLecture20.2
-
HCF and LCM Part #3 18 minLecture20.3
-
HCF and LCM [Formula] —Lecture20.4
-
HCM and LCM [Handmade Notes]–Lecture20.5
-
HCM and LCM [Practice Problems]Lecture20.6
-
-
Section A [ Quantitative ] - Percentage Problem 9
-
Percentage Part 1 08 minLecture21.1
-
Percentage Part 2 08 minLecture21.2
-
Percentage Part 3 09 minLecture21.3
-
Percentage Part 4 08 minLecture21.4
-
Percentage Part 5 09 minLecture21.5
-
Percentage Practice Questions 27 minLecture21.6
-
Percentage Problem [Formula] —Lecture21.7
-
Percentage Problem [ Notes ]Lecture21.8
-
Percentage Problem [Practice Problems]Lecture21.9
-
-
Section A [ Quantitative ] - Permutation and Combination 6
-
Permutation and Combination Part #1 25 minLecture22.1
-
Permutation and Combination Part #2 19 minLecture22.2
-
Permutation and Combination Part #3 20 minLecture22.3
-
Permutation and Combination [Formula]–Lecture22.4
-
Permutation and Combination [Handmade Notes]Lecture22.5
-
Permutation and Combination [Practice Problems]Lecture22.6
-
-
Section A [ Quantitative ] - Pipes and Cistern 7
-
Pipes and Cistern Part #1 27 minLecture23.1
-
Pipes and Cistern Part #2 16 minLecture23.2
-
Pipes and Cistern Part #3 12 minLecture23.3
-
Pipes and Cistern – 1 [ New Video ] 27 minLecture23.4
-
Pipes and Cistern – 2 [ New Video ] 23 minLecture23.5
-
Pipes and Cistern [Handmade Notes]Lecture23.6
-
Pipes and Cistern [Practice Problems]Lecture23.7
-
-
Section A [ Quantitative ] - Ratio and Proportion 8
-
Ratio & Proportion #1 13 minLecture24.1
-
Ratio & Proportion #2 12 minLecture24.2
-
Ratio & Proportion #3 13 minLecture24.3
-
Ratio & Proportion #4 10 minLecture24.4
-
Ratio & Proportion #5 08 minLecture24.5
-
Ratio and Proportion Practice Problem 33 minLecture24.6
-
Ratio and Proportion [ Notes ]Lecture24.7
-
Ratio and Proportion [Practice Problems]Lecture24.8
-
-
Section A [ Quantitative ] - Train Problems 8
-
Train Problems Part #1 19 minLecture25.1
-
Train Problems Part #2 11 minLecture25.2
-
Train Problems Part #3 19 minLecture25.3
-
Problems on Train – 1 26 minLecture25.4
-
Problems on Train – 2 27 minLecture25.5
-
Train Problems [Formula] —Lecture25.6
-
Train Problems [ Notes ]Lecture25.7
-
Train Problems [Practice Problems]Lecture25.8
-
-
Section A [ Verbal ] - Reading Comprehension 6
-
Reading Comprehension 13 minLecture26.1
-
Reading Comprehension -1 24 minLecture26.2
-
Reading Comprehension -2 19 minLecture26.3
-
Reading Comprehension [ Notes + Solved Examples + Practice Problem ]Lecture26.4
-
Reading Comprehension Notes 1Lecture26.5
-
Reading Comprehension Notes 2Lecture26.6
-
-
Section A [ Verbal ] - Synonyms And Antonyms 7
-
Synonyms 28 minLecture27.1
-
Antonyms 22 minLecture27.2
-
Synonyms and Antonyms 14 minLecture27.3
-
Synonyms And Antonyms NotesLecture27.4
-
Synonyms NotesLecture27.5
-
Antonyms NotesLecture27.6
-
Synonyms Antonyms Practice ProblemLecture27.7
-
-
Section A [ Verbal ] - Sentence Rearrangement 3
-
Rearrangements – 1 21 minLecture28.1
-
Rearrangements – 2 21 minLecture28.2
-
Sentence Rearrangement NotesLecture28.3
-
-
Section A [ Verbal ] - Error Identification 2
-
Error Identification 13 minLecture29.1
-
Error Identification NotesLecture29.2
-
-
Section A [ Verbal ] - Paragraph 2
-
Paragraph 22 minLecture30.1
-
Paragraph FormationLecture30.2
-
-
Section A [ Verbal ] - Sentence Corrections 3
-
Sentence Corrections – 1 23 minLecture31.1
-
Sentence Corrections – 2 22 minLecture31.2
-
Sentence Correction NotesLecture31.3
-
-
Section A [ Verbal ] - Sentence Completion 2
-
Sentence Completion 18 minLecture32.1
-
Sentence Completion NotesLecture32.2
-
-
Section A [ Verbal ] - Fill in the Blanks 9
-
Conjunction 10 minLecture33.1
-
Prepositions 11 minLecture33.2
-
Articles 15 minLecture33.3
-
Tenses 21 minLecture33.4
-
Conjunction NotesLecture33.5
-
Prepositions NotesLecture33.6
-
Articles NotesLecture33.7
-
Tenses NotesLecture33.8
-
Tenses Practice ProblemsLecture33.9
-
-
Section A [ Verbal ] - Subject Verb Agreement 2
-
Subject Verb and Agreement 22 minLecture34.1
-
Subject Verb Agreement NotesLecture34.2
-
-
Section A [ Verbal ] - Roots words 2
-
Roots words [ Prefix and Suffix ] 13 minLecture35.1
-
Roots words [ Prefix and Suffix ] NotesLecture35.2
-
-
Section A [ Verbal ] - Idioms & Phrases 2
-
Idioms & Phrases – 1 24 minLecture36.1
-
Idioms & Phrases – 2 25 minLecture36.2
-
-
Section A [ Verbal ] - Ability Extra 9
-
Introduction to Verbal Ability + Tenses Part #1 12 minLecture37.1
-
Tenses Part #1 11 minLecture37.2
-
Tenses [ Notes + Solved Examples + Practice Problem ]Lecture37.3
-
Error Detection and Correction + Sentence Completion #1 14 minLecture37.4
-
Sentence Completion Part #2 13 minLecture37.5
-
Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]Lecture37.6
-
Sentence Completion [ Notes + Solved Examples + Practice Problem ]Lecture37.7
-
Assumption in Verbal Reasoning 14 minLecture37.8
-
Deduction in Verbal Reasoning 26 minLecture37.9
-
-
Section A [ Reasoning ] - Blood Relation 8
-
Blood Relation Part #1 12 minLecture38.1
-
Blood Relation Part #2 10 minLecture38.2
-
Blood Relation Part #3 10 minLecture38.3
-
Blood Relation Part #4 09 minLecture38.4
-
Blood Relation Part #5 09 minLecture38.5
-
Blood Relation Practice Questions 23 minLecture38.6
-
Blood Relation [ Notes ]Lecture38.7
-
Blood Relation [ Practice Problem ]Lecture38.8
-
-
Section A [ Reasoning ] - Coding Decoding 7
-
Coding Decoding Part #1 07 minLecture39.1
-
Coding Decoding Part #2 08 minLecture39.2
-
Coding Decoding Part #3 08 minLecture39.3
-
Coding Decoding Part #4 06 minLecture39.4
-
Coding Decoding Part #5 10 minLecture39.5
-
Coding Decoding [Notes]Lecture39.6
-
Coding Decoding [ Practice Problem]Lecture39.7
-
-
Section A [ Reasoning ] - Data Sufficiency 3
-
Data Sufficiency 09 minLecture40.1
-
Data Sufficiency [ Practice Problem ]Lecture40.2
-
Data Sufficiency [ Notes ]Lecture40.3
-
-
Section A [ Reasoning ] - Direction 9
-
Direction Part #1 07 minLecture41.1
-
Direction Part #2 08 minLecture41.2
-
Direction Part #3 09 minLecture41.3
-
Direction Part #4 04 minLecture41.4
-
Direction Part #5 07 minLecture41.5
-
Direction Part #6 06 minLecture41.6
-
Direction Practice Question 21 minLecture41.7
-
Direction [ Notes ]Lecture41.8
-
Direction [ Practice Problem ]Lecture41.9
-
-
Section A [ Reasoning ] - Number Series 6
-
Number Series Part #1 09 minLecture42.1
-
Number Series Part #2 08 minLecture42.2
-
Number Series Part #3 08 minLecture42.3
-
Number Series Part #4 04 minLecture42.4
-
Number Series [Notes]Lecture42.5
-
Number Series [Practice Problems]Lecture42.6
-
-
Section A [ Reasoning ] - Seating Arrangement 8
-
Seating Arrangement Part #1 08 minLecture43.1
-
Seating Arrangement Part #2 12 minLecture43.2
-
Seating Arrangement Part #3 11 minLecture43.3
-
Seating Arrangement Part #4 06 minLecture43.4
-
Seating Arrangement Part #5 07 minLecture43.5
-
Seating Arrangement Part #6 06 minLecture43.6
-
Seating Arrangement [Notes]Lecture43.7
-
Seating Arrangement [ Practice Problem ]Lecture43.8
-
-
Section A [ Reasoning ] - Visual Reasoning 6
-
Visual Reasoning Part #1 10 minLecture44.1
-
Visual Reasoning Part #2 12 minLecture44.2
-
Visual Reasoning Part #3 11 minLecture44.3
-
Visual Reasoning Part #4 11 minLecture44.4
-
Visual Reasoning [ Notes ]Lecture44.5
-
Visual Reasoning [ Practice Problem ]Lecture44.6
-
-
Section A [ Reasoning ] - Odd man out and series 2
-
Odd man out and series -1 19 minLecture45.1
-
Odd man out and series – 2 17 minLecture45.2
-
-
Section A [ Reasoning ] - Verbal Reasoning : Analogy 3
-
Analogy – 1 22 minLecture46.1
-
Analogy – 2 26 minLecture46.2
-
Analogy – 3 28 minLecture46.3
-
-
Section A - [Computer Fundamental] 12
-
1. Introduction 10 minLecture47.1
-
2. Computer Memory and its types 14 minLecture47.2
-
3. Motherboard and its component 08 minLecture47.3
-
4. Ports, Cables and Graphic Card 09 minLecture47.4
-
5. Storage Devices 07 minLecture47.5
-
6. Number System 11 minLecture47.6
-
7. Machine Language 06 minLecture47.7
-
8. Operating Systems 10 minLecture47.8
-
9. AR and VR 07 minLecture47.9
-
10. Computer Virus 08 minLecture47.10
-
Computer Fundamental [Notes]Lecture47.11
-
Computer Fundamental Practice ProblemLecture47.12
-
-
Section A - [Concepts of Programming] 3
-
Concepts of Programming NotesLecture48.1
-
Concepts of Programming Practice Problem 1Lecture48.2
-
Concepts of Programming Practice Problem 2Lecture48.3
-
-
Section B - [ C Programming ] 32
-
C Programming Part #1 10 minLecture49.1
-
C Programming Part #2 12 minLecture49.2
-
C Programming Part #3 16 minLecture49.3
-
C Programming Part #4 21 minLecture49.4
-
C Programming Part #5 23 minLecture49.5
-
C Programming Part #6 15 minLecture49.6
-
C Programming Part #7 15 minLecture49.7
-
C Programming Part #8 14 minLecture49.8
-
C Programming Part #9 15 minLecture49.9
-
C Programming Part #10 16 minLecture49.10
-
C Programming Part #11 12 minLecture49.11
-
C Programming Part #12 12 minLecture49.12
-
C Programming Part #15 15 minLecture49.13
-
C Programming Part #14 13 minLecture49.14
-
C Programming Part #13 19 minLecture49.15
-
C Programming Part #16 12 minLecture49.16
-
C Programming Part #17 13 minLecture49.17
-
C Programming Part #18 11 minLecture49.18
-
C Programming Part #19 16 minLecture49.19
-
C Programming Part #20 13 minLecture49.20
-
C Programming Part #21 23 minLecture49.21
-
C Programming Part #22 15 minLecture49.22
-
C Programming Part #23 14 minLecture49.23
-
C Programming Part #24 17 minLecture49.24
-
C Programming Part #25 11 minLecture49.25
-
C Programming Part #26 13 minLecture49.26
-
C Programming Part #27 14 minLecture49.27
-
C Programming Part #28 10 minLecture49.28
-
C Programming Part #29 10 minLecture49.29
-
C Programming Part #30 11 minLecture49.30
-
C Programming [Notes]Lecture49.31
-
C Programming Practice ProblemLecture49.32
-
-
Section B - [ Object Oriented Programming (C++) ] 27
-
Object Oriented Programming (C++) SampleLecture50.1
-
Object Oriented Programming (C++)Lecture50.2
-
Object Oriented Programming (C++) Practice ProblemLecture50.3
-
Introduction to C++ 11 minLecture50.4
-
Input & Output in C++ 14 minLecture50.5
-
Difference between Structure in C & C++ 14 minLecture50.6
-
Class & Objects C++ 14 minLecture50.7
-
Inspector, Mutators, Facilitators 16 minLecture50.8
-
Contructor & Destructor 15 minLecture50.9
-
Default Arguments & Inline Function 16 minLecture50.10
-
Array of Objects 16 minLecture50.11
-
Dynamic Memory Allocation 15 minLecture50.12
-
Static Member and function 15 minLecture50.13
-
Exception handling 18 minLecture50.14
-
Composition 22 minLecture50.15
-
Friend Class and function 13 minLecture50.16
-
Function Overloading 15 minLecture50.17
-
Operator Overloading 13 minLecture50.18
-
Copy Constructor 05 minLecture50.19
-
Inheritance 15 minLecture50.20
-
Pure Virtual Function 13 minLecture50.21
-
Types of Inheritance 26 minLecture50.22
-
Virtual Function 12 minLecture50.23
-
Template 15 minLecture50.24
-
RTTI 11 minLecture50.25
-
Casting Operators 19 minLecture50.26
-
Dynamic Array of Object 13 minLecture50.27
-
-
Section B - [ C Snippet Problems with Solutions Video] 10
-
Code Snippet 1 – 5 21 minLecture51.1
-
Code Snippet 6 -10 20 minLecture51.2
-
Code Snippet 11 – 15 19 minLecture51.3
-
Code Snippet 16 – 20 15 minLecture51.4
-
Code Snippet 21 – 25 23 minLecture51.5
-
Code Snippet 26 – 30 18 minLecture51.6
-
Code Snippet 31 – 35 25 minLecture51.7
-
Code Snippet 36 – 40 25 minLecture51.8
-
Code Snippet 41 – 45 13 minLecture51.9
-
Code Snippet 46 – 50 18 minLecture51.10
-
-
Section B - [ Operating System ] 40
-
1. Introduction of Operation System , Function , Objectives 18 minLecture52.1
-
2. OS Structure [ Monolithic , Layer , Microkernel ] 17 minLecture52.2
-
3. System Call its Types 10 minLecture52.3
-
4. Process State Transition Diagram 11 minLecture52.4
-
5. PCB ( Process Control Block ) 12 minLecture52.5
-
6. Threading and Multi-Threading 09 minLecture52.6
-
7. Scheduler and Types of Process Scheduling Algorithm 13 minLecture52.7
-
8. Various Scheduling Criteria 21 minLecture52.8
-
9. SJF – Scheduling Criteria 16 minLecture52.9
-
10. Priority Scheduling Non-Preemptive 15 minLecture52.10
-
11. SRTN Scheduling Algo 18 minLecture52.11
-
12. Round Robin Scheduling Criteria 15 minLecture52.12
-
13. Priority Scheduling Preemptive 14 minLecture52.13
-
14. Process Syncronization and IPC 13 minLecture52.14
-
15. Deadlock 08 minLecture52.15
-
15. 1 – Dead Lock Recovery 05 minLecture52.16
-
15.2 – Bankers algorithm with Solve Example Part 1 13 minLecture52.17
-
15.3 – Bankers Algorithm Part 2 (Resource Request algorithm) 09 minLecture52.18
-
16. Semaphore Producer Consumer Problem 12 minLecture52.19
-
17. OS Reader Writer & Dinning Philospher Problem 16 minLecture52.20
-
18. Memory Management & Partitioning 11 minLecture52.21
-
19. Memory Allocation Techniques 11 minLecture52.22
-
20. Paging & TLB 17 minLecture52.23
-
21. Segmentation 14 minLecture52.24
-
22. Virtual Memory & Demand Paging 13 minLecture52.25
-
23. Pagen Replacement Algorithms 16 minLecture52.26
-
24. File Managment File System 09 minLecture52.27
-
25. Disk Allocation Methods 11 minLecture52.28
-
26. Disk scheduling Algorithm 06 minLecture52.29
-
27. FCFS Disk Scheduling Algorithm 13 minLecture52.30
-
28. SSTF Disk Scheduling Algorithm 07 minLecture52.31
-
29. SCAN Disk Scheduling Algorithm 06 minLecture52.32
-
30. C SCAN Disk Scheduling Algorithm 05 minLecture52.33
-
31. Look Disk Scheduling Algorithm 04 minLecture52.34
-
32. C Look Disk Scheduling Algorithm 04 minLecture52.35
-
33. All in One ( FCFS SSTF SCAN CSCAN LOOK CLOOK ) 08 minLecture52.36
-
34. Input Output Management 10 minLecture52.37
-
Operating System Sample [Notes]–Lecture52.38
-
Operating System [Notes]Lecture52.39
-
Operating System Practice ProblemLecture52.40
-
-
Section B -[Data Community & Networking] 18
-
1. Introduction To Computer Networks 11 minLecture53.1
-
2. Network Topology Types 12 minLecture53.2
-
3. Network Connecting Devices [ Repeater , Hub , Bridge , Switch ] 10 minLecture53.3
-
4. Types of Network – LAN, MAN, WAN 07 minLecture53.4
-
5. Virtual LAN 07 minLecture53.5
-
6. OSI Reference Model 06 minLecture53.6
-
7. TCP-IP Reference model 06 minLecture53.7
-
8. IPv4 Header Format 12 minLecture53.8
-
9. IP Address v/s MAC Address 08 minLecture53.9
-
10. IPv4 v/s IPv6 10 minLecture53.10
-
11. ARP & RARP 07 minLecture53.11
-
12. Simple Mail Transfer Protocol – SMTP 05 minLecture53.12
-
13. User Datagram Protocol 07 minLecture53.13
-
14. File Transfer Protocol – FTP 05 minLecture53.14
-
15. Domain Name Server – DNS 06 minLecture53.15
-
16. Hypertext Transfer Protocol – HTTP 08 minLecture53.16
-
Computer Network [Notes]Lecture53.17
-
Computer Network Practice ProblemLecture53.18
-
-
Section B - [ Basics of Big Data and Artificial Intelligence ] 27
-
Agent and Peas Description [ Artificial Intelligence ] 08 minLecture54.1
-
Types of Agent [ Artificial Intelligence ] 08 minLecture54.2
-
Learning Agent [ Artificial Intelligence ] 08 minLecture54.3
-
Introduction to Machine Learning [ Artificial Intelligence ] 12 minLecture54.4
-
Types of Machine Learning [ Artificial Intelligence ] 05 minLecture54.5
-
Introduction to Fuzzy Logic [ Artificial Intelligence ] 04 minLecture54.6
-
Introduction to Neural Network [ Artificial Intelligence ] 06 minLecture54.7
-
Genetic Algorithm [ Artificial Intelligence ] 05 minLecture54.8
-
Introduction to Big Data [ Big Data ] 06 minLecture54.9
-
Hadoop Part 1 [ Big Data ] 10 minLecture54.10
-
Hadoop Part 2 [ Big Data ] 10 minLecture54.11
-
Map Reduce [ Big Data ] 11 minLecture54.12
-
Introduction to No SQL [ Big Data ] 08 minLecture54.13
-
Key Value Stores 06 minLecture54.14
-
Column Store Database 05 minLecture54.15
-
Document Database 05 minLecture54.16
-
Graph Database 07 minLecture54.17
-
Data Stream Management System 08 minLecture54.18
-
Sampling Technique – Part 1 05 minLecture54.19
-
Sampling Technique – Part 2 06 minLecture54.20
-
Introduction to Datawarehouse [ Big Data ] 10 minLecture54.21
-
Meta Data [ Big Data ] 04 minLecture54.22
-
Data mart [ Big Data ] 06 minLecture54.23
-
Architecture of Data Warehouse [ Big Data ] 07 minLecture54.24
-
OLAP vs OLTP [ Big Data ] 07 minLecture54.25
-
ETL – Extract Transform and Load [ Big Data ] 08 minLecture54.26
-
What is Olap Operation [ Big Data ] 08 minLecture54.27
-
-
Section B - [ Data Structures ] 89
Yet To Update
-
Introduction [ Introduction ] 08 minLecture55.1
-
Types Of Data Structures [ Introduction ] 06 minLecture55.2
-
Operations Of Data Structures [ Introduction ] 06 minLecture55.3
-
Concept Of Abstract Data Type [ Introduction ] 06 minLecture55.4
-
Arrays – Part 1 [ Introduction ] 16 minLecture55.5
-
Arrays – Part 2 [ Introduction ] 19 minLecture55.6
-
Divide & Conquer With Example 06 minLecture55.7
-
DP Approaches -1 10 minLecture55.8
-
DP Approaches -2 07 minLecture55.9
-
Asymptotic Notations 03 minLecture55.10
-
Time Complexity and Big O 22 minLecture55.11
-
Space Complexity 14 minLecture55.12
-
Hashing Concept [ Searching & Sorting ] 06 minLecture55.13
-
Hashing Collision [ Searching & Sorting ] 12 minLecture55.14
-
Linear Probing – #1 [ Searching & Sorting ] 13 minLecture55.15
-
Linear Probing – #2 [ Searching & Sorting ] 12 minLecture55.16
-
Linear Probing With Collisions – Solved [ Searching & Sorting ] 10 minLecture55.17
-
Linear + Quadratic Probing – Solved Example [ Searching & Sorting ] 14 minLecture55.18
-
Searching & Sorting Introduction [ Searching & Sorting ] 11 minLecture55.19
-
Selection Sorting – #1 [ Searching & Sorting ] 12 minLecture55.20
-
Selection Sorting – #2 [ Searching & Sorting ] 12 minLecture55.21
-
Insertion Sort – #1 [ Searching & Sorting ] 12 minLecture55.22
-
Insertion Sort – #2 [ Searching & Sorting ] 12 minLecture55.23
-
Merge Sort – #1 [ Searching & Sorting ] 12 minLecture55.24
-
Merge Sort – #2 [ Searching & Sorting ] 12 minLecture55.25
-
Merge Sort – #3 [ Searching & Sorting ] 10 minLecture55.26
-
Quick Sort – #1 [ Searching & Sorting ] 10 minLecture55.27
-
Quick Sort – #2 [ Searching & Sorting ] 09 minLecture55.28
-
Radix Sort – #1 [ Searching & Sorting ] 10 minLecture55.29
-
Radix Sort – #2 [ Searching & Sorting ] 10 minLecture55.30
-
Introduction To Stack [ Stacks ]Lecture55.31
-
Operations Of Stack ADT [ Stacks ] 06 minLecture55.32
-
Operations Of Queue ADT [ Queues ] 04 minLecture55.33
-
Stack Implementation Using Array Part – 1 [ Stacks ] 10 minLecture55.34
-
Queue Implementation Using Array Part – 1 [ Queues ] 11 minLecture55.35
-
Queue Implementation Using Array Part – 2 [ Queues ] 09 minLecture55.36
-
Circular Queue Implementation Part – 1 [ Queues ] 12 minLecture55.37
-
Circular Queue Implementation Part – 2 [ Queues ] 09 minLecture55.38
-
Introduction To Linked List [ Linked Lists ] 05 minLecture55.39
-
Array Vs Linked List [ Linked Lists ] 07 minLecture55.40
-
Linked List Implementation Part – 1 [ Linked Lists ] 17 minLecture55.41
-
Linked List Implementation Part – 2 [ Linked Lists ] 10 minLecture55.42
-
Linked List Implementation Part – 3 [ Linked Lists ] 10 minLecture55.43
-
Linked List Implementation Part – 4 [ Linked Lists ] 14 minLecture55.44
-
Linked List Implementation Part – 5 [ Linked Lists ] 09 minLecture55.45
-
Linked List Implementation Part – 6 [ Linked Lists ] 10 minLecture55.46
-
Stack Linked List #1 09 minLecture55.47
-
Stack Linked List #2 06 minLecture55.48
-
Queue Using Linked List Part – 1 [ Linked Lists ] 10 minLecture55.49
-
Queue Using Linked List Part – 2 [ Linked Lists ] 07 minLecture55.50
-
Circular Queue Using Linked List [ Linked Lists ] 10 minLecture55.51
-
Doubly Linked List – Part 1 [ Linked Lists ] 14 minLecture55.52
-
Doubly Linked List – Part 2 [ Linked Lists ] 08 minLecture55.53
-
Doubly Linked List – Part 3 [ Linked Lists ] 10 minLecture55.54
-
Doubly Linked List – Part 4 [ Linked Lists ] 10 minLecture55.55
-
Doubly Linked List – Part 5 [ Linked Lists ] 12 minLecture55.56
-
Introduction to Tree Data Structure & Binary Tree [ Trees ] 06 minLecture55.57
-
Binary Tree Implementation Part 1 – Insertion & Traversing [ Trees ] 14 minLecture55.58
-
Binary Tree Implementation Part 2 – Traversing & Deletion [ Trees ] 12 minLecture55.59
-
Binary tree Traversal [ Trees ] 14 minLecture55.60
-
Tree traversal methods: Pre, post and in-order traversal [ Trees ] 14 minLecture55.61
-
(Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Trees ] 11 minLecture55.62
-
Height Balaced Binary Search Tree [ Trees ] 12 minLecture55.63
-
AVL Tree [ Trees ] 16 minLecture55.64
-
AVL Tree Solved Example – #1 [ Trees ] 17 minLecture55.65
-
AVL Tree Solved Example – #2 [ Trees ] 17 minLecture55.66
-
B-Tree Introduction [ Trees ] 13 minLecture55.67
-
B-Tree Solved Example – #1 [ Trees ] 14 minLecture55.68
-
B-Tree Solved Example – #2 [ Trees ] 12 minLecture55.69
-
Huffman Coding [ Trees ] 07 minLecture55.70
-
Graphs Introduction [ Graphs ] 13 minLecture55.71
-
BFS & DFS – #1 [ Graphs ] 14 minLecture55.72
-
BFS & DFS – #2 [ Graphs ] 12 minLecture55.73
-
Topological Sorting [ Graphs ] 11 minLecture55.74
-
Topological Sorting – Solved Example [ Graphs ] 09 minLecture55.75
-
Recursion – Winding & Unwinding [Recursion and Storage Management] 11 minLecture55.76
-
Introduction to Buddy System [Recursion and Storage Management] 10 minLecture55.77
-
Problems on Buddy System [Recursion and Storage Management] 08 minLecture55.78
-
Binary Search [Recursion and Storage Management] 10 minLecture55.79
-
Linear Search [Recursion and Storage Management] 05 minLecture55.80
-
Heap Data Structure 11 minLecture55.81
-
Min & Max Heap 11 minLecture55.82
-
Infix Notation & Conversion 11 minLecture55.83
-
Prefix, Postfix Notation & Conversion 12 minLecture55.84
-
Prim’s & Kruskal’s #1 18 minLecture55.85
-
Prim’s & Kruskal’s #2 10 minLecture55.86
-
Data Structures & AlgorithmsLecture55.87
-
Practice Problems Set 1 – Data Structures & AlgoLecture55.88
-
Practice Problems Set 2 – Data Structures & AlgoLecture55.89
-
-
Section B - [ AI Notes ] 2
-
Artificial Intelligence NotesLecture56.1
-
Artificial Intelligence Practice ProblemsLecture56.2
-
-
Section B - [ Big Data Notes ] 5
-
Module 1 – Introduction to Big DataLecture57.1
-
Module 2 _ Hadoop HDFS and MapReduceLecture57.2
-
Module 3 _ NO SQLLecture57.3
-
Module 4 _ Mining Data StreamLecture57.4
-
Module 5 _ Real Time Big Data ModelsLecture57.5
-
-
Section B - [ AI Notes for CCAT Exam ] 5
-
AI Domain [ Data Science , Computer Vision , NLP ]Lecture58.1
-
Basics of Artificial IntelligenceLecture58.2
-
Future of AI TrendsLecture58.3
-
Introduction to Neural Networks, Fuzzy Logic, and Genetic AlgorithmsLecture58.4
-
Ways to Implement AI – Machine Learning & Deep LearningLecture58.5
-
-
Section B - [ Big Data Notes for CCAT Exam ] 1
-
Big Data Notes for CCAT ExamLecture59.1
-
-
Section C - [ Digital Electronics ] 22
-
1 – Number System Intro 11 minLecture60.1
-
2 – Binary Number System 11 minLecture60.2
-
3 – Octal Number System 09 minLecture60.3
-
4 – Hexadecimal Number System 07 minLecture60.4
-
5 – POS and SOP 13 minLecture60.5
-
6 – K-Map 1 17 minLecture60.6
-
7 – K-Map 2 10 minLecture60.7
-
8 – Logic Gates – 1 12 minLecture60.8
-
9 – Logic Gates – 2 12 minLecture60.9
-
10 – Universal Gates 13 minLecture60.10
-
11. Arithmetic Operations in Binary 08 minLecture60.11
-
12 – Arithmetic Operations using 1_s and 2_s compliment 13 minLecture60.12
-
13 – Arithmetic Operations using 9s and 10s 10 minLecture60.13
-
14 – Excess – 3 05 minLecture60.14
-
15 – Gray Code 07 minLecture60.15
-
16 – Half and Full Adder 13 minLecture60.16
-
17 – Multiplexer and Demultiplexer 06 minLecture60.17
-
18 – SR Flip Flop 07 minLecture60.18
-
19 – JK Flip Flop 05 minLecture60.19
-
20 – D and T Flip Flop 06 minLecture60.20
-
Digital Electronics [Notes]Lecture60.21
-
Digital Electronics Practice ProblemLecture60.22
-
-
Section C - [ Computer Architecture ] 49
-
01 – Introduction 09 minLecture61.1
-
02 – Von Neumann Architecture 13 minLecture61.2
-
03 – Binary Numeric Data Representation 07 minLecture61.3
-
04 – IEEE-754 Floating Point Number Representation 17 minLecture61.4
-
05 – Booth’s Algorithm – Part 1 15 minLecture61.5
-
06 – Booth’s Algorithm – Part 2 10 minLecture61.6
-
07 – Booth’s Algorithm – Part 3 08 minLecture61.7
-
08 – Restoring Division – Part 1 18 minLecture61.8
-
09 – Restoring Division – Part 2 10 minLecture61.9
-
10 – Non-Restoring Division – Part 1 12 minLecture61.10
-
11 – Non-Restoring Division – Part 2 10 minLecture61.11
-
12 – Addressing Modes – Part 1 11 minLecture61.12
-
13 – Addressing Modes – Part 2 13 minLecture61.13
-
14 – Instruction Cycles & Interrupts Mechanism 07 minLecture61.14
-
15 – Hardwired Control Unit 08 minLecture61.15
-
16 – Microprogrammed Control Unit 08 minLecture61.16
-
17 – Hardwired vs Microprogrammed 10 minLecture61.17
-
18 – Wilkie’s Control 10 minLecture61.18
-
19 – RISC Microprocessor 12 minLecture61.19
-
20 – CISC Microprocessor 09 minLecture61.20
-
21 – Memory And It’s Characteristics 09 minLecture61.21
-
22 – DRAM 07 minLecture61.22
-
23 – SRAM 08 minLecture61.23
-
24 – Memory Hierarchy And Locality Of Reference 13 minLecture61.24
-
25 – Cache Memory 07 minLecture61.25
-
26 – Cache Coherence 11 minLecture61.26
-
27 – Cache Coherence Strategies 09 minLecture61.27
-
28 – MESI Protocol 11 minLecture61.28
-
29 – Interleaved Memory 10 minLecture61.29
-
30 – Virtual Memory & Paging Concept 10 minLecture61.30
-
31 – Demand Paging 11 minLecture61.31
-
32 – Memory Segmentation 10 minLecture61.32
-
33 – IO Module, Functions, Requirement & Types 11 minLecture61.33
-
34 – Programmed IO 12 minLecture61.34
-
35 – Interrupt Driven IO 11 minLecture61.35
-
36 – DMA Driven IO 13 minLecture61.36
-
37 – Bus & Bus Arbitration 11 minLecture61.37
-
38 – Daisy Chaining 08 minLecture61.38
-
39 – Polling Methods 07 minLecture61.39
-
40 – Bus Arbitration Independent Request 04 minLecture61.40
-
41 – Parallel Processing & Applications 13 minLecture61.41
-
42 – Flynn’s Classfication 10 minLecture61.42
-
43 – Instruction Level Parallelism 08 minLecture61.43
-
44 – Superscalar Architecture 10 minLecture61.44
-
45 – VLIW 10 minLecture61.45
-
46 – Superscalar vs VLIW 05 minLecture61.46
-
47 – Out Of Order Execution 09 minLecture61.47
-
Computer Architecture [ Notes ]Lecture61.48
-
Computer Architecture MCQLecture61.49
-
-
Section C - [ Microprocessor ] 4
-
Introduction to microprocessor 05 minLecture62.1
-
Von Neumann Architecture 13 minLecture62.2
-
RISC Microprocessor 12 minLecture62.3
-
CISC Microprocessor 09 minLecture62.4
-
-
Section C - [ Microprocessor ] 8086 (Module 1) 10
-
Introduction to Microprocessor 28 minLecture63.1
-
8086 Memory banking [8086] 10 minLecture63.2
-
8086 Memory segmentation [8086] 07 minLecture63.3
-
8086 FLAG REGISTER [8086] 17 minLecture63.4
-
Architecture of 8086 [8086] 14 minLecture63.5
-
Minimum Mode 20 minLecture63.6
-
Timing Diagram 12 minLecture63.7
-
Maximum Mode 28 minLecture63.8
-
8086 interrupts [8086] 14 minLecture63.9
-
Design 8086 Memory Mapping Sum [ VV IMP ] 19 minLecture63.10
-
-
Section C - [ Microprocessor ] 8086 (Module 2) 17
-
8086 Addressing modes [8086] 13 minLecture64.1
-
Data Transfer Instruction 10 minLecture64.2
-
XLAT Translation 07 minLecture64.3
-
DAA and AAA Instruction 16 minLecture64.4
-
Push and POP Instruction 04 minLecture64.5
-
String Instruction 20 minLecture64.6
-
Logical Operation 09 minLecture64.7
-
Arithmetic instructions 14 minLecture64.8
-
8086 Rotate instructions [8086] 12 minLecture64.9
-
8086 Branch instructions [8086] 17 minLecture64.10
-
Programmer Model 14 minLecture64.11
-
Basics of Programming- Addition of 2 Numbers 32 minLecture64.12
-
ALP for Exchange Content of Two Memory Block 11 minLecture64.13
-
Reverse a String- ALP Program 14 minLecture64.14
-
Find a Character in the Given String 11 minLecture64.15
-
ALP to Sort a Array of 10 in Ascending Order 25 minLecture64.16
-
Previous Year ALP All Codes Solution NotesLecture64.17
-
-
Section C - [ Microprocessor ] 8086 (Module 3) 7
-
8255 Architecture Modes and Control Word 19 minLecture65.1
-
Introduction to 8255 + Pin Diagram 08 minLecture65.2
-
8257 DMA CONTROLLER 16 minLecture65.3
-
Introduction to 8259 + Architecture 15 minLecture65.4
-
8259 Initialization 09 minLecture65.5
-
A0 Pin of 8259 04 minLecture65.6
-
ICW and OCW in 8259 22 minLecture65.7
-
-
Section C - [ Microprocessor ] Notes 2
-
Microprocessor [ Notes ]Lecture66.1
-
Microprocessor Practice ProblemLecture66.2
-
-
Quiz 6
-
Section A – Quiz #1 [Free]Lecture67.1
-
Section A – Quiz #2 [Premium]Lecture67.2
-
Section B – Quiz #1 [Free]Lecture67.3
-
Section B – Quiz #2 [Premium]Lecture67.4
-
Section C – Quiz #1 [Free]Lecture67.5
-
Section C – Quiz #2 [Premium]Lecture67.6
-
-
Previous Year Leak Papers 6
-
Section A-17 December 2017Lecture68.1
-
Section A8 18 dec 2016 morningLecture68.2
-
Section B – 17 December 2017Lecture68.3
-
Section B 10 December 2017Lecture68.4
-
Section B – 18 June 2017Lecture68.5
-
SectionB-23-june-2019Lecture68.6
-
-
CCAT Previous Year Leak Paper Solution 8
-
CCAT Section A SOLUTION – 2016Lecture69.1
-
CCAT Section A Solution – DEC 2017Lecture69.2
-
CCAT Sec A DEC 2017 Day 2 SolutionLecture69.3
-
CCAT Sec A June 2019 Paper SolutionLecture69.4
-
CCAT Sec B June 2017 SolutionLecture69.5
-
CCAT SEC B Dec 2017 SolutionLecture69.6
-
CCAT Sec B Dec 2017 Day 2 SolutionLecture69.7
-
CCAT Sec B June 2019 SolutionsLecture69.8
-

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.


