Exams are coming!
Get ready with premium notes and study guides!

Textbook Notes for Reges Stuart

  • 8 Results
  • About UW
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 12: Backtracking

OC13127121 Page
13 Nov 2016
4
A programming technique in which you describe actions to be repeated using a method that calls itself. Involves many cooperating entities, each of whic
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 13: Analysis Of Algorithms, Selection Sort, Insertion Sort

OC13127122 Page
13 Nov 2016
13
Complexity is a measure of the computing resources that we used by a piece of code, such as time, memory, or disk space. One way to measure a program"s
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter 15: Throwing Exceptions

OC13127121 Page
13 Nov 2016
4
Throw an exception in the event that the clients disobey the precondition. Have the option to include a string that will be displayed with the exceptio
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter 14: Stacks and Queues

OC13127122 Page
13 Nov 2016
8
Like a list, a stack or queue stores an ordered sequence of values. A minimal set of operations for such a structure would require at least: some way t
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 16: Multiple Inheritance

OC13127121 Page
13 Nov 2016
2
Interface: a type that consists of a set of method declarations; when classes promise to implement an interface, you can treat those classes similar in
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 11: Linked List, Sequential Access

OC13127122 Page
13 Nov 2016
8
Entities that store and manage data are called data structures. Data structures can be used to implement sophisticated data storage objects called coll
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 11: Hash Table, Binary Search Tree, Iterator

OC13127121 Page
13 Nov 2016
3
View Document
UWCSE 143Reges StuartWinter

CSE 143 Chapter Notes - Chapter 16: Local Variable

OC13127122 Page
13 Nov 2016
10
Linkedlists are composed of individual elements called nodes. A basic list of nodes is an object with two fields: one for storing a single item of data
View Document

Textbook Notes (280,000)
US (110,000)
UW (800)
CSE (10)
Reges Stuart (8)