Please try all of the TRY THIS problems throughout this document. When done, do the following:
|
|
- Emerald Rosalyn Rich
- 5 years ago
- Views:
Transcription
1 AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School One great resource for any course is YouTube. Please watch videos to help you with any of the summer homework. Please try all of the TRY THIS problems throughout this document. When done, do the following: Watch the Youtube video Java tutorial 1: hello Java! Getting started with eclipse by Maxwell Sanchez Download the program eclipse. You should look for the following icon: Run the program "Hello World" You can go to the video and type it. Go to File New Java Project Name the project, then return to; go to File New Class. Type in the program below: public class Intro { } public static void main(string[] args) { System.out.println("Hello World"); } Hit the play (run) button when done. Experiment by changing Hello World to any phrase you want. Finally, read chapter 1 from the link below. These are the basics about computers. Answer the questions at the end of the chapter named quiz on chapter 1. This is found on page 17 of the chapter but page 31 on the pdf document. Please send me an to rrabadi@nredlearn.org if you need clarification or assistance with anything. Have a great summer.
2 Decimal base 10 Binary base 2 Hexadecimal base 16 It is very important to know how to convert from decimal to binary and binary to decimal. Converting to Hexadecimal will be taught during the first week of class, but please feel free to learn about them. Please take some time to read the following: To convert the number (decimal) 57 to binary (base 2), you should make a box and write down Binary number : Power of 2: Since I know 2 6 is 64, I know I went over. Therefore I only need up to 2 5. Binary numbers can only take on the two numbers 1 and 0. You cannot use any other value. Take a look at the chart below to see how 57 (base 10) is binary number: power of 2: = = 57 Similarly, if you have the binary then what you should do is make a 6 lines (because in this example there are six numbers) and below the lines you write the powers of Then place the binary on top of each one and compute the value as shown in the table above When you understand try the following examples. The answers are below the examples so that you can check your work. NOTE: Some answers have many zeros in the beginning and that is because many people write binary using 8 digits. However, the zeros in the beginning are not necessary and it is not recommended that you put them there. Again if you need more help, please watch a YouTube video. There are many great ones.
3 TRY THIS: Problem Set 1: Convert from Binary numbers to Decimal
4 Answers Binary to Decimal
5 Problem Set 2: Convert from Decimal to Binary
6 Answers for converting Decimal to Binary
7 Logic Section A statement can either be true or false. We usually represent a statement with a letter that is associated to the statement somehow. For example, Aaron went to the store. Aaron purchased eggs and bacon can be represented as: Let S: represent Aaron went to the store. Let E: represent Aaron purchased eggs. Let B: represent Aaron purchased bacon. Notice that we do not use A for Aaron because Aaron comes up in more than one sentence. Some logic that we should know: Conjunction is the truth-functional connective which forms compound propositions which are true if and only if both statements are true. Also known as the and statement, it is represented in mathematics by the symbol ^. The only way a conjunction can be true is if both statements are true. In computer programming, the symbol for and is a double ampersand &&. T T Disjunction is a connective which forms compound propositions which is true if one statement is true Also known as the or statement, it is represented in mathematics by the symbol V. T. The only way a disjunction can be True if one statement is True. In computer programming, the symbol for or is a double line. Negation: The negation statement is the not statement. It changes the value from true to false and false to true. The mathematical symbol for negation is ~. In computer programming, we use the! symbol to represent negation. Demorgan s Law are rules of logic that show what happens when you negate a conjunction or negate a disjunction. This is very important to remember. ~(p q) is logically equivalent to ~p ~q ~(p q) is logically equivalent to ~p ~q
8 This can be shown by creating the following truth table p q p q ~(p q) ~p ~q ~p ~q T T T F F F F T F F T F T T F T F T T F T F F F T T T T Column 4 and column 7 are equivalent showing that the two statements are equivalent. To do this, I dissected each part. In other words, I asked myself, what parts of the puzzle do I need to show that this is true. Well, you needed the parts that I put in the column. TRY THIS: Show this for the second statement. That is, show ~(p V q) is logically equivalent to ~p ~q. Fill in the chart. p q p q ~(p q) ~p ~q ~p ~q T T T F F T F F Law of Contrapositive: Also logically equivalent to an original statement is its contrapositive (switching the statements around and negating them). p q is logically equivalent to ~q ~p Law of Disjunctive Inference is when you are given two statements that are compounded with an or. Only one of the two statements will happen. Depending on the statement, the conclusion is the opposite. For example, Law of Disjunctive Inference: Statement 1: I will drink milk OR I will drink water. Statement 2: I will not drink milk Conclusion: I will drink water. Using symbols, this looks like Statement 1: M W
9 Statement 2: ~W Conclusion: M Law of Syllogism (Chain Rule): Statement 1: If I go to the movies, then I will buy popcorn Statement 2: If I buy popcorn, then I will buy soda. Conclusion: If I go to the movies, then I will buy soda. This can be written symbolically in the following way, Statement 1: M P Statement 2: P S Conclusion: M S Law of Detachment Statement 1: If I drive to the park, I will need gas for my car. Statement 2: I drive to the park. Conclusion: I will need gas for my car. Law of Modus Tollens (denying the consequent): It makes more sense if we take a look at this by example. If a watchdog detects an intruder then the watchdog will bark. The watchdog does not bark. Therefore, the watchdog did not detect the intruder. Symbolically shown: Statement 1: D B Statement 2: ~B Conclusion: ~D Putting all these laws together, let s try the following example Given: If I get a summer job, then I will earn money. If I fail mathematics, then I will not earn money. I get a summer job or I am not happy. I am happy or I am not successful. I am successful.
10 Prove: I did not fail mathematics. Statement 1) If I get a summer job, then I will earn money. 2) If I fail mathematics, then I will not earn money. 3) I get a summer job or I am not happy. 4) I am happy or I am not successful. 5) I am successful. Reason Given 6) I am not happy Disjunctive inference (using statements 4, 5) 7) I get a summer job Disjunctive inference (using statements 3, 6) 8) I will earn money Detachment (using statements 7 and 1) 9) I will not fail mathematics Modus Tollens (using statements 2 and 8) TRY THIS: A ~B D ~C (~D ~E) F C v B A ~F Prove: E TRY THIS: Use statement-reason method to prove it. Given: Beta is not true Alpha is true or beta is true If gamma is not true, then alpha is not true If sigma is not true, then delta is true If gamma is true, then delta is not true or epsilon is not true or epsilon is not true Epsilon is true Prove: Sigma is true
11 TRY THIS: Given: If I save money, then I buy a car. If I do not save money, then I will take the train. If I buy a car and I buy a bike, then I need insurance. I do not need insurance. I buy a bike. Prove: I take the train.
Geometry Note-Sheet Overview
Geometry Note-Sheet Overview 1. Logic a. A mathematical sentence is a sentence that states a fact or contains a complete idea. Open sentence it is blue x+3 Contains variables Cannot assign a truth variable
More informationSummer Assignment for AP Computer Science. Room 302
Fall 2016 Summer Assignment for AP Computer Science email: hughes.daniel@north-haven.k12.ct.us website: nhhscomputerscience.com APCS is your subsite Mr. Hughes Room 302 Prerequisites: You should have successfully
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationAP Computer Science A Summer Assignment
Mr. George AP Computer Science A Summer Assignment Welcome to AP Computer Science A! I am looking forward to our class. Please complete the assignment below. It is due on the first day back to school in
More informationIII SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions
III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT Multiple Choice Questions MODULE - I 1. In Symbolic logic, do not change their value. a) Variables
More informationStatements Truth Tables. Definition of a Statement
Aendix E Introduction to Logic E.1 Introduction to Logic Statements Truth Tables Statements In everyday seech and in mathematics you make inferences that adhere to common laws of logic. These methods of
More informationAP Computer Science Summer Assignment (updated 5/29/2018) DUE : Sept. 4, 2018
AP Computer Science 2018 2019 E-mail: taegoode@vbschools.com Summer Assignment (updated 5/29/2018) DUE : Sept. 4, 2018 This assignment is due on the first day of class. Please read the instructions carefully
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationL05 - Negating Statements
L05 - Negating Statements CSci/Math 2112 15 May 2015 1 / 14 Assignment 1 Assignment 1 is now posted Due May 22 at the beginning of class Can work on it in groups, but separate write-up Don t forget your
More informationCommas Rule with some Comma Rules
Commas Rule with some Comma Rules Commas can be confusing. Remembering a few basic rules can help! For the best performance of this presentation, open this slideshow to fullscreen view so that all applications
More informationAP Computer Science A Summer Assignment
AP Computer Science A Summer Assignment Welcome to AP Computer Science A! I am looking forward to our class. Please complete the assignment below. Email the completed Part I as an attachment to kgeorge@glenridge.org
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the logic we've been using in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical equivalences.
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationAP Computer Science Unit 1. Writing Programs Using BlueJ
AP Computer Science Unit 1. Writing Programs Using BlueJ 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationHey there, I m (name) and today I m gonna talk to you about rate of change and slope.
Rate and Change of Slope A1711 Activity Introduction Hey there, I m (name) and today I m gonna talk to you about rate of change and slope. Slope is the steepness of a line and is represented by the letter
More informationIntroduction to Java Unit 1. Using BlueJ to Write Programs
Introduction to Java Unit 1. Using BlueJ to Write Programs 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationHow to make a "hello world" program in Java with Eclipse *
OpenStax-CNX module: m43473 1 How to make a "hello world" program in Java with Eclipse * Hannes Hirzel Based on How to make a "hello world" program in Java. by Rodrigo Rodriguez This work is produced by
More informationAP Computer Science Summer Work Mrs. Kaelin
AP Computer Science Summer Work 2018-2019 Mrs. Kaelin jkaelin@pasco.k12.fl.us Welcome future 2018 2019 AP Computer Science Students! I am so excited that you have decided to embark on this journey with
More informationCS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
More informationSt. Edmund Preparatory High School Brooklyn, NY
AP Computer Science Mr. A. Pinnavaia Summer Assignment St. Edmund Preparatory High School Name: I know it has been about 7 months since you last thought about programming. It s ok. I wouldn t want to think
More informationBASIC COMPUTATION. public static void main(string [] args) Fundamentals of Computer Science I
BASIC COMPUTATION x public static void main(string [] args) Fundamentals of Computer Science I Outline Using Eclipse Data Types Variables Primitive and Class Data Types Expressions Declaration Assignment
More informationAP Computer Science Unit 1. Writing Programs Using BlueJ
AP Computer Science Unit 1. Writing Programs Using BlueJ 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationHonors Geometry Chapter 2 Test * Required
Honors Geometry Chapter 2 Test * Required Matching Vocabulary Section 1. Compound with the word "and" 2. negates both the hypothesis and conclusion 3. "if-then" s https://docs.google.com/a/evsck12.com/forms/d/1tjnuxtlrl3_kjnv3uxiay6oe-mvaxf7pieqvisunsye/edit
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the logic we've been using in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical equivalences.
More informationCOSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture)
COSC 243 Data Representation 3 Lecture 3 - Data Representation 3 1 Data Representation Test Material Lectures 1, 2, and 3 Tutorials 1b, 2a, and 2b During Tutorial a Next Week 12 th and 13 th March If you
More informationAdvanced Algebra I Simplifying Expressions
Page - 1 - Name: Advanced Algebra I Simplifying Expressions Objectives The students will be able to solve problems using order of operations. The students will identify expressions and write variable expressions.
More informationMath Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can
More informationCOMP Intro to Logic for Computer Scientists. Lecture 2
COMP 1002 Intro to Logic for Computer Scientists Lecture 2 B 5 2 J Language of logic: building blocks Proposition: A sentence that can be true or false. A: It is raining in St. John s right now. B: 2+2=7
More informationNote: For #10 I have written out the solutions in more detail than you would be required to give.
Math 218 Spring 2010 Homework 4 Solutions Section 1.5 Note: For #10 I have written out the solutions in more detail than you would be required to give. 10) For each of these sets of premises, what relevant
More informationDepartment: Course: Chapter 1
Department: Course: 2016-2017 Term, Phrase, or Expression Simple Definition Chapter 1 Comprehension Support Point Line plane collinear coplanar A location in space. It does not have a size or shape The
More informationComputer Science 1 Ah
UNIVERSITY OF EDINBURGH course CS0077 FACULTY OF SCIENCE AND ENGINEERING DIVISION OF INFORMATICS SCHOOL OF COMPUTER SCIENCE Computer Science 1 Ah Degree Examination Date: Saturday 25th May 2002 Time: 09:30
More informationCommas. Review Mini Lesson
Commas Review Mini Lesson Why use a Comma? l A comma is a punctuation mark that helps keep distinct ideas separate. l Commas signal meaning, so it is critical to use them correctly! How do I use commas
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationInformatics 1 - Computation & Logic: Tutorial 3
Informatics - Computation & Logic: Tutorial Counting Week 5: 6- October 7 Please attempt the entire worksheet in advance of the tutorial, and bring all work with you. Tutorials cannot function properly
More informationGrad AI Fall, 2007 Homework 1
Grad AI. 15-780 Fall, 2007 Homework 1 Homework deadline: 10:30am on October 4 Please print your code and hand it in with the hard copy of your homework. Also send a copy of your code by e-mail to both
More informationDR. H S 4 RULES. I have whittled the list down to 4 essential rules for college writing:
PUNCTUATION Since we will NOT be drafting letters or addressing envelopes Since most students understand the use of direct quotes Since some of these rules can be combined DR. H S 4 RULES I have whittled
More informationSection 1.1 Logic LOGIC
Section 1.1 Logic 1.1.1 1.1 LOGIC Mathematics is used to predict empirical reality, and is therefore the foundation of engineering. Logic gives precise meaning to mathematical statements. PROPOSITIONS
More informationCIS 194: Homework 8. Due Wednesday, 8 April. Propositional Logic. Implication
CIS 194: Homework 8 Due Wednesday, 8 April Propositional Logic In this section, you will prove some theorems in Propositional Logic, using the Haskell compiler to verify your proofs. The Curry-Howard isomorphism
More informationFormal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5
Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can
More informationCS 2223 B15 Term. Homework 1 (100 pts.)
CS 2223 B15 Term. Homework 1 (100 pts.) Homework Instructions This homework is to be completed individually. If you have any questions as to what constitutes improper behavior, review the examples I have
More informationThis is a copy of the notes used in the module CI01.
CI101 This is a copy of the notes used in the module CI01. It is presented to you in the hope that it will be useful and reduce some of the burden of taking notes during the lectures. However, it will
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationApril 25, Lesson 8.2B
Lesson 8.2B Content Objective: I can substitute a number in for a variable and solve for the expression I can turn word problems into expressions, equations, and inequalities and solve for the variable.
More informationCS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 2: SEP. 8TH INSTRUCTOR: JIAYIN WANG
CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 2: SEP. 8TH INSTRUCTOR: JIAYIN WANG 1 Notice Class Website http://www.cs.umb.edu/~jane/cs114/ Reading Assignment Chapter 1: Introduction to Java Programming
More informationAnswer Key #1 Phil 414 JL Shaheen Fall 2010
Answer Key #1 Phil 414 JL Shaheen Fall 2010 1. 1.42(a) B is equivalent to B, and so also to C, where C is a DNF formula equivalent to B. (By Prop 1.5, there is such a C.) Negated DNF meets de Morgan s
More informationAlgebra Funct assign 33 writing functions, IV DV, notation.notebook
Bellwork Describe the domain and range in each case below. Determine in each case whether the relation is also a function. D: D: R: R: 1 9/18 Functions: Building a connection between Independent and Dependent
More informationSimplifying Expressions
Unit 1 Beaumont Middle School 8th Grade, 2017-2018 Math8; Intro to Algebra Name: Simplifying Expressions I can identify expressions and write variable expressions. I can solve problems using order of operations.
More informationChapter 9 Deductive Arguments II Truth-Functional Logic. Tutorial: Truth Tables
Chapter 9 Deductive Arguments II ruth-unctional Logic utorial: ruth ables ruth ables he aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments.
More information(More) Propositional Logic and an Intro to Predicate Logic. CSCI 3202, Fall 2010
(More) Propositional Logic and an Intro to Predicate Logic CSCI 3202, Fall 2010 Assignments Next week: Guest lectures (Jim Martin and Nikolaus Correll); Read Chapter 9 (but you can skip sections on logic
More informationLogical statements and. Lecture 1 ICOM 4075
Logical statements and operations Lecture 1 ICOM 4075 What is a statement? By a statementwe understand a sentence that affirms or denies the validity of a property or concept Examples: The color white
More informationEnrico s holiday job
TIME FOR PRACTICE PRESENT TENSE or PAST TENSE? Things that happened in the past and are now finished (an hour, yesterday, last week, last month, in 2010, when I was six. Enrico s holiday job Present Tense
More informationConversion Between Number Bases
Conversion Between Number Bases MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Summer 2018 General Number Bases Bases other than 10 are sometimes used in numeration
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationUnit 2: Boolean Logic
AP Computer Science Mr. Haytock Unit 2: Boolean Logic Topics: I. Syllogisms and propositional logic II. Logical operators III. Constructing truth tables IV. Laws of Boolean algebra V. Boolean operations
More informationUniversity of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012
University of Illinois at Chicago Department of Computer Science Final Examination CS 151 Mathematical Foundations of Computer Science Fall 2012 Thursday, October 18, 2012 Name: Email: Print your name
More informationWhat is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationDeclarative Programming. 2: theoretical backgrounds
Declarative Programming 2: theoretical backgrounds 1 Logic Systems: structure and meta-theoretical properties logic system syntax semantics proof theory defines which sentences are legal in the logical
More informationIntroduction to Computers and Engineering Problem Solving 1.00 / Fall 2004
Introduction to Computers and Engineering Problem Solving 1.00 / 1.001 Fall 2004 Problem Set 1 Due: 11AM, Friday September 17, 2004 Loan Calculator / Movie & Game Rental Store (0) [100 points] Introduction
More informationThomas Jefferson High School for Science and Technology Program of Studies TJ Math 1
Course Description: This course is designed for students who have successfully completed the standards for Honors Algebra I. Students will study geometric topics in depth, with a focus on building critical
More informationThe Effects on Read Performance from the Addition of a Long Term Read Buffer to YAFFS2. Sam Neubardt
The Effects on Read Performance from the Addition of a Long Term Read Buffer to YAFFS2 Sam Neubardt My research project examined the effects on read performance from the addition of a long term read buffer
More informationCONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics. COMP-202 Unit 1: Introduction
CONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics COMP-202 Unit 1: Introduction Assignment 1 Assignment 1 posted on WebCt and course website. It is due September 22nd
More informationSTUDENT LESSON A14 Boolean Algebra and Loop Boundaries
STUDENT LESSON A14 Boolean Algebra and Loop Boundaries Java Curriculum for AP Computer Science, Student Lesson A14 1 STUDENT LESSON A14 Boolean Algebra and Loop Boundaries INTRODUCTION: Conditional loops
More informationAlgebraic Reasoning. Participant Materials
Instructional Accommodations and Curricular Modifications Bringing Learning Within the Reach of Every Student Algebraic Reasoning Participant Materials 2011, Stetson Online Page 1 Introduction 4 Components
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationMixed Integer Linear Programming
Mixed Integer Linear Programming Part I Prof. Davide M. Raimondo A linear program.. A linear program.. A linear program.. Does not take into account possible fixed costs related to the acquisition of new
More informationCS40-S13: Functional Completeness
CS40-S13: Functional Completeness Victor Amelkin victor@cs.ucsb.edu April 12, 2013 In class, we have briefly discussed what functional completeness means and how to prove that a certain system (a set)
More informationSummer Math Learning Packet for Students Entering. Grade 6. SFTitle I
Summer Math Learning Packet for Students Entering Grade 6 Dear Parents, The attached packet provides a range of activities that review the skills and concepts that your child explored this year in their
More informationC++ Data Types. 1 Simple C++ Data Types 2. 3 Numeric Types Integers (whole numbers) Decimal Numbers... 5
C++ Data Types Contents 1 Simple C++ Data Types 2 2 Quick Note About Representations 3 3 Numeric Types 4 3.1 Integers (whole numbers)............................................ 4 3.2 Decimal Numbers.................................................
More informationProgram Verification & Testing; Review of Propositional Logic
8/24: p.1, solved; 9/20: p.5 Program Verification & Testing; Review of Propositional Logic CS 536: Science of Programming, Fall 2018 A. Why Course guidelines are important. Active learning is the style
More informationCS252 Advanced Programming Language Principles. Prof. Tom Austin San José State University Fall 2013
CS252 Advanced Programming Language Principles Prof. Tom Austin San José State University Fall 2013 What are some programming languages? Why are there so many? Different domains Mobile devices (Objective
More informationSimplifying Logical Formulas
Simplifying Logical Formulas Assume we have a SCHEME logical expression involving the operators and, or, not, and the truth constants #t and (). Example: (and a (not b) (or b c) (not (and c (not d))) #t
More informationLESSON 5 - DECIMALS INTRODUCTION
LESSON 5 - DECIMALS INTRODUCTION Now that we know something about whole numbers and fractions, we will begin working with types of numbers that are extensions of whole numbers and related to fractions.
More informationThe Mathematics of Banking and Finance By Dennis Cox and Michael Cox Copyright 2006 John Wiley & Sons Ltd
The Mathematics of Banking and Finance By Dennis Cox and Michael Cox Copyright 2006 John Wiley & Sons Ltd Less than ( ), less than or equal to ( ) Appendix 281 A symbol meaning smaller or less than, for
More informationALICE: An introduction to progamming
ALICE: An introduction to progamming What is Computer Science? Computer Science Do you know the difference between ICT and Computer Science? Any suggestions as to what jobs you could do if you were a Computer
More informationCOSC 1010 Introduction to Computer Programming
COSC 1010 Introduction to Computer Programming Exam 1, Spring 2016 Exam Duration: Sixty (60) Minutes The exam has three parts: Multiple Choice (17 points), Short Answer (30 points) and Programming (53
More informationAICE Mathematics AS Level Summer Review
AICE Mathematics AS Level Summer Review Welcome to AICE mathematics. This is a rigorous and fast paced course so it is important to make sure that you have mastered the prerequisite skills. These necessary
More informationLECTURE 2 An Introduction to Boolean Algebra
IST 210: Boot Camp Ritendra Datta LECTURE 2 An Introduction to Boolean Algebra 2.1. Outline of Lecture Fundamentals Negation, Conjunction, and Disjunction Laws of Boolean Algebra Constructing Truth Tables
More informationCOMP-202 Unit 0: Course Details
COMP-202 Unit 0: Course Details CONTENTS: Focus of the Course and Prerequisites Outline and Textbook Course Structure and Grading Scheme Computer Lab Info and Required Software Getting started thinking
More informationCS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 1: Overview http://courses.cs.cornell.edu/cs2110 1 Course Staff Instructor Thorsten Joachims (tj@cs.cornell.edu)
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationCOMS 1003 Fall Introduction to Computer Programming in C. Bits, Boolean Logic & Discrete Math. September 13 th
COMS 1003 Fall 2005 Introduction to Computer Programming in C Bits, Boolean Logic & Discrete Math September 13 th Hello World! Logistics See the website: http://www.cs.columbia.edu/~locasto/ Course Web
More information7 th Pre-AP REVIEW for TEST1 1 st Six Weeks
Name: Period: Date: 7 th Pre-AP REVIEW for TEST1 1 st Six Weeks Linear Functions 1. Complete the table of values for the equation and graph the line of the equation on the coordinate plane. Is it proportional
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationLecture Notes 15 Number systems and logic CSS Data Structures and Object-Oriented Programming Professor Clark F. Olson
Lecture Notes 15 Number systems and logic CSS 501 - Data Structures and Object-Oriented Programming Professor Clark F. Olson Number systems The use of alternative number systems is important in computer
More information1001ICT Introduction To Programming Lecture Notes
1001ICT Introduction To Programming Lecture Notes School of Information and Communication Technology Griffith University Semester 2, 2015 1 2 Elements of Java Java is a popular, modern, third generation
More information2. Unlock the Customization Features: The Edit Button Click the "Edit" button on the Dashboard Home Page to unlock the customization features.
1. Introduction: Customize Content for Your Students The Garland Science Learning System (GSLS) is completely customizable. You can edit, delete, or add content to create a unique learning experience for
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationCSC116: Introduction to Computing - Java
CSC116: Introduction to Computing - Java Course Information Introductions Website Syllabus Computers First Java Program Text Editor Helpful Commands Java Download Intro to CSC116 Instructors Course Instructor:
More informationCOMP-202: Foundations of Programming. Lecture 2: Java basics and our first Java program! Jackie Cheung, Winter 2015
COMP-202: Foundations of Programming Lecture 2: Java basics and our first Java program! Jackie Cheung, Winter 2015 Assignment Due Date Assignment 1 is now due on Tuesday, Jan 20 th, 11:59pm. Quiz 1 is
More informationTwo Types of Types. Primitive Types in Java. Using Primitive Variables. Class #07: Java Primitives. Integer types.
Class #07: Java Primitives Software Design I (CS 120): M. Allen, 13 Sep. 2018 Two Types of Types So far, we have mainly been dealing with objects, like DrawingGizmo, Window, Triangle, that are: 1. Specified
More informationMNU 3-08a - Proportion
MNU 3-08a - Proportion I can write proportion as a fraction, decimal fraction or percentage. 1) A fruit drink is made by mixing 20ml of orange juice with 60ml of pineapple juice. What is the proportion
More informationCS2630: Computer Organization Homework 1 Bits, bytes, and memory organization Due January 25, 2017, 11:59pm
CS2630: Computer Organization Homework 1 Bits, bytes, and memory organization Due January 25, 2017, 11:59pm Instructions: Show your work. Correct answers with no work will not receive full credit. Whether
More informationMath 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday)
Math 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday) Name, class, URL (www.cs.berkeley.edu/~demmel/ma55) on board Head TA Mike West speaks on bureaucracy Advertise CS 70 (T Th 2-3:30) as an "honors"
More informationFor Students Entering Investigations into Mathematics (IM)
E. Brooke Lee Middle School Summer Math For Students Entering Investigations into Mathematics (IM) 0 Summer 0 One goal of the Down County cluster of schools is to promote increased math performance at
More informationSome Sample AP Computer Science A Questions - Solutions
Some Sample AP Computer Science A Questions - s Note: These aren't from actual AP tests. I've created these questions based on looking at actual AP tests. Also, in cases where it's not necessary to have
More informationGrade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
More informationIntroduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
More information