CS/ENGRD 2110 FALL 2016 Lecture 1: Overview and intro to types THERE IS ROOM IN THE BALCONY! Romeo, Romeo,

Slides:



Advertisements
Similar presentations
CS/ENGRD 2110 SPRING 2013 Lecture 1: Overview
Advertisements

L2:CSC © Dr. Basheer M. Nasef Lecture #2 By Dr. Basheer M. Nasef.
Introduction to Computing Concepts Note Set 7. Overview Variables Data Types Basic Arithmetic Expressions ▫ Arithmetic.
Data Types in Java Data is the information that a program has to work with. Data is of different types. The type of a piece of data tells Java what can.
Introduction to Computers and Programming Lecture 4: Mathematical Operators New York University.
22-Jun-15 Introduction to Primitives. 2 Overview Today we will discuss: The eight primitive types, especially int and double Declaring the types of variables.
1 Foundations of Software Design Lecture 1: Course Overview Intro to Binary and Boolean Marti Hearst SIMS, University of California at Berkeley.
0 CS100J September 2007 CS100J: 12 weeks programming using Java, 2 using Matlab. David Gries. CS100M: 7 weeks of Matlab and 7 of Java. Daisy Fan. CS100H:
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Adrian Ilie COMP 14 Introduction to Programming Adrian Ilie June 27, 2005.
Chapter 2 Data Types, Declarations, and Displays
Lecture 2: Topics Bits and Bytes Primitive Types Casting Strings Boolean expressions.
CS/ENGRD 2110 SPRING 2015 Lecture 1: Overview and intro to types
Recitation 1 Programming for Engineers in Python.
1 CS1130 Spring 2011: David Gries & Walker White Transition to Object-Oriented Programming Assumes programming knowledge in a language like Matlab, C,
1 CS1110 Fall 2011: David Gries & Steve Marschner CS1112: Matlab No prior programming experience One semester of calculus Math- & engineering- type problems.
CSE 131 Computer Science 1 Module 1: (basics of Java)
CS/ENGRD 2110 SPRING 2015 Lecture 1: Overview and intro to types
CS/ENGRD 2110 FALL 2013 Lecture 1: Overview and intro to types
01- Intro-Java-part1 1 Introduction to Java, and DrJava Barb Ericson Georgia Institute of Technology June 2008.
1 CS1110 Fall 2010 Instructors: David Gries & Lillian Lee CS1112: Matlab No prior programming experience One semester of calculus Math- & engineering-
COMP Introduction to Programming Yi Hong May 13, 2015.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Georgia Institute of Technology Introduction to Java, and DrJava Barb Ericson Georgia Institute of Technology Aug 2005.
Lecture 2 Object Oriented Programming Basics of Java Language MBY.
CS100J Spring 2006 CS100J: 11 weeks of programming using Java and 2 weeks using Matlab. David Gries is teaching CS100J. Graeme Bailey is teaching a special.
1 CS1110 Fall 2011 David Gries, Steve Marschner Reading for this lecture and previous lecture: Sections 1.1, 1.2, 1.3. Lab 1 will give you practice with.
1 CS1100 Fall Instructor: David Gries CS100M: Matlab No prior programming experience One semester of calculus Math & engineering type problems CS100J:
1 CS1110 Fall Instructors: David Gries & Lillian Lee CS1112: Matlab No prior programming experience One semester of calculus Math- & engineering-
COMP Primitive and Class Types Yi Hong May 14, 2015.
Data Structures and Algorithms in Java AlaaEddin 2012.
CS/ENGRD 2110 FALL 2016 Lecture 1: Overview and intro to types
1 CS100J Spring Instructor: David Gries CS100M: Matlab No prior programming experience One semester of calculus Math & engineering type problems.
CS0007: Introduction to Computer Programming Primitive Data Types and Arithmetic Operations.
Lecture 3: More Java Basics Michael Hsu CSULA. Recall From Lecture Two  Write a basic program in Java  The process of writing, compiling, and running.
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Prof. Jeremy.
© 2004 Pearson Addison-Wesley. All rights reserved August 27, 2007 Primitive Data Types ComS 207: Programming I (in Java) Iowa State University, FALL 2007.
CS/ENGRD 2110 Fall 2017 Lecture 2: Objects and classes in Java
CS/ENGRD 2110 Spring 2017 THERE IS ROOM IN THE BALCONY!
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Based on slides by Shawn.
電腦圖學 Computer Graphic with Programming
Chapter 2 Variables.
Lecture 2 D&D Chapter 2 & Intro to Eclipse IDE Date.
INTERMEDIATE PROGRAMMING WITH JAVA
CS1110 Spring Instructor: David Gries
Primitive Data Types August 28, 2006 ComS 207: Programming I (in Java)
Multiple variables can be created in one declaration
CISC124 Labs start this week in JEFF 155: Meet your TA.
Computer Science 102 Data Structures CSCI-UA
COSC051: Computer Science I
Week 1 Gates Introduction to Information Technology cosc 010 Week 1 Gates
CS/ENGRD 2110 SPRING 2018 THERE IS ROOM IN THE BALCONY!
CS/ENGRD 2110 Fall 2018 THERE IS ROOM IN THE BALCONY!
Introduction to Java, and DrJava part 1
Introduction CSE 373 Data Structures.
Chapter 2 Variables.
CS 200 Primitives and Expressions
Accelerated Introduction to Computer Science
Fall 2018 CISC124 2/15/2019 CISC124 TA names and s will be added to the course web site by the end of the week. Labs start next week in JEFF 155:
CS 200 Primitives and Expressions
Introduction to Java, and DrJava
CMSC201 Computer Science I for Majors Final Exam Information
Winter 2019 CMPE212 4/7/2019 CMPE212 – Reminders
Summary of what we learned yesterday
Zorah Fung University of Washington, Spring 2015
Unit 3: Variables in Java
Introduction to Java, and DrJava
Dr. David Matuszek Spring, 2003
Introduction to Java, and DrJava part 1
Chapter 2 Variables.
Zorah Fung University of Washington, Winter 2016
Presentation transcript:

