Class & Objects

Duration: 30 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-programming-languages/oops-with-c/classes-objects/asset-class-objects 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.

This lecture introduces Object-Oriented Programming Systems (OOPS) in C++, focusing on the foundational concepts of Classes and Objects. The instructor begins by contrasting the limitations of global variables in C programming with the encapsulation provided by classes. Through a series of code examples involving Global.h, Prog1.c, and Prog2.c, the lesson demonstrates how global variables are shared across memory locations, leading to potential issues with data persistence and modification. The video then transitions to C++, defining a class as a user-defined data type that serves as a blueprint for creating objects. Key distinctions are drawn between the class structure and object instances, emphasizing that while member functions are shared, data members possess separate memory for each object. The lecture concludes with a practical demonstration of access specifiers, showing how private data members are protected from direct external access and must be manipulated through public member functions like getters and setters.

Chapters

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

    The lecture opens with an introduction to OOPS using C++, specifically highlighting the topic of Classes and Objects. The instructor underlines 'Classes and Objects' on the slide and writes 'Encapsulation' underneath, signaling this as a primary focus. The visual content transitions to C code examples involving global variables, displaying files named Global.h, Prog1.c, and Prog2.c. The instructor begins to explain the problem with global variables in C programming, setting the stage for why encapsulation is necessary.

  2. 2:00 – 5:00 02:00-05:00

    The instructor details a C programming example where three files share a global variable 'x' declared in Global.h. The code shows that any function can modify the value of 'x', and these changes persist because all functions access the same memory location. Visual cues include red checkmarks indicating correct code structure and question marks highlighting potential issues in Prog1.c and Prog2.c. The instructor emphasizes that since 'x' is declared as a global variable, it is shared by all functions across the different source files.

  3. 5:00 – 10:00 05:00-10:00

    The lesson traces the execution flow of function calls modifying the shared variable 'x'. The instructor demonstrates that modifications made by one function persist and affect subsequent calls in other files. A step-by-step execution trace is shown where 'x' is initialized to 0 and then modified by functions fun1, fun2, and fun3 in a specific sequence. The visual progression includes writing down the arithmetic steps (0 -> 10 -> 20) to illustrate how changes remain available to subsequent calls, reinforcing the concept of shared memory.

  4. 10:00 – 15:00 10:00-15:00

    The instructor analyzes C code examples to demonstrate how shared memory locations allow functions to modify a common variable's value across different files. The lesson calculates intermediate values (10, 20) and final outputs (40, 22, 42) based on the order of function calls in prog1.c and prog2.c. The video then transitions to C++ concepts, defining a class as a user-defined data type that acts as a blueprint for creating objects. A real-life analogy is introduced comparing a class to the blueprint of a house.

  5. 15:00 – 20:00 15:00-20:00

    The lecture explains the fundamental concepts of Classes and Objects in C++. The instructor defines a class as a user-defined data type containing data members (variables) and member functions (methods). The lesson transitions to objects, describing them as instances of a class that represent real-world entities with their own properties and behaviors. The visual content highlights the distinction between structure (class) and instance (object), using a house analogy where the class is the blueprint and the object is the actual house built from it.

  6. 20:00 – 25:00 20:00-25:00

    The instructor explains that objects as instances of a class have their own separate memory for data members while sharing member functions. The lesson introduces access specifiers (private and public) within a class definition. A code example shows a class Temp with private data and public methods, demonstrating that private data members cannot be accessed directly from outside the class. The instructor highlights an error when attempting direct access like 't1.x = 30', requiring public member functions (getters and setters) to interact with the data.

  7. 25:00 – 29:39 25:00-29:39

    The final segment explains the execution flow of member functions within a C++ class, focusing on how set() and print() methods interact with private data members. The instructor demonstrates encapsulation by showing that while public methods can access private variables, direct access from outside the class results in an error. Visual notes track the state of objects t1 and t2 as values are assigned (t1.set(100), t2.set(10)) and printed. The lesson concludes by contrasting public access with private access errors, reinforcing the protection of data members.

The lecture systematically builds the case for Object-Oriented Programming by first exposing the vulnerabilities of procedural C programming. The instructor uses a concrete example involving three files (Global.h, Prog1.c, Prog2.c) to show how global variables create shared memory issues where any function can modify a variable's value, leading to unpredictable state persistence. This problem serves as the motivation for introducing C++ classes. The core definition of a class is established as a user-defined data type acting as a blueprint, distinct from the object which is an instance of that class. A critical distinction is made regarding memory allocation: while member functions are shared across all instances, each object possesses its own separate memory for data members. The concept of encapsulation is introduced through access specifiers, specifically the 'private' keyword which restricts direct external access to data members. The instructor demonstrates that private variables like 'x' in class Temp cannot be modified directly (e.g., t1.x = 30 causes an error) and must instead be accessed via public member functions such as set() and get(). This mechanism ensures data integrity by forcing all interactions to go through controlled methods, effectively solving the global variable issues presented earlier in the lecture.

Loading lesson…