I'll give you time to fill out evals at the end – please wait until I'm out of the room! Goodbye, world!

Slides:



Advertisements
Similar presentations
College of Natural Sciences University of Northern Iowa Welcome to the Computer Science Department Dr. Ben Schafer.
Advertisements

CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CSE 111: Object Oriented Design. Design “To program is human but to design is divine” (WEH)
CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
CS 351 Overview Spring 2012 Modeling and Simulation Technologies Dr. Jim Holten.
UGCC Report, 11/29/05 Committee: Bettati, Gutierrez, Keyser, Jiheon Kwan (undergrad rep), Leyk, Loguinov, Petersen, Welch (chair) Meetings: Fridays 2-3.
CSE 143 Lecture 26 Computer Science slides created by Marty Stepp and Benson Limketkai
CS261 Data Structures Winter 2011 Professor Timothy Budd.
Visualizing Architectures INF 123 – Software architecture 1.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
Goodbye, world! CSE Major themes Abstraction –Leverage existing components without understanding details –Create components that can be used as.
February Semantion Privately owned, founded in 2000 First commercial implementation of OASIS ebXML Registry and Repository.
 A set of objectives or student learning outcomes for a course or a set of courses.  Specifies the set of concepts and skills that the student must.
CS324e - Elements of Graphics and Visualization Class Intro
Introduction CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Mathematics in Computer Science at Loras College Steve Mosiman.
Introduction CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
04/30/13 Last class: summary, goggles, ices Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1 Image: wordpress.com/2011/11/22/lig.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Socorro Independent School District Eastlake High School.
CSE 2320 Algorithms and Data Structures Dimitrios Kosmopoulos Introduction.
CS.UCSB.EDU U. C. S A N T A B A R B A R A C O M P U T E R S C I E N C E I want to be a Computer Scientist Why should I choose UCSB?
MATH 224 – Discrete Mathematics
CSE 143 Lecture 24 Computer Science Goodbye, world! slides adapted from Marty Stepp, Hélène Martin, and Benson Limketkai
I'll give you time to fill out evals at the end. Please wait until I'm out of the room! Goodbye, world!
I'll give you time to fill out evals at the end. Please wait until I'm out of the room! Goodbye, world!
Building Java Programs Bonus Slides Computer Science is Awesome! Copyright (c) Pearson All rights reserved.
CSE 143 Lecture 25 Computer Science slides created by Marty Stepp, Hélène Martin, and Benson Limketkai
SNU OOPSLA Lab. 1 Great Ideas of CS with Java Part 1 WWW & Computer programming in the language Java Ch 1: The World Wide Web Ch 2: Watch out: Here comes.
More Computer Science in your Future? CSE 142 Autumn
04/04/13 Algorithms and NP Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1.
Web Services from 10,000 feet Part I Tom Perkins NTPCUG CertSIG XML Web Services.
Goodbye, world!. 2 Major themes Abstraction Leverage existing components without understanding details Create components that can be used as black boxes.
Introduction CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
CSE 143 Lecture 29 Computer Science Based on slides by Marty Stepp and Benson Limketkai.
Discrete mathematics Kwon, Tae-kyoung
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
  ONLINE DORMITORY RESERVATION SYSTEM By RAMYA VAKITY KOUSHIK KUMAR SURAGONI MOTHE ADITHYA    GRADUATE CAPSTONE SEMINAR PROJECT    Submitted in partial.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Why Study Automata Theory and Formal Languages?
Why Study Automata? What the Course is About Administrivia
Computer Science Courses
CSC 221: Computer Programming I Fall 2005
Project Topic 2: Migration to Java 9
Principles of Computing – UFCFA Lecture-1
Introduction CSE 1310 – Introduction to Computers and Programming
Major themes Abstraction Design tradeoffs Recursion Leverage existing components without understanding details Create components that can be.
structures and their relationships." - Linus Torvalds
Software Usability and Design
Building Java Programs Bonus Slides
* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface
structures and their relationships." - Linus Torvalds
Software Defined Networking (SDN)
CSE 143 Goodbye, world!.
CSE 142 vs CSE 143 CSE 142 CSE 143 You learned how to write programs and decompose large problems with: Print statements Methods Control Structures.
Introduction to Computer Science for Majors II
Code to the Future: 2nd Grade
Review CSE116 2/21/2019 B.Ramamurthy.
Korea Software HRD Center
Rocky K. C. Chang September 11, 2018
CSCE156: Introduction to Computer Science II
Computer Science Courses in the Major
structures and their relationships." - Linus Torvalds
Martin Rinard, Jiasi Shen, Varun Mangalick
from Lutz Dietrich and Hans Kluge
Presentation transcript:

I'll give you time to fill out evals at the end – please wait until I'm out of the room! Goodbye, world!

2 Major themes Abstraction –Leverage existing components without understanding their details –Create components that can be used as black boxes Recursion –Reason about problems in terms of self-similarity –Write very short code to achieve complex behaviors Algorithm analysis –Scalability and growth –Tradeoffs between implementations Beauty

3 Leveraging existing code Accessing Facebook data – Processing language – Building games with physics – Processing biological data –

4 Using the restFB API Add the restfb jar to your build pathrestfb jar –In Eclipse, right click on your project > properties –In Java Build Path, Add JARs... Create Facebook app ( In your browser, request the pages described here to obtain an access tokenhere

5 More to CS than programming Mind-controlled robots – Muscle-controlled interfaces – 3D models from pictures – Animation –

6 Theory of computation languages, grammars, and automata computational complexity and intractability –Big-Oh –polynomial vs. exponential time –P = NP? graph theory ?

7 What's next? CSE non-majors –CSE 373: Data Structures and Algorithms –CSE 374: Programming Concepts and Tools (C/C++, Linux,...) –CSE 190M: Web Programming –CSE 131: Digital Photography –CSE 460: Animation Capstone (open to all majors) –INFO, AMATH, DXARTS,... CSE majors –CSE 332: Data Abstractions (Data Structures and Algorithms) –CSE 311: (Mathematical) Foundations of Computing –CSE 331: Software Design and Implementation –CSE 341: Programming Languages –CSE 344: Intro to Data Management (and databases) –CSE 351: Hardware/Software Interface