Friend Function - Part 2

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-programming-languages/oops-with-c/friend-function/asset-friend-function-part-2 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, 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

  1. 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. 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.

  3. 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.

  4. 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.

  5. 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.

Loading lesson…