CS/ENGRD 2110 FALL 2016 Lecture 1: Overview and intro to types THERE IS ROOM IN THE BALCONY! Romeo, Romeo, where art thou! Up in the balcony, where it’s cheaper!

Welcome to CS2110! 101 Freshmen 243 Sophomores 062 Juniors 062 Seniors 055 Meng/Masters 012 Graduate PhD 535 Total As of Sunday, 21 August. THIS MORNING: Instructors: David Gries, Mike George Recitation leaders: 21 Consultants: 22 OO Programming and Data Structures

Did you receive an from us Sunday? If not, there’s something wrong with how you forward from your Cornell netid. About 3 people’s bounced. 3

Welcome to CS2110! Learning about:  OO, abstract data types, generics, Java Collections, …  Reasoning about complex problems, analyzing algorithms we create to solve them, and implementing algorithms with elegant, easy-to-understand, correct code  Testing; Reasoning about correctness  Data structures: linked lists, trees, hash tables, graphs, etc.  Recursion  Algorithmic complexity  Parallelism —threads of execution 4

Usefulness of 2110 This summer I'm working in particle physics, making simula- tions of some of the background signal we’d expect to see in our detector for an experiment run in the particle accelerator. What I'm working on a clustering algorithm to put together energy depositions from several quantized points in the detector to learn what the initial particle's energy and position was. After some thought, I decided the best first sweep over this data would be to do a depth first search starting about a high energy deposition in the calorimeter. It works great, and my PI was very excited about the results! 5

Usefulness of 2110 I am working at a startup in Silicon Valley this summer … that does subscription-based financial management and billing among other things. It has been pretty incredible the amount I've learned from your class that relates to this internship and I have definitely decided to pursue computer science (I was initially engineering physics). 6

Is CS2110 right for you?  Knowledge of Java not required  Only ~30% of you know Java –others know Matlab, Python …  Requirement: comfort with some programming language, on the level of CS1110 (Python based) and CS1112 (Matlab based). Prior knowledge of OO not required.  We assume you do not know Java! 7

Homework! 8 Homework 1. Read article Why Software is So Bad. Link: Course website -> Lectures notes (Lecture 1) Homework 2. Get Java, Eclipse, DrJava on your computer. Homework 3. Spend some time perusing the course website. Look at course information, resources, links, etc. Homework 4. BEFORE EACH LECTURE/RECITATION: download pdf form of the slides, bring to class and look at them during lecture. We project not only PPT but also Eclipse and other things. Having PPT slides in paper form or on your laptop/tablet can help you during the lecture.

Lectures  TR 10:10-11am, Statler auditorium  Attendance mandatory  ENGRD 2110 or CS 2110?  Same course! We call it CS 2110 in online materials  Non-engineers sign up for CS 2110  Engineers sign up for ENGRD

Sections (Recitations) 10 T 12:20 4 sections: 50, 35, 21, 21 T 1:25 2 sections: 50, 25 T 2:30 2 sections: 47, 12 T 3:35 1 section: 49 W 12:20 2 sections: 50, 35 W 01:25 2 sections: 46, 36 W 02:30 2 sections: 25, 25 W 07:30 1 section: 12 Some time EARLY, visit StudentCenter and change your section to even out the numbers  Attendance mandatory  Sometimes flipped: you watch videos beforehand, come to recitation and do something  Sometimes review, help on homework, new material  No permission needed to switch sections, but do register for whichever one you attend

