Friend Function - Part 2
Duration: 17 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, titled 'Friend Function - Part 2', systematically covers the advanced categories of friend functions and classes in C++. The instructor begins by explaining Category 2, where a single non-member function acts as a bridge between two classes (Circle and Rectangle) by accessing their private members. This requires forward declaration because the compiler encounters the friend function before the second class is fully defined. The lesson then transitions to Category 3, defining a friend class as one whose all member functions can access the private and protected members of another class. Key properties are emphasized: friendship is not mutual, inherited, or transitive. A code example demonstrates a Rectangle class declared as a friend of Circle, calculating the difference between their areas. Finally, Category 4 is introduced, where a member function of one class (Rectangle::res_area) becomes the friend of another class. The lecture concludes with a theoretical summary slide defining friend functions and listing all four categories.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces Category 2, where a single friend function acts as a bridge between two classes. Using Circle and Rectangle as examples, the slide explains that res_area() is a single friend function of both classes. A key requirement highlighted is forward declaration, as the compiler reaches the friend function inside Circle before Rectangle is defined. Red annotations point to the 'friend float res_area(Rectangle, Circle);' declaration.
2:00 – 5:00 02:00-05:00
The focus shifts to Category 3, the Friend Class. The instructor defines it as a class whose all member functions can access private and protected members of another class. The syntax 'friend class B;' is shown within class A. Key points are underlined: friendship is not mutual, inherited, or transitive. The instructor uses red circles to emphasize 'all member functions' and arrows to connect the syntax elements.
5:00 – 10:00 05:00-10:00
A C++ code example demonstrates the Friend Class concept. The Circle class declares 'friend class Rectangle;'. The console output shows inputs for radius (5), length (4), and breadth (3), resulting in 'Rectangle area - Circle area = -60.50'. Red boxes mark the forward declaration and friend line. Handwritten notes contrast member access using 'ar' versus 'c.ar', explaining the use of object references.
10:00 – 15:00 10:00-15:00
The lecture moves to Category 4, where a member function of one class is the friend of another. The slide title 'Member function of one class is friend of the another class' is displayed. Code shows Circle and Rectangle classes with get() and cal_area() members. Red circles mark 'one class' and 'another class'. The output console again shows the area calculation result of -60.50, reinforcing the practical application.
15:00 – 16:48 15:00-16:48
The instructor concludes by demonstrating the syntax for Category 4, specifically 'friend float Rectangle::res_area(Circle c);'. A final theoretical slide summarizes the Friend Function definition: a non-member function granted access to private and protected members. The syntax 'friend void functionName(ClassName);' is displayed, followed by a list of the four categories covered in the lecture.
The lecture progresses logically through three specific types of friend relationships in C++. It starts with the bridge function (Category 2), emphasizing the compiler's need for forward declarations when a non-member function spans two classes. It then moves to the friend class (Category 3), where an entire class is granted access, and finally to a member function acting as a friend (Category 4). Throughout the video, the instructor uses consistent examples involving Circle and Rectangle classes to calculate area differences. Visual cues like red circles, arrows, and handwritten notes are used to clarify the distinction between accessing members directly (ar) versus through an object reference (c.ar). The lesson is grounded in practical code execution, showing console outputs to verify the logic of accessing private data across class boundaries.

