Loading & Linking

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/operating-system/introduction-to-os/loading-linking/asset-loading-linking 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, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  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, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  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), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  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, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  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), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  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 lecture introduces the operating system concepts of loading and linking, using a slide-based presentation and a C-language example. The instructor first defines loading as the process of bringing a program from secondary storage into main memory (RAM) for execution. Two types of loading are compared: static loading, where the entire program is loaded before execution, resulting in faster execution but inefficient memory utilization; and dynamic loading, where routines are loaded on demand, which improves memory utilization but adds additional time. Diagrams show a “Program on Disk” containing Routine A, B, C, and D moving into “Main Memory (RAM)”; in the dynamic case, only some routines are shown loaded. The lesson then transitions to linking, defined as the process of combining different modules or functions of a program to create an executable program. A C example uses File 1: main.c with a function declaration int add(int, int); and File 2: add.c with the definition int add(int a, int b) { return a + b; }. A flow diagram shows compilation producing object files main.o and add.o, a linker combining them into an executable file (a.out / program.exe), execution, and an output of 30. The final section covers types of linking: static linking, which combines all required modules and library functions into a single executable file, making it generally larger; and dynamic linking, which connects to library functions at load time or runtime, allowing libraries to be shared by multiple programs and resulting in a smaller executable file.

Chapters

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

    The instructor introduces the topic “Loading” with the heading “Types of Loading.” The slide defines loading as “the process of bringing a program from secondary storage into main memory (RAM) for execution.” Two panels compare “1 Static Loading” and “2 Dynamic Loading.” Diagrams show a “Program on Disk” box listing Routine A, B, C, and D with an arrow to a “Main Memory (RAM)” box. Red-highlighted terms include “entire program,” “inefficient utilization of memory,” “faster,” “on demand,” “improves memory utilization,” and “additional time.”

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

    The instructor explains the two loading types in more detail. Static loading brings the entire program into memory before execution, which is faster but leads to inefficient memory utilization. Dynamic loading loads routines on demand, improving memory utilization but requiring additional time. The instructor points to the static diagram and then to the dynamic “Main Memory (RAM)” box, which shows only Routine A and B loaded. A C code example is written on the whiteboard to illustrate function calls, connecting the loading discussion to the upcoming linking example.

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

    The lesson transitions from loading to linking. The slide states that “Linking is the process of combining different modules or functions of a program to create an executable program.” An “Example of Linking in C” shows two code panels: “File 1 : main.c” containing “int add(int, int); // function declaration” and “File 2 : add.c” containing “int add(int a, int b)” and “return a + b;.” A right-hand panel titled “How Linking Works?” lists five numbered steps, ending with “A single executable file is created.”

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

    The instructor walks through the linking flow diagram. Pink “Compilation (Compiler)” boxes feed “main.o (Object File)” and “add.o (Object File).” A “Linker” box combines these into an “Executable File (a.out / program.exe),” which leads to “Execution” and a circled “Output 30.” The slide then switches to “Types of Linking,” divided into “1 Static Linking” and “2 Dynamic Linking” columns, each with its own module-to-executable diagram. The instructor uses a pen to circle the executable box in the static diagram.

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

    The instructor compares static and dynamic linking. Static linking combines “all required modules” and “library functions” into a single executable file, making it generally larger. Dynamic linking connects to library functions at “load time or runtime,” allowing them to be “shared by multiple programs” and resulting in a smaller executable file. The instructor highlights these key terms and draws diagrams showing modules and library code being combined by a linker, and Program A and Program B using a dynamic linker to access a shared library.

The lecture progresses logically from loading to linking, two fundamental steps in preparing a program for execution. Loading is defined as moving a program from secondary storage into RAM. Static loading loads the entire program upfront, trading memory efficiency for speed, while dynamic loading loads routines on demand, improving memory utilization at the cost of additional time. The C example with main.c and add.c bridges loading and linking by showing how separate source files are compiled into object files and then linked into a single executable. The linking flow diagram—compilation, object files, linker, executable, execution, output 30—makes the process concrete. Finally, static and dynamic linking are contrasted: static linking embeds all needed code into the executable, increasing its size, while dynamic linking uses shared libraries at load or runtime, reducing executable size and enabling code sharing. The recurring theme is the trade-off between memory/disk efficiency and execution speed, illustrated through consistent diagrams and a single C example.

Loading lesson…