CS2111  An “enrichment” course  Help students who might feel overwhelmed by CS2110  Gives more explanation of core ideas behind Java, programming, data structures, assignments, etc.  Taught by Gries and George, 1 credit S/U  Only for students who also take CS2110  Only requirement: Attend weekly lecture 11 I would just like to thank you for taking the time to hold CS2111 this year. You have no idea how the class helped and impacted a lot of us. I would never had "survived" CS2110 without your generous share of your knowledge. I appreciated your time.

Academic Excellence Workshops  Two-hour labs: students work together in cooperative setting  One credit S/U course based on attendance  Time and location TBA  Visit Olin 167 and ask about AEWs  See website for more info: m/courses/workshops/index.cfm 12

Piazza  Click link on our web page to register  Incredible resource for 24 x 7 help with anything  We keep an eye on it and answer questions. YOU can (and will) too. Visit the Piazza often. 13

Resources  Book: Frank M. Carrano, Data Structures and Abstractions with Java, 3 nd ed., Prentice Hall  2 nd edition is okay. E-book not required  Share textbook. Need access to it from time to time  Copies on reserve in Engr Library  PPT slides (on course website and Piazza) outline all of OO in Java. Has index at beginning  Great Java resource: online materials at Oracle JDK web site. Google has it indexed.  VideoNote: videos of lectures from Fall Log in with netid 14

Obtaining Java and Eclipse  Follow instructions on our Resources web page  Make sure you have Java JDK 1.8, if not download and install. We explain how on the web page.  Then download and install the Eclipse IDE  Test it out: launch Eclipse and click “new>Java Project”  This is one of a few ways Java can be used  When program runs, output is visible in a little console window 15

DrJava IDE  IDE: Integrated Development Environment  DrJava is a much simpler IDE, few features  We use it only to demo Java features and programming concepts. Has an “interactions pane”, which allows trying things without requiring a complete Java program. Great tool!  DON’T use it for course assignments –use Eclipse  Free at Download the jar file, not the app!!! 16

Coursework  7–8 programming assignments (37%)  Two prelims (14% – 16%)  Final exam (30%)  Course evaluation (1%)  Work in recitations (1-3%) Formula will change as course progresses and we make changes in assignments, give quizzes, etc. 17 Exams are most important aspect in determining final grade

Assignments: a real learning experience  Teams of one or two  A0 and then A1 will be posted soon on the CMS  Finding a partner: choose your own or contact your TA. Piazza can be helpful. 18 One way to do an assignment: Wait until the day before it is due. Result: Frustration, anger, impatience, long lines in consulting room. No fun. Not a good educational experience

Assignments: a real learning experience 19 One way to do an assignment: Read the handout immediately. Work on it every (other) day. Ponder. Look things up. Get help in consulting room, with no lines, or office hours. Fun, hard work, a great learning experience Piano lessons: Practice Daily? Or put off practicing until an hour before weekly lesson?

Academic Integrity… Trust but verify!  98% of you are honest and don’t try to cheat  We use artificial intelligence tools to check each homework assignment, so catch the other 2%  The software is accurate!  It tests your code and notices similarities between code written by different people  Sure, you can fool this software  … but it’s easier to just do the assignments  … and if you try to fool it and screw up, you might fail the assignment or even the whole course. 20

Types in Java References in text and in JavaSummary type: A.14 slide 4 variable: A.13 slide 7 variable declaration: A.15 slide 7 Primitive types, A.16, back inside cover slide 5 Constants, A.17 slide 20 Assignment, A.18-A.20 slide 8 Casting, A.21 slide 6 Expressions: A.22-A.23 Precedences: A.24, back inside cover Unicode character codes, back inside cover 21

Type: Set of values together with operations on them. Type integer: values: …, –3, –2, –1, 0, 1, 2, 3, … operations: +, –, *, /, unary – 22 God’s integers! Can represent them in many ways — decimal, binary, octal, maybe as strokes |||| (that’s 4) Do you know how your computer represents them?

The integers as the basis Leopold Kronecker ( ), Prussian mathematician, Argued that arithmetic and analysis should be founded on the whole numbers (integers): Die ganzen Zahlen hat der liebe Gott gemacht, alles andere ist Menschenwerk. The beloved God made the whole numbers, everything else is the work of man. He insisted on the constructibility of math objects. Real numbers –do they really exist? You can’t compute most of them because they have an infinite number of digits. 23 God’s integers!

