Scope

JavaScript

Function Implementation

Type Classes

Inheritance (object-oriented programming)

IO Monad

Storage Management

type Inference

Subtyping

Continuations

Lambda Calculus

Haskell

Object (computer science)

Control flow

Type Polymorphism

Exception handling

vtables

CSE 130: Programming Languages: Principles and Paradigms UC San Diego Winter 2017 UC San Diego's CSE 130 provides an overview of basic concepts and design trade-offs related to programming languages. The course covers a wide range of topics like scope, storage management, exceptions, and concurrency, through practical implementation. This course will cover basic concepts and design trade-offs related to programming languages. The first half of the course focuses on functions, types, scope, storage management, exceptions, and continuations. The second half covers object-oriented features and concurrency. We will conclude with a few special-topics in programming languages. The class also has a number of small labs where students get to implement some of the language features discussed in class. The course consists of lectures, written homeworks, and programming assignments. The goal of the course is to (1) familiarize you with various modern programming language concepts and paradigms and (2) get you to think about and understand the design trade-offs and implementations of different language features. We will use real-world languages (e.g., JavaScript, Haskell, and C++) to explore the different concepts. But, we will not cover any one language in full – this course is not meant to make you a proficient programmer, learning how to proficiently program in any of these languages is a course in of itself.  We will be following John Mitchell’s [Concepts In Programming Languages](https://books.google.com/books?id=AUUgAwAAQBAJ) textbook and assigning reading from this book and various other online resources and papers. Some of the book chapters have been revised, we will be handing out PDFs of these chapters. Cheaper renting options for the book seem to be available online (e.g., on [Amazon](https://www.amazon.com/Concepts-Programming-Languages-John-Mitchell-ebook/dp/B00AHTN2TA/ref=mt_kindle?_encoding=UTF8&me=)).

If you are serious about programming languages Benjamin Pierce’s [Types and Programming Languages](https://www.cis.upenn.edu/~bcpierce/tapl/) is a must.

CSE 130: Programming Languages: Principles and Paradigms

Programming Languages

Java (programming language)

Class (computer programming)

Software testing

References

Recursion (computer science)

List (abstract data type)

SLLists

Nested Classes

Debugging

Array (data structure)

Array Resizing

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

Linked list

Shortest paths

Heap (data structure)

Kolmogorov complexity

Sentinel Nodes

DLLists

ALists

SLists

Implements

Casting

Subtype Polymorphism

Iterators

Asymptotics

Abstract Data Type (ADT)

Map (higher-order function)

B-tree

Hashing

Priority queue (PQ)

Graph traversal

Range Searching

Software Engineering

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

Functional Decomposition

Control Structures

Data Abstraction

Documentation and Readability

Static methods

Types

`print` statements

Scanners

Conditional (computer programming)

While loop

Object-Oriented Programming (OOP)

ArrayList

Java

Expressions

Parameters

`Math` class

Information flow

Pseudorandomness

Line-based file input

reference semantics

Constructors

Polymorphism (computer science)

Escape sequences

`for` loops

Class constants

Return values

Chaining

Sentinel loops

Token-based file input

Array Traversals

Fields

`println`

Variable (computer_science)

Nested `for` loops

String (computer science)

Cumulative algorithm

Fencepost problems

Boolean

File output

Array Shifting

Instance Methods

Critters

CSE 142 Computer Programming I University of Washington Summer 2022 This introductory course teaches programming using Java. Students learn computational problem-solving techniques, functional decomposition, control structures, data abstraction, and code documentation. No prior programming experience is required. This course provides an introduction to programming using the Java programming language. We will explore common computational problem-solving techniques useful to computer scientists, but also to anyone who has large data sets, repetitive processes or other needs for computation. No prior programming experience is assumed, although students should know the basics of using a computer (e.g., using a web browser and a text editor) and should be comfortable with math through Algebra 1. Students with significant prior programming experience should consider skipping CSE 142 and taking [CSE 143](https://cs.washington.edu/143). CSE 142 is organized around five key learning objectives. At the end of the course, students will be able to do the following:

1. Functionality/Behavior: Write functionally correct Java programs that meet a provided specification and/or solve a specified problem
1. Functional Decomposition: Break down problems into subproblems that are modular and reusable, and define methods to represent those subproblems
1. Control Structures: Select and apply control structures (e.g. methods, loops, conditionals) to manage the flow of control and information in programs
1. Data Abstraction: Select and apply basic data abstractions (e.g. variables, parameters, arrays, classes) to manage and manipulate data in programs
1. Documentation and Readability: Define programs that are well-written, readable, maintainable, and conform to established standards  Recommended textbook: [*Building Java Programs* by Reges and Stepp (5th edition)](https://courses.cs.washington.edu/courses/cse142/22su/textbook.html)

CSE 142 Computer Programming I

Computer Programming

Scope

3 courses cover this concept

CSE 130: Programming Languages: Principles and Paradigms

CS 61B: Data Structures

CSE 142 Computer Programming I