General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

More documents

Recommendations

Info

$The LaTeXML Daemon: A LATEX Entrance to the Semantic Web$

$Mathematical Documents want to Active Digital Math ... - Kwarc$

6 CHAPTER 1. GETTING STARTED WITH “GENERAL COMPUTER SCIENCE” this is a document passed by the Jacobs community (our law of the university) you have signed it last week (we take this seriously) It mandates good behavior and penalizes bad from both faculty and students honest academic behavior (we don’t cheat/falsify) respect and protect the intellectual property of others (no plagiarism) treat all Jacobs members equally (no favoritism) this is to protect you and build an atmosphere of mutual respect academic societies thrive on reputation and respect as primary currency The Reasonable Person Principle (one lubricant of academia) we treat each other as reasonable persons the other’s requests and needs are reasonable until proven otherwise but if the other violates our trust, we are deeply disappointed(severe uncompromising consequences) ©: Michael Kohlhase 6 To understand the rules of academic societies it is central to realize that these communities are driven by economic considerations of their members. However, in academic societies, the primary good that is produced and consumed consists in ideas and knowledge, and the primary currency involved is academic reputation 2 . Even though academic societies may seem as altruistic — scientists share their knowledge freely, even investing time to help their peers understand the concepts more deeply — it is useful to realize that this behavior is just one half of an economic transaction. By publishing their ideas and results, scientists sell their goods for reputation. Of course, this can only work if ideas and facts are attributed to their original creators (who gain reputation by being cited). You will see that scientists can become quite fierce and downright nasty when confronted with behavior that does not respect other’s intellectual property. The Academic Integrity Committee (AIC) Joint Committee by students and faculty (Not at “student honours court”) Mandate: to hear and decide on any major or contested allegations, in particular, the AIC decides based on evidence in a timely manner the AIC makes recommendations that are executed by academic affairs the AIC tries to keep allegations against faculty anonymous for the student we/you can appeal any academic integrity allegations to the AIC ©: Michael Kohlhase 7 One special case of academic rules that affects students is the question of cheating, which we will cover next. Cheating [adapted from CMU:15-211 (P. Lee, 2003)] There is no need to cheat in this course!! (hard work will do) 2 Of course, this is a very simplistic attempt to explain academic societies, and there are many other factors at work there. For instance, it is possible to convert reputation into money: if you are a famous scientist, you may get a well-paying job at a good university,. . .
1.2. ADMINISTRATIVA 7 cheating prevents you from learning (you are cutting your own flesh) if you are in trouble, come and talk to me (I am here to help you) We expect you to know what is useful collaboration and what is cheating you will be required to hand in your own original code/text/math for all assignments you may discuss your homework assignments with others, but if doing so impairs your ability to write truly original code/text/math, you will be cheating copying from peers, books or the Internet is plagiarism unless properly attributed(even if you change most of the actua more on this as the semester goes on . . . There are data mining tools that monitor the originality of text/code. Procedure: If we catch you at cheating (correction: if we suspect cheating) we will confront you with the allegation (you can explain yourself) if you admit or are silent, we impose a grade sanction and notify registrar repeat infractions to go the AIC for deliberation (much more serious) Note: both active (copying from others) and passive cheating (allowing others to copy) are penalized equally ©: Michael Kohlhase 8 We are fully aware that the border between cheating and useful and legitimate collaboration is difficult to find and will depend on the special case. Therefore it is very difficult to put this into firm rules. We expect you to develop a firm intuition about behavior with integrity over the course of stay at Jacobs. 1.2.3 Resources Textbooks, Handouts and Information, Forum No required textbook, but course notes, posted slides Course notes in PDF will be posted at http://kwarc.info/teaching/<strong>GenCS</strong>1.html Everything will be posted on PantaRhei (Notes+assignments+course forum) announcements, contact information, course schedule and calendar discussion among your fellow students(careful, I will occasionally check for academic integrity!) http://panta.kwarc.info (follow instructions there) if there are problems send e-mail to c.david@jacobs-university.de ©: Michael Kohlhase 9 No Textbook: Due to the special circumstances discussed above, there is no single textbook that covers the course. Instead we have a comprehensive set of course notes (this document). They are provided in two forms: as a large PDF that is posted at the course web page and on the PantaRhei system. The latter is actually the preferred method of interaction with the course materials, since it allows to discuss the material in place, to play with notations, to give feedback, etc. The PDF file is for printing and as a fallback, if the PantaRhei system, which is still under development, develops problems.
Page 1 and 2: General Computer Science 320201 Gen
Page 3 and 4: Computer Science: In accordance to
Page 5: Recorded Syllabus for 2012/13 In th
Page 8 and 9: viii CONTENTS 6 More SML 67 6.1 Rec
Page 10 and 11: 2 CHAPTER 1. GETTING STARTED WITH
Page 18 and 19: 10 CHAPTER 2. MOTIVATION AND INTROD
Page 29 and 30: Chapter 3 Elementary Discrete Math
Page 31 and 32: 3.2. REASONING ABOUT NATURAL NUMBER
Page 33 and 34: 3.2. REASONING ABOUT NATURAL NUMBER
Page 35 and 36: 3.3. DEFINING OPERATIONS ON NATURAL
Page 37 and 38: 3.4. TALKING (AND WRITING) ABOUT MA
Page 39 and 40: 3.5. NAIVE SET THEORY 31 e.g. by ch
Page 41 and 42: 3.5. NAIVE SET THEORY 33 n-fold Ca
Page 43 and 44: 3.6. RELATIONS AND FUNCTIONS 35 Id
Page 45 and 46: 3.6. RELATIONS AND FUNCTIONS 37 Ex
Page 47 and 48: Chapter 4 Computing with Functions
Page 49 and 50: 4.1. STANDARD ML: FUNCTIONS AS FIRS
Page 57 and 58: 4.2. INDUCTIVELY DEFINED SETS AND C
Page 59 and 60: 4.2. INDUCTIVELY DEFINED SETS AND C
Page 61 and 62: 4.3. INDUCTIVELY DEFINED SETS IN SM
Page 63 and 64: Chapter 5 A Theory of SML: Abstract
Page 65 and 66:
5.2. A FIRST ABSTRACT INTERPRETER 5
Page 67 and 68:
5.3. SUBSTITUTIONS 59 not allowed i
Page 69 and 70:
5.4. A SECOND ABSTRACT INTERPRETER
Page 71 and 72:
5.5. EVALUATION ORDER AND TERMINATI
Page 73 and 74:
5.5. EVALUATION ORDER AND TERMINATI
Page 75 and 76:
Chapter 6 More SML 6.1 Recursion in
Page 77 and 78:
6.2. PROGRAMMING WITH EFFECTS: IMPE
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Chapter 7 Encoding Programs as Stri
Page 85 and 86:
7.2. ELEMENTARY CODES 77 Lexical Or
Page 87 and 88:
7.3. CHARACTER CODES IN THE REAL WO
Page 89 and 90:
7.3. CHARACTER CODES IN THE REAL WO
Page 91 and 92:
7.4. FORMAL LANGUAGES AND MEANING 8
Page 93 and 94:
Chapter 8 Boolean Algebra We will n
Page 95 and 96:
8.1. BOOLEAN EXPRESSIONS AND THEIR
Page 97 and 98:
8.2. BOOLEAN FUNCTIONS 89 (use the
Page 99 and 100:
8.3. COMPLEXITY ANALYSIS FOR BOOLEA
Page 101 and 102:
8.3. COMPLEXITY ANALYSIS FOR BOOLEA
Page 103 and 104:
8.4. THE QUINE-MCCLUSKEY ALGORITHM
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
8.5. A SIMPLER METHOD FOR FINDING M
Page 111 and 112:
Chapter 9 Propositional Logic 9.1 B
Page 113 and 114:
9.1. BOOLEAN EXPRESSIONS AND PROPOS
Page 115 and 116:
9.2. A DIGRESSION ON NAMES AND LOGI
Page 117 and 118:
9.3. CALCULI FOR PROPOSITIONAL LOGI
Page 119 and 120:
9.4. PROOF THEORY FOR THE HILBERT C
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
9.5. A CALCULUS FOR MATHTALK 117 I
Page 127 and 128:
9.5. A CALCULUS FOR MATHTALK 119 If
Page 129 and 130:
Chapter 10 Machine-Oriented Calculi
Page 131 and 132:
10.1. CALCULI FOR AUTOMATED THEOREM
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
10.2. RESOLUTION FOR PROPOSITIONAL
Page 139:
Part II Interlude for the Semester
Page 142 and 143:
134 CHAPTER 11. LEGAL FOUNDATIONS O
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
144 CHAPTER 12. WELCOME AND ADMINIS
Page 155 and 156:
In this part, we will learn how to
Page 157 and 158:
Chapter 13 Combinational Circuits W
Page 159 and 160:
13.1. GRAPHS AND TREES 151 ©: Mich
Page 161 and 162:
13.1. GRAPHS AND TREES 153 Labeled
Page 163 and 164:
13.1. GRAPHS AND TREES 155 Trees D
Page 165 and 166:
13.2. INTRODUCTION TO COMBINATORIAL
Page 167 and 168:
13.3. REALIZING COMPLEX GATES EFFIC
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Bibliography [Den00] Peter Denning.
Page 175 and 176:
INDEX 167 abstract ( interpreter),
Page 177 and 178:
INDEX 169 exceptions, 69 exploitati
Page 179 and 180:
INDEX 171 node root, 14 nodes, 12 n
Page 181 and 182:
INDEX 173 state machine, 69 step re
show all

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?