CompSci 001 18.1 Topics since midterm l Java  Methods  Sound  Graphics l Software design  Recursion  Arrays  Copyright issues l Computer systems.

Slides:



Advertisements
Similar presentations
U Computer Systems Research: Past and Future u Butler Lampson u People have been inventing new ideas in computer systems for nearly four decades, usually.
Advertisements

Computing Studies Is it for me? Click here to find out…
Limited Time and Experience: Parallelism in CS1 Fourth NSF/TCPP Workshop on Parallel and Distributed Computing Education (EduPar-14) Steven Bogaerts.
Year 11 Tuesday March 3 rd To give information about exams, revision sessions and final practical exams. 2. To give some advice about revision.
Math Xa Introduction to Functions and Calculus Fall 2008 Introductory Meeting John Hall.
Craig Schock, 2004 Basic Exam information Time and location Exam Regulations Illness during exam Taking the exam Chapter breakdown Brief Overview Tips.
CS4 - Introduction to Scientific Computing Alan Usas Topics Covered Algorithms and Data Structures –Primality testing, bisection, Newton’s method,
Chapter Chapter Goals Describe the layers of a computer system Describe the concept of abstraction and its relationship to computing Describe.
COMPSCI 125 Spring 2011 Section What is computer science? … the study of the theoretical foundations of information and computation and their implementation.
CS 280 Data Structures Professor John Peterson. Goals Understand “Programming in the small” Java programming Know what’s under the hood in complex libraries.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
CSCE 312 Computer Organization Lecture 0: Course Administration EJ Kim Department of Computer Science and Engineering 338B Bright
Welcome to CSCA67 Discrete Mathematics for Computer Scientists
Object-Oriented Enterprise Application Development Course Introduction.
EngageNY.org Common Core: What can Parents Do? Presented by: Ms. Augello Ms. Careccia.
Introducing Computer Science in the Classroom
ECS15: Introduction to Computers Fall 2013 Patrice Koehl
Careers and Degrees in Computing Stuart Hansen Department of Computer Science UW - Parkside.
Chapter 01 Nell Dale & John Lewis.
Types of Operating System
Object-Oriented Programming Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm QA, IIMS, Albany.
Introduction CSE 1310 – Introduction to Computers and Programming
Introduction CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
General information CSE : Probabilistic Analysis of Computer Systems
Introduction and Overview Questions answered in this lecture: What is an operating system? How have operating systems evolved? Why study operating systems?
Prof. Matthew Hertz SH 1029F /
Prof. Matthew Hertz WTC 207D /
Amdahl's Law Validity of the single processor approach to achieving large scale computing capabilities Presented By: Mohinderpartap Salooja.
The Beauty and Joy of Computing Lecture #3 : Creativity & Abstraction UC Berkeley EECS Lecturer Gerald Friedland.
CPS Topics since last test l Recursion l Software design  Object-oriented  Copyright issues l Computer systems  Hardware  Architecture  Operating.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
April 26, CSE8380 Parallel and Distributed Processing Presentation Hong Yue Department of Computer Science & Engineering Southern Methodist University.
Parallel Processing Sharing the load. Inside a Processor Chip in Package Circuits Primarily Crystalline Silicon 1 mm – 25 mm on a side 100 million to.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Genome Revolution: COMPSCI 006G 1.1 FOCUS COMPSCI 006G Genome Revolution Owen Astrachan
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
CompSci CompSci 6 Programming Design and Analysis I Dietolf (Dee) Ramm
CSCE 312 Computer Organization Course Administration Dr. Rabi N Mahapatra Department of Computer Science & Engineering, 520B HR Bright,
CompSci What can be computed l What class of problems can be solved? ä Google Datacenter, Desktop computer, Cell phone, pencil? ä Alan Turing proved.
CPS Topics since last test l Recursion l Sound l Graphics l Software design  Object-oriented  Copyright issues l Computer systems  Hardware 
Software Design 14.1 CPS 108 l Object oriented design and programming of medium-sized projects in groups using modern tools and practices in meaningful.
Introduction & Overview Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
CompSci 100e 13.1 Topics l Data Structures  Arrays ArrayLists  Linked Lists Circular Doubly-linked  Binary Trees Binary Search Trees AVL Trees Heaps.
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.
COMP1927 Course Introduction 16x1
Introduction CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Chapter VI What should I know about the sizes and speeds of computers?
The problem that needs to be solved is if a computer career is for me.
Parallel IO for Cluster Computing Tran, Van Hoai.
Duke University Computer Science 1 Topics since last test l More invariants l Pixmap l Sorting & Templates  Selection sort  Insertion sort  Quicksort.
Hardware Trends CSE451 Andrew Whitaker. Motivation Hardware moves quickly OS code tends to stick around for a while “System building” extends way beyond.
Hardware Trends CSE451 Andrew Whitaker. Motivation Hardware moves quickly OS code tends to stick around for a while “System building” extends way beyond.
CPS Topics since last test l Graphics l Software design  Recursion  Arrays  Copyright issues l Computer systems  Hardware  Architecture  Operating.
ECEN2102 Digital Logic Design Lecture 0 Course Overview Abdullah Said Alkalbani University of Buraimi.
BA Week 10 Course overview, conversations about this class and the IS field’s future Dave Sullivan.
Parallel Algorithm Design & Analysis Course Dr. Stephen V. Providence Motivation, Overview, Expectations, What’s next.
Conclusions on CS3014 David Gregg Department of Computer Science
Sujata Ray Dey Maheshtala College Computer Science Department
CompSci 6 Introduction to Computer Science
CompSci 101 Introduction to Computer Science
AP computer science PRINCIPLES
EE 193: Parallel Computing
Delivering new Enhanced Assessments
Crowd Simulation (INFOMCRWS) - Course Introduction
Parallel Processing Sharing the load.
Sujata Ray Dey Maheshtala College Computer Science Department
Topics since last test More invariants Pixmap Sorting & Templates
Topics since last test More invariants Pixmap Sorting & Templates
Welcome! Knowledge Discovery and Data Mining
Presentation transcript:

