Building Java Programs Bonus Slides

Slides:



Advertisements
Similar presentations
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Advertisements

Security & Encryption Thomas Fenske & Joseph Minter.
Computer Science It’s more than programming Eric Lantz.
CSC 2400 Computer Systems I Lecture 3 Big Ideas. 2 Big Idea: Universal Computing Device All computers, given enough time and memory, are capable of computing.
Computer Science Professor Jennifer Rexford ’91.
CSE 143 Lecture 26 Computer Science slides created by Marty Stepp and Benson Limketkai
A Glimpse of the History of Cryptography
Course Introduction CS 1037 Fundamentals of Computer Science II.
Intelligent Systems Group Emmanuel Fernandez Larry Mazlack Ali Minai (coordinator) Carla Purdy William Wee.
Computer Science Professor Jennifer Rexford ’91.
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
Xiaoying Sharon Gao Mengjie Zhang Computer Science Victoria University of Wellington Introduction to Artificial Intelligence COMP 307.
Famous Firsts in Computation MSE 2400 Evolution & Learning
An Introduction to Computer Science. CSE Studies How Computers Work and How to Make Them Work Better Architecture  Designing machines Programming languages.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Secret Codes.  A code is a system of symbols, letters, words, or signals that are used instead of ordinary words and numbers to send messages or store.
Research Interest overview and future directions Mina Guirguis Computer Science Department Texas State University – San Marcos CS5300 9/16/2011.
I'll give you time to fill out evals at the end – please wait until I'm out of the room! Goodbye, world!
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
Shortest Paths and Dijkstra’s Algorithm CS 105. SSSP Slide 2 Single-source shortest paths Given a weighted graph G and a source vertex v in G, determine.
CSE 143 Lecture 24 Computer Science Goodbye, world! slides adapted from Marty Stepp, Hélène Martin, and Benson Limketkai
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.
CSE 143 Lecture 25 Computer Science slides created by Marty Stepp, Hélène Martin, and Benson Limketkai
University of California Irvine Department of Computer Science UCI Computer Science Department 7 majors 1860 undergraduates 322 graduate students ~42 faculty/lecturers.
Invitation to Computer Science 5 th Edition Chapter 8 Information Security.
CSE 143 Lecture 29 Computer Science Based on slides by Marty Stepp and Benson Limketkai.
Chapter 11 Theory of Computation © 2007 Pearson Addison-Wesley. All rights reserved.
 History  What is AI?  Current implementations  Future of AI  Conclusion  References.
CS201 Tech-Talk Two: Cryptography Michael Hsu CSULA.
Why Should You Apply to Graduate School? Masters Degree
Sub-fields of computer science. Sub-fields of computer science.
Unit 3 Section 6.4: Internet Security
Secret Key Cryptography
Security Issues in Information Technology
Who Am I?.
Electrical Engineering
NP-Completeness NP-Completeness Graphs 5/7/ :49 PM x x x x x x x
Key words: Cryptography | Binary | Cipher
Chapter 12: Theory of Computation
TASHKENT UNIVERSITY OF INFORMATION TECHNOLOGIES NAMED AFTER MUHAMMAD AL-KHWARIZMI THE SMART HOME IS A BASIC OF SMART CITIES: SECURITY AND METHODS OF.
Recursion, robots, and randomness
The History of Computing
Paul M. Dooley Tamer Tayea Wenlin Zhou Ian M. Johson Joshua Tarlow
Computer Science Courses
Done Done Course Overview What is AI? What are the Major Challenges?
Chapter 11 Theory of Computation © 2007 Pearson Addison-Wesley.
Ch. 11 Theory of Computation
Big Ideas in Computer Science
Introduction to Problem Solving and Programming CS140: Introduction to Computing 1 8/19/13.
COMP 4640 Intelligent & Interactive Systems
Q Jeff Kinne.
Chapter 12: Theory of Computation
What is Pattern Recognition?
NP-Completeness NP-Completeness Graphs 11/16/2018 2:32 AM x x x x x x
History of Cryptography
NP-Completeness NP-Completeness Graphs 12/3/2018 2:46 AM x x x x x x x
CS3901 Intermediate Programming & Data Structures Introduction
CSE 373: Data Structures and Algorithms
CSE 373 Data Structures and Algorithms
Principles of Computing – UFCFA3-30-1
Cryptography : Introduction
An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.
Discrete Mathematics in the Real World
Slide design: Dr. Mark L. Hornick
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
The Internet: Encryption & Public Keys
By Sean O’Mahoney from the Computing Society at Futures Friday
Computer Science Courses in the Major
Presentation transcript:

Building Java Programs Bonus Slides Computer Science is Awesome!

Data structures graphs, heaps, skip lists 99 60 40 80 20 10 50 700 85 graphs, heaps, skip lists balanced trees (AVL, splay, red-black) ORD PVD MIA DFW SFO LAX LGA HNL 849 802 1387 1743 1843 1099 1120 1233 337 2555 142

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

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% The Enigma machine is any of a family of related electro-mechanical rotor machines that have been used to generate ciphers for the encryption and decryption of secret messages. The Enigma was invented by German engineer Arthur Scherbius at the end of World War I.[1] It was used commercially from the early 1920s and was adopted by military and governmental services of a number of countries — most notably by Nazi Germany before and during World War II.[2] A variety of Enigma models were produced, but the German military model, the Wehrmacht Enigma, is the version most commonly discussed.

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

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

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

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

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) http://www.usps.com/strategicplanning/cs05/chp2_009.html (2005)

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

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

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, Sierra pioneer of adventure gaming