Initializer

Duration: 26 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-9-object-oriented-programming/oops-with-c/object-slicing-initializer-list/asset-initializer after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. 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
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. 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
  13. 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
  14. 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
  15. 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
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github
  18. 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. 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
  22. Unit 15 | Multimedia: Multimedia
  23. 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
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces C++ initializer lists as a syntax for initializing class data members at object creation. The instructor defines the syntax, `ClassName(parameters) : member1(value1), ...`, and states two purposes: initializing data members and controlling constructor flow in inheritance. A simple `Temp` class example demonstrates default and parameterized constructors, contrasting assignment inside the constructor body with direct initialization using an initializer list. The lecture then moves to inheritance, showing how a derived class can explicitly call a base-class constructor in its initializer list. A code editor example with `base` and `derived` classes is annotated to trace constructor calls, including a compiler error case where the required base constructor is missing. The final section revisits initializer list syntax and emphasizes that this mechanism works faster than normal constructors.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens by defining an initializer list as a special syntax used to initialize class data members when an object is created. On-screen text lists two purposes: initializing data members and controlling the flow of constructors in inheritance. A note states that initializer lists work faster than normal constructors and can only be used with constructors. The instructor writes the general syntax, `ClassName(parameters) : member1(value1), ...`, and begins a handwritten example for a class named `Temp` with integer members `a` and `b`, starting the public constructor section.

  2. 2:00 – 5:00 02:00-05:00

    The `Temp` class example is developed with two constructors. A default constructor initializes members to zero, while a parameterized constructor assigns values from arguments `x` and `y`. The instructor highlights the initializer list syntax, such as `a(x), b(y)`, in green ink and draws arrows connecting constructor parameters to member initializations. Object boxes show `t1` with default values and `t2(10, 20)` using the parameterized constructor. The on-screen code evolves from assignment inside the body to initializer list form, e.g., `Temp(int x, int y) : a(x), b(y) { }`.

  3. 5:00 – 10:00 05:00-10:00

    The lecture contrasts initializer lists with normal assignment inside constructors. The instructor annotates the `Temp` class to show that members can be initialized directly in the initializer list, such as `x(0), y(0)` for the default constructor and `x(i), y(j)` for the parameterized version. Memory diagrams for objects `t1` and `t2` illustrate how member values are set at creation. Console output is shown printing values such as `x=0, y=0` and `x=10, y=20`, demonstrating the effect of different constructor calls.

  4. 10:00 – 15:00 10:00-15:00

    The topic transitions to inheritance. A new example introduces `class base` and `class derived : public base`. The instructor writes constructors such as `base() : i(0)` and `derived(int y) : base(y), j(y)`, showing how the derived class initializer list explicitly calls a base-class constructor. The on-screen text includes the phrase “Calling Desired Base Class Constructor for Derived Object,” emphasizing that initializer lists control constructor flow in inheritance scenarios.

  5. 15:00 – 20:00 15:00-20:00

    A code editor displays the full `base`/`derived` program, with a console window showing output text such as “b def” and “one.” Red handwritten annotations mark line 21, `derived() : base(), j(0)`, and the parameterized constructor. A hand-drawn box labeled `d1` lists `i = 0` and `j = 0`, with arrows in `main()` linking object creation to constructor output. The instructor traces how creating a derived object triggers the base constructor call specified in the initializer list.

  6. 20:00 – 25:00 20:00-25:00

    The lecture explains what happens if the required base constructor is not specified. On-screen text shows a compiler error: “No matching function for call to 'Base::Base()'.” The instructor then presents an example of cross-calling base constructors, with code and output demonstrating the sequence of constructor calls. Red annotations highlight errors and corrections in the code, reinforcing that explicit base constructor selection is necessary when a suitable default constructor does not exist.

  7. 25:00 – 26:11 25:00-26:11

    The final segment revisits the initializer list definition and syntax. The on-screen text repeats that an initializer list is a special syntax used to initialize data members when an object is created, and the note that it works faster than normal constructors. The instructor summarizes the key points: initializer lists initialize members directly and can control constructor flow in inheritance, closing the lecture on this C++ topic.

The lecture builds from definition to application. It first defines initializer lists and their syntax, then uses a simple `Temp` class to show direct member initialization versus assignment. The inheritance example extends this by showing how derived classes call base constructors through the initializer list, with annotated code and console output tracing constructor execution. The compiler error case clarifies why explicit base constructor calls are needed. Overall, the central idea is that initializer lists provide faster, direct initialization and control constructor flow in inheritance.

Loading lesson…