Computer Network CH3 Transport LayerTransport Layer: OverviewGoal understanding principle of transport layer servics multiplexing, demultiplexing reliable data transfer flow control congestion contro

Computer Organization CH4 The Processor4.1 introintro p3performance ISA is diff. -> instruction count diff. clock cycle and CPI diff. determined by processor CH4 a more realistic pipeline vers

Algorithm CH2 Getting started2.1 Insertion sortthe number that we wish to sort are known as the keys Insertion sort operation Sorted in place: The numbers are rearranged within the array A, with at m

Algorithm CH3 growth of functionAsymptotic notationO-notation -notation -notation Theorem waringinterpret # of anonymous function functio on left side o-notation -notation Comparison of fun.

Algorithm CH4 RecurrencesA recurrence is a function is defined in terms of one or more base cases, and itself, with smaller arguments Ex. Substitution method T(n) is always constant for any con

Algorithm CH6 HeapsortHeap A is a nearly complete binary tree. Height of node = # of edges on a longest simple path from the node down to a leaf. Height of heap = height of root = (lg n) A heap can

Algorithm CH7 Quicksort description Partition Loop invarient Ex. correctness performance * balanced case is much closer to best case Intuition for the average case 看最好跟最壞的分割情況，只差一個常數而已 而

algorithm CH15 DPEx. Rod cuttinginput: n length of rod price of rod with diff. lengthoutput: max price Assume lenght of rod is n, how many method to cut rod?Ans. to prevent exponential complecity,

Compiler CH3 Scanningscanner(lexical analyzer) the interface between source & compiler routine called by passer Tokens Although the task of the scanner is to convert the entire source program int

Compiler CH4 Grammars and ParsingParsing: Syntax Analysis decides which part of the incoming token stream should be grouped together. the output of parsing is some representation of a parse tree. inte