CSE 143 Lecture 25 Computer Science slides created by Marty Stepp, Hélène Martin, and Benson Limketkai

Slides:



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

Course Outline Presentation Term: F09 Faculty Name : Asma Sanam Larik Course Name :INTRO TO COMPUTING Course Code : CSE145 Section :1 Semester : 1.
1 Undergraduate Curriculum Revision Department of Computer Science February 10, 2010.
CSE 373 Graphs 1: Concepts, Depth/Breadth-First Search
Computer Science It’s more than programming Eric Lantz.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Introductory Computer Science Courses Past experiences & thoughts Haakon Ringberg, Thomson Research Paris & Princeton University.
1 i206: Distributed Computing Applications & Infrastructure 2012
Computer Science Professor Jennifer Rexford ’91.
CS4 - Introduction to Scientific Computing Alan Usas Topics Covered Algorithms and Data Structures –Primality testing, bisection, Newton’s method,
CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
CSE 143 Lecture 26 Computer Science slides created by Marty Stepp and Benson Limketkai
1 Foundations of Software Design Lecture 1: Course Overview Intro to Binary and Boolean Marti Hearst SIMS, University of California at Berkeley.
Intelligent Systems Group Emmanuel Fernandez Larry Mazlack Ali Minai (coordinator) Carla Purdy William Wee.
Course Review i206 Fall 2010 John Chuang. 2 Outline  Test 3 topics  Course review  Course evaluation.
What is Computer Science?
Discrete Structure CS 203 Introduction.
Goodbye, world! CSE Major themes Abstraction –Leverage existing components without understanding details –Create components that can be used as.
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
Lecture 23: Future of IT Intro to IT COSC1078 Introduction to Information Technology Lecture 23 Future of IT James Harland
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
C OMPUTER S CIENCE, C OMPUTER E NGINEERING, I NFORMATION T ECHNOLOGY AND S YSTEMS, F LOW OF C ONTROL, B ATCH AND I NTERACTIVE P ROCESSING Week 5 Mr. Mohammed.
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
CS426 Game Programming II Dan Fleck. Why games?  While the ideas in this course are demonstrated programming games, they are useful in all parts of computer.
Relevance of Maths for CS John Barnden School of Computer Science University of Birmingham Intro to Maths for CS 2013/14.
Structure of Study Programmes Bachelor of Computer Science Bachelor of Information Technology Master of Computer Science Master of Information Technology.
An Introduction to Computer Science. CSE Studies How Computers Work and How to Make Them Work Better Architecture  Designing machines Programming languages.
Network Security by Behzad Akbari Spring 2012 In the Name of the Most High.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Weems CSE  CompE Transition 2007 BSCSE PRE-PROFESSIONAL (54 hours) GENERAL EDUCATION (24 hours) PROFESSIONAL (49 hours) 3302 Programming Languages 3310.
Discrete Structures for Computing
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?
I'll give you time to fill out evals at the end – please wait until I'm out of the room! Goodbye, world!
Fundamentals of Information Systems, Sixth Edition1 Natural Language Processing and Voice Recognition Processing that allows the computer to understand.
Lecture 23: Future of IT Intro to IT COSC1078 Introduction to Information Technology Lecture 23 Future of IT James Harland
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
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.
Master’s Degree in Computer Science. Why? Acquire Credentials Learn Skills –Existing software: Unix, languages,... –General software development techniques.
University of California Irvine Department of Computer Science UCI Computer Science Department 7 majors 1860 undergraduates 322 graduate students ~42 faculty/lecturers.
More Computer Science in your Future? CSE 142 Autumn
CSE 373: Data Structures and Algorithms
Goodbye, world!. 2 Major themes Abstraction Leverage existing components without understanding details Create components that can be used as black boxes.
CSE 143 Lecture 29 Computer Science Based on slides by Marty Stepp and Benson Limketkai.
Quantum Computers By Ryan Orvosh.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Presenter: Bradley Green.  What is Bioinformatics?  Brief History of Bioinformatics  Development  Computer Science and Bioinformatics  Current Applications.
Why Should You Apply to Graduate School? Masters Degree
Sub-fields of computer science. Sub-fields of computer science.
Who Am I?.
Recursion, robots, and randomness
Computer Science Courses
Ch. 11 Theory of Computation
Big Ideas in Computer Science
Major themes Abstraction Design tradeoffs Recursion Leverage existing components without understanding details Create components that can be.
The CS Undergrad Curriculum of 2017: My Biased View from Academia
COMP 4640 Intelligent & Interactive Systems
Building Java Programs Bonus Slides
What is Pattern Recognition?
* 312 Foundations II 332 Data Abstractions 311 I 351 Hw/Sw Interface
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.
CSE 373 Data Structures and Algorithms
CSCE156: Introduction to Computer Science II
Computer Science Courses in the Major
Presentation transcript:

CSE 143 Lecture 25 Computer Science slides created by Marty Stepp, Hélène Martin, and Benson Limketkai

2 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

3 Data structures graphs, heaps, skip lists balanced trees (AVL, splay, red-black) CSE 373, 332 ORD PVD MIA DFW SFO LAX LGA HNL

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

5 Security cryptography: study of hiding information –enigma machine –RSA encryption –steganography security problems and attacks –social engineering –viruses, worms, trojans –rootkits, key loggers CSE 484 security course –hacking assignment: hack into grades, change from 0 to 100%

6 Quantum computing qubit: A particle that can store 0, 1, or any "superposition" between –a bit that can sort of be 0 and 1 at once –quantum computer: uses qubits, not bits –theoretically makes it possible to perform certain computations very quickly Example: factoring integers (why is that useful?) –actual implementation still in its infancy can add single-digit numbers; can factor 15

7 Robots –toys, building cars, vacuums, surgery, search and rescue, elder care, exploration

8 Graphics and vision GRAIL (Graphics and AI Lab) computer vision AI and the Turing Test

9 Sensor networks Environment monitoring Military Intelligence Intelligent homes –detecting human activity through device usage / voltage (S. Patel, UW) radio freq. identification (RFID) –shopping, inventory –credit cards, toll roads, badges

10 Data mining data mining: extracting patterns from large data sets –What do these two lists have in common? coughing, rash, high fever, sore throat, headache, heartburn V14GR4, cheap meds, home loans, Nigeria, lower interest rate –And what does it have to do with sorting your mail? (90% of mail is sorted automatically) (2005)

11 Science and medicine computer science –bioinformatics: applying algorithms/stats to biological datasets –computational genomics: study genomes of cells/organisms –neurobotics: robotic brain-operated devices to assist human motor control –assistive technologies

12 The developing world One Laptop Per Child (OLPC) Mary Lou Jepsen, CTO

13 Experience optional Mark Zuckerberg, Facebook –side project while soph. CS major at Harvard in 2 weeks, 2/3 of Harvard students joined Bill Gates started "Micro-Soft" at age 20 Larry Page / Sergei Brin, Google –made "BackRub" search at age 23 Roberta Williams, SierraRoberta Williams –pioneer of adventure gaming Ryan Hankins, vsfinder.com

14 Join us!