fork(), clone(), Orphan & Zombie Process

Duration: 26 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/operating-system/linux-os/process-scheduling/asset-fork-clone-orphan-zombie-process after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Linux process creation and lifecycle management, focusing on the fork() system call, its return values, and how multiple forks generate process trees. It then contrasts fork() with clone(), explaining that clone() offers fine-grained control over resource sharing and is used internally for threads, containers, and namespaces. The session continues with parent-child relationships, the wait() system call for reaping terminated children, and concludes by defining orphan and zombie processes. A comparison table distinguishes orphans (re-parented when the parent dies) from zombies (terminated children whose status has not yet been collected), and a flowchart illustrates how wait() prevents zombie accumulation. The teaching progression moves from basic process duplication to advanced resource-sharing and cleanup mechanisms, using diagrams, annotated code examples, and comparison tables throughout.

Chapters

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

    The lecture opens with the slide titled 'Process Creation using fork()'. The instructor defines fork() as a Linux system call that creates a new process. A flow diagram shows the 'Parent Process (Shell)' calling fork(), which duplicates the current process into a parent with PID = X and a child with PID = 0. A return-value table lists three outcomes: '> 0 Returned to Parent → value is Child's PID', '0 Returned to Child', and '-1 fork() failed → no child created'. A red handwritten annotation builds across frames from 'P1 fork()' to '(Parent) P1 fork() → P2 (Child)' with 'PID = P1' added, visually tracing the duplication.

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

    The instructor continues on the same fork() slide, emphasizing that the child is initially a copy of the parent but receives its own PID. The return-value table is revisited, with the instructor highlighting each row: > 0 for the parent (child's PID), 0 for the child, and -1 on failure. The teaching cue is a flowchart visualizing duplication plus hand-drawn arrows connecting parent and child PIDs. The slide text reiterates: 'fork() is a system call used to create a new process in Linux' and 'Child process is initially a copy of the parent process, but it gets its own PID.'

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

    The lesson transitions to 'Example 1: Basic fork()', showing C code that checks the return value with if (pid > 0) for the parent and else if (pid == 0) for the child, printing 'Parent Process' or 'Child Process'. A warning note states 'Parent/child execution order is not guaranteed'. The instructor then presents a process tree diagram for two fork() calls resulting in four total processes, establishing the rule 'Maximum processes = 2^n' for n independent fork() calls. Red annotations trace the return value between parent and child.

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

    The topic shifts to the clone() system call. A slide titled 'clone() System Call - Basic Purpose' explains that clone() creates a new task (like fork()) or a new thread (like pthread_create()), allows fine-grained control over resource sharing using flags, and is used internally by Linux for threads, containers, namespaces, and other advanced features. A comparison table contrasts fork() vs clone() across purpose, resource sharing, memory, files, control, and typical use. The instructor uses red circles around key terms like 'process', 'thread-like', and 'resources', and red checkmarks on specific table rows.

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

    The lecture covers the 'Parent-Child Process Relationship'. A slide states: 'A Parent Process can create a new process called a Child Process using fork()', 'Child gets a different PID, while PPID refers to its parent', and 'wait() allows the parent to wait for a child process to finish'. The instructor annotates with red lines and arrows, highlighting the term 'reaping' next to wait() and explaining that wait() collects the child's termination status, preventing a terminated child from remaining as a zombie when properly reaped.

  6. 20:00 – 25:00 20:00-25:00

    The session addresses 'Orphan & Zombie Process'. Definitions are given: a child becomes an Orphan when its parent terminates before the child, and the orphan is adopted/re-parented by another process; a child becomes a Zombie when it has finished execution but its parent has not yet collected its termination status. A comparison table highlights differences between the two concepts, with red underlines and checkmarks on key terms. The instructor transitions to a flowchart explaining the wait() system call, showing 'Parent calls wait()', 'Child calls exit()', and 'wait() returns'.

  7. 25:00 – 25:43 25:00-25:43

    The final segment reinforces the wait() flowchart for reaping a terminated child. The diagram illustrates the sequence: parent calls wait(), child calls exit(), and wait() returns the termination status. This closes the lecture by connecting wait() to zombie prevention, completing the progression from fork() creation through clone() resource sharing to process cleanup and lifecycle management.

The lecture follows a clear pedagogical arc: (1) fork() basics and return values, (2) code example and process-tree math (2^n), (3) clone() as a more general, flag-controlled alternative to fork(), (4) parent-child relationships and wait()/reaping, and (5) orphan vs zombie processes. Central ideas include the dual return value of fork() (>0 to parent, 0 to child), the non-deterministic execution order without synchronization, clone()'s resource-sharing flags for threads/containers/namespaces, and the necessity of wait() to collect termination status and avoid zombies. Orphans are re-parented (typically to init/systemd) and continue running, while zombies retain a process entry until reaped. The instructor consistently uses flow diagrams, annotated C code, comparison tables, and red handwritten marks to reinforce key terms. Minor details include specific PID notation (PID = X for parent, 0 for child) and the 2^n maximum process count rule. The content is grounded in visible slide text, diagrams, and annotations; no audio transcript was available, so spoken emphasis is inferred from visual cues such as red circles, checkmarks, and underlines.

Loading lesson…