Round-Robin Scheduling in operating system-computer world Round-Robin Scheduling The round-robin(R-R Scheduling) Scheduling algorithm is designed for time sharing operating system. Round-Robin is similar to FCFS Scheduling, but preemption is added to enable the system to switch between processes. In Round-Robin Scheduling a small unit of time is used which is called a time quantum or time slice. A time quantum is generally from 10 to 100 millisecond. The CPU Scheduler goes around the ready queue, allocate the CPU to every process for a time interval of up to 1 time quantum. In this scheduling new processes are added to the tail of the ready queue. The CPU scheduler picks the first process from ready queue, set a timer after one time slice and dispatch the process. One of two things will happens. When a process have CPU burst of less the 1 time quantum. In this case the process itself release the CPU. If the CPU burst time of the currently runni...
Aggregation and Functional dependency in DBMS Aggregation In aggregation the relation between two entities is treated as a single entity. In aggregation relationship with its corresponding entity is aggregated into higher level entity . It is the process of compiling information on object, there by obstructing a higher level. On limitation of the ER model is that it can not Express relationship among relationships. The aggregation represent a relationship between a whole object and its component in other word we can say that using aggregation we can express relationship main relationships. For example center entity offer the course entity act as a single entity in the relationship which is in a relationship with another entity visitor. In the real world if a visitor visits a coaching center they will never inquiry about the course or just about the center instead he will ask the inquiry about both. Functional dependency Functional dependency play an ...