Basics of a Process
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- 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
- 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
- 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
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive introduction to the concept of a 'Process' within the context of Operating Systems. The instructor begins by defining a process generally as a 'program in execution,' immediately distinguishing it from a 'program,' which is described as a passive entity consisting of a file containing a list of instructions stored on secondary memory or disk. The lecture emphasizes that a program only becomes a process when an executable file is loaded into main memory and its Process Control Block (PCB) is created. The instructor uses visual aids, drawing a document to represent a program and a shaded box to represent a process, to illustrate this transformation. He further explains that a process is an active entity that requires specific resources such as main memory, CPU time, registers, and system buses to function. The session concludes by detailing the memory layout of a process, breaking it down into text, data, heap, and stack sections.
Chapters
0:00 – 2:00 00:00-02:00
The session starts with the definition: 'In general, a process is a program in execution.' The instructor clarifies that a program is not a process by default because it is a passive entity, essentially a file on disk. He explains that a program becomes a process when an executable file is loaded into main memory and when its PCB is created. To visualize this, he draws a simple document icon representing the program and then a shaded rectangle representing the process in memory. He underlines key phrases on the slide like 'loaded into main memory' and 'PCB is created' to emphasize the conditions for a process's existence. He also points out that a process is an active entity requiring resources. The visual distinction between the passive file and the active execution is a central theme in this segment.
2:00 – 5:00 02:00-05:00
The instructor elaborates on the active nature of a process, stating it requires resources like main memory, CPU time, registers, and system buses. He provides a concrete example: 'For instance, if a user has invoked many copies of web browser program, each copy will be treated as separate process.' Even though the text section (code) is the same for all copies, the data, heap, and stack sections can vary. He draws a diagram showing a single document (program) branching out into multiple separate boxes (processes) to illustrate that multiple processes can be associated with the same program but are considered totally different execution sequences. The slide text explicitly states, 'Even if two processes may be associated with same program, they will be considered a separate execution sequences and are totally different process.' This highlights the independence of process instances.
5:00 – 9:09 05:00-09:09
The lecture transitions to the internal structure of a process. The slide lists four main sections: 'Text section: also known as Program Code,' 'Stack: which contains the temporary data (Function Parameters, return addresses and local variables),' 'Data Section: containing global variables,' and 'Heap: which is memory dynamically allocated during process runtime.' The instructor points to a memory layout diagram on the right side of the screen. The diagram shows the text section at the bottom (address 0), followed by the data section, then the heap, and finally the stack at the top (max address), growing downwards. He explains the function of each section, highlighting that the stack holds temporary data while the heap holds dynamically allocated memory. He uses a pen to point at the specific sections on the diagram, ensuring students understand the memory organization.
The video effectively progresses from a high-level definition to specific implementation details. It starts by defining a process as an active entity derived from a passive program, highlighting the necessity of memory loading and PCB creation. It then clarifies that multiple processes can stem from a single program, differing in their data and stack sections. Finally, it breaks down the process into its constituent memory parts—text, data, heap, and stack—providing a complete picture of how a process is structured and managed within the system's memory space. This logical flow helps students grasp both the conceptual and structural aspects of processes, moving from abstract definitions to concrete memory layouts.

