COMS W1004 Lecture Notes - Lecture 27: Microarchitecture, Pseudocode, Time Complexity
29 Apr 2016
School
Department
Course
Professor
Document Summary
Sign up sheet will be sent tonight, sign it before wednesday next week. Final review: topics in computer science (chapters 1-5, 7, and 12in schneider and gersting, what is computer science, what are algorithms, representing algorithms in pseudocode. Indexing starts at 1, instead of 0: basic algorithmic analysis, time complexity for sort and searches, representing information using bits, chapter 4, circuit construction, networks. Introductory computer organization: chapter 7, computability, chapter 12, java programming skills (big java: chapters 1-11 and some of 12, variable assignment, primitive data types in java, control structures, conditionals. Static variables: majority of people don"t understand (will be on final, parameter passing, passing primitives, passing object references, designing better classes. Public void transfer(bankaccounts, double a){ a=0; b. deposit(100) double z=100. 0 x. transfer(y,z) z is not affected because z is a primitive, so still 100. 0. Final design: question 1 terms (10 x 2, question 2, multiple choice (40 x 1 , question 3 short answer (20 x 2 )
