Static Storage Class

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/structures/storage-classes/asset-static-storage-class after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: 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
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on C programming storage classes, specifically focusing on the static and external storage classes. The instructor begins by defining the static storage class through a structured table, explaining its initialization, scope, and lifetime. He then uses a practical code example to demonstrate the difference between automatic and static variables. Finally, the lecture introduces the external storage class, outlining its global scope and program-wide lifetime.

Chapters

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

    The instructor details the "Static Storage Class" using a table with columns for "Storage" and "Memory". The table specifies that the "Default initial value" is "Zero", the "Scope" is "Local to the block in which the variable is defined", and the "Life" is such that the "Value of the variable persists between different function calls". He physically circles the word "Zero" and underlines the scope and life descriptions to emphasize them. To clarify the concept of persistence, he displays a comparison slide with two code blocks. The left block shows main() calling increment() three times, where increment() declares auto int i = 1;. The output is 1 1 1. The right block is identical except increment() declares static int i = 1;, producing an output of 1 2 3. This visual comparison effectively demonstrates that static variables retain their value across function invocations, unlike automatic variables which are re-initialized.

  2. 2:00 – 2:42 02:00-02:42

    The lesson progresses to the "External Storage Class". A new table is displayed with the same structure, listing features for "Storage" and "Memory". The "Default initial value" is again "Zero". However, the "Scope" is now defined as "Global", indicating accessibility from anywhere in the program. The "Life" is described as "As long as the program's execution doesn't come to an end". This section establishes that external variables are initialized once and remain in memory for the entire duration of the program's execution, distinguishing them from local variables. The instructor explains that these variables are typically defined outside of any function.

The video effectively contrasts different storage classes by first establishing the unique persistence of static variables within a local scope, then contrasting it with automatic variables. It concludes by defining external variables as having global scope and a lifetime tied to the program's execution, providing a comprehensive overview of how variable storage and lifetime are managed in C. The progression from local persistence to global accessibility helps students understand the hierarchy of variable visibility and duration.

Loading lesson…