Friend Function - Part 1
Duration: 37 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 the concept of Friend Functions in C++ Object-Oriented Programming, defining them as non-member functions granted access to private and protected members of a class. The instructor explains that while encapsulation restricts direct access, friend functions provide an exception to data hiding rules. The session covers the syntax for declaring a friend function using the keyword 'friend' inside a class definition and lists four categories: simple friend functions, bridge functions between classes, friend classes, and member functions of one class acting as friends to another. The lecture progresses from theoretical definitions to practical code examples, starting with a simple friend function calculating the area of a circle by accessing its private radius member. It then advances to a more complex scenario involving two classes, Circle and Rectangle, where a shared friend function calculates the difference in their areas. The instructor emphasizes the necessity of forward declarations when one class references another within a friend function declaration, demonstrating how to pass objects as arguments to access private data across class boundaries.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with an introduction to the topic of Friend Functions within Object-Oriented Programming (OOPS) using C++. The instructor presents a title slide displaying 'OOPS with C++' and 'Friend Function'. He begins writing notes on the slide, specifically focusing on access specifiers like 'Private' and 'Public' associated with a class. The visual progression shows the instructor annotating the slide to explain how friend functions interact with class members, underlining key terms and listing access modifiers such as 'LDM (Private)' and 'LMF (Public)'. The instructor gestures with his hands to emphasize points while maintaining a thinking pose.
2:00 – 5:00 02:00-05:00
The instructor introduces the concept of a Friend Function within Object-Oriented Programming in C++. He begins by writing class inheritance notation (Class B inheriting from Class A) to set up a context for accessing private members. The visual focus shifts between the inheritance diagram and the main topic 'Friend Function' to illustrate how access control works. He writes 'Inherit' below the diagram and then crosses it out, suggesting a distinction between inheritance and friend functions. The slide outlines that this mechanism is used when accessing private data from outside the class, bypassing standard encapsulation rules.
5:00 – 10:00 05:00-10:00
The video introduces the concept of a 'Friend Function' in C++ Object-Oriented Programming. The instructor explains that a friend function is a non-member function granted access to the private and protected members of a class. The slide outlines that this mechanism is used when accessing private data from outside the class, bypassing standard encapsulation rules. The instructor underlines key phrases like 'non-member function', 'private and protected members', and the syntax for declaration. The slide highlights that the friend keyword is used inside the class to declare this function, which allows access from outside without violating data hiding principles.
10:00 – 15:00 10:00-15:00
The instructor explains the syntax and categories of friend functions in C++, emphasizing that they are non-member functions granted access to private data. He illustrates how a friend function is declared and discusses the logical requirement for it to take an object as an argument. The lesson progresses through different categories of friend functions, including simple friend functions and bridges between classes. He uses checkmarks to validate correct syntax and crosses out incorrect usage examples, marking the distinction between valid and invalid implementations of friend functions.
15:00 – 20:00 15:00-20:00
The video lecture introduces the concept of Friend Functions in C++, explaining them as non-member functions that access private and protected class members. The instructor details the syntax, categories of friend functions (simple, bridge, etc.), and logical requirements like passing objects as arguments. The session transitions to a practical code example demonstrating a 'Simple Friend Function' that calculates the area of a circle by accessing its private radius member. The code snippet includes '#include <iostream>' and 'class Circle { float r; ... friend float cal_area(Circle c); }'.
20:00 – 25:00 20:00-25:00
The instructor explains the concept of a simple friend function in C++ using a `Circle` class example. He demonstrates how the friend function `cal_area` is declared inside the class and defined outside, allowing it to access private members like `r`. The instructor draws diagrams to illustrate the relationship between the class object and the friend function, showing how the private data is accessed during execution. The output shows 'Input radius: 5' resulting in '78.5', confirming the calculation `return 3.14 * c.r * c.r;`.
25:00 – 30:00 25:00-30:00
The instructor explains a C++ friend function example where two classes, Circle and Rectangle, share a common friend function to calculate the combined area. He demonstrates how the friend function accesses private members of both classes by passing objects as arguments. The instructor manually traces the execution flow, calculating values for radius and dimensions to verify the output. He circles 'friend float res_area' declarations in both classes, drawing diagrams to represent object memory layout (Circle 'c' and Rectangle 's') and verifying the final output 28.5 in the console window.
30:00 – 35:00 30:00-35:00
The instructor is explaining the concept of a friend function that acts as a bridge between two classes, specifically `Circle` and `Rectangle`. He highlights the forward declaration of `class Rectangle` at line 5, which is necessary because the friend function inside `Circle` references `Rectangle` before it is fully defined. The code demonstrates a global friend function `res_area` that takes objects of both classes as parameters to calculate an area involving private members from each. The instructor emphasizes the forward declaration necessity and bridge concept between classes.
35:00 – 37:23 35:00-37:23
The instructor concludes the segment by reinforcing the syntax for declaring friend functions inside class definitions and defining them outside. He shows the definition of `res_area` function outside classes, demonstrating usage in the main function. The code snippet includes 'friend float res_area(Rectangle s, Circle c);' and 'return s.ar - c.ar;'. The instructor highlights the forward declaration necessity, bridge concept between classes, and accessing private members via friend function parameters to ensure students understand the complete flow of data access across class boundaries.
The lecture systematically builds understanding of Friend Functions in C++ by first defining them as non-member functions that bypass encapsulation to access private and protected members. The instructor uses visual aids, including class diagrams and code snippets, to illustrate the syntax 'friend void functionName(ClassName);' and lists four categories of friend functions. The progression moves from theoretical definitions to practical implementation, starting with a simple example calculating the area of a circle. The complexity increases as the instructor introduces a bridge function between two classes, Circle and Rectangle, requiring forward declarations. Key evidence includes the code 'class Circle { float r; ... friend float cal_area(Circle c); }' and the output '78.5'. The instructor emphasizes that while friend functions violate strict data hiding, they are essential for operations like operator overloading and cross-class calculations. The final examples demonstrate how to pass objects as arguments to access private data, with the instructor manually tracing execution to verify outputs like '28.5'.