CompSci Topics since midterm l Java  Methods  Sound  Graphics l Software design  Recursion  Arrays  Copyright issues l Computer systems  Hardware  Architecture  Operating Systems  Security l Debate Topics  Digital Divide  Net Neutrality  Biometrics  Data Mining  Blogging l Computer Science Theory  Performance of algorithms  Complexity  Computability

CompSci The exam l Tuesday, May 1, 2pm-5pm in B101 LSRC l Open book/open note l ~40% multiple choice/short answer l Cumulative l By end of the day on Friday, April 28:  All grades up (except final project)  All solutions out  Grade problems: Submit Blackboard assignment issues l Final grades up Friday, May 4 Help session Sunday, April 29 3:30-5:00 in D106 LSRC

CompSci Essential concepts There is beauty at all levels of sophistication and all levels of abstraction. - David A. Blackwell If life were really fair, algebra would actually come in handy - Amstel Light commercial

CompSci On programming and deadlines Observe that for the programmer, as the chef, the urgency of the patron may govern the scheduled completion of task, but it cannot govern the actual completion. An omelet, promised in two minutes, may appear to be progressing nicely. But when it has not set in two minutes, the customer has two choices -- wait or eat it raw. Software customers have the same choices.. - Fred Brooks We don’t have time to stop for gas -- we’re already late. - Old software project planning proverb via Mike Cleron I love deadlines. I like the whooshing sound they make as they fly by. - Douglas Adams

CompSci Why is programming fun? What delights may its practitioner expect as a reward? First is the sheer joy of making things Second is the pleasure of making things that are useful Third is the fascination of fashioning complex puzzle- like objects of interlocking moving parts Fourth is the joy of always learning Finally, there is the delight of working in such a tractable medium. The programmer, like the poet, works only slightly removed from pure thought-stuff. Fred Brooks

CompSci On education The college you attend does not determine the scope and possibility of your life’s achievements. It will have some influence, no doubt. What is more important is the encouragement that we, as parents and friends, offer these prospective students as they explore their own educational trail. In the end, the experiences they encounter and the depth of character they build along the way will mean far more than the name of the institution on their diploma. - John Hennesy Education is not filling a bucket but lighting a fire. - William Yeats

CompSci On education An education isn’t how much you have committed to memory, or even how much you know. It’s being able to differentiate between what you know and what you don’t. - Anatole France The best way to have a good idea is to have lots of ideas. - Linus Pauling If there is no struggle, there is no progress - Frederick Douglass The ability to quote is a serviceable substitute for wit. - W. Somerset Maugham

CompSci Who are these people? Why are they important?

CompSci Who are these people? Why are they important?

CompSci Who are these people? Why are they important?

CompSci Laws governing computer science l Moore’s Law (1965)  The number of transistors per area on a chip double every 18 months  Density of transistors => more functionality and speed l How about multiple computers? l Amdahl’s Law (1967)  Given: fraction ( s ) of work to be done is serial (i.e. isn’t parallelizable)  Maximum speedup with infinite number of processors is 1/s

CompSci What are computers for? l Simulation l Communication among people  Storage = communication across time l Control  Get physical  Get real (time)  Get mobile

CompSci Application l Simulation  Models of the real world (e.g. planets, cities, molecules) l Communication among people  Information at your fingertips  Telepresence  Home l Control  Robots  Software agents

CompSci What’s next l CompSci 4  Robots  Video games  Java l CompSci 6  Assumes knowledge of loops & arrays l Seminars  Animation and virtual worlds  History of Communication l Interdisciplinary minor  Computational Biology & Bioinformatics  Computational Economics