give an algo to calculate 300! or even 400!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
Hi all,
I have a doubt in OS.
The scheduler does the process of preemption.
And one processor can run atmost 1 instruction at a time.
Then how where does the scheduler run??
With Regards,
Prabagaran.
--
You received this message because you are subscribed to the Google Groups
The scheduler takes control with a clock interruption. Then it analyzes if
it has to preempt or not the running task.
On Sat, May 1, 2010 at 5:00 PM, praba garan prabagara...@gmail.com wrote:
Hi all,
I have a doubt in OS.
The scheduler does the process of preemption.
And one
read here - http://en.wikipedia.org/wiki/Preemption_%28computing%29
Time slice
The period of time for which a process is allowed to run in a preemptive
multitasking system is generally called the *time slice*, or *quantum*. The
scheduler is run once every time slice to choose the next process
@ Guillermo Garcia
The link gives the overall abstract idea.
I am talking in register level.
When a user process executes
1. PC program counter will contain the address of the next instruction in
user code.
2. Processor registers(accumulator ...) contain the current instruction
data.
Then where
this equation is true for 32 but not for 64 so i used a linear search
for 43 the right side is 43.410118 and for 44 its 43.675453
so this equation means n44
On Sat, May 1, 2010 at 9:43 AM, Amit Agarwal lifea...@gmail.com wrote:
I could not get you properly. This is an equation comes from the
take an long array of integer (to store the answer)
let Mod=1 (maximum allowable size or number in the array element
initialize the last element of array with 1
and know start multiplying the 1--n into the last number to first of array
if any number crosses the given then take
m=a[i]/mod
and
An easy way to do would be to plot both functions in matlab, n and 8log(n)
... just see when y = x is below y = 8log(x) happens between 3= n = 25
if log is to natural base if it was log base 2 ... 3= n = 43
On Sat, May 1, 2010 at 10:43 AM, Amit Agarwal lifea...@gmail.com wrote:
I could
@mohit
The idea of DP is fine.
When you find the Max i dont think you need to include A[i+1]+B[j+1] because
it can never be greater than both A[i+1]+B[j] and A[i]+B[j+1] since both the
lists are sorted in decreasing order.
On Fri, Apr 30, 2010 at 8:47 PM, mohit ranjan
lets suppose Processor executing a instruction(process1) and another
process2 tries to take the control of CPU so inorder to inform CPU it has to
interrupt the CPU right
now we know that if interrupt comes CPU stop its current processing and goes
to the interrupt subroutine...now CPU knows that
correct, and in each process switch, the process state (registers, etc. ) is
stored so when the scheduler wants to go back to execute such process, it
restores it to the state exactly before its execution was interrupted
On Sat, May 1, 2010 at 7:32 PM, pradeep verma ppradeep...@gmail.com wrote:
11 matches
Mail list logo
