Computer Classification
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces computer classification by contrasting fixed-program embedded systems with stored-program general-purpose computers. It begins by defining embedded systems as dedicated devices whose functionality is permanently programmed into a chipset, using examples such as washing machines, microwaves, calculators, digital thermometers, blood-pressure monitors, bathroom scales, subway stations, glucose meters, smartwatches, portable radios, and ATMs. The instructor emphasizes that embedded systems contain small microprocessors hardwired for specific tasks and cannot be reprogrammed for general-purpose computing. The lesson then transitions to stored-program computers based on the Von Neumann architecture, proposed by John von Neumann in 1945. The stored-program concept states that both program instructions and data are kept in the same binary memory, allowing a general-purpose computer to run different programs. A diagram of the Von Neumann architecture shows the CPU, registers, and main memory, with red annotations highlighting sequential execution. The instructor explains that because the CPU processes instructions one at a time and shares the same bus for instruction and data, this creates the Von Neumann bottleneck. As an exam key point, the lecture classifies the Von Neumann architecture as SISD (Single Instruction, Single Data). The final section introduces Flynn's Taxonomy of Computer Architecture from 1966, listing the four categories SISD, SIMD, MISD, and MIMD. It also contrasts mainframe computers, which target throughput for critical applications and bulk data processing such as IBM zSeries, with supercomputers and high-performance computing systems that target speed through parallel processing and are measured in FLOPS, with PARAM 8000 cited as an example. The taxonomy slide gives examples such as GPUs for SIMD and modern multi-core CPUs for MIMD.
Chapters
0:00 – 2:00 00:00-02:00
The opening slide is titled 'Fixed Program Computers / Dedicated device / Embedded system.' It defines embedded systems as devices designed for specific tasks, with functionality permanently programmed into a chipset, citing washing machines and microwaves. A second bullet states that embedded systems contain small microprocessors hardwired to perform only specific tasks and cannot be reprogrammed for general-purpose computing. A grid of example devices is shown, including a calculator, digital thermometer, blood-pressure monitor, bathroom scale, subway station, glucose meter kit, smartwatch, portable radio, and an ATM. Red circles and arrows are used to highlight specific components in the embedded system examples.
2:00 – 5:00 02:00-05:00
The lecture transitions to a slide titled 'Stored Program Computers / General Purpose Computer / Von Neumann Architecture.' It presents the stored-program concept proposed by John von Neumann in 1945, stating that both program instructions and data are stored in the same binary memory. A diagram illustrates the Von Neumann architecture, including CPU, registers, and main memory, alongside a portrait of John von Neumann. The instructor explains sequential execution as the 'bottleneck,' where the CPU processes instructions one at a time, and defines the Von Neumann bottleneck as instruction and data sharing the same bus. A red circle with a cross marks the memory block in the CPU diagram, highlighting shared storage.
5:00 – 10:00 05:00-10:00
The lecture continues with the Von Neumann architecture, emphasizing that it is classified as SISD (Single Instruction, Single Data) due to its sequential nature. It then introduces Flynn's Taxonomy of Computer Architecture from 1966, listing the four categories SISD, SIMD, MISD, and MIMD alongside a portrait of Michael J. Flynn. The segment also contrasts mainframe computers, which target throughput for critical applications and bulk data processing such as IBM zSeries, with supercomputers and high-performance computing systems that target speed through parallel processing and are measured in FLOPS, with PARAM 8000 cited as an example. A comparison table highlights mainframes as data servers and supercomputers as number crunchers.
10:00 – 10:44 10:00-10:44
The final segment revisits Flynn's Taxonomy of Computer Architecture (1966), listing the four categories SISD, SIMD, MISD, and MIMD as an exam key point. Each category is paired with examples such as GPUs (Graphics Cards) for SIMD and modern multi-core CPUs for MIMD. Red handwritten marks, including a bracket around item 1 and arrows at items 3 and the 'Exam Key Point' line, act as teaching cues. The later frames switch back to a slide titled 'Fixed Program Computers / Dedicated device / Embedded system' with bullets for 'Embedded Systems:' and 'Characteristics:', reinforcing the initial classification.
The lecture builds a clear progression from fixed-program embedded systems to stored-program general-purpose computers, then to Flynn's taxonomy. The central idea is that computer classification depends on how programs and data are handled: embedded systems have hardwired, non-reprogrammable microprocessors for specific tasks, while Von Neumann machines store both instructions and data in the same binary memory. The Von Neumann bottleneck arises because the CPU processes instructions sequentially over a shared bus, leading to its SISD classification. Flynn's taxonomy then generalizes this into four categories based on instruction and data streams: SISD, SIMD, MISD, and MIMD. Mainframes and supercomputers are distinguished by their goals—throughput for critical, bulk data processing versus speed through parallel processing measured in FLOPS. For exam revision, students should remember the embedded system examples, the stored-program concept, the Von Neumann bottleneck, the SISD classification of Von Neumann architecture, and the four Flynn categories with their examples.

