Array Pointers, Functions

Duration: 19 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-array-pointers-functions 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
  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
  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 lecture introduces arrays, functions, recursion, and pointers in C/C++. It begins by defining arrays as collections of same-type elements stored in contiguous memory, accessed via a common name and index. The instructor explains why arrays are used: to store multiple values under one variable name, reduce individual variables, and allow fast indexed access. The syntax datatype array_name[size]; is shown with int marks[5]; and initialization int marks[5] = {10, 20, 30, 40, 50}; where the size can be omitted and inferred by the compiler. A one-dimensional array example reads five integers using cin >> a[i]; in a for loop and prints them, with console output showing 10 20 30 40 50. A two-dimensional array is then introduced as matrix form with syntax datatype array_name[row][column]; and example int a[2][3];, followed by a 3x3 matrix input/output demonstration. The lecture transitions to functions, defining them and listing benefits such as reducing code repetition (code reusability). The syntax return_type function_name(parameter_list) is presented with an optional return value for void functions. An example shows int add(int a, int b); and the call sum = add(x, y);. Four combinations of arguments and return values are taught: no args/no return, args/no return, no args/return, and args/return. Recursion is defined as a function calling itself until a base condition is met, with syntax including if(base_condition) return value; and return function_name(smaller_problem);, illustrated by a hand-drawn stack diagram. Pointers are defined as variables storing the memory address of another variable, with syntax data_type *pointer_name;. The address operator & and dereference operator * are explained using a memory sketch where num holds 10 at address 100 and ptr holds 100. A declaration/initialization example prints Value of num = 25 and Address of num = 0x22FF44. Finally, dynamic memory allocation for a single integer is shown with int *p = new int(8); and delete(p);, accompanied by a sketch of P=100 pointing to 8.

Chapters

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

    The opening slide titled 'Arrays' defines an array as a collection of elements of the same data type stored in contiguous memory locations and accessed using a common name and index. The instructor draws red checkmarks next to C and C++ labels and underlines key phrases such as 'same data type' and 'contiguous memory locations.' The slide lists why arrays are used, including storing multiple values using a single variable name, and notes that in C/C++ array indexing starts from 0. The syntax datatype array_name[size]; is shown with the example int marks[5];, annotated as creating an array that can store 5 integer values. An initialization example int marks[5] = {10, 20, 30, 40, 50}; appears, with a note that the size can be omitted and the compiler determines it as 5.

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

    The lesson moves to a one-dimensional array, described as storing data in a single row. A C++ editor shows int a[5]; and a for loop using cin >> a[i];, with red checkmarks, underlines, and curly-brace annotations. A console window labeled array_1D.exe displays 'Enter 5 elements:' with inputs 10 20 30 40 50 and output 'Array elements are: 10 20 30 40 50,' later bracketed and underlined in red. The instructor then introduces the two-dimensional array, stating it stores data in rows and columns (matrix form) with syntax datatype array_name[row][column]; and example int a[2][3];. A second console window, array_2D.exe, shows 'Enter elements of 3x3 matrix:' and a resulting 'Matrix is:' grid.

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

    A slide titled 'Functions' presents a definition and a bulleted list under 'Why Do We Use Functions?' including 'Reduces code repetition (code reusability).' A syntax block shows return_type function_name(parameter_list) with a body containing '// Function body' and 'return value; // Optional for void functions.' Red handwritten underlines progressively mark the definition, each bullet point, and parts of the syntax line. The slide then switches to 'Example of Functions' with C++ code showing the declaration int add(int a, int b); and the call sum = add(x, y); // Function Call. The instructor highlights actual arguments in the function call.

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

    The video introduces two major types of functions in C++: library (built-in) and user-defined. A code example demonstrates the four possible combinations of arguments and return values for user-defined functions: 1. No Arguments, No Return Value; 2. Arguments, No Return Value; 3. No Arguments, Return Value; and 4. Arguments and Return Value. The instructor highlights the 'void' keyword for no return value functions and the 'int' keyword with 'return' statements for functions that return values. The lesson then defines a recursive function as one that calls itself repeatedly until a base condition is met, showing syntax return_type function_name(parameter) with if(base_condition) return value; and return function_name(smaller_problem);. A hand-drawn stack diagram illustrates the recursive call flow.

  5. 15:00 – 18:42 15:00-18:42

    A slide titled 'Pointer' states it is a variable that stores the memory address of another variable, with syntax data_type *pointer_name;. Hand-drawn memory sketches show num holding 10 at address 100 and ptr holding 100, illustrating the &num and *ptr relationship. A 'Declaration and Initialization' slide pairs a C++ source window with console output reading 'Value of num = 25' and 'Address of num = 0x22FF44.' A final slide titled 'Dynamic Memory Allocation for a Single Integer' displays code int *p = new int(8); followed by delete(p); and a sketch of P=100 pointing to 8.

The lecture progresses from data structures (arrays) to procedural abstraction (functions) and then memory-level concepts (pointers). Arrays are established as contiguous, same-type collections with zero-based indexing; 1D and 2D examples are demonstrated live in the console. Functions are introduced as reusable code blocks, with syntax and four argument/return combinations explicitly categorized. Recursion is a special function case explained via self-calls, base conditions, and a stack diagram. Pointers tie the topics together by exposing memory addresses: the & operator obtains an address, * dereferences it, and dynamic allocation with new/delete extends pointer use to heap memory. The consistent use of red annotations, code examples, and console output supports exam revision by linking definitions to runnable C++ snippets.

Loading lesson…