Computer Classification

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-2-coa/basics-of-coa/computer-classification-flynns-taxonomy/asset-computer-classification after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: Introduction to CN, Data Communication, 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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

  1. 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. 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.

  3. 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.

  4. 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.

Loading lesson…