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{.

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.

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.

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.

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 ...