Class & Objects
Duration: 30 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Pipe and Cistern, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Cubes & Dices, Number System, Powers, Surds and Logarithms, Mathematical Operations, Simplification and Approximation, Percentages, 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, Transformation of Shapes, Signal Space and Optimum Detection, Alphabet and Word Tests, Syllogisms and Venn Diagrams, Analogy and Classification, Mensuration, Constraint Puzzles, Patterns in Two-Dimensional Figures, Three-Dimensional Patterns and Visualization, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Numerical Reasoning, Assembling and Grouping of Shapes, Coding and Decoding, Cubes and Dice, Series Completion, Direction Sense, Logical Deduction and Induction, Order, Ranking and Sequence, Clocks and Calendars, Critical Reasoning, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Algebra, Data Interpretation, Time and Work, Probability, Speed, Time and Distance, Statistics, Data Sufficiency, Trigonometry, Differential Calculus, Blood Relations, Mixture and Alligation, Speed Time and Distance, Combinatorics
- Computer Networks & Cybersecurity: 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, Hardware Basics, Network Security
- Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
- Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes, Semiconductor Memories and Programmable Logic
- TOC & Compiler: 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, 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
- 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
- Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
- Live Classes: ISRO Live classes
- Full Mock Test:
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
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: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.
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.
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.
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.
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.
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.

