What Computer Science Deals With

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/theory-of-computation/regular-language-properties/decidability-basics/asset-what-computer-science-deals-with after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. Paper 2 | 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, Run Time Environment
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video serves as a foundational introduction to the theoretical scope of Computer Science. The instructor, Sanchit Jain Sir, begins by delineating the boundaries of the discipline, explicitly stating that Computer Science is not concerned with the physical design or operational running of computers. Instead, he pivots to the core essence of the field: problem-solving. The lecture progresses by introducing a structured taxonomy of problems. A detailed flowchart is presented, categorizing problems first into solvable and unsolvable categories. The solvable problems are further subdivided into decidable and undecidable types, with decidable problems eventually branching into P type and NP type complexity classes. This progression establishes a clear framework for understanding how computer scientists approach and classify computational challenges, setting the stage for more advanced topics in algorithms and complexity theory.

Chapters

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

    The instructor starts the session by posing the fundamental question, "What computer science deals with?" displayed at the top of the slide. He immediately addresses common misconceptions by listing what the field does not cover. The slide explicitly lists "Don't" followed by specific exclusions: "So we do not study how to design a computer" and "We do not study how to run a computer." The instructor verbally reinforces these points, underlining the text on the screen to emphasize that Computer Science is distinct from Computer Engineering or IT operations, focusing instead on abstract concepts rather than physical hardware mechanics. He ensures students understand that the physical machine is not the primary object of study.

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

    Moving past the exclusions, the instructor introduces the positive definition of the field with a "Do" bullet point. He states, "We deal with problem solving," and explains that within the context of Computer Science, problems are categorized systematically. A hierarchical flowchart appears on the screen to visualize this classification. The diagram starts with "PROBLEM" at the top, branching into "SOLVABLE" and "UNSOLVABLE." The "SOLVABLE" branch further divides into "DECIDABLE" and "UNDECIDABLE," and finally, the "DECIDABLE" branch splits into "P TYPE" and "NP TYPE." This visual aid serves as a roadmap for the theoretical concepts that will be explored in subsequent lectures, highlighting the mathematical nature of the subject.

The lecture effectively narrows down the broad field of Computer Science by first eliminating hardware-related activities like designing or running computers, which are often confused with the discipline. It then focuses on the theoretical core: problem-solving. The instructor provides a foundational map by categorizing problems into solvable and unsolvable, and further into decidable and undecidable types, eventually leading to complexity classes like P and NP. This structured approach helps students understand the abstract nature of the subject and prepares them for the rigorous classification of algorithms and computational limits that define the field.

Loading lesson…