Algorithm CH7 Quick sort Algorithm CH7 Quicksort description Partition Loop invarient Ex. correctness performance * balanced case is much closer to best case Intuition for the average case 看最好跟最壞的分割情況,只差一個常數而已 而 2024-04-30 Algorithm #Math
Algorithm CH15 DP 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, 2024-04-30 Algorithm #Math
Compiler CH3 Scanning 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 2024-04-18 Compiler
Compiler CH4 Grammars and Parsing 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 2024-04-18 Compiler
Compiler CH5 Top-Down Parsing Compiler CH5 Top-Down Parsingobjectves of Top-Down Parsingan attempt to find a leftmost derivation for an input string an attempt to construct a parse tree for the input string starting from the root 2024-04-18 Compiler
Computer Organization CH1 Abstraction computer organization CH1 Abstraction1.1 introclasses of computer Personal Embedded Server Supercomputers why will you learned? the hardware/software interface understanding performance I depends 2024-04-18 Computer Organization
Computer Organization CH2 Instructions: Language of the Computer Computer Organization CH2 Instructions: Language of the Computer2.1 IntroductionInstruction SetInstructions command a computer’s hardware the words of a computer’s language An Instruction set vocab 2024-04-18 Computer Organization
Computer Organization CH3 Arithmetic for Computeres Computer Organization CH3 Arithmetic for Computeres3.1 IntroductionChapter GoalsTo understand representation of real numbers arithmetic algo. hardware that follows these algo. the implications(影響) of 2024-04-08 Computer Organization
Algorithm Ch9 Medians and Order Statistics Algorithm Ch9 Medians and Order StatisticsOverview ith order statistic: the ith smallest ele. of a set of n ele. minimum: the first order statistic(i=1) maximum: the nth order statistic(i=n) mediam: t 2024-04-08 Algorithm #Math
Algorithm Ch8 Sort in linear time Algorithm Ch8 Sort in linear timeLower bounds for sorting to examine all the input All sort lower bound are is lower bound for comparison test Decision Tree Abstration of any comparison sort Repr 2024-04-07 Algorithm #Math