Frame Allocation Policy Equal Allocation

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/operating-systems/virtual-memory/thrashing-allocation/asset-frame-allocation-policy-equal-allocation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Computer Networks: 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 Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on Frame Allocation Algorithms within the context of operating systems. The instructor begins by defining the constraints on frame allocation, noting that the minimum number of frames depends on the Instruction Set Architecture, while the maximum depends on the process size. He then introduces the Equal Allocation strategy, where frames are distributed equally among processes regardless of their individual size requirements. The lecture uses a specific example of 30 frames and 3 processes to illustrate that each process receives 10 frames. The instructor then moves to a visual demonstration, writing down process identifiers and assigning them frame counts to reinforce the concept of equal distribution versus other potential allocation methods.

Chapters

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

    The instructor introduces the topic Frame Allocation Algorithms via a slide. The slide text states, Minimum Number of frames to be allocated to each process depends on Instruction Set Architecture, and the maximum number of allocation of frames depends on the size of the process. He then highlights the Equal Allocation method, reading the definition: Frames will be equally allocated to each process. Ex: if we have 30 frames and 3 processes, each will get 10 regardless of their size. This section establishes the theoretical basis for the allocation strategy before moving to practical examples. The instructor emphasizes that under this specific algorithm, the size of the process does not influence the number of frames received, ensuring a uniform distribution of memory resources across all active processes in the system.

  2. 2:00 – 3:35 02:00-03:35

    The instructor transitions to a practical demonstration on the screen to visualize the concept. He writes P1, P2, and P3 horizontally, placing 10 underneath each to represent the equal allocation of 10 frames per process as described in the previous example. He then modifies these values, writing 12, 23, and 7 underneath the respective processes. This visual change likely serves to contrast the equal allocation method with a scenario where processes receive different amounts of frames, possibly hinting at proportional allocation or simply illustrating variance in resource distribution. He gestures towards these numbers while explaining the implications of such allocations, showing how the total frames might be redistributed if the allocation strategy were different, such as proportional allocation based on process size.

The lesson progresses from theoretical definitions of frame allocation limits to a specific algorithm called Equal Allocation. By using a concrete example of 30 frames for 3 processes, the instructor clarifies that equal allocation ignores process size. The subsequent visual writing of process IDs and frame counts reinforces this concept, showing how resources are distributed in a fixed manner before potentially contrasting it with other methods. This progression helps students understand the distinction between fixed allocation strategies and dynamic ones that consider process requirements.

Loading lesson…