DMA, Control Statements

Duration: 22 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/basics-of-c/asset-dma-control-statements 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
  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
  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 C++ lecture covers dynamic memory allocation with new/delete, output formatting differences between endl and \n, decision-making statements (if, if-else, nested if, else-if ladder), switch statement syntax and limitations, the conditional (ternary) operator, loop structures (while, do-while, for, nested), and loop control statements break and continue. The instructor uses slides with handwritten annotations, memory diagrams comparing stack and heap, comparison tables, flowcharts, and live IDE code execution to demonstrate concepts. The lesson progresses from memory management fundamentals through control flow structures, emphasizing when each construct is appropriate and how they behave at runtime.

Chapters

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

    The lecture opens with a slide titled 'New & Delete Keywords' defining the C++ new operator as dynamically allocating memory at runtime from the heap and returning its address, with syntax pointer = new data_type;, and delete as freeing memory allocated using new, with syntax delete pointer;. The instructor handwrites 'malloc', 'calloc', and 'realloc' on the slide with checkmarks to contrast C-style allocation functions against C++ operators, then begins writing a code example using malloc cast to an integer pointer on the whiteboard.

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

    The instructor writes the specific example int *p = new int(5); and draws a memory diagram showing stack variable p pointing to a heap block containing the value 58 (later crossed out). The diagram visually distinguishes Stack and Heap regions, with the heap box crossed out after writing delete p; to represent deallocation. Key terms like 'dynamically', 'runtime', and 'heap' are underlined for emphasis, reinforcing that new allocates at runtime from the heap while delete releases that block.

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

    The topic shifts to output formatting with a slide titled 'Difference between endl and \n'. Both move the cursor to the next line, but endl also flushes the output buffer. A comparison table contrasts features including speed and performance, with checkmarks and crosses marking which option is faster. Example code cout << "Hello" << endl; and cout << "World"; are annotated to show output behavior, with key terms like 'flushes the output buffer' underlined and circled.

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

    A slide titled 'Decision Making Statements in C++' presents a real-life example: 'If it is raining, carry an umbrella; otherwise, do not carry it.' Six types are listed: if Statement, else Statement, Nested if Statement, else-if Ladder, switch Statement, and Conditional (Ternary) Operator. A four-column table then details columns 1-4 with descriptions, flow diagrams showing condition diamonds with TRUE/FALSE arrows, and syntax blocks. Red pen annotations include underlines on if and if-else descriptions, checkmarks on TRUE/FALSE paths, and circles around 'if (condition1)' and 'else if' in the Nested if and else-if Ladder columns.

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

    The switch statement is presented with syntax showing case value1:, default:, and the instructor annotates that it requires a constant value and cannot be used for range conditions. A comparison table shows if-else, while, and loops are suitable for ranges unlike switch. The conditional (ternary) operator is introduced as shorthand for if-else with syntax (condition) ? expression1 : expression2;, demonstrated in a C++ program finding the maximum of two numbers: max = (a > b) ? a : b;. The lesson then introduces loops as control structures repeating statements until a condition becomes false, with an overview table comparing while, do-while, for, and nested loops.

  6. 20:00 – 21:49 20:00-21:49

    A slide titled 'Loop Control Statements' defines the break statement as immediately terminating the loop and continue as skipping the current iteration to move to the next. Two C++ code examples are displayed in an IDE: one demonstrating break that terminates the loop at 6 (output stops at 5), and another showing continue that skips printing 6. Output windows for both examples confirm the behavior, with red annotations highlighting 'break', 'continue', and specific conditions in the code.

The lecture builds a coherent progression from memory management to control flow. It begins with new/delete for dynamic heap allocation, contrasting C++ operators with C's malloc/calloc/realloc and using stack-heap diagrams to make pointer-to-memory relationships concrete. The endl versus \n comparison introduces a practical performance consideration (buffer flushing) before moving to decision-making structures. The six decision-making types are organized from simple if through else-if ladders, then switch (with its limitation to constant values rather than ranges), and the ternary operator as a compact if-else alternative. Loops are introduced as repeating control structures, and break/continue are demonstrated with live IDE execution showing exact output differences. The teaching method consistently combines slide definitions, handwritten annotations, visual diagrams (memory layouts, flowcharts), comparison tables, and code examples to reinforce each concept. Central ideas include: new allocates at runtime from heap returning an address, delete frees that memory; endl flushes the buffer while \n does not; switch cannot handle range conditions unlike if-else or loops; ternary operator is shorthand for if-else; break terminates a loop entirely while continue skips only the current iteration. The progression from allocation through conditional branching to looping and loop control mirrors typical C++ curriculum sequencing.

Loading lesson…