DMA, Control Statements

Duration: 22 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/programming-data-structures-oop-java/oops-with-c/basics-of-c/asset-dma-control-statements after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: 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++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: 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, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: 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
  10. Section B: 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
  11. Section B: 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
  12. Section B: 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
  13. Section B: 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
  14. Section B: 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
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: 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
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear 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
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. 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 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…