Friend Function - Part 2

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/programming-data-structures-oop-java/oops-with-c/friend-function/asset-friend-function-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access 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, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, Artificial Intelligence, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, Number System & Place Value, Factors, Multiples, Divisibility, HCF & LCM, Mensuration — Perimeter, Area, Surface Area, Volume, Data Handling, Graphs & Probability, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…