1. CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:50 645-4739 alphonce@buffalo.edu

2. cell phones off (please) 2

3. Announcements HW3 due Friday. Second exam is March 17 (week after spring break). 3

4. Today’s Agenda Programming languages –History and examples (continued) –Some basic programming (introduction) 4

5. Timeline Fortran – mid-late 1950’s – scientific computation Lisp – late 50’s – artificial intelligence COBOL – late 50’s, early 60’s – business programming Simula – early 60’s – simulations/object-oriented ML – late 70’s – functional programming/theorem proving Erlang – mid 80’s – (see slide) Fortress – in development now – (see slide) 5

6. Erlang Mid 1980’s Developed by Ericsson Concurrent Distributed Fault-tolerant Real-time Hot-code updates 6

7. Fortress In development now Scientific computing Parallelism by default Programmer extensible 7

8. Variables and Types Variables hold values Values encoded in some scheme: type! Languages differ in typing strategies: –compile-time vs. run-time ML infers types - demo 8

9. 9 Source: http://commons.wikimedia.org/wiki/File:Genealogical_tree_of_programming_languages.svg

10. Macros We will introduce you to some basic programming Defining macros for Word/Excel First, basic programming ideas 10

11. Sequencing Do things in order Usually indicated by order of instructions: –A program is a sequence of instructions (i.e. an ordered list, not a just an unordered set) 11

12. Selection Must have some way of choosing alternate computation paths Sometimes called conditional statements –Conditionally execute an instruction –Execute instruction based on some condition 12

13. Repetition Must have some way of repeating an instruction several times Repetition governed by a count –Do this 100 times Repetition governed by an event –Do this until user clicks button –Do this until temperature reaches 185 13

14. Variables Variables store information/data Must (generally) be typed (have a type) –Type determines encoding scheme 14

15. Subprograms Named sequences of instructions Can be used multiple times Can be parameterized –Area of a rectangle 15

16. Flow charts Diagrams which show flow of control in a program 16