This document summarizes key concepts related to CPU scheduling from Chapter 6 of the textbook "Operating System Concepts Essentials – 2nd Edition". It covers basic CPU scheduling concepts, different scheduling algorithms like FCFS, SJF, priority scheduling and round robin. It also discusses scheduling criteria, thread scheduling, multilevel queues, and the pthread scheduling API. The goal is to introduce CPU scheduling techniques used in modern operating systems.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, and waiting time. It also describes techniques like multilevel feedback queues that allow processes to move between queues with different scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the 9th edition of Operating System Concepts by Silberschatz, Galvin and Gagne, which covers CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It then explains common scheduling algorithms like first-come first-served, shortest job first, priority scheduling and round robin. It also discusses thread scheduling, multilevel queues, and multilevel feedback queues. The objectives are to introduce CPU scheduling, describe various algorithms, and discuss criteria for selecting algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It also describes techniques like predicting next CPU burst times, aging priorities to prevent starvation, and using multilevel queues and feedback queues.
Various CPU Scheduling Algorithms in OS.ppttaricvilla
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It covers CPU scheduling, which is the basis for multiprogrammed operating systems. Various scheduling algorithms like FCFS, SJF, priority scheduling and round robin are described. Evaluation criteria for selecting scheduling algorithms like CPU utilization, throughput, turnaround time and waiting time are discussed.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in real systems and provides examples of scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, and waiting time. It also describes techniques like multilevel feedback queues that allow processes to move between queues with different scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the 9th edition of Operating System Concepts by Silberschatz, Galvin and Gagne, which covers CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It then explains common scheduling algorithms like first-come first-served, shortest job first, priority scheduling and round robin. It also discusses thread scheduling, multilevel queues, and multilevel feedback queues. The objectives are to introduce CPU scheduling, describe various algorithms, and discuss criteria for selecting algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It also describes techniques like predicting next CPU burst times, aging priorities to prevent starvation, and using multilevel queues and feedback queues.
Various CPU Scheduling Algorithms in OS.ppttaricvilla
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It covers CPU scheduling, which is the basis for multiprogrammed operating systems. Various scheduling algorithms like FCFS, SJF, priority scheduling and round robin are described. Evaluation criteria for selecting scheduling algorithms like CPU utilization, throughput, turnaround time and waiting time are discussed.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in real systems and provides examples of scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
CPU Scheduling is the process through which we can find the best way to check the shortest and fastest working. Different Algorithms are explained here in this chapter. First-come-first-servers, Shortest Job First, Shortest remaining time first,
Round Robin, Priority Scheduler.
cpu scheduling bassically tell us about the outer structure or the managemnet of the computer tha how it is done ,it bassically tell us about how our cpu is scheduled.
This document discusses CPU scheduling in operating systems. It covers basic scheduling concepts like processes alternating between CPU and I/O bursts. It then discusses scheduling criteria like response time and algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced topics like multilevel queue scheduling, multiple processor scheduling, and real-time scheduling. Evaluation methods for scheduling algorithms like simulation and queueing models are also mentioned.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts Essentials". It discusses CPU scheduling, which selects processes to run on the CPU. Various scheduling algorithms are described, including first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time and response time. Multilevel queue and feedback queue approaches are also summarized.
This document discusses CPU scheduling in operating systems. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). Evaluation criteria for scheduling algorithms like CPU utilization, throughput, turnaround time, and waiting time are also presented. Multilevel queue and multilevel feedback queue scheduling are discussed as ways to improve performance.
The document summarizes key concepts from Chapter 6 of Operating System Concepts - 9th Edition about CPU scheduling. It discusses the goals of CPU scheduling, including maximizing CPU utilization and throughput. It describes common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced techniques such as multilevel queue scheduling and multilevel feedback queue scheduling. Evaluation methods like deterministic modeling are presented to analyze and compare the performance of different scheduling algorithms.
Operating System - CPU Scheduling IntroductionJimmyWilson26
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes various scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers scheduling criteria for optimization and examples of applying the different algorithms.
The document discusses CPU scheduling algorithms in operating systems. It covers basic scheduling concepts, criteria for evaluating algorithms, and examples of common algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, real-time scheduling, thread scheduling, and scheduling on multiprocessor and multicore systems.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time, and response time. Ready queues can be partitioned into multiple levels with different scheduling policies to implement multilevel queue and feedback queue scheduling.
This document summarizes Chapter 5 from the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. The chapter introduces CPU scheduling algorithms which are important for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization and waiting time. Specific algorithms covered include first-come first-served scheduling, shortest-job-first scheduling, priority scheduling, and round robin scheduling. Advanced scheduling techniques involving multiple queues and multiple processors are also discussed.
This document discusses CPU scheduling algorithms in operating systems. It begins with an outline of the chapter topics, including basic concepts, scheduling criteria, algorithms like first-come first-served (FCFS), shortest job first (SJF), and round robin (RR). It then examines these algorithms in more detail through examples, discussing how to estimate process burst times, preemptive vs non-preemptive approaches, and optimization criteria like wait time. Real-time scheduling and examples from Windows, Linux and Solaris are also mentioned.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts" related to CPU scheduling. It discusses basic scheduling concepts like multiprogramming and the CPU-I/O burst cycle. It then covers various scheduling algorithms like first-come first-served, shortest-job-first, priority scheduling, and round robin. The document also discusses optimization criteria, techniques for estimating future CPU bursts, multilevel queue scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 10th Edition" regarding CPU scheduling. It covers common CPU scheduling algorithms like first-come first-served, shortest job first, round robin, and priority scheduling. It also discusses scheduling criteria to evaluate algorithms and challenges like starvation for low priority processes. Multilevel queues, multilevel feedback queues, and thread scheduling concepts are presented. The objectives of describing various scheduling techniques, assessing them, and applying modeling and simulations to evaluate performance are outlined.
This document provides an overview of CPU scheduling algorithms in operating systems. It begins with basic concepts like CPU utilization and I/O burst cycles. It then discusses various scheduling criteria like throughput and turnaround time. Common scheduling algorithms covered include first-come first-served, shortest job first, round robin, priority scheduling, and multilevel queue scheduling. It also addresses thread scheduling, multiprocessor scheduling, and real-time scheduling. The objectives are to describe and evaluate various CPU scheduling algorithms based on scheduling criteria.
Senthilkanth,MCA..
The following ppt's full topic covers Operating System for BSc CS, BCA, MSc CS, MCA students..
1.Introduction
2.OS Structures
3.Process
4.Threads
5.CPU Scheduling
6.Process Synchronization
7.Dead Locks
8.Memory Management
9.Virtual Memory
10.File system Interface
11.File system implementation
12.Mass Storage System
13.IO Systems
14.Protection
15.Security
16.Distributed System Structure
17.Distributed File System
18.Distributed Co Ordination
19.Real Time System
20.Multimedia Systems
21.Linux
22.Windows
This document summarizes a chapter on CPU scheduling from a textbook. It discusses key concepts in CPU scheduling like scheduling criteria, algorithms, and evaluation methods. The major scheduling algorithms covered are first-come, first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, and real-time scheduling.
This document provides an overview of CPU scheduling concepts and algorithms. It discusses key scheduling concepts like processes, ready queues, context switching and dispatch latency. It then covers common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). The document also discusses more advanced scheduling techniques such as multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, real-time scheduling and thread scheduling. Finally, it provides examples of scheduling in specific operating systems like Solaris, Windows and Linux.
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
CPU Scheduling is the process through which we can find the best way to check the shortest and fastest working. Different Algorithms are explained here in this chapter. First-come-first-servers, Shortest Job First, Shortest remaining time first,
Round Robin, Priority Scheduler.
cpu scheduling bassically tell us about the outer structure or the managemnet of the computer tha how it is done ,it bassically tell us about how our cpu is scheduled.
This document discusses CPU scheduling in operating systems. It covers basic scheduling concepts like processes alternating between CPU and I/O bursts. It then discusses scheduling criteria like response time and algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced topics like multilevel queue scheduling, multiple processor scheduling, and real-time scheduling. Evaluation methods for scheduling algorithms like simulation and queueing models are also mentioned.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts Essentials". It discusses CPU scheduling, which selects processes to run on the CPU. Various scheduling algorithms are described, including first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time and response time. Multilevel queue and feedback queue approaches are also summarized.
This document discusses CPU scheduling in operating systems. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). Evaluation criteria for scheduling algorithms like CPU utilization, throughput, turnaround time, and waiting time are also presented. Multilevel queue and multilevel feedback queue scheduling are discussed as ways to improve performance.
The document summarizes key concepts from Chapter 6 of Operating System Concepts - 9th Edition about CPU scheduling. It discusses the goals of CPU scheduling, including maximizing CPU utilization and throughput. It describes common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced techniques such as multilevel queue scheduling and multilevel feedback queue scheduling. Evaluation methods like deterministic modeling are presented to analyze and compare the performance of different scheduling algorithms.
Operating System - CPU Scheduling IntroductionJimmyWilson26
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes various scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers scheduling criteria for optimization and examples of applying the different algorithms.
The document discusses CPU scheduling algorithms in operating systems. It covers basic scheduling concepts, criteria for evaluating algorithms, and examples of common algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, real-time scheduling, thread scheduling, and scheduling on multiprocessor and multicore systems.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time, and response time. Ready queues can be partitioned into multiple levels with different scheduling policies to implement multilevel queue and feedback queue scheduling.
This document summarizes Chapter 5 from the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. The chapter introduces CPU scheduling algorithms which are important for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization and waiting time. Specific algorithms covered include first-come first-served scheduling, shortest-job-first scheduling, priority scheduling, and round robin scheduling. Advanced scheduling techniques involving multiple queues and multiple processors are also discussed.
This document discusses CPU scheduling algorithms in operating systems. It begins with an outline of the chapter topics, including basic concepts, scheduling criteria, algorithms like first-come first-served (FCFS), shortest job first (SJF), and round robin (RR). It then examines these algorithms in more detail through examples, discussing how to estimate process burst times, preemptive vs non-preemptive approaches, and optimization criteria like wait time. Real-time scheduling and examples from Windows, Linux and Solaris are also mentioned.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts" related to CPU scheduling. It discusses basic scheduling concepts like multiprogramming and the CPU-I/O burst cycle. It then covers various scheduling algorithms like first-come first-served, shortest-job-first, priority scheduling, and round robin. The document also discusses optimization criteria, techniques for estimating future CPU bursts, multilevel queue scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 10th Edition" regarding CPU scheduling. It covers common CPU scheduling algorithms like first-come first-served, shortest job first, round robin, and priority scheduling. It also discusses scheduling criteria to evaluate algorithms and challenges like starvation for low priority processes. Multilevel queues, multilevel feedback queues, and thread scheduling concepts are presented. The objectives of describing various scheduling techniques, assessing them, and applying modeling and simulations to evaluate performance are outlined.
This document provides an overview of CPU scheduling algorithms in operating systems. It begins with basic concepts like CPU utilization and I/O burst cycles. It then discusses various scheduling criteria like throughput and turnaround time. Common scheduling algorithms covered include first-come first-served, shortest job first, round robin, priority scheduling, and multilevel queue scheduling. It also addresses thread scheduling, multiprocessor scheduling, and real-time scheduling. The objectives are to describe and evaluate various CPU scheduling algorithms based on scheduling criteria.
Senthilkanth,MCA..
The following ppt's full topic covers Operating System for BSc CS, BCA, MSc CS, MCA students..
1.Introduction
2.OS Structures
3.Process
4.Threads
5.CPU Scheduling
6.Process Synchronization
7.Dead Locks
8.Memory Management
9.Virtual Memory
10.File system Interface
11.File system implementation
12.Mass Storage System
13.IO Systems
14.Protection
15.Security
16.Distributed System Structure
17.Distributed File System
18.Distributed Co Ordination
19.Real Time System
20.Multimedia Systems
21.Linux
22.Windows
This document summarizes a chapter on CPU scheduling from a textbook. It discusses key concepts in CPU scheduling like scheduling criteria, algorithms, and evaluation methods. The major scheduling algorithms covered are first-come, first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, and real-time scheduling.
This document provides an overview of CPU scheduling concepts and algorithms. It discusses key scheduling concepts like processes, ready queues, context switching and dispatch latency. It then covers common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). The document also discusses more advanced scheduling techniques such as multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, real-time scheduling and thread scheduling. Finally, it provides examples of scheduling in specific operating systems like Solaris, Windows and Linux.
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Physiology and chemistry of skin and pigmentation, hairs, scalp, lips and nail, Cleansing cream, Lotions, Face powders, Face packs, Lipsticks, Bath products, soaps and baby product,
Preparation and standardization of the following : Tonic, Bleaches, Dentifrices and Mouth washes & Tooth Pastes, Cosmetics for Nails.