The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x

Wall for nikunj

Deadlock Prevention: Wait/Wound/Die Algorithms
http://www.cs.colostate.edu/~cs551/CourseNotes/Deadlock/WaitWoundDie.html
Sep 13 by nikunj
"Operating System Concepts, Ninth Edition ", Chapter 7- Deadlock
https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/7_Deadlocks.html
Sep 11 by nikunj
Serial schedule possible only if graph does not contain cycle . And a graph with a topological sort must be an acyclic graph.

BFS can work BOTH cyclic and acyclic graphs.

Thats why we choose topological sort.

Reference :

https://www.quora.com/Why-must-a-graph-with-a-topological-sort-be-acyclic-and-why-must-an-acyclic-graph-have-a-topological-sort
Sep 11 by nikunj
Everything we need to know about context switching
http://www.linfo.org/context_switch.html
Sep 11 by nikunj
In static scoping, if a variable is not defined in the local space, it is looked in the global space.

In dynamic scoping, if a variable is not found in the local space, it is looked in the place from which the function is called (like this recursively) and only at the end in global space.

 

http://courses.cs.washington.edu/courses/cse341/03wi/imperative/scoping.html
Sep 11 by nikunj
Sep 10 by nikunj
28,834 questions
36,686 answers
90,617 comments
34,640 users