3.1 Using Data Types. Data Type. Constructors and Methods. Objects. Data type. Set of values and operations on those values.

Size: px
Start display at page:

Download "3.1 Using Data Types. Data Type. Constructors and Methods. Objects. Data type. Set of values and operations on those values."

Transcription

1 Data Types 3.1 Using Data Types Data type. Set of values and operations on those values. Primitive types. Ops directly translate to machine instructions. Data Type boolean int double Set of Values true, false to any of 2 64 possible reals Operations not, and, or, xor add, subtract, multiply add, subtract, multiply We want to write programs that process other types of data.! Colors, pictures, strings, input streams,! Complex numbers, vectors, matrices, polynomials,! Points, polygons, charges, particles, Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright Objects Constructors and Methods Object. Holds a data type value; variable name refers to object. To construct a new object: Use keyword new and name of data type. Impact. Enables us to create our own data types; define operations on them; and integrate into our programs. To apply an operation: Use name of object, the dot operator, and the name of the method. Data Type Color Set of Values 24 bits Operations get red component, brighten Picture 2D array of colors get/set color of pixel (i, j) String sequence of characters length, substring, compare 3 4

2 Color Data Type Image Processing Color. A sensation in the eye from electromagnetic radiation. Set of values. [RGB representation] possible values, which quantify the amount of red, green, and blue, each on a scale of to. R G B Color Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright Color Data Type Using Colors in Java Color. A sensation in the eye from electromagnetic radiation. One use of objects. Store aggregate data in one variable. Set of values. [RGB representation] possible values, which quantify the amount of red, green, and blue, each on a scale of to. API. [Applications Program Interface] to access Color library import java.awt.color; public class ColorTest { public static void main(string[] args) { Color magenta = new Color(,, ); Color sienna = new Color(16, 82, 45); StdDraw.setPenColor(magenta); StdDraw.filledCircle(.5,.5,.667); StdDraw.setPenColor(sienna); StdDraw.filledSquare(.5,.5,.25); StdDraw.setPenColor(magenta); StdDraw.filledCircle(.5,.5,.333); Reference: 7 8

3 Monochrome Luminance Color Compatibility Monochrome luminance. Effective brightness of a color. NTSC formula. Y =.299r +.587g +.114b. Q. Which font colors will be most readable with which background colors on computer monitors and cell phone screens? A. Rule of thumb: difference in luminance should be! 128. import java.awt.color; public class Luminance { public static double lum(color c) { int r = c.getred(); int g = c.getgreen(); int b = c.getblue(); return.299*r +.587*g +.114*b; public static boolean compatible(color a, Color b) { return Math.abs(lum(a) - lum(b)) >= 128.; 9 1 Grayscale OOP Context for Color Grayscale. When all three R, G, and B values are the same, resulting color is on grayscale from (black) to (white). Possible memory representation. Convert to grayscale. Use luminance to determine value. D D1 D2 D3 D4 D5 D6 15 D7 15 D8 15 public static Color togray(color c) { int l = (int) Math.round(lum(c)); Color gray = new Color(l, l, l); return gray; magenta A D memory address B D6 gray Bottom line. We are writing programs that manipulate color. Object reference is analogous to variable name.! We can manipulate the value that it holds.! We can pass it to (or return it from) a method

4 René Magritte. "This is not a pipe." References Picture Data Type Raster graphics. Basis for image processing. Set of values. 2D array of Color objects (pixels). (, ) i j API. Java. This is not a color. Color sienna = new Color(16, 82, 45); Color c = sienna.darker(); OOP. Natural vehicle for studying abstract models of the real world Image Processing: Grayscale Filter Image Processing: Grayscale Filter Goal. Convert color image to grayscale according to luminance formula. Goal. Convert color image to grayscale according to luminance formula. import java.awt.color; public class Grayscale { public static void main(string[] args) { Picture pic = new Picture(args[]); for (int i = ; i < pic.width(); i++) { for (int j = ; j < pic.height(); j++) { Color color = pic.get(i, j); Color gray = Luminance.toGray(color); pic.set(i, j, gray); pic.show(); mandrill.jpg % java Grayscale mandrill.jpg 16 17

5 Image Processing: Scaling Filter Image Processing: Scaling Filter Goal. Shrink or enlarge an image to desired size. Goal. Shrink or enlarge an image to desired size. Downscaling. To halve the size, delete half the rows and columns. Upscaling. To double the size, replace each pixel by 4 copies. Uniform strategy. To convert from w s -by-h s to w t -by-h t :! Scale row index by w s / w t.! Scale column index by h s / h t.! Set color of pixel (i, j) in target image to color of pixel (i " w s / w t, j " h s / h t ) in source image. h s? h t w t w s Image Processing: Scaling Filter Image Processing: Scale Filter import java.awt.color; public class Scale { public static void main(string args[]) { String filename = args[]; int w = Integer.parseInt(args[1]); int h = Integer.parseInt(args[2]); Picture source = new Picture(filename); Picture target = new Picture(w, h); for (int ti = ; ti < w; ti++) { for (int tj = ; tj < h; tj++) { int si = ti * source.width() / w; int sj = tj * source.height() / h; Color color = source.get(si, sj); target.set(ti, tj, color); source.show(); target.show(); Scale.java. Creates two Picture objects and windows. % java Scale 4 2 mandrill.jpg 2 21

6 More Image Processing Effects OOP Context for Picture Immutability. Can't change a Color object's value once created. Mutability. Can change a Picture object's value. D Color color = pic.get(, ); pic.set(, 3, color); RGB color separation D4 D8 DC swirl filter wave filter glass filter Sobel edge detection String Data Type String Processing String data type. Basis for text processing. Set of values. Sequence of Unicode characters. API. [partial list] Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright

7 Gene Finding Gene Finding: Algorithm Pre-genomics era. Sequence a human genome. Post-genomics era. Analyze the data and understand structure. Genomics. Represent genome as a string over { A, C, T, G alphabet. Gene. A substring of genome that represents a functional unit.! Preceded by ATG. [start codon]! Multiple of 3 nucleotides. [codons other than start/stop]! Succeeded by TAG, TAA, TAG, or TGA. [stop codons] Algorithm. Scan left-to-right through genome.! If start codon, then set beg to index i.! If stop codon and substring is a multiple of 3 output gene reset beg to A T A G A T G C A T A G C G C A T A G C T A G A T G T G C T A G C start stop Gene Finding: Implementation OOP Context for Strings public class GeneFind { public static void main(string[] args) { String start = args[]; String stop = args[1]; String genome = StdIn.readAll(); int beg = -1; for (int i = ; i < genome.length() - 2; i++) { String codon = genome.substring(i, i+3); if (codon.equals(start)) beg = i; if (codon.equals(stop) && beg!= -1) { String gene = genome.substring(beg+3, i); if (gene.length() % 3 == ) { System.out.println(gene); beg = -1; % more genometiny.txt ATAGATGCATAGCGCATAGCTAGATGTGCTAGC % java GeneFind ATG TAG < genometiny.txt CATAGCGCA TGC Possible memory representation of a string.! String genome = "aacaagtttacaagc"; D D1 a a D2 c D3 a D4 a D5 g D6 t D7 t D8 t! s = genome.substring(1, 4);! t = genome.substring(9, 12); Consequences. D9 a DA DB DC DD DE c a a g c s t B B1 B2 B3 D1 3 D9 3! Use s.equals(t) to compare character sequences.! Use s == t to compare object identity. genome A D memory address A1 15 length 28 29

8 OOP Summary Object. Holds a data type value; variable name refers to object. In Java, programs manipulate references to objects.! Exception: primitive types, e.g., boolean, int, double.! Reference types: String, Picture, Color, arrays, everything else.! OOP purist: language should not have separate primitive types. Bottom line. We wrote programs that manipulate colors, pictures, and strings. Next time. We'll write programs that manipulate our own abstractions. 3

3.1 Data Types. Abstract Data Types. Objects. Object. Holds a data type value; variable name refers to object.

3.1 Data Types. Abstract Data Types. Objects. Object. Holds a data type value; variable name refers to object. 3.1 Data Types any program you might want to write objects create your own data types functions and modules graphics, sound, and image I/O arrays conditionals and loops Math primitive data types text I/O

More information

A Foundation for Programming

A Foundation for Programming 3.1 Using Data Types Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 2008 11/20/09 11/20/09 A Foundation for Programming any program you might

More information

9. Abstract Data Types

9. Abstract Data Types COMPUTER SCIENCE S E D G E W I C K / W A Y N E 9. Abstract Data Types Section 3.1 http://introcs.cs.princeton.edu COMPUTER SCIENCE S E D G E W I C K / W A Y N E 9. Abstract Data Types Overview Color Image

More information

9. Abstract Data Types

9. Abstract Data Types COMPUTER SCIENCE S E D G E W I C K / W A Y N E 9. Abstract Data Types Section 3.1 http://introcs.cs.princeton.edu COMPUTER SCIENCE S E D G E W I C K / W A Y N E 9. Abstract Data Types Overview Color Image

More information

9. Abstract Data Types

9. Abstract Data Types COMPUTER SCIENCE COMPUTER SCIENCE Overview Color Image processing String processing Section 3.1 http://introcs.cs.princeton.edu CS.9.A.ADTs.Overview Abstract data types Object-oriented programming (OOP)

More information

Using data types. Overview. Data types. Why custom data types? Using data types. A slight diversion: Methods. Data type. Data type

Using data types. Overview. Data types. Why custom data types? Using data types. A slight diversion: Methods. Data type. Data type Using data types Using data types Overview What they are Constructors and methods Application Programming Interface (API) Image processing Text processing A slight diversion: Incrementing and decrementing

More information

Using data types Fundamentals of Computer Science Keith Vertanen Copyright 2013

Using data types Fundamentals of Computer Science Keith Vertanen Copyright 2013 Using data types Fundamentals of Computer Science Keith Vertanen Copyright 213 Using data types Overview What they are Constructors and methods Applica;on Programming Interface (API) Image processing Text

More information

Inf1-OOP. Data Types. A Foundation for Programming. type value set operations. Overview. Using Data Types 1. Image Processing

Inf1-OOP. Data Types. A Foundation for Programming. type value set operations. Overview. Using Data Types 1. Image Processing Inf1-OOP Using Data Types 1 Perdita Stevens, adapting earlier version by Ewan Klein School of Informatics January 11, 2014 Overview Image Processing String Processing Summary/Admin 1 Thanks to Sedgewick&Wayne

More information

Inf1-OOP. Data Types. A Foundation for Programming. type value set operations. Overview. Using Data Types 1. Image Processing

Inf1-OOP. Data Types. A Foundation for Programming. type value set operations. Overview. Using Data Types 1. Image Processing Inf1-OOP Using Data Types 1 Ewan Klein, Perdita Stevens School of Informatics January 10, 2013 Overview Image Processing String Processing Summary/Admin 1 Thanks to Sedgewick&Wayne for much of this content

More information

Admin. CS 112 Introduction to Programming. Recap: OOP Analysis. Software Design and Reuse. Recap: OOP Analysis. Inheritance

Admin. CS 112 Introduction to Programming. Recap: OOP Analysis. Software Design and Reuse. Recap: OOP Analysis. Inheritance Admin CS 112 Introduction to Programming q Class project Inheritance Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone: 432-6400 Email: yry@cs.yale.edu 2 Recap: OOP Analysis

More information

Inf1-OP. Classes and Objects. Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein. November 23, School of Informatics

Inf1-OP. Classes and Objects. Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein. November 23, School of Informatics Inf1-OP Classes and Objects Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein School of Informatics November 23, 2017 Software engineering as managing change The computer doesn

More information

Software engineering as managing change. Inf1-OP. Data representation. How can we make change easier and cheaper?

Software engineering as managing change. Inf1-OP. Data representation. How can we make change easier and cheaper? Software engineering as managing change Inf1-OP Classes and Objects Timothy Hospedales, adapting earlier version by Perdita Stevens and Ewan Klein School of Informatics February 13, 2017 The computer doesn

More information

Admin. CS 112 Introduction to Programming. Exercise: Gene Finding. Language Organizing Structure. Gene Finding. Foundational Programming Concepts

Admin. CS 112 Introduction to Programming. Exercise: Gene Finding. Language Organizing Structure. Gene Finding. Foundational Programming Concepts Admin CS 112 Introduction to Programming q PS6 (Sukoku) questions? q Planning of remaining of the semester User-Defined Data Types Yang (Richard) Yang Computer Science Department Yale University 308A Watson,

More information

3.1 Data Types. Abstract Data Types. Constructors and Methods. Objects

3.1 Data Types. Abstract Data Types. Constructors and Methods. Objects Abstrct Dt Types 3.1 Dt Types Dt type. Set of vlues nd opertions on those vlues. Abstrct dt type. Dt type whose representtion is hidden from the user. ny progrm you might wnt to write objects functions

More information

3.1 Data Types!!! any program you might want to write

3.1 Data Types!!! any program you might want to write Abstrct Dt Types 3.1 Dt Types ny progrm you might wnt to write objects functions nd modules grphics, sound, nd imge I/O rrys conditionls nd loops Mth primitive dt types text I/O ssignment sttements crete

More information

3.1 Using Data Types. A Foundation for Programming. Objects. Data Type. Object. Holds a data type value; variable name refers to object.

3.1 Using Data Types. A Foundation for Programming. Objects. Data Type. Object. Holds a data type value; variable name refers to object. A Foundtion for Progrmming 3.1 Using Dt Types ny progrm you might wnt to write objects crete your own dt types functions nd modules grphics, sound, nd imge I/O rrys conditionls nd loops Mth primitive dt

More information

CS 112 Introduction to Programming

CS 112 Introduction to Programming A Foundtion for Progrmming CS 112 Introduction to Progrmming (Spring 212) ny progrm you might wnt to write Lecture #18: Using Dt Types crete your own dt types objects Zhong Sho functions nd modules Deprtment

More information

3.2 Creating Data Types

3.2 Creating Data Types 1 3.2 Creating Data Types Data Types Data type. Set of values and operations on those values. Basic types. Data Type boolean int String Set of Values true, false -2 31 to 2 31-1 sequence of Unicode characters

More information

Computer Science. 9. Creating Data Types. Computer Science COMPUTER SCIENCE. Section 3.2.

Computer Science. 9. Creating Data Types. Computer Science COMPUTER SCIENCE. Section 3.2. COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I : P R O G R A M M I N G I N J AVA Computer Science Computer Science An Interdisciplinary Approach Section 3.2 ROBERT SEDGEWICK K E V I N WAY N E

More information

10. Creating Data Types

10. Creating Data Types COMPUTER SCIENCE S E D G E W I C K / W A Y N E 10. Creating Data Types Section 3.2 http://introcs.cs.princeton.edu COMPUTER SCIENCE S E D G E W I C K / W A Y N E 10. Creating Data Types Overview Point

More information

26/3/ Creating Data Types. Data Type. Defining Data Types in Java. Point Charge Data Type. Charge Data Type: A Simple Client

26/3/ Creating Data Types. Data Type. Defining Data Types in Java. Point Charge Data Type. Charge Data Type: A Simple Client Data Types 3.2 Creating Data Types Data type. Set of values and operations on those values. Basic types. Data Type boolean int String Set of Values true, false -2 31 to 2 31-1 sequence of Unicode characters

More information

3.2 Creating Data Types

3.2 Creating Data Types Data Types 3.2 Creating Data Types Data type. Set of values and operations on those values. Basic types. Data Type boolean int String Set of Values true, false -2 31 to 2 31-1 sequence of Unicode characters

More information

A Founda4on for Programming

A Founda4on for Programming 3.1 Objects LOGO STYLE GUIDE Schools within the University Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 2002 2010 3/16/14 11:29 PM A Founda4on

More information

10. Creating Data Types

10. Creating Data Types Overview Point charges Turtle graphics Complex numbers Section 3.2 Object-oriented programming (OOP) Implementing a data type Object-oriented programming (OOP). To create a data type, you need provide

More information

public static void main(string[] args) { GTest mywindow = new GTest(); // Title This program creates the following window and makes it visible:

public static void main(string[] args) { GTest mywindow = new GTest(); // Title This program creates the following window and makes it visible: Basics of Drawing Lines, Shapes, Reading Images To draw some simple graphics, we first need to create a window. The easiest way to do this in the current version of Java is to create a JFrame object which

More information

A Foundation for Programming

A Foundation for Programming 3.1 Objects Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 2002 2010 7/28/2015 3:46:55 PM A Foundation for Programming any program you might

More information

1.4 Arrays. A Foundation for Programming. Arrays. Many Variables of the Same Type. This lecture. Store and manipulate huge quantities of data.

1.4 Arrays. A Foundation for Programming. Arrays. Many Variables of the Same Type. This lecture. Store and manipulate huge quantities of data. A Foundation for Programming 1.4 Arrays any program you might want to write objects functions and modules graphics, sound, and image I/O arrays store and manipulate huge quantities of data conditionals

More information

CS 112 Introduction to Programming

CS 112 Introduction to Programming CS 112 Introduction to Programming (Spring 2012) Lecture #9: Arrays Zhong Shao Department of Computer Science Yale University Office: 314 Watson http://flint.cs.yale.edu/cs112 Acknowledgements: some slides

More information

3.1 Objects 7/29/2014 1:49:50 PM

3.1 Objects 7/29/2014 1:49:50 PM 3.1 Objects Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 22 21 7/29/214 1:49:5 PM A Foundation for Programming any program you might want

More information

JAVA OPERATORS GENERAL

JAVA OPERATORS GENERAL JAVA OPERATORS GENERAL Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators

More information

Sýnislausnir á heimadæmum 11

Sýnislausnir á heimadæmum 11 Sýnislausnir á heimadæmum 11 1. Java forrit til að búa til slembi Albers ferning: import java.awt.color; public class HHSquares { Color[] c = new Color[4]; StdDraw.setCanvasSize(500, 500); StdDraw.setXscale(0.0,

More information

3.1 Symbol Tables. API sequential search binary search ordered operations

3.1 Symbol Tables. API sequential search binary search ordered operations 3.1 Symbol Tables API sequential search binary search ordered operations Algorithms in Java, 4 th Edition Robert Sedgewick and Kevin Wayne Copyright 2009 February 23, 2010 8:21:03 AM Symbol tables Key-value

More information

Algorithms. Algorithms 3.1 SYMBOL TABLES. API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE

Algorithms. Algorithms 3.1 SYMBOL TABLES. API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE Algorithms ROBERT SEDGEWICK KEVIN WAYNE 3.1 SYMBOL TABLES Algorithms F O U R T H E D I T I O N API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE https://algs4.cs.princeton.edu

More information

CISC 1115 (Science Section) Brooklyn College Professor Langsam. Assignment #5

CISC 1115 (Science Section) Brooklyn College Professor Langsam. Assignment #5 CISC 1115 (Science Section) Brooklyn College Professor Langsam Assignment #5 An image is made up of individual points, known as pixels. Thus if we have an image with a resolution of 100 x 100, each pixel

More information

Values, Variables, Types & Arithmetic Expressions. Agenda

Values, Variables, Types & Arithmetic Expressions. Agenda Values, Variables, Types & Arithmetic Expressions Lecture 2 Object-Oriented Programming Agenda Inside of a Computer Value Variable Data Types in Java Literals Identifiers Type conversions Manipulating

More information

Algorithms. Algorithms 3.1 SYMBOL TABLES. API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE

Algorithms. Algorithms 3.1 SYMBOL TABLES. API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE Algorithms ROBERT SEDGEWICK KEVIN WAYNE 3.1 SYMBOL TABLES Algorithms F O U R T H E D I T I O N API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE https://algs4.cs.princeton.edu

More information

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Basic Operators Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators

More information

public class CMemory {

public class CMemory { public class CMemory { private int size; private char[] content; private boolean[] status; // allocation status private int[][] holes; private int numholes; public CMemory (int s){ size = s; content =

More information

Algorithms ROBERT SEDGEWICK KEVIN WAYNE 3.1 SYMBOL TABLES Algorithms F O U R T H E D I T I O N API elementary implementations ordered operations ROBERT SEDGEWICK KEVIN WAYNE http://algs4.cs.princeton.edu

More information

Changing a picture. Modifying Pictures. Looping (iteration) Changing all the pixels in a picture TOPIC 6 MODIFYING PICTURES USING LOOPS

Changing a picture. Modifying Pictures. Looping (iteration) Changing all the pixels in a picture TOPIC 6 MODIFYING PICTURES USING LOOPS 1 Outline TOPIC 6 MODIFYING PICTURES USING LOOPS 2 2 How to manipulate digital images by changing pixels What is a loop in Java while loop for loop Notes adapted from Introduction to Computing and Programming

More information

TOPIC 6 MODIFYING PICTURES USING LOOPS

TOPIC 6 MODIFYING PICTURES USING LOOPS 1 TOPIC 6 MODIFYING PICTURES USING LOOPS Notes adapted from Introduction to Computing and Programming with Java: A Multimedia Approach by M. Guzdial and B. Ericson, and instructor materials prepared by

More information

Introduction to Computer Science (I1100) Data Storage

Introduction to Computer Science (I1100) Data Storage Data Storage 145 Data types Data comes in different forms Data Numbers Text Audio Images Video 146 Data inside the computer All data types are transformed into a uniform representation when they are stored

More information

Elementary Symbol Tables

Elementary Symbol Tables Symbol Table ADT Elementary Symbol Tables Symbol table: key-value pair abstraction.! a value with specified key.! for value given key.! Delete value with given key. DS lookup.! URL with specified IP address.!

More information

Problem Solving: Storyboards for User Interaction

Problem Solving: Storyboards for User Interaction Topic 6 1. The while loop 2. Problem solving: hand-tracing 3. The for loop 4. The do loop 5. Processing input 6. Problem solving: storyboards 7. Common loop algorithms 8. Nested loops 9. Problem solving:

More information

ASSIGNMENT 5 TIPS AND TRICKS

ASSIGNMENT 5 TIPS AND TRICKS ASSIGNMENT 5 TIPS AND TRICKS linear-feedback shift registers Java implementation a simple encryption scheme http://princeton.edu/~cos26 Last updated on /26/7 : PM Goals OOP: implement a data type; write

More information

H212 Introduction to Software Systems Honors

H212 Introduction to Software Systems Honors Introduction to Software Systems Honors Lecture #04: Fall 2015 1/20 Office hours Monday, Wednesday: 10:15 am to 12:00 noon Tuesday, Thursday: 2:00 to 3:45 pm Office: Lindley Hall, Room 401C 2/20 Printing

More information

CLASSES AND OBJECTS. Fundamentals of Computer Science I

CLASSES AND OBJECTS. Fundamentals of Computer Science I CLASSES AND OBJECTS Fundamentals of Computer Science I Outline Primitive types Creating your own data types Classes Objects Instance variables Instance methods Constructors Arrays of objects A Foundation

More information

! 52 playing cards in a deck. ! 5 thousand undergrads at Princeton. ! 1 million characters in a book. ! 10 million audio samples in an MP3 file.

! 52 playing cards in a deck. ! 5 thousand undergrads at Princeton. ! 1 million characters in a book. ! 10 million audio samples in an MP3 file. Arrays 1.4 Arrays This lecture. Store and manipulate huge quantities of data. Array. Indexed sequence of values of the same type. Examples.! 52 playing cards in a deck.! 5 thousand undergrads at Princeton.!

More information

CLASSES AND OBJECTS. Fundamentals of Computer Science I

CLASSES AND OBJECTS. Fundamentals of Computer Science I CLASSES AND OBJECTS Fundamentals of Computer Science I Outline Primitive types Creating your own data types Classes Objects Instance variables Instance methods Constructors Arrays of objects A Foundation

More information

CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015

CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015 CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015 These pages will NOT BE INCLUDED IN THE MIDTERM. print - Displays a value in the command area - Examples: - print

More information

Review Chapters 1 to 4. Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013

Review Chapters 1 to 4. Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 Review Chapters 1 to 4 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 Introduction to Java Chapters 1 and 2 The Java Language Section 1.1 Data & Expressions Sections 2.1 2.5 Instructor:

More information

A foundation for programming. Classes and objects. Overview. Java primitive types. Primitive types Creating your own data types

A foundation for programming. Classes and objects. Overview. Java primitive types. Primitive types Creating your own data types Classes and objects A foundation for programming any program you might want to write objects functions and modules build even bigger programs and reuse code http://www.flickr.com/photos/vermegrigio/5923415248/

More information

MCS 2514 Fall 2012 Programming Assignment 3 Image Processing Pointers, Class & Dynamic Data Due: Nov 25, 11:59 pm.

MCS 2514 Fall 2012 Programming Assignment 3 Image Processing Pointers, Class & Dynamic Data Due: Nov 25, 11:59 pm. MCS 2514 Fall 2012 Programming Assignment 3 Image Processing Pointers, Class & Dynamic Data Due: Nov 25, 11:59 pm. This project is called Image Processing which will shrink an input image, convert a color

More information

Inf1-OOP. Data Types. Defining Data Types in Java. type value set operations. Overview. Circle Class. Creating Data Types 1.

Inf1-OOP. Data Types. Defining Data Types in Java. type value set operations. Overview. Circle Class. Creating Data Types 1. Overview Inf1-OOP Creating Data Types 1 Circle Class Object Default Perdita Stevens, adapting earlier version by Ewan Klein Format Strings School of Informatics January 11, 2015 HotelRoom Class More on

More information

Programming for Non-Programmers

Programming for Non-Programmers Programming for Non-Programmers Python Chapter 2 Source: Dilbert Agenda 6:00pm Lesson Begins 6:15pm First Pillow example up and running 6:30pm First class built 6:45pm Food & Challenge Problem 7:15pm Wrap

More information

COMP-202 More Complex OOP

COMP-202 More Complex OOP COMP-202 More Complex OOP Defining your own types: Remember that we can define our own types/classes. These classes are objects and have attributes and behaviors You create an object or an instance of

More information

1. (10 pts) Order the following three images by how much memory they occupy:

1. (10 pts) Order the following three images by how much memory they occupy: CS 47 Prelim Tuesday, February 25, 2003 Problem : Raster images (5 pts). (0 pts) Order the following three images by how much memory they occupy: A. a 2048 by 2048 binary image B. a 024 by 024 grayscale

More information

Lecture 2. COMP1406/1006 (the Java course) Fall M. Jason Hinek Carleton University

Lecture 2. COMP1406/1006 (the Java course) Fall M. Jason Hinek Carleton University Lecture 2 COMP1406/1006 (the Java course) Fall 2013 M. Jason Hinek Carleton University today s agenda a quick look back (last Thursday) assignment 0 is posted and is due this Friday at 2pm Java compiling

More information

PIXL. Maxwell Hu (mh3289) Justin Borczuk (jnb2135) Marco Starger (mes2312) Shiv Sakhuja (ss4757)

PIXL. Maxwell Hu (mh3289) Justin Borczuk (jnb2135) Marco Starger (mes2312) Shiv Sakhuja (ss4757) PIXL Maxwell Hu (mh3289) Justin Borczuk (jnb2135) Marco Starger (mes2312) Shiv Sakhuja (ss4757) Description Point processing is the enhancement or modification of an image through individual pixel manipulation.

More information

Full file at

Full file at Java Programming: From Problem Analysis to Program Design, 3 rd Edition 2-1 Chapter 2 Basic Elements of Java At a Glance Instructor s Manual Table of Contents Overview Objectives s Quick Quizzes Class

More information

2.4 Modular Programming

2.4 Modular Programming Percolation 2.4 Modular Programming Percolation. Pour liquid on top of some porous material. Will liquid reach the bottom? Applications. [Chemistry, materials science]! Chromatography.! Natural gas through

More information

MULTIMEDIA AND CODING

MULTIMEDIA AND CODING 07 MULTIMEDIA AND CODING WHAT MEDIA TYPES WE KNOW? TEXTS IMAGES SOUNDS MUSIC VIDEO INTERACTIVE CONTENT Games Virtual reality EXAMPLES OF MULTIMEDIA MOVIE audio + video COMPUTER GAME audio + video + interactive

More information

Inf1-OOP. Arrays 1. Perdita Stevens, adapting earlier version by Ewan Klein. January 11, School of Informatics

Inf1-OOP. Arrays 1. Perdita Stevens, adapting earlier version by Ewan Klein. January 11, School of Informatics Inf1-OOP Arrays 1 Perdita Stevens, adapting earlier version by Ewan Klein School of Informatics January 11, 2015 1 Thanks to Sedgewick&Wayne for much of this content Arrays Introduction to Arrays Arrays

More information

Inf1-OOP. Arrays. Many Variables of the Same Type. Arrays Introduction to Arrays Arrays in Java Shuffling a Deck Multidimensional Arrays Summary/Admin

Inf1-OOP. Arrays. Many Variables of the Same Type. Arrays Introduction to Arrays Arrays in Java Shuffling a Deck Multidimensional Arrays Summary/Admin Inf1-OOP Arrays 1 Perdita Stevens, adapting earlier version by Ewan Klein School of Informatics Arrays Introduction to Arrays Arrays in Java Shuffling a Deck Multidimensional Arrays Summary/Admin January

More information

2.2 Input and Output. Input and Output. Digital Michelangelo Project. Terminal. Input devices. Output devices.

2.2 Input and Output. Input and Output. Digital Michelangelo Project. Terminal. Input devices. Output devices. Input and Output 2.2 Input and Output Input devices. Keyboard Mouse Hard drive Network Digital camera Speakers Hard drive Network Printer Microphone Output devices. Display MP3 Player Our approach. Define

More information

COMPUTER SCIENCE. 4. Arrays. Section 1.4.

COMPUTER SCIENCE. 4. Arrays. Section 1.4. COMPUTER SCIENCE S E D G E W I C K / W A Y N E 4. Arrays Section 1.4 http://introcs.cs.princeton.edu Basic building blocks for programming any program you might want to write objects functions and modules

More information

Object-Oriented Programming. Topic 2: Fundamental Programming Structures in Java

Object-Oriented Programming. Topic 2: Fundamental Programming Structures in Java Electrical and Computer Engineering Object-Oriented Topic 2: Fundamental Structures in Java Maj Joel Young Joel.Young@afit.edu 8-Sep-03 Maj Joel Young Java Identifiers Identifiers Used to name local variables

More information

Lecture 12 Color model and color image processing

Lecture 12 Color model and color image processing Lecture 12 Color model and color image processing Color fundamentals Color models Pseudo color image Full color image processing Color fundamental The color that humans perceived in an object are determined

More information

CS251L REVIEW Derek Trumbo UNM

CS251L REVIEW Derek Trumbo UNM CS251L REVIEW 2010.8.30 Derek Trumbo UNM Arrays Example of array thought process in Eclipse Arrays Multi-dimensional arrays are also supported by most PL s 2-dimensional arrays are just like a matrix (monthly

More information

CSCI 136 Programming Exam #2 Fundamentals of Computer Science II Spring 2012

CSCI 136 Programming Exam #2 Fundamentals of Computer Science II Spring 2012 CSCI 136 Programming Exam #2 Fundamentals of Computer Science II Spring 2012 This part of the exam is like a mini- programming assignment. You will create a program, compile it, and debug it as necessary.

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques () Lecture 13 February 12, 2018 Mutable State & Abstract Stack Machine Chapters 14 &15 Homework 4 Announcements due on February 20. Out this morning Midterm results

More information

cs2010: algorithms and data structures

cs2010: algorithms and data structures cs2010: algorithms and data structures Lecture 11: Symbol Table ADT Vasileios Koutavas School of Computer Science and Statistics Trinity College Dublin Algorithms ROBERT SEDGEWICK KEVIN WAYNE 3.1 SYMBOL

More information

Color and Shading. Color. Shapiro and Stockman, Chapter 6. Color and Machine Vision. Color and Perception

Color and Shading. Color. Shapiro and Stockman, Chapter 6. Color and Machine Vision. Color and Perception Color and Shading Color Shapiro and Stockman, Chapter 6 Color is an important factor for for human perception for object and material identification, even time of day. Color perception depends upon both

More information

COS 126 Exam 2 Review Part 1

COS 126 Exam 2 Review Part 1 COS 126 Exam 2 Review Part 1 Programming Exam 2 Part 1 (ADT) Q. Can you implement a simple abstract data type? Example (Fall 2016). Part 1. Implement a data type ColorHSB.java for HSB colors. This time,

More information

Java3018: Darkening, Brightening, and Tinting the Colors in a Picture *

Java3018: Darkening, Brightening, and Tinting the Colors in a Picture * OpenStax-CNX module: m44234 1 Java3018: Darkening, Brightening, and Tinting the Colors in a Picture * R.G. (Dick) Baldwin This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution

More information

Computer Graphics Lecture 2

Computer Graphics Lecture 2 1 / 16 Computer Graphics Lecture 2 Dr. Marc Eduard Frîncu West University of Timisoara Feb 28th 2012 2 / 16 Outline 1 Graphics System Graphics Devices Frame Buffer 2 Rendering pipeline 3 Logical Devices

More information

Use the scantron sheet to enter the answer to questions (pages 1-6)

Use the scantron sheet to enter the answer to questions (pages 1-6) Use the scantron sheet to enter the answer to questions 1-100 (pages 1-6) Part I. Mark A for True, B for false. (1 point each) 1. Abstraction allow us to specify an object regardless of how the object

More information

Extensions of One-Dimensional Gray-level Nonlinear Image Processing Filters to Three-Dimensional Color Space

Extensions of One-Dimensional Gray-level Nonlinear Image Processing Filters to Three-Dimensional Color Space Extensions of One-Dimensional Gray-level Nonlinear Image Processing Filters to Three-Dimensional Color Space Orlando HERNANDEZ and Richard KNOWLES Department Electrical and Computer Engineering, The College

More information

1.4 Arrays. A Foundation for Programming. Many Variables of the Same Type. Arrays. Many Variables of the Same Type. Many Variables of the Same Type

1.4 Arrays. A Foundation for Programming. Many Variables of the Same Type. Arrays. Many Variables of the Same Type. Many Variables of the Same Type A Foundation for Programming 1.4 Arrays any program you might want to write objects functions and modules graphics, sound, and image I/O arrays store and manipulate huge quantities of data conditionals

More information

JAVA MOCK TEST JAVA MOCK TEST II

JAVA MOCK TEST JAVA MOCK TEST II http://www.tutorialspoint.com JAVA MOCK TEST Copyright tutorialspoint.com This section presents you various set of Mock Tests related to Java Framework. You can download these sample mock tests at your

More information

ELEMENTARY SEARCH ALGORITHMS

ELEMENTARY SEARCH ALGORITHMS BBM 202 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ELEMENTARY SEARCH ALGORITHMS Acknowledgement: The course slides are adapted from the slides prepared by R. Sedgewick and K. Wayne of Princeton University.

More information

CS 112 Introduction to Programming

CS 112 Introduction to Programming A Possible Pitfall With Recursion CS 112 Introduction to Programming Fibonacci numbers. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, (Spring 2012) #0 if n = 0 % F(n) = 1 if n = 1 % F(n 1) + F(n 2) otherwise & Lecture

More information

12/11/ The TOY Machine II. Data Representation. What We've Learned About TOY. What We Do Today. Adding and Subtracting Binary Numbers

12/11/ The TOY Machine II. Data Representation. What We've Learned About TOY. What We Do Today. Adding and Subtracting Binary Numbers // What We've Learned About TOY. The TOY Machine II TOY machine. Box with switches and lights. 6-bit memory locations, 6-bit registers, 8-bit pc. 4,38 bits = ( 6) + ( 6) + (8) = 4 bytes! von Neumann architecture.

More information

Graphics Hardware and Display Devices

Graphics Hardware and Display Devices Graphics Hardware and Display Devices CSE328 Lectures Graphics/Visualization Hardware Many graphics/visualization algorithms can be implemented efficiently and inexpensively in hardware Facilitates interactive

More information

5. The TOY Machine II

5. The TOY Machine II 5. The TOY Machine II Laboratory Instrument Computer (LINC) Introduction to Computer Science: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 2002 2011 2/18/2013 9:52:08 AM What

More information

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide AP Computer Science Chapter 10 Implementing and Using Classes Study Guide 1. A class that uses a given class X is called a client of X. 2. Private features of a class can be directly accessed only within

More information

Debugging [continued]

Debugging [continued] 1 Debugging [continued] Admiral Grace Murray Hopper http://www.history.navy.mil/photos/images/h96000/h96566kc.htm 2 Debugging Your Program Debugging Your Program. [summary] 1. Edit the program (type in

More information

Final Study Guide Arts & Communications

Final Study Guide Arts & Communications Final Study Guide Arts & Communications Programs Used in Multimedia Developing a multimedia production requires an array of software to create, edit, and combine text, sounds, and images. Elements of Multimedia

More information

Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs

Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs CSC 1051 Algorithms and Data Structures I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova

More information

CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012

CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012 CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 7 problems on the following 6 pages. You may use your single- side hand- written 8 ½ x 11 note sheet during the

More information

Graphics and Java 2D Introduction OBJECTIVES. One picture is worth ten thousand words.

Graphics and Java 2D Introduction OBJECTIVES. One picture is worth ten thousand words. 1 2 12 Graphics and Java 2D One picture is worth ten thousand words. Chinese proverb Treat nature in terms of the cylinder, the sphere, the cone, all in perspective. Paul Cézanne Colors, like features,

More information

3D graphics, raster and colors CS312 Fall 2010

3D graphics, raster and colors CS312 Fall 2010 Computer Graphics 3D graphics, raster and colors CS312 Fall 2010 Shift in CG Application Markets 1989-2000 2000 1989 3D Graphics Object description 3D graphics model Visualization 2D projection that simulates

More information

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: JAVA OPERATORS GENERAL Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators

More information

Introduction to Programming Using Java (98-388)

Introduction to Programming Using Java (98-388) Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;

More information

Problem Grade Total

Problem Grade Total CS 101, Prof. Loftin: Final Exam, May 11, 2009 Name: All your work should be done on the pages provided. Scratch paper is available, but you should present everything which is to be graded on the pages

More information

Practice Midterm 1. Problem Points Score TOTAL 50

Practice Midterm 1. Problem Points Score TOTAL 50 CS 120 Software Design I Spring 2019 Practice Midterm 1 University of Wisconsin - La Crosse February 25 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages including the

More information

1.5 Input and Output. Introduction to Computer Science Sedgewick and Wayne Copyright 2007

1.5 Input and Output. Introduction to Computer Science Sedgewick and Wayne Copyright 2007 1.5 Input and Output Introduction to Computer Science Sedgewick and Wayne Copyright 2007 http://introcs.cs.princeton.edu A Foundation for Programming any program you might want to write objects functions

More information

1.4 Arrays. A Foundation for Programming. Many Variables of the Same Type. Arrays. !!! any program you might want to write

1.4 Arrays. A Foundation for Programming. Many Variables of the Same Type. Arrays. !!! any program you might want to write A Foundation for Programming 1.4 Arrays any program you might want to write objects functions and modules graphics, sound, and image I/O arrays store and manipulate huge quantities of data conditionals

More information

Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs

Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs Algorithms and Java basics: pseudocode, variables, assignment, and interactive programs CSC 1051 Algorithms and Data Structures I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova

More information

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following g roups:

Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following g roups: JAVA BASIC OPERATORS http://www.tuto rialspo int.co m/java/java_basic_o perato rs.htm Copyrig ht tutorialspoint.com Java provides a rich set of operators to manipulate variables. We can divide all the

More information