I = prt = [15000 × 0.07 × (214/365) ]=615.52

Future value, S = P + I = $15 000 + $615.52 = $15 615.52

We have P = 15 000, r = 0.07 and since the actual date the loan was taken out
is not given, we use t =7/12

I = Prt=$15 000* 0.07* 7/12 = $612.50

Amount repaid = Future or accumulated value,

S = P + I = $15 000 + $612.50 = $15 612.50

1. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.


2. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.


3. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.


4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

Virtual channel is normally a connection from one source to one destination, although multicast connections are also permitted. The other name for virtual channel is virtual circuit.

Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process.

Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.

Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption.

Let sum=Rs.x

C.I. when compounded half yearly = x1+101004-x=464110000

C.I. when compounded annually =x201002-x=1125

 464110000x-1125x=482

=> x=20000