Views of programming Writing code from the method/function view is pretty similar across languages Organizing methods is different, organizing code is.

Slides:



Advertisements
Similar presentations
Engineering Problem Solving With C++ An Object Based Approach Fundamental Concepts Chapter 1 Engineering Problem Solving.
Advertisements

1 Engineering Problem Solving With C++ An Object Based Approach Fundamental Concepts Chapter 1 Engineering Problem Solving.
©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. COMPSCI 125 Introduction to Computer Science I.
Computing Components 01/26/11. Announcements & Reminders Programs 1 due Friday, 9/2/11 What is my late policy? Proxy Codes for Labs  You should be able.
Introduction to Computers and Programming. Some definitions Algorithm: –A procedure for solving a problem –A sequence of discrete steps that defines such.
CMPT 120 Introduction to Computer Science and Programming I Chris Schmidt.
Professor Jennifer Rexford COS 217
CEG 320/520: Computer Organization and Assembly Language Programming1 CEG 320/520 Computer Organization and Assembly Language Programming.
Copyright © 2012 Pearson Education, Inc. Chapter 1: Introduction to Computers and Programming.
The Study of Computer Science Chapter 0 Intro to Computer Science CS1510, Section 2.
1 CS/COE0447 Computer Organization & Assembly Language Pre-Chapter 2.
1 TOPIC 1 INTRODUCTION TO COMPUTER SCIENCE AND PROGRAMMING Topic 1 Introduction to Computer Science and Programming Notes adapted from Introduction to.
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 1: Introduction to Computers and Programming.
Compsci 100, Fall ’.1 Views of programming l Writing code from the method/function view is pretty similar across languages  Organizing methods.
The Study of Computer Science Chapter 0 Intro to Computer Science CS1510.
ICAPRG301A Week 4Buggy Programming ICAPRG301A Apply introductory programming techniques Program Bugs US Navy Admiral Grace Hopper is often credited with.
CompSci 100 Prog Design and Analysis II
IT253: Computer Organization Lecture 3: Memory and Bit Operations Tonga Institute of Higher Education.
Compsci 06/101, Spring What is Computing? Informatics? l What is computer science, what is its potential?  What can we do with computers in.
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.
Software Design 8.1 A Rose by any other name…C or Java? l Why do we use Java in our courses (royal we?)  Object oriented  Large collection of libraries.
Introduction to Programming Instructor: Yong Tang Brookhaven National Laboratory Working on accelerator control (BNL Phone #)
Department of Electrical and Computer Engineering Introduction to C++: Primitive Data Types, Libraries and Operations By Hector M Lugo-Cordero August 27,
Compsci 06/101, Spring What is Computing? Informatics? l What is computer science, what is its potential?  What can we do with computers in.
Compsci 100, Spring What’s left to talk about? l Transforms  Making Huffman compress more  Understanding what transforms do Conceptual understanding,
CPS 100, Fall What is Computing? Informatics? l What is computer science, what is its potential?  What can we do with computers in our lives?
CompSci 100e Program Design and Analysis II April 7, 2011 Prof. Rodger CompSci 100e, Spring p 1 h 1 2 e 1 r 1 4 s 1 * 2 7 g 3 o
CompSci Problem: finding subsets l See CodeBloat APT, requires finding sums of all subsets  Given {72, 33, 41, 57, 25} what is sum closest (not.
1 Lecture 5 More Programming Constructs Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung Institute of Technology.
Compsci 101, Fall LWoC l Review Recommender, dictionaries, files  How to create recommendations in order? food.txt  Toward a Duke eatery-recommender.
Compsci 06/101, Fall What is Computing? Informatics? l What is computer science, what is its potential?  What can we do with computers in our.
Chapter 11  Getting ready to program  Hardware Model  Software Model  Programming Languages  Facts about C++  Program Development Process  The Hello-world.
CompSci 100e 12.1 Sorting: In 2 Slides l Why do people study sorting?  Because we have to  Because sorting is beautiful  Example of algorithm analysis.
Computer Science A 1. Course plan Introduction to programming Basic concepts of typical programming languages. Tools: compiler, editor, integrated editor,
C is a high level language (HLL)
Compsci 101.2, Fall Plan for LDO101 l Ethical webpage scraping  Illustrate power of regular expressions  Python makes trying things relatively.
Review A program is… a set of instructions that tell a computer what to do. Programs can also be called… software. Hardware refers to… the physical components.
Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 1: Introduction to Computers and Programming.
Chapter 1 slides1 What is C? A high-level language that is extremely useful for engineering computations. A computer language that has endured for almost.
Software Engineering Algorithms, Compilers, & Lifecycle.
Coming up Implementation vs. Interface The Truth about variables Comparing strings HashMaps.
CompSci 100e 10.1 Binary Digits (Bits) l Yes or No l On or Off l One or Zero l
CMSC 202 Lesson 26 Miscellaneous Topics. Warmup Decide which of the following are legal statements: int a = 7; const int b = 6; int * const p1 = & a;
CompSci From bits to bytes to ints  At some level everything is stored as either a zero or a one  A bit is a binary digit a byte is a binary.
Bitwise Operations C includes operators that permit working with the bit-level representation of a value. You can: - shift the bits of a value to the left.
CompSci 101 Introduction to Computer Science
From bits to bytes to ints
The Study of Computer Science Chapter 0
Basic Concepts: computer, program, programming …
BASIC PROGRAMMING C SCP1103 (02)
Prof: Dr. Shu-Ching Chen TA: Samira Pouyanfar Spring 2017
Computer Science 210 Computer Organization
Engineering Problem Solving With C An Object Based Approach
Bottom up meets Top down
BASIC PROGRAMMING C SCP1103 (02)
The Study of Computer Science Chapter 0
Choice of Programming Language
CS 240 – Lecture 8 Bitwise Operations, Bit Manipulation, Type Conversion, Conditional Expression.
Computer Science 210 Computer Organization
The Study of Computer Science
Strings, Line-by-line I/O, Functions, Call-by-Reference, Call-by-Value
Fundamentals of Programming I Number Systems
Lesson 26 Miscellaneous Topics
CS/COE0447 Computer Organization & Assembly Language
The Study of Computer Science
Operations and Arithmetic
LCC 6310 Computation as an Expressive Medium
The Study of Computer Science Chapter 0
Advanced OS COMP 755.
From bit to byte to char to int to long
Presentation transcript:

Views of programming Writing code from the method/function view is pretty similar across languages Organizing methods is different, organizing code is different, not all languages have classes, Loops, arrays, arithmetic, … Program using abstractions and high level concepts Do we need to understand 32-bit twos-complement storage to understand x =x+1? Do we need to understand how arrays map to contiguous memory to use ArrayLists?

Bottom up meets Top down We teach programming by teaching abstractions What’s an array? What’s an ArrayList? What’s an array in C? What’s a map, Hashmap? Treemap? How are programs stored and executed in the JVM? Differences on different architectures? Similarities between Java and C++ and Python and PHP? What about how the CPU works? How memory works? Shouldn’t we study this too?

From bit to byte to char to int to long Ultimately everything is stored as either a 0 or 1 Bit is binary digit a byte is a binary term (8 bits) We should be grateful we can deal with Strings rather than sequences of 0's and 1's. We should be grateful we can deal with an int rather than the 32 bits that comprise an int If we have 255 values for R, G, B, how can we pack this into an int? Why should we care, can’t we use one int per color? How do we do the packing and unpacking?

More information on bit, int, long int values are stored as two's complement numbers with 32 bits, for 64 bits use the type long, a char is 16 bits Standard in Java, different in C/C++ Facilitates addition/subtraction for int values We don't need to worry about this, except to note: Infinity + 1 = - Infinity (see Integer.MAX_VALUE) Math.abs(-Infinity) > Infinity Java byte, int, long are signed values, char unsigned What are values for 16-bit char? 8-bit byte? Why did this matter in Burrows Wheeler?

Signed, unsigned, and why we care Some applications require attention to memory-use Differences: one-million bytes, chars, and int First requires a megabyte, last requires four megabytes When do we care about these differences? Memory is cheaper, faster, …But applications expand to use it Java signed byte: -128..127, # bits? What if we only want 0-255? (Huff, pixels, …) Convert negative values or use char, trade-offs? Java char unsigned: 0..65,536 # bits? Why is char unsigned? Why not as in C++/C?

More details about bits How is 13 represented? … _0_ _0_ _1_ _1_ _0_ _1_ 24 23 22 21 20 Total is 8+4+1 = 13 What is bit representation of 32? Of 15? Of 1023? What is bit-representation of 2n - 1? What is bit-representation of 0? Of -1? Study later, but -1 is all 1’s, left-most bit determines < 0 Determining what bits are on? How many on? Understanding, problem-solving

How are data stored? To facilitate Huffman coding we need to read/write one bit Why do we need to read one bit? Why do we need to write one bit? When do we read 8 bits at a time? 32 bits? We can't actually write one bit-at-a-time. We can't really write one char at a time either. Output and input are buffered,minimize memory accesses and disk accesses Why do we care about this when we talk about data structures and algorithms? Where does data come from?

How do we buffer char output? Done for us as part of InputStream and Reader classes InputStreams are for reading bytes Readers are for reading char values Why do we have both and how do they interact? Reader r = new InputStreamReader(System.in); Do we need to flush our buffers? In the past Java IO has been notoriously slow Do we care about I? About O? This is changing, and the java.nio classes help Map a file to a region in memory in one operation

Buffer bit output To buffer bits we store bits in a buffer (duh) When the buffer is full, we write it. The buffer might overflow, e.g., in process of writing 10 bits to 32-bit capacity buffer that has 29 bits in it How do we access bits, add to buffer, etc.? We need to use bit operations Mask bits -- access individual bits Shift bits – to the left or to the right Bitwise and/or/negate bits

Representing pixels A pixel typically stores RGB and alpha/transparency values Each RGB is a value in the range 0 to 255 The alpha value is also in range 0 to 255 Pixel red = new Pixel(255,0,0,0); Pixel white = new Pixel(255,255,255,0); Typically store these values as int values, a picture is simply an array of int values void process(int pixel){ int blue = pixel & 0xff; int green = (pixel >> 8) & 0xff; int red = (pixel >> 16) & 0xff; }

Bit masks and shifts void process(int pixel){ int blue = pixel & 0xff; int green = (pixel >> 8) & 0xff; int red = (pixel >> 16) & 0xff; } Hexadecimal number: 0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f f is 15, in binary this is 1111, one less than 10000 The hex number 0xff is an 8 bit number, all ones Bitwise & operator creates an 8 bit value, 0—255 Must use an int/char, what happens with byte? 1&1 == 1, otherwise we get 0 like logical and Similarly we have |, bitwise or

A Rose by any other name…C or Java? Why do we use Java in our courses (royal we?) Object oriented Large collection of libraries Safe for advanced programming and beginners Harder to shoot ourselves in the foot Why don't we use C++ (or C)? Standard libraries weak or non-existant (comparatively) Easy to make mistakes when beginning No GUIs, complicated compilation model What about other languages?

Why do we learn other languages? Perl, Python, PHP, Ruby, C, C++, Java, Scheme, ML, Can we do something different in one language? Depends on what different means. In theory: no; in practice: yes What languages do you know? All of them. In what languages are you fluent? None of them In later courses why do we use C or C++? Closer to the machine, we want to understand the machine at many levels, from the abstract to the ridiculous Or at all levels of hardware and software Some problems are better suited to one language What about writing an operating system? Linux?

Unique words in Java import java.util.*; import java.io.*; public class Unique { public static void main(String[] args) throws IOException{ Scanner scan = new Scanner(new File("/data/melville.txt")); TreeSet<String> set = new TreeSet<String>(); while (scan.hasNext()){ String str = scan.next(); set.add(str); } for(String s : set){ System.out.println(s);

Bjarne Stroustrup, Designer of C++ Numerous awards, engineering and science ACM Grace Hopper Formerly at Bell Labs Now Texas A&M “There's an old story about the person who wished his computer was as easy to use as his telephone. That wish has come true, since I no longer know how to use my telephone.” Bjarne Stroustrup

Unique words in C++ #include <iostream> #include <fstream> #include <set> using namespace std; int main(){ ifstream input("/data/melville.txt"); set<string> unique; string word; while (input >> word){ unique.insert(word); } set<string>::iterator it = unique.begin(); for(; it != unique.end(); it++){ cout << *it << endl; return 0;

PHP, Rasmus Lerdorf and Others Qeqertarsuaq, Greenland 1995 started PHP, now part of it http://en.wikipedia.org/wiki/PHP Personal Home Page No longer an acronym “When the world becomes standard, I will start caring about standards.” Rasmus Lerdorf

Unique words in PHP <?php $wholething = file_get_contents("file:///data/melville.txt"); $wholething = trim($wholething); $array = preg_split("/\s+/",$wholething); $uni = array_unique($array); sort($uni); foreach ($uni as $word){ echo $word."<br>"; } ?>

Guido van Rossum BDFL for Python development Python is multi-paradigm Benevolent Dictator For Life Late 80’s began development Python is multi-paradigm OO, Functional, Structured, … We're looking forward to a future where every computer user will be able to "open the hood" of their computer and make improvements to the applications inside. We believe that this will eventually change the nature of software and software development tools fundamentally. Guido van Rossum, 1999!

Unique Words in Python #! /usr/bin/env python import sys import re def main(): f = open('/data/melville.txt', 'r') words = re.split('\s+',f.read().strip()) allWords = set() for w in words: allWords.add(w) for word in sorted(allWords): print "%s" % word if __name__ == "__main__": main()

Kernighan and Ritchie First C book, 1978 First ‘hello world’ Ritchie: Unix too! Turing award 1983 Kernighan: tools Strunk and White Everyone knows that debugging is twice as hard as writing a program in the first place. So if you are as clever as you can be when you write it, how will you ever debug it? Brian Kernighan

How do we read a file in C? #include <stdio.h> #include <string.h> #include <stdlib.h> int strcompare(const void * a, const void * b){ char ** stra = (char **) a; char ** strb = (char **) b; return strcmp(*stra, *strb); } int main(){ FILE * file = fopen("/data/melville.txt","r"); char buf[1024]; char ** words = (char **) malloc(5000*sizeof(char **)); int count = 0; int k;

Storing words read when reading in C while (fscanf(file,"%s",buf) != EOF){ int found = 0; // look for word just read for(k=0; k < count; k++){ if (strcmp(buf,words[k]) == 0){ found = 1; break; } if (!found){ // not found, add to list words[count] = (char *) malloc(strlen(buf)+1); strcpy(words[count],buf); count++; Complexity of reading/storing? Allocation of memory?

Sorting, Printing, Freeing in C qsort(words,count,sizeof(char *), strcompare); for(k=0; k < count; k++) { printf("%s\n",words[k]); } for(k=0; k < count; k++){ free(words[k]); free(words); Sorting, printing, and freeing How to sort? What’s analgous to comparator? Why do we call free? Necessary in this program? Why?