CPS 100, Spring 2010 1.1 COMPSCI 100, Spring 2010 Owen Astrachan

Slides:



Advertisements
Similar presentations
COMP 121 Week 9: AbstractList and ArrayList. Objectives List common operations and properties of Lists as distinct from Collections Extend the AbstractCollection.
Advertisements

CS /29/2004 (Recitation Objectives) and Computer Science and Objects and Algorithms.
Computer Science - I Course Introduction Computer Science Department Boston College Hao Jiang.
COMP 14: Primitive Data and Objects May 24, 2000 Nick Vallidis.
1 An Extremely Short Introduction to Computer Programming Mike Scott.
Describing algorithms in pseudo code To describe algorithms we need a language which is: – less formal than programming languages (implementation details.
Java Software Solutions Lewis and Loftus Chapter 2 1 Copyright 1997 by John Lewis and William Loftus. All rights reserved. Software Concepts -- Introduction.
Welcome to CompSci 100! As You Arrive… Make sure you grab a syllabus packet. Read through it. I will be covering the most essential points in my talk,
Abstract Data Types (ADTs) Data Structures The Java Collections API
Compsci 101, Spring COMPSCI 101, Spring 2012 Introduction to Computer Science Owen Astrachan
Week 4-5 Java Programming. Loops What is a loop? Loop is code that repeats itself a certain number of times There are two types of loops: For loop Used.
(c) University of Washingtonhashing-1 CSC 143 Java Hashing Set Implementation via Hashing.
CPS 100, Fall COMPSCI 100, Fall 2011 Owen Astrachan w/ Michael Hewner
SIGCSE Tradeoffs, intuition analysis, understanding big-Oh aka O-notation Owen Astrachan
1 CSC 427: Data Structures and Algorithm Analysis Fall 2011 See online syllabus (also available through BlueLine): Course goals:
CompSci 100e Program Design and Analysis II January 18, 2011 Prof. Rodger CompSci 100e, Spring20111.
CSCI 115 Computer Programming Overview. Computer Software System Software –Operating systems –Utility programs –Language compilers Application Software.
Compsci 06/101, Fall COMPSCI 06/101, Fall 2010 Owen Astrachan Robert Duvall
Introduction. 2COMPSCI Computer Science Fundamentals.
Chapter 1: Introducing JAVA. 2 Introduction Why JAVA Applets and Server Side Programming Very rich GUI libraries Portability (machine independence) A.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Lecture 2: Classes and Objects, using Scanner and String.
CSE 143 Lecture 2 More ArrayList ; classes and objects reading: 10.1; slides created by Marty Stepp and Hélène Martin
5-Aug-2002cse Arrays © 2002 University of Washington1 Arrays CSE 142, Summer 2002 Computer Programming 1
Netprog: Java Intro1 Crash Course in Java. Netprog: Java Intro2 Why Java? Network Programming in Java is very different than in C/C++ –much more language.
CIT 590 Intro to Programming First lecture on Java.
Some Other Collections: Bags, Sets, Queues and Maps COMP T2 Lecture 4 School of Engineering and Computer Science, Victoria University of Wellington.
CPS 100, Fall COMPSCI 100, Fall 2009 Owen Astrachan
CS 206 Introduction to Computer Science II 09 / 10 / 2009 Instructor: Michael Eckmann.
Building Java Programs Chapter 11 Lecture 11-1: Sets and Maps reading:
1 CSC 222: Object-Oriented Programming Spring 2013 Course goals:  To know and use basic Java programming constructs for object- oriented problem solving.
1 CSC 321: Data Structures Fall 2013 See online syllabus (also available through BlueLine2): Course goals:  To understand.
CompSci CompSci 6 Programming Design and Analysis I Dietolf (Dee) Ramm
CSC 212 – Data Structures Lecture 37: Course Review.
CompSci 100E 1.1 CompSci 100E Dietolf (Dee) Ramm Robert A. Wagner
BEGINNING PROGRAMMING.  Literally – giving instructions to a computer so that it does what you want  Practically – using a programming language (such.
1 CSCD 326 Data Structures I Software Design. 2 The Software Life Cycle 1. Specification 2. Design 3. Risk Analysis 4. Verification 5. Coding 6. Testing.
CPS 100, Spring Tools: Solve Computational Problems l Algorithmic techniques  Brute-force/exhaustive, greedy algorithms, dynamic programming,
CPS What is Computer Science? What is it that distinguishes it from the separate subjects with which it is related? What is the linking thread.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
1 CSC 221: Computer Programming I Spring 2008 course overview  What did we set out to learn?  What did you actually learn?  Where do you go from here?
1 CSC 427: Data Structures and Algorithm Analysis Fall 2006 See online syllabus (also available through Blackboard): Course goals:
CompSci 100e1.1 Welcome! Program Design and Analysis II for Engineers CompSci 100E Soc Psy 126 W, F 2:50-4:05 Professor Jeff Forbes
90-723: Data Structures and Algorithms for Information Processing Copyright © 1999, Carnegie Mellon. All Rights Reserved. 1 Lecture 1: Introduction Data.
Lesson 6 – Libraries & APIs Libraries & APIs. Objective: We will explore how to take advantage of the huge number of pre-made classes provided with Java.
CPS 100, Spring COMPSCI 100, Spring 2009 Owen Astrachan
CompSci 100e2.1 Today’s Topics l Reading:  Sedgewick & Wayne: , l Topics  APTs  Basic Collections: ArrayLists: the expandable array.
Liang, Introduction to Java Programming, Sixth Edition, (c) 2007 Pearson Education, Inc. All rights reserved Chapter 23 Algorithm Efficiency.
Today… “Hello World” ritual. Brief History of Java & How Java Works. Introduction to Java class structure. But first, next slide shows Java is No. 1 programming.
CPS APTs and structuring data/information l Is an element in an array, Where is an element in an array?  DIY: use a loop  Use Collections, several.
Spring 2009 Programming Fundamentals I Java Programming XuanTung Hoang Lecture No. 8.
Compsci 06/101, Spring COMPSCI 06/101, Spring 2011 Introduction to Computer Science Owen Astrachan
Recursion ITI 1121 N. El Kadri. Reminders about recursion In your 1 st CS course (or its equivalent), you have seen how to use recursion to solve numerical.
TCSS 342 Autumn 2004 Version TCSS 342 Data Structures & Algorithms Autumn 2004 Ed Hong.
CPS 100e 5.1 Inheritance and Interfaces l Inheritance models an "is-a" relationship  A dog is a mammal, an ArrayList is a List, a square is a shape, …
CPS What's in Compsci 100? l Understanding tradeoffs: reasoning, analyzing, describing…  Algorithms  Data Structures  Programming  Design l.
CPS What is Computer Science? What is it that distinguishes it from the separate subjects with which it is related? What is the linking thread.
CompSci 100 Prog Design and Analysis II
Using the Java Collection Libraries COMP 103 # T2
CompSci 100E cs. duke CompSci 100E Dietolf (Dee) Ramm
INTERMEDIATE PROGRAMMING WITH JAVA
CSC 321: Data Structures Fall 2017
CSC 221: Computer Programming I Spring 2010
CompSci 100 Dietolf (Dee) Ramm
CompSci 6 Introduction to Computer Science
CSC 221: Computer Programming I Fall 2005
CompSci 1: Principles of Computer Science Lecture 1 Course Overview
CSC 321: Data Structures Fall 2018
COMPSCI 100, Spring 2008 Owen Astrachan
CSC 241: Introduction to Computer Science I
Presentation transcript:

CPS 100, Spring COMPSCI 100, Spring 2010 Owen Astrachan

CPS 100, Spring Data into Information and Knowledge Computer Science

CPS 100, Spring What is Computer Science? What is it that distinguishes it from the separate subjects with which it is related? What is the linking thread which gathers these disparate branches into a single discipline? My answer to these questions is simple --- it is the art of programming a computer. It is the art of designing efficient and elegant methods of getting a computer to solve problems, theoretical or practical, small or large, simple or complex. C.A.R. (Tony)Hoare

CPS 100, Spring What will you experience?

CPS 100, Spring Programming != Computer Science l What is the nature of intelligence? How can one predict the performance of a complex system? What is the nature of human cognition? Does the natural world 'compute'? l It is the interplay between such fundamental challenges and the human condition that makes computer science so interesting. The results from even the most esoteric computer science research programs often have widespread practical impact. Computer security depends upon the innovations in mathematics. Your Google search for a friend depends on state-of-the-art distributed computing systems, algorithms, and artificial intelligence.

CPS 100, Spring Efficient design, programs, code Object-oriented design and patterns. Software design principles transcend language, but … Engineer, scientist: what toolkits do you bring to programming? Mathematics, design patterns, libraries --- standard and others… Know data structures and algorithms. Trees, hashing, binary search, sorting, priority queues, greedy methods, graphs … Using the language: Java (or C++, or Python, or …), its idioms, its idiosyncracies

CPS 100, Spring Course Overview l There are details, see the course web pagecourse web page  Midterms and final are open book, what does that mean?  APTs: Algorithmic Problem-solving and Testing Weekly small programming assignments, tested online  Programming assignments: major, minor, paired, … l Why should you come to class?  Meet people, learn things, participate in a community  Provide help, get help, wonder, dance, think l Why is this course so great?  Because you’re in it

CPS 100, Spring What's in Compsci 100? l Understanding tradeoffs: reasoning, analyzing, describing…  Algorithms  Data Structures  Programming  Design l Programming using Java  Tools: Eclipse, JDK, Libraries, …  Ideas: Design Patterns, OOP, Agile programming, …  Engineering and analyzing designs and programs  Using mathematical and scientific techniques  Scaling solutions

CPS 100, Spring Questions If you gotta ask, you’ll never know Louis Armstrong: “What’s Jazz?” If you gotta ask, you ain’t got it Fats Waller: “What’s rhythm?” What questions did you ask today? Arno Penzias

CPS 100, Spring Tradeoffs Simple, elegant, quick, efficient: what are our goals in programming? What does XP say about simplicity? Einstein? How do we decide what tradeoffs are important? Tension between generality, simplicity, elegance, … Fast programs, small programs, run anywhere- at-all programs. Runtime, space-time, your time, CPU time… Programming, design, algorithmic, data- structural

CPS 100, Spring From Blog to Scientific Visualization l Text Cloud aka Tag Cloud?  Number of occurrences/emphasis indicated by size of word  Great visual/statistic: l What is involved with generating tag clouds?  Steps? Issues?  See SimpleTagMaker.java

CPS 100, Spring Analysis of SimpleTagMaker l Which classes used have static methods?  Do methods in CSSMaker need to be non-static? Why?  l How would we create a tag cloud from a file of words?  What steps are needed? Algorithmic? Java? l Why is there an IOException that’s thrown from main?  What is an exception, how do we handle them? l Any questions?

CPS 100, Spring Problem Solving and Programming l How many words are in a file?  What’s a word?  What’s a file?  How do we solve this: simply, quickly, …? What’s the best we can do? Constraints? l How many different/unique words are in a file?  How is this related to previous task? l How many words do two files have in common?  Spell-checking, Google did you mean..?

CPS 100, Spring Fast, cheap, out-of-control? l This is valid and correct Java code, questions? import java.util.*; import java.io.*; public class SimpleUnique { public static void main(String[] args) throws FileNotFoundException{ Scanner s = new Scanner(new File("/data/kjv10.txt")); String[] words = s.useDelimiter("\\Z").next().split("\\s+"); TreeSet set = new TreeSet (); set.addAll(Arrays.asList(words)); System.out.printf("total #: %d, unique #: %d\n", words.length,set.size()); }

CPS 100, Spring How fast is fast? How cheap is cheap? l How do we measure how fast the code/design is?  Can we implement this design in C++?  Can we implement this in Python? l We want a measure that’s independent of language?  What are we measuring?  How do we express answer?  Units? Best case? Average? Worst? l What is answer using recognized terminology? 

CPS 100, Spring What is Computer Science? l Computer science is no more about computers than astronomy is about telescopes. Edsger Dijkstra l Computer science is not as old as physics; it lags by a couple of hundred years. However, this does not mean that there is significantly less on the computer scientist's plate than on the physicist's: younger it may be, but it has had a far more intense upbringing! Richard Feyneman

CPS 100, Spring Some Java Vocabulary and Concepts l Java has a huge standard library  Organized in packages : java.lang, java.util, javax.swing, …  API browseable online, but Eclipse IDE helps a lot l Java methods have different kinds of access inter/intra class  Public methods …  Private methods …  Protected and Package methods … l Primitive types (int, char, double, boolean) are not objects but everything else is literally an instance of class Object  foo.callMe();

CPS 100, Spring Solving problems, writing code l APT: Simple Word Game APT: Simple Word Game  Understand the problem, know how to solve an instance  Ideas? Caveats? l Writing code to implement proposed solution  Will it run? In time? Constraints? Look before you code  How will we test the solution? When to start testing? l What’s the green dance and when do we do it?  Satisfaction of finishing something  Knowing when to stop when you’re not making progress  Leveraging community wisdom

CPS 100, Spring Structuring Information: ideas & code l Is an element in an array, Where is an element in an array?  DIY: use a loop  Use Collections, several options  Tradeoffs? public boolean contains(String[] list, String target){ for(String s : list){ if (s.equals(target)) return true; } return false; } public boolean contains(String[] list, String target){ return Arrays.asList(list).contains(target); } public boolean contains(String[] list, String target){ return new HashSet (Arrays.asList(list)).contains(target); }

CPS 100, Spring Basic data structures and algorithms l Arrays are typed and fixed in size when created  Don't have to fill the array, but cannot expand it  Can store int, double, String, Object, … l ArrayList (and related interface List) grows s needed  Stores objects, not primitives Autoboxing in Java 5 facilitates int to/from Integer conversion Store an int in an ArrayList, get one out Can’t convert entire ArrayList to array for int, can for String, why?  ArrayList objects grow themselves intelligently java.util package has lots of data structures and algorithms  Use rather than re-implement, but know how do to do both

CPS 100, Spring Who is Alan Perlis? l It is easier to write an incorrect program than to understand a correct one l Simplicity does not precede complexity, but follows it l If you have a procedure with ten parameters you probably missed some l If a listener nods his head when you're explaining your program, wake him up l Programming is an unnatural act l Won first Turing award

CPS 100, Spring Who has taken Compsci 100? l Jessica Abroms, Trinity ‘98  Pixar, iPhone, Guitar Hero l Luis von Ahn, Trinity ‘00  Macarthur, reCaptcha, GWAP l Rachel Zurer, Trinity ‘04  Americorps, Creative Writing l Ge Wang, Trinity ’00  T-Pain, Ocarina, Music l Jim Bungener, Pratt ’99  CFD, Team Alinghi l Eric Hartzog, Trinity ’09  Navy, StickWars

CPS 100, Spring Who takes Compsci 100 Now?

CPS 100, Spring Computer Science in a Nutshell