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
-tasking system.
On Sat, May 1, 2010 at 5:26 PM, praba garan prabagara...@gmail.com wrote:
@ Guillermo Garcia
Suppose a user program is executing and and clock interrupt arrives..
Then who receives the interrupt??
Can you xplain me the clock interrupt(like any hardwares involved) bit
On Sun, May 2, 2010 at 3:06 AM, praba garan prabagara...@gmail.comwrote:
@ 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
Hola Daniel, why this does not match your needs? (am i missing something)
http://cgm.cs.mcgill.ca/~msuder/courses/360/lectures/articulation/articulation.pdf
On 5/18/07, Daniel Bastidas [EMAIL PROTECTED] wrote:
Hi.
I need the find articulation point algorithm, somebody can help me?
yeahh...
An O(n) solution:
let a = [1,2..N]
print input[0] + 1
remove (input[0]+1) from a
for i = 1 to N-1
print a[input[i]]
remove a[input[i]] from a
On 5/7/07, Phanisekhar B V [EMAIL PROTECTED] wrote:
I feel its possible to do it in O(n log n) for randomized input. I tried
for small
to better understand, can you send an small example with a solution?
On 3/28/07, vinay [EMAIL PROTECTED] wrote:
Hai all,
Given a N X N Matrix( with +ve integers), How to find the elements,
such that only one element from each row and one element from each
column and sum of the elements is
soundex?
http://en.wikipedia.org/wiki/Soundex
On 3/28/07, Kevin [EMAIL PROTECTED] wrote:
This is from an interview question, see how do you guys think of it:
Given a Enlgish word, how to find these words that pronounce similar
to it?
You can have some reasonable assumptions, such as:
A (key?) question: is it tolerable that the merged group of bets generate
some bets that were not contained in the original group?
For example, for the bet group
1 2 3 7 8 9 5 2 3 7 8 9 1 6 3 7 8 9 5 6 3 7 8 9 1 2 4 7 8 9 5 2 4 7 8 9 1
6 4 7 8 9
the merge 1+5 / 2+6 / 3+4 / 7 / 8 / 9, renders
My proposal:
- find how many vertices of one rectangle are inside the other one (easy)
- case
* 4 vertices: one rectangle is contained in the other
* 1 vertex: find intersections between the lines going out from this vertex with the sides of the containing rectangle. Then you have the
Try dynamic programming
On 6/26/06, Pradeep Muthukrishnan [EMAIL PROTECTED] wrote:
I have been trying this problem for quite some time now...but haventfound anything concrete...can anyone solve this?
http://acm.zju.edu.cn/show_problem.php?pid=2642
10 matches
Mail list logo
