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

Textbook Notes for M O Ellis

VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Queue and Deque Implementations: Modular Arithmetic, Double-Ended Queue, Java Class Library

OC23441227 Page
29 Mar 2018
0
Add a tail reference, an external reference to the last node in the chain. Must be able to remove the entry at the front of the queue, so if it"s at th
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Iterators and List Iterators: Inner Class

OC23441229 Page
29 Mar 2018
0
Iterators are a program component that allows one to traverse a collection of data (i. e. a list). Iteration refers to one complete traversal where eac
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter 5: Operand, Subsequence, Java Class Library

OC23441224 Page
26 Feb 2018
0
The adt stack follows a last-in, first-out or lifo behavior such that all additions are added to the top. The top entry is always the newest item on th
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter 18 (Searching): Boolean Algebra, Linear Search, Binary Search Algorithm

OC23441224 Page
12 Apr 2018
0
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter List Implementation That Links Data: Precondition

OC23441228 Page
29 Mar 2018
0
Consequences of using linked implementation: (+) only used memory as needed for new entries; returns unneeded memory. (+) avoids moving data when addin
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter 6: CS-2114 - Notes - Reading 6 - Recursion

OC23441225 Page
26 Feb 2018
0
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter 3: Local Variable

OC23441224 Page
31 Jan 2018
0
3 a bag implementation that links data. Nodes are objects that are linked together to form a data structure. <accessor and mutator methods: getdata, se
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Cloning (Java Interlude): Object Copying, Cloning, Immutable Object

OC23441225 Page
29 Apr 2018
0
Since sharing an immutable object is safe, cloning it is usually unnecessary. The class object contains a protected method clone that returns a copy of
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Sorting: Selection Sort, Pseudocode, The Algorithm

OC23441224 Page
29 Mar 2018
0
Sorting arranges things into either ascending or descending order. Using the method compareto is very helpful (implement the interface. Sorting an arra
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter List Implementation Using Arrays: CS-2114 - Notes - Reading 8 - List Implementation Using Arrays

OC23441223 Page
29 Mar 2018
0
1 normally this class would be named arraylist, but since java already provides a class with that name, the textbook chose a different name to avoid co
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Inheritance and Lists: Linked Data

OC23441225 Page
29 Mar 2018
0
Recall ~ sortedlist and llist have a has-a relationship. Super t>> extends llist<t> implements sortedlistinterface<t> public void add(t newentry) { int
View Document
VIRGINIA TECHCS 2114M O EllisSpring

CS 2114 Chapter Notes - Chapter Lists: Java Class Library, Insertion Sort, Sydney Trains T Set

OC23441222 Page
29 Mar 2018
0
Provides a way to organize data a collection. Each item has a position may be important or may not. Adds a new entry to the end of the list. Adds a new
View Document

Textbook Notes (280,000)
US (110,000)
CS (30)
CS 2114 (20)
M O Ellis (20)