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 the course: About the Course
- Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
- Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
- General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
- Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
- Environmental Science: Environment
- Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
- Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Unit 6 | 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, Transaction Management, Concurrency Control
- Unit 7 | Computer Networks: 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
- Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Unit 9 | Object Oriented Programming: OOPS with C++
- Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
- Unit 11 | 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
- Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
- Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
- Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
- Unit 15 | Multimedia: Multimedia
- Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
- Full Length Mock Tests — General Paper:
- Full Length Mock Tests — Computer Science (Paper II):
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.