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

Duration: 26 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/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. 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 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…