DOC PREVIEW
CMU CS 15122 - Principles of Imperative Computation

This preview shows page 1-2-21-22 out of 22 pages.

Save
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

15 122 Principles of Imperative Computation Fall 2010 Frank Pfenning Tom Cortina William Lovas http www cs cmu edu fp courses 15122 f10 1 Overview Goals of This Course Interactions Lectures Recitations Office Hours Assessment Quizzes Homeworks Exams A Mysterious Function 2 Goals Computational Thinking Programming Algorithms 3 Computational Thinking Specification vs implementation correctness Logical vs operational reasoning Abstraction and interfaces Loop and data structure invariants Reasoning about resource bounds 4 Programming Skills Transformation of algorithmic ideas into correct imperative code Specify write test debug re factor code in the small Some familiarity with Unix tools and C 5 Programming Language C0 a small safe subset of C int bool char string arrays pointers structs Essential algorithmic and programming ideas Relatively close to machine imperative Sound reasoning with contracts Transition to C near end of course 6 Algorithmic Ideas Asymptotic complexity time space parallel worst case average case important classes O 1 O log n O n log n O nk O 2n Divide and conquer P vs NP recently in the news Emphasis on imperative prog s ephemeral data struct s 7 Concrete Algorithms sample not a promise Basic arithmetic Binary search sorting Stacks and queues priority queues Binary trees dictionaries maps sets tries Hashing hash tables Graphs reachability shortest path spanning trees Satisfiability SAT 8 Role in Curriculum 15 150 Principles of Functional Programming 15 213 Introduction to Computer Systems 15 210 Fundamental Alg s Data Struct s 15 214 Principles of Software Systems 9 Overview Goals of this course Interactions Lectures Recitations Office Hours Assessment Quizzes Homeworks Exams A Mysterious Function 10 Lectures Please be here please be active Ask and answer questions pay attention No textbook new course Laptops for note taking only No surfing email games Too distracting for everyone else 11 Recitations Reinforce lecture material Problem solving How to programming and tool support Get to know your instructor 12 Office Hours We like to see you Any questions and issues with course See web page for current hours and location Cluster help available Tue Thu 6 30 9 30 13 On line Communication Blackboard for grades quizzes email announcements Bboard cyrus academic cs 15 122 Email to me TA or CA Cluster Linux machines for and afs for assignments 14 Overview Goals of this course Interactions Lectures Recitations Office Hours Assessment Quizzes Homeworks Exams A Mysterious Function 15 Quizzes Test basic understanding On line on Blackboard auto graded Due Monday night 8 quizzes drop lowest score Total of 7 15 100 pts 16 Midterms Test functional understanding of material During lecture period 80 mins Closed book closed laptop 1 sheet of notes Total of 2 100 200 pts 17 Final Testing cumulative mastery of material Three hours during final exam period Closed book closed laptop 1 sheet of notes Total of 250 points 18 Assignments Weekly assignment out Thu due Thu Apply material in problem solving context Combination of written and programming Hand in start of lecture written online prog Total of 3 late days on prog none on written Max of 1 late day per assignment Total of 7 50 1 100 450 pts 19 Academic Integrity Quizzes exams homework must be your own OK discussion of course material practice problems study sessions Not OK copying or discussing answers looking at or copying each others code even parts Tomorrow in recitation read and sign academic integrity policy for this class ask when in doubt University policy will be applied rigorously 20 Overview Goals of this course Interactions Lectures Recitations Office Hours Assessment Quizzes Homeworks Exams A Mysterious Function 21 Bug Report int f int n int i 0 int k 0 while k n k i 1 1 i return i 1 22


View Full Document

CMU CS 15122 - Principles of Imperative Computation

Loading Unlocking...
Login

Join to view Principles of Imperative Computation and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Principles of Imperative Computation and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?