Type: Set of values together with operations on them. Matlab and Python are weakly typed: One variable can contain at different times a number, a string, an array, etc. One isn’t so concerned with types. 24 Valid Python sequence: x= 100; x= ‘Hello World’; x= (1, 2, 3, 4, 5 ); Corresponding Java int x; x= 100; x= “Hello”; Java strongly typed: A variable must be declared before it is used and can contain only values of the type with which it is declared Declaration of x: x can contain only values of type int Illegal assignment: “Hello” is not an int

Weakly typed versus strongly typed Weakly typed: Shorter programs, generally. Programmer has more freedom, language is more liberal in applying operations to values. 25 Strongly typed: Programmer has to be more disciplined. Declarations provide a place for comments about variables. More errors caught at compile-time (e.g. it’s a syntax error to assign a string to an int variable). Note: weak and strong typing not well defined; literature has several definitions

Type: Set of values together with operations on them. Java Type int: values: – –1 operations: +, –, *, /, %, unary – 26 Java designers decided on this Principle: primitive operations on type int should yield an int. b % c : remainder when b is divided by c. 67 % 60 = 7

Most-used ‘primitive’ types 27 int: values: – –1 operations: +, –, *, /, %, unary – b % c : remainder when b is divided by c. 67 % 60 = 7 double: values like : –22.51E6, 24.9 operations: +, –, *, /, %, unary – Write values in “scientific notation” char: values like : 'V' '$' '\n' operations: none Use single quotes for type char. '\n' is new-line char boolean: values: true false operations: ! (not), && (and), || (or) Can’t use integers as booleans! Inside back cover, A-6..7

About ‘primitive’ type int 28 int: values: – –1, i.e. operations: +, –, *, /, %, unary – Inside back cover, A-6..7 Java Principle: A basic operation of type int must produce an int –2 31 : WRAP-AROUND Integer.MAX_VALUE: name for max int value: 2 31 –1: Integer.MAX_VALUE + 1 is

Primitive number types 29 Integer types: byte short int long 1 byte 2 bytes 4 bytes 8 bytes Real types: float double –22.51E6 4 bytes 8 bytes 24.9 Use these to save space. Have an array of 1,000,000 integers in range 0..7? Use a byte array rather than an int array usual operators usual operators Don’t worry about this in next 7-8 weeks. Use int and double. Inside back cover, A-6..7

Casting among types 30 any number type any number expression byte short int long float double narrow wider must be explicit cast, may truncate may be automatic cast (int) 3.2 casts double value 3.2 to an int Page A-9, inside back cover (int) is a unary prefix operator, just like – – – 3 evaluates to 3 – (int) 3.2 evaluates to –3 30

Char is a number type! 31 Page A-9, inside back cover 31 char is a number type: (int) 'V' (char) 86 Unicode repr. in decimal: 86'V''V' Unicode: 16-bit char repr. Encodes chars in just about all languages. In java, use hexadecimal (base 16) char literals: '\u0041' is 'A' '\u0042' is 'B' '\u0056' is 'V' '\u0024' is ‘$' See '\u0950' is ' ॐ ’ —Om, the sound of the universe '\u5927' is ' 大 ' — 大衛 is (I think) a transliteration '\u885b' is ' 衛 ' of David into Chinese (Da Wei)

Basic variable declaration 32 Page A-6 32 Declaration: gives name of variable, type of value it can contain int x; Declaration of x, can contain an int value 20.1 area double double area;Declaration of area, can contain a double value 5 x int int[] a;Declaration of a, can contain a pointer to an int array. We explain arrays much later a int[]

Assignment statement 33 Much like in other languages —need ‘;’ at end: = ; int x; x= 10; … other code x= x+1; Have to declare x before assigning to it. int x= 10; … other code x= x+1; Can combine declaration with an initializing assignment. Shorthand for a declaration followed by an assignment.

Assignment statement type restriction 34 Every expression has a type, which depends on its operators and the types of its operands in a natural way. Rule: In x= e; type of e has to be same as or narrower than type of x. Reason: To avoid possibly losing info without the programmer realizing it. The value of 5+1 is automatically cast from type int to type double. double y= 5 + 1; int x= (int) ( );You can cast to int explicitly. 76 will be stored in x. int x= ;Illegal: The exp value is of type double.

A function in Matlab, Python, and Java 35 function s = sum(a, b) % Return sum of a and b s= a + b; /** return sum of a and b */ public static double sum(double a, double b) { return a + b; } def sum(a, b): """ return sum of a and b""" return a + b Matlab Python Declarations of parameters a and b return type Specification: in comment before function