What's next? Should you major in Computer Science?

Slides:

Advertisements

Similar presentations

Syntax & terminology review While the following slides are not exactly what we did on the board (object diagrams are not shown here) they cover most of.

Advertisements

1 CSE 142 Lecture Notes Interactive Programs with Scanner Chapter 4 Suggested reading: Suggested self-checks: Section 4.10 #1-4 These lecture.

UML Sequence Diagrams Reading: UML Distilled Ch. 4, by M. Fowler

These materials are prepared only for the students enrolled in the course Distributed Software Development (DSD) at the Department of Computer.

1 CSE 403 Software Requirements Reading: Pragmatic Programmer Ch. 7: Before the Project These lecture slides are copyright (C) Marty Stepp, 2007, with.

United Press International. From the New York Times. All rights reserved. Used by permission and protected by the Copyright Laws of the United States.

UML Class Diagrams 1 These lecture slides are copyright (C) Marty Stepp, They may not be rehosted, sold, or modified without expressed permission.

CSE 143 Lecture 14 (B) Maps and Grammars reading: 11.3 slides created by Marty Stepp

What have we learned?. What is a database? An organized collection of related data.

1 Building Java Programs Chapter 7: Arrays These lecture notes are copyright (C) Marty Stepp and Stuart Reges, They may not be rehosted, sold, or.

1 CSE 403 Introduction Reading: Rapid Development Ch3.3 These lecture slides are copyright (C) Marty Stepp, 2007, with significant content taken from slides.

1 Building Java Programs Chapter 3: Introduction to Parameters and Objects These lecture notes are copyright (C) Marty Stepp and Stuart Reges, They.

Final Exam Tuesday, December 22nd 2:00 - 3:50pm room 102 Warren Weaver Hall.

An Update on UW Intro Classes Stuart Reges Principal Lecturer University of Washington.

Course Introductions.  Introduction to java  Basics of Java  Classes & Objects  Java Collections and APIs  Algorithms and their analysis  Recursion.

CSE 143 Lecture 16 Iterators; Grammars reading: 11.1, 15.3, 16.5 slides created by Marty Stepp

Algorithms and Problem Solving

Building Java Programs

CSC 321: Data Structures Fall 2016

Databases Chapter 16.

Lecture 7 Data Compression

Welcome to Computer Science Jeopardy

records Database Vocabulary It can be useful to collect information.

Hierarchy of Data in a Database

Chapter 10: Non-linear Data Structures

Lecture 1: Welcome to CSE 373

slides created by Marty Stepp and Alyssa Harding

CSE 143 Lecture 9 References and Linked Nodes reading: 3.3; 16.1

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.

Defining New Types of Objects, part 3

ServiceLink Training Video Scheduling Service Gaps

Binary Trees Based on slides by Alyssa Harding & Marty Stepp

Maps Grammars Based on slides by Marty Stepp & Alyssa Harding

CSE 143 Lecture 20 Binary Search Trees, continued read 17.3

Introduction to Computer Science for Majors II

ITEC 2620M Introduction to Data Structures

CSE 142 Lecture Notes Graphics with DrawingPanel Chapter 3

CSE 303 Lecture 25 Loose Ends and Random Topics

Binary Trees: Motivation

ACCOUNTING INFORMATION SYSTEMS

CSE 403 JUnit Reading: These lecture slides are copyright (C) Marty Stepp, They may not be rehosted, sold, or modified without expressed permission.

CSE 142 Lecture Notes Defining New Types of Objects

Algorithms and Problem Solving

slides created by Marty Stepp

Building Java Programs

CSE 403 Scheduling These lecture slides are copyright (C) Marty Stepp, 2007, with significant content taken from slides written by Valentin Razmov. They.

CSE 143 Lecture 25 Set ADT implementation; hashing read 11.2

CSE 142 Lecture Notes Global Constants, Parameters, Return Values

CSE 142 Lecture Notes Inheritance, Interfaces, and Polymorphism

Introduction to Databases

1.4 ทบทวน JAVA OO Programming Concepts Declaring and Creating Objects

Suggested self-checks: Section 7.11 #1-11

Integration Reading: McConnell, Code Complete, Ch. 29

CSE 142 Lecture Notes Defining New Types of Objects, cont'd.

slides created by Marty Stepp

File Organization.

Suggested self-checks:

Christopher M. Pascucci

slides created by Marty Stepp

COP3530- Data Structures Introduction

The University of Adelaide, School of Computer Science

Hashing based on slides by Marty Stepp

What is Copyright? And why is it important? created by Mancie Beck.

Suggested self-checks: Section 7.11 #12-29

Binary Search Trees Based on slides by Marty Stepp & Alyssa Harding

Non-Linear data structures

A Binary Search Tree Implementation

RANDOM NUMBERS SET # 1:

slides created by Marty Stepp and Hélène Martin

Presentation transcript:

What's next? Should you major in Computer Science? CSE 142 Lecture Notes What's next? Should you major in Computer Science? These lecture notes are copyright (C) Marty Stepp 2005. May not be rehosted, copied, sold, or modified without Marty Stepp's expressed written permission. All rights reserved.

CSE 143 More Java: inheritance, the API, collections, recursion Data structures Effective ways to store, sort, and search data The little brother of databases Example assignments Random sentence generator Jane kissed Spot the wonderful wonderful pretentious television collapsed Assassin +-------->--------+ ^ v Joe --> Sally Jim Carol --> Chris ^ v +--------<--------<---------<--------+ Huffman Trees and secret codes: "hello" --> 00110010001011

What next?

Some interesting links "Why CSE?" http://www.cs.washington.edu/education/ugrad/forms/programinfo.html Nature of the CSE field: http://www.cs.washington.edu/education/ugrad/messer.html Videos of UW CSE students in action: http://www.cs.washington.edu/info/videos/