Debugging

Android (operating system)

Human–computer interaction

Framework vs. Toolkit vs. Library

Android software development

Java (programming language)

Animation

User Interface Layout

Visual Perception

Application security

Accessibility

Event (computing)

Interactor hierarchy

Motor control

Fitts's law

Data analysis

Application Design Principles

Mental Models

Undo (Computing)

Persuasive technology

Location Services

Sensors

Dark pattern

Finite-state machine

Usability testing

User interface

CSE 340 Interaction Programming University of Washington Spring 2022 This course focuses on the design and programming of interactive systems, exploring various programming paradigms, event handling, and accessibility. It requires prior knowledge of Java and familiarity with data structures. This course helps to develop user-friendly interfaces and study existing interfaces. Although the platform used is Android, it's not strictly an Android programming course. Interactive technology is changing society. Some of today’s interfaces are used by a billion people at a time. Almost everything we create is created for people to use, through user interfaces. We will learn about interactive systems, including programming paradigms and design of event handling, layout, undo, accessibility and context awareness. ## Why should I take this class?

Interfaces are an important part of our daily lives and many of them are created as a connection from a human to a machine. Even a new machine learning algorithm or a database system requires some human connection in order for those systems to work.

User interfaces are incredibly important, but interactive user interaction requires a different programming paradigm than you may have learned before. In this you will learn how to:

- write an event-driven program which reacts to user input and displays output using abstractions in a structured and maintainable way. These abstractions generally transfer to almost any other user interface toolkit.
- think about the design and implementation of novel interaction techniques such as voice based interfaces or augmented reality, in order to enrich the user experience.
- build inclusive and accessible user interfaces.
- implement implement user-centered features, such as Undo, that following well studied design principles that are applicable in any user interface.
- critique and study existing user interfaces using light weight informal and formal methods.
- communicate your findings through comprehensive reports as well as reflections on your learning

The [Course Details](https://courses.cs.washington.edu/courses/cse340/22sp/course-details.html) page describes each of our course modules as well as other classes that complement the learning goals in CSE 340.
 The only official requirement for this class is that you have taken **CSE 142 and 143 or an equivalent class**, meaning you are comfortable programming in Java, and have some experience with data structures.

There are other skills that are required for the class that are not explicitly taught, which means you should **plan to spend extra time (either independently or in OH) learning and practicing those skills**. These include:

- working in an Integrated Development Environment (IDE) that is more complicated than JGrasp
- Using a version control systems (Git)
- Reading and understanding library and toolkit documentation
- Reading and understanding a larger starter code base
- Reflecting on and explaining the coding work you have done
- Reading through assignment specifications which are “more complicated and less detailed” than a typical Introduction to CS assignment specification.

Taking CSE 391 just before or concurrently with 340 can help, but our staff can also assist where needed.

The specific platform and language for this class are **Java on Android phones** (or simulators); using the IntelliJ IDE (Android Studio). While Google is switching over to Kotlin, there are good reasons to [start learning Android with Java first](https://dzone.com/articles/java-vs-kotlin-which-language-android-developer-sh).

Note that this class is designed for CSE majors, and other students who work regularly with information technology and are strong programmers. While we will consider applications from outside the major, other restrictions may limit space for such students. ### What should I expect as a student in this class?

This is an **interaction programming course** which will teach the abstractions that underly all user interfaces (see the [Course Details](https://courses.cs.washington.edu/courses/cse340/22sp/course-details.html) page for more information). To learn these concepts, we will cover a mix of theoretical aspects of HCI (such as how to predict the time it will take to click on a button, or why Undo is important to implement) and practical aspects of HCI (such as how to handle user interface events). What we will not cover is Android programming.

To re-iterate, *this is not an Android programming class and you will be expected to research Android programming yourself*. We will point you at the relevant of Android documentation but you must be willing to read through and explore this documentation on your own.

Taking any class is a commitment, and this one is no exeception. We want to make sure you get the most out of your experience. Below is some information about prerequisites and expectations.

CSE 340 Interaction Programming

Software Engineering

Reasoning

Data Abstraction

Representation Invariants (RIs)

Hashing

Exception handling

Generics

HTTP Servers

JSON

Loops

Abstract Data Type (ADT)

Software testing

Equality

Module Design & Style

React

Web Clients

Specifications

Abstraction Functions (AFs)

Identity (object-oriented programming)

Assertion (software development)

Subtypes

Event-Driven Programming

TypeScript

Software design pattern

JavaScript

CSE 331 Software Design & Implementation University of Washington Spring 2022 This course aims to improve students' software development skills, focusing on building correct, scalable, and easy-to-understand software. It relies on a solid understanding of Java and the concepts covered in CSE 143. Students will learn about software design principles, modern programming languages, and software tools. It covers software testing, type systems, design patterns, and more. The aim of this course is to help students write programs of higher quality and increased complexity. This requires creating software that is correct, easy to change, easy to understand, and easy to scale. The course covers principled approaches to achieving each of these. The aim of this course is to help students write programs of higher quality and increased complexity. This requires creating software that is (1) correct, (2) easy to change, (3) easy to understand, and (4) easy to scale. We will study principled approaches to achieving these four goals.

After completing this course successfully students should be able to:

- Successfully build medium-scale software projects in principled ways
- Understand the role of specifications and abstractions and how to verify that an implementation is correct, including effective testing and verification strategies and the use of formal reasoning
- Analyze a software development problem and be able to design effective program structures to solve it, including appropriate modularity, separation of abstraction and implementation concerns, use of standard design patterns to solve recurring design problems, and use of standard libraries
- Use modern programming languages effectively, including understanding type systems, objects and classes, modularity, notions of identity and equality, and proper use of exceptions and assertions
- Use and learn new contemporary software tools, including integrated development environments, test frameworks, debuggers, version control, and documentation processing tools

In this class, we will use Java and associated tools like IntelliJ, JUnit, JavaDoc, and git, but the goal is to understand the underlying ideas and concepts that are generally applicable to software construction. The only formal prerequisite is CSE 143. We will very much rely on a thorough understanding of the concepts from CSE 143 as well as Java programming skills. We will go much further and you will be challenged to approach software development much differently than you have in CSE 143 or other courses. ### Texts

The required text for the course is the following:

- Effective Java by Joshua Bloch, 3rd ed., Addison-Wesley, 2018.

Contains a great deal of distilled wisdom about Java best practices, technical details, and style issues.

There will be assigned readings from this book during the quarter, and there will be questions on the exams about those readings.

Besides the required text, the following books may be helpful to you:

- The Pragmatic Programmer by Andrew Hunt and David Thomas, 20th anniversary (2nd) edition, Addison-Wesley, 2020.

Contains a great deal of distilled wisdom about software construction and the craft of programming, including many things that those who read the book later in their careers wish they had learned early on.

- Program Development in Java by Barbara Liskov and John Guttag, 1st ed, Addison Wesley, 2000.

The content of this well-written book closely mirrors much of the content of the course. The only downside is that it was written 17 years ago, so it is out-of-date with regard to some of key parts of the Java language and libraries. Nonetheless, it is a good place to look for another presentation of the material covered in class, if you can ignore those parts.

- Core Java Vol. I - Fundamentals by Cay Horstmann, 10th ed, Prentice-Hall, 2016; 11th ed, 2018.

This is a good general reference for the Java language and basic libraries. While technical documentation for these things is available on the web, the discussions in a book like this one are usually easier to follow and typically include advice not found in the formal documentation. Either recent edition will cover what we need for CSE 331.

CSE 331 Software Design & Implementation

Class (computer programming)

References

Recursion (computer science)

List (abstract data type)

SLLists

Nested Classes

Array (data structure)

Array Resizing

Inheritance (object-oriented programming)

Extends

Higher-order function (HOF)

Object Methods

Disjoint Sets

Set (abstract data type)

Binary Search Tree (BST)

Red Black Trees

Tree traversal

Multi-Dimensional Data

Prefix Operations and Tries

Reductions and Decomposition

Quick Sort

Algorithmic Bounds

Data structure

Scope

Linked list

Shortest paths

Heap (data structure)

Kolmogorov complexity

Sentinel Nodes

DLLists

ALists

SLists

Implements

Casting

Subtype Polymorphism

Iterators

Asymptotics

Map (higher-order function)

B-tree

Priority queue (PQ)

Graph traversal

Range Searching

Sorting algorithm

Radix Sorts

Compression

P=NP

Static

Minimum Spanning Tree (MST)

CS 61B: Data Structures UC Berkeley Fall 2022 CS 61B focuses on software efficiency from design and runtime perspectives. It covers object-oriented programming with Java, teaching data structures and various programming concepts. The course promotes hands-on learning with optional assignments. The CS 61 series is an introduction to Computer Science, with particular emphasis on software and machines from a programmer’s point of view. CS 61A covered high-level approaches to problem-solving, providing you with a variety of ways to organize solutions to programming problems as compositions of functions, collections of objects, or sets of rules. In CS 61B, we move to a somewhat more detailed (and to some extent, more basic) level of programming by focusing particularly on the efficiency of writing programs (design) and running programs (runtime).  This class assumes you have taken CS 61A, CS 88, or E 7, or have equivalent background to a student who has taken one of these courses. The course is largely built upon the assumption that you have taken CS 61A. CS 88 and E7 students may find the beginning of the course to be a bit scarier, particularly when it comes to object oriented programming. We assume you are coming in with zero Java experience, but we will move through basic Java syntax very quickly.

We recommend all students to complete the [optional introductory assignment](https://fa22.datastructur.es/materials/hw/hw0/) by the beginning of the semester to get comfortable with Java and practice some of the programming skills expected by this class.

If you already have Java experience, great! We hope that you’ll help out your fellow students in discussion, lab, and on our class forum, particularly in the opening weeks when everyone is catching up on Java. **There is no required textbook for the class.**

There is an online textbook written by myself and a large team of former TAs. It can be found at https://joshhug.gitbooks.io/hug61b. If you find these notes insufficient, you might consider consulting [Paul Hilfinger’s (free) Java Reference](http://www-inst.eecs.berkeley.edu/~cs61b/fa14/book1/java.pdf) or [Head First Java, 2nd Edition by Sierra and Bates (O’Reilly, 2005)](https://www.google.com/search?q=head+first+java). These are not required for the course. The **optional** textbook for the weeks 5-14 of the course is Algorithms, 4th Edition by Wayne and Sedgewick.

The official description of the Java core language is available online in [The Java Language Specification](https://docs.oracle.com/javase/specs/jls/se17/html/index.html) (Java SE 17 Edition) by James Gosling, Bill Joy, Guy Steele, Gilad Bracha, Alex Buckley, Daniel Smith, and Gavin Bierman. It’s extremely thorough and precise, at the expense of being quite dense and technical. You will find the official [Java 17 documentation](ttps://docs.oracle.com/en/java/javase/17/docs/api/index.html) to be useful as well

CS 61B: Data Structures

Data Structures and Algorithms

Rust

C Programming

Function (computer programming)

Pointer (computer programming)

Computer memory

Modules

Compilation

Makefiles

File I/O

Buffering

POSIX I/O

System Calls

Directories

C++ Programming

Introduction

Const

Constructors

new/delete

Smart pointer

Client-side Networking

HTTP

Templates

Networks

Server-side Networking

Standard Template Library (STL)

vtables

IP (Internet Protocol)

DNS (Domain Name System)

CSE 333 Systems Programming University of Washington Summer 2022 This course provides an understanding of systems in computing, focusing on operating systems, networking, and C/C++ languages. Students learn about low-level data representation, memory management, system interactions, and efficient programming workflows. It delves into C++ idioms, network protocols, and concurrency. Prior knowledge of C programming and Linux tools is required. Systems Programming is the exploration of the composition and interface of systems in computing looking through the lens of operating systems, networking, and C/C++ languages. Through peeling levels of abstraction, students will view practices of low-level data representation (e.g. C, C++); explicit memory management; interacting with operating-system services; and cache-aware programming. Course Learning objectives are the goals that are set out for you to accomplish in this course:

- Understand system theory of how a system interacts with its environment and controlling its input and output (feedback loops, input and output, deterioration, computation)
- Unravel layers of abstraction found within systems
- Describe multiple systems throughout the computing space (e.g. HTTP, Operating Systems, Threading, and Makefiles)
- Interpret and build an efficient workflow for programming in larger sized code bases
- Debug substantial C/C++ programs using debugging tools (GDB and Valgrind) - [CSE351 (The Hardware/Software Interface)](http://www.cs.washington.edu/education/courses/cse351): CSE 351 provides students with rudimentary knowledge of C programming; the ability to write, run, and debug programs; familiarity with Linux and the use of Linux compilation, editing, and debugging tools; a solid mental model of the relationship between high-level code (C) and assembly-level compiled code.
- [CSE 143 (Intro Programming II)](http://www.cs.washington.edu/education/courses/cse143): CSE 143 is not a direct prerequisite (CSE 351 prerequisite), but some of its topics are beneficial to review for CSE 333. This includes classes, inheritance, good style practices, and simple data structures such as linked lists, trees, hash tables, and queues. Further knowledge of Java and these data structures is not required, but could be helpful! ### Textbooks

There are no strictly required texts for this course. Most people will find it useful to have both a C and a C++ reference; suggestions are given below. The C++ Primer is strongly recommended as C++ is a big, complex language and it is hard to understand how it all fits together from just Google and Stack Overflow snippets and folklore.

#### Strongly Recommended:

C++ Primer (5th Edition), Lippman, Lajoie & Moo. ISBN 0-321-71411-3.

#### Suggested:

- [*C Programming Language (2nd Edition)*](http://www.amazon.com/Programming-Language-2nd-Brian-Kernighan/dp/0131103628/), Kernighan & Ritchie. ISBN 0-13-110362-8.
    - The definitive book on C from the people who created it. You will want to use an online reference for information about the latest libraries, but every serious programmer should study this book.
- [*Computer Systems: A Programmer's Perspective (3rd Edition)*](http://csapp.cs.cmu.edu/3e/home.html), Bryant & O'Hallaron, ISBN 0-13-409266-X.
    - Useful review of CSE 351 and background for many additional topics covered more extensively in CSE333.
- [*Effective C++: 55 Specific Ways to Improve Your Programs and Designs (3rd Edition)*](http://www.amazon.com/Effective-Specific-Improve-Programs-Designs/dp/tags-on-product/0321334876), Scott Meyers. ISBN 0321334879.
- [*Effective Modern C++: 42 Specific Ways to Improve Your Use of C++11 and C++14*](http://www.amazon.com/Effective-Modern-Specific-Ways-Improve/dp/1491903996), Scott Meyers. ISBN 1491903996.


### Proposed Topic List

- C Programming and idioms (Memory Management, cstdio, error handling, and structs)
- System Management Tools (Makefiles, Header Guards, GDB, and Valgrind)
- System Interfacing with Operating Systems (POSIX)
- C++ Programming and idioms (namespaces, templates, STL, smart pointers)
- C++ Classes and Inheritance (Classes, operator overloading, OOP)
- Network Programming and Protocols (POSIX, HTTP)
- Concurrency (pthreads)

CSE 333 Systems Programming

Operating Systems

Tkinter

Python

Arithmetic Expressions

Variable (computer science)

String (computer science)

Boolean

Tuple

Array slicing

Control flow

For loop

Dictionary (data structure)

Modular programming

File system

Object-Oriented Programming (OOP)

While loop

API (Application Programming Interface)

Web API

Lambda

Filter (higher-order function)

Event loop

Graphical User Interface (GUI)

CICS 110: Foundations of Programming  The University of Massachusetts Amherst Spring 2023 This course introduces computer programming and problem-solving. Students learn using a modern language, covering variables, data types, branching, functions, classes, and methods. Emphasis is on real-world problem translation, computational understanding, and debugging. An introduction to computer programming and problem solving using computers. This course teaches you how real-world problems can be solved computationally using programming constructs and data abstractions of a modern programming language. Concepts and techniques covered include variables, expressions, data types, objects, branching, iteration, functions, classes, and methods. We will also cover how to translate problems into a sequence of instructions, investigate the fundamental operation of a computational system and trace program execution and memory, and learn how to test and debug programs. No previous programming experience required. The objective of this course is to introduce the fundamentals of computing and programming using a general-purpose programming language from a modern perspective. This includes understanding the operation of a machine from a programming language perspective and what it means to execute a whole program as well as its individual parts, how to solve problems using constructs that a programming language provides such as variables, data types, objects, branching, iteration, functions, and classes, and how to write programs that receive data from various sources, process that data, and produce output in various forms.

## Learning Outcomes

At the completion of this course you will be able to:

- Read and write programs to solve non-trivial programs using the Python programming language.
- Describe fundamental units of computation and program structure.
- Translate real-world problems into computational solutions.
- Solve problems using a general-purpose programming language and the tools it provides such as variables, data types, objects, branching, iteration, functions/methods, and classes.
- Design and implement whole programs and functions to solve computational problems using top-down and bottom-up techniques.
- Describe application programming interfaces (API) and use APIs available from existing objects and libraries to solve problems.
- Translate data from and into various formats that are in computer memory, a graphical interface, a file, from a remote API on the web, or other data resources.
- Use console-based or graphical interfaces to learn about input/output to move data into and out of a program.
- Use modules and classes to organize data and functions.
- Explain the notion of a machine and how it relates to the execution of a general-purpose programming language.
- Explain how programs and their data are represented in a computer and build mental models and use diagrams of program and function execution and data stored in memory.
- Use basic debugging techniques such as “print debugging” and assert statements to determine the cause of logical programming errors and show the correctness of a program and its implementation.
- Describe programs using proper documentation techniques to communicate implementation details at various levels of granularity. R1 (or a score of 20 or higher on the math placement test Part A), or one of the following courses: MATH 101&102 or MATH 104 or MATH 127 or MATH 128 or MATH 131 or MATH 132. ## Textbook

The following textbook is required:

- Programming in Python 3, an interactive textbook from [zyBooks](https://learn.zybooks.com/) designed specifically for this course.

The information you need to subscribe to this book can be found on the course LMS (e.g., Moodle).

Here are some additional textbook recommendations freely available online. You may consider looking at these as supplemental material:

- Automate the Boring Stuff with Python, Al Sweigert, https://automatetheboringstuff.com
- A Byte of Python, https://www.gitbook.com/book/swaroopch/byte-of-python/details
- Dive into Python, Mark Pilgrim, http://getpython3.com/diveintopython3
- Learn python the hard way, Zed Shaw, http://learnpythonthehardway.org/book
- Python Practice Book, Anad Chitpothu, http://anandology.com/python-practice-book

CICS 110: Foundations of Programming 