computersciencecafe.blogspot.com
Memory Management - Paging, Swaping, Partitioning | Computer Science Cafe
http://computersciencecafe.blogspot.com/2010/11/operating-system-memory-management-part.html
Computer Science Lecture Notes. Tuesday, November 23, 2010. Memory Management - Paging, Swaping, Partitioning. Bring process into main memory from input queue. 1 If using equal size partitions. Main memory is divided into fix size partitions initially. A process whose size = partition can only be loaded in it. If program large than partition size program has to design it with overlays reduces the OS overhead. Could lead to internal fragmentation for small size process. 2 If using unequal size partitions.
computersciencecafe.blogspot.com
Instruction set and Addressing mode | Computer Science Cafe
http://computersciencecafe.blogspot.com/2011/01/instruction-set-and-addressing-mode.html
Computer Science Lecture Notes. Wednesday, January 19, 2011. Instruction set and Addressing mode. Addressing mode are aspect of instruction set architecture. Defines how the instructions identifies the operand. Operand is present in the instruction. Typically number will be stored in 2's compliment form. No memory reference other that instruction fetch is needed to get operand. Limits the size of number with size of address field. ADD R4, #5. Reg[R4] - - reg[R4] 5. ADD R4, 3000. ADD R4, 3000. ADD R4,R3,R2.
computersciencecafe.blogspot.com
Computer Science Cafe: Ebook Links
http://computersciencecafe.blogspot.com/p/ebook-links.html
Computer Science Lecture Notes. Theory of Computation ebooks. Introduction to Formal Language and Automata, Peter Linz. Http:/ rapidshare.com/files/265398218/IntroductiontoFormalLanguagesandAutomata PETERLINZ.pdf. Http:/ rapidshare.com/files/277102154/Automata Peter Linz.pdf.html. Introduction to the theory of computation Michael Sisper. Http:/ hotfile.com/dl/44088885/1fe7051/IntroductionToThe TC - MS.zip.html. Data Structure and Algorithms. Http:/ rapidshare.com/files/267900997/MCQ.pdf.
computersciencecafe.blogspot.com
Instruction Pipeline and CPU Performance | Computer Science Cafe
http://computersciencecafe.blogspot.com/2010/12/instruction-pipeline-and-cpu.html
Computer Science Lecture Notes. Wednesday, December 8, 2010. Instruction Pipeline and CPU Performance. Pipeline is implementation technique where multiple instructions are overlapped in execution. Pipeline does not reduces the completion task for single task but increases the throughput of entire workload. Preformance increase from pipeline is directly proportional to number of pipe stages. Time from initiation of instruction until its result available. Is number of operations per unit time. Instruction ...
computersciencecafe.blogspot.com
Theory of computation - Regular, CFG, Recursive languages | Computer Science Cafe
http://computersciencecafe.blogspot.com/2010/12/theory-of-computation-part-1.html
Computer Science Lecture Notes. Thursday, December 16, 2010. Theory of computation - Regular, CFG, Recursive languages. Identities of regular expression. 1) R*R* = R*. 2) (R*)* = R*. 3) RR* = R*R. 3) (a b)* = (a*b*)* = (a* b*)* = (a b*)* = a*(ba*)*. Example simplify ( a*b*)* (b*a*)*)*. A b)*(a b)*)* / set union is commutative that is a b = b a. A b)* / using above 1) and 2). 6) ∅ R = R. 7) Rε = R. 8) ∅* = ε. The empty set ∅ = {} is not the same as the empty string ε. So {}* = {ε}! Ie a* (a b)* =(a b)*.
computersciencecafe.blogspot.com
Latex | Computer Science Cafe
http://computersciencecafe.blogspot.com/2014/03/latex.html
Computer Science Lecture Notes. Tuesday, March 15, 2011. A 2 b 2=c 2{. A 2 b 2=c 2{. X={-b pm sqrt{b 2-4ac} over 2a} {. X={-b pm sqrt{b 2-4ac} over 2a} {. Tall parentheses and fractions. 2 = left( frac{ left(3-x right) times 2}{3-x} right){. 2 = left( frac{ left(3-x right) times 2}{3-x} right){. S { text{new} = S { text{old} - frac{ left( 5-T right) 2} {2}{. S { text{new} = S { text{old} - frac{ left( 5-T right) 2} {2}{. Int a s f(y) ,dy ,ds = int a x f(y)(x-y) ,dy{. U' p(x)u' q(x)u = f(x), quad x a{.
computersciencecafe.blogspot.com
Asymptotic growth of function (Comparision) | Computer Science Cafe
http://computersciencecafe.blogspot.com/2011/03/asymptotic-function-growth.html
Computer Science Lecture Notes. Tuesday, March 1, 2011. Asymptotic growth of function (Comparision). Rules for comparing asymptotic growth of functions. 2) if f(n) g(n) then 1/g(n) 1/f(n). Ordering functions according to their asymptotic growth. 1 log(log n) log n n. Where 0 ε 1 and C 1. Because f(n)/g(n) - infinity as n - infinity for each f(n) g(n). 3)Using the reciprocal rule in above hierarchy we can deduce that. 1 / log n. Concrete Mathematics, Graham Knuth Pattasnik. Posted by sourabh Shrishrimal.
computersciencecafe.blogspot.com
Computer Science Cafe: January 2011
http://computersciencecafe.blogspot.com/2011_01_01_archive.html
Computer Science Lecture Notes. Wednesday, January 19, 2011. 1)Using Banker Algorithm you always work on NEED not MAX claim. 2)We add the Allocation NOT the NEED to Avaiable. 3)Available resources, when total resources is given = total - allocated. 4)when a new process enters the system find its need request and new available as. New available = available = request for process. 6)Deadlock can involve process not in circular chain if they request resource currently held by process in circular chain. Prove...
computersciencecafe.blogspot.com
Database Index - B tree, B+ tree | Computer Science Cafe
http://computersciencecafe.blogspot.com/2010/11/database-indexes.html
Computer Science Lecture Notes. Sunday, November 28, 2010. Database Index - B tree, B tree. Why database index are used. Database index helps improve the data retrieval speed in response to certain search conditions. Drawbacks with database index. Slower write, index needs to be updated on sql updates. Storage space, index may grow based on the column values. Type of Single level Database index. Ordering key field is used to physically order records on disk. Dictates the order of physical data in a table.
computersciencecafe.blogspot.com
Computer Science Cafe: September 2010
http://computersciencecafe.blogspot.com/2010_09_01_archive.html
Computer Science Lecture Notes. Thursday, September 30, 2010. Graph Theory Problem solutions links. Http:/ www.mpi-inf.mpg.de/ pascal/graphtheory exercises.html. Very good set of questions , with solutions. Wwwmath.udel.edu/ lazebnik/papers/688hwsols.pdf. Graph theory and combinatorics part 1. Http:/ www.math.udel.edu/ lazebnik/papers/689H1-4S.pdf. Graph theory and combinatorics part 2. Posted by sourabh Shrishrimal. Links to this post. Graph Theory Notes Part1. Topics covered in Graph Theory Part 1 are.
