History

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-architecture/basics-of-coa/evolution-history/asset-history after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive historical overview of the foundations of digital logic and computer architecture. It begins by establishing the roots of Boolean algebra, introduced by George Boole in the 19th century, which underpins modern binary digital systems. The lecture details Boole's seminal works and the specific logical operations defined within his algebra. The narrative then advances to the mid-20th century, exploring the theoretical underpinnings of computation through the Church-Turing thesis and the Turing machine model. It highlights the pivotal role of Claude Shannon in applying these logical rules to physical switching circuits in the 1930s. Finally, the session concludes by defining the von Neumann architecture, outlining the standard components of a modern electronic digital computer as described in 1945.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The session opens with a slide titled Boolean algebra, explaining that modern digital systems utilize binary signals with just two discrete values. The instructor discusses George Boole, underlining his first book The Mathematical Analysis of Logic (1847) and his later work An Investigation of the Laws of Thought (1854) on the slide to emphasize their importance. The lecture defines Boolean algebra as a branch where variables take truth values true and false, usually denoted as 1 and 0 respectively. It contrasts this with elementary algebra, listing the main operations: conjunction denoted as wedge, disjunction denoted as vee, and negation denoted as not. The instructor emphasizes these definitions while pointing to the text on the screen, ensuring students understand the fundamental logical operators used in digital design.

  2. 2:00 – 4:20 02:00-04:20

    The lecture progresses to the Turing Machine, introducing the Church-Turing thesis which states that any algorithmic procedure that can be carried out by human beings or a computer can be carried out by a Turing machine, citing the year 1936. Portraits of Alan Turing and Alonzo Church are displayed to identify the key figures. Next, the topic shifts to Digital System, noting that in the 1930s, while studying switching circuits, Claude Shannon observed that one could apply the rules of Boole's algebra. The slide highlights since 1938 Claude Shannon father of information theory as the figure who organized and systematized Boole's work for the design of digital hardware. Finally, the von Neumann architecture is presented as a computer architecture based on a 1945 description by John von Neumann. The slide lists essential components including a processing unit with an arithmetic logic unit, a control unit, memory that stores data and instructions, external mass storage, and input and output mechanisms.

The video constructs a chronological narrative of computer science history, moving from abstract mathematics to physical engineering. It starts with the mathematical logic foundation laid by George Boole in the 1840s and 1850s, establishing the binary nature of digital signals. It then bridges to the theoretical computer science era with the Church-Turing thesis in 1936, defining the limits of computation. The practical application is shown through Claude Shannon's work in the late 1930s, connecting abstract logic to physical switching circuits and gates. The lesson concludes with the architectural standardization provided by John von Neumann in 1945, which integrated these logical and theoretical concepts into a functional computer design. This progression moves from abstract logic to theoretical models, then to physical implementation, and finally to system architecture, providing a complete picture of how modern computers evolved.

Loading lesson…