Get 2 days of unlimited access
at Virginia Polytechnic Institute and State University

Textbook Notes for Computer Science at Virginia Polytechnic Institute and State University (VT)


VIRGINIA TECHCS 1114M S IrwinFall

CS 1114 Chapter 4: CS-1114 - Notes - Reading 4

OC23441221 Page
0
Abstraction is the ability to ignore details of parts, to focus attention on a higher level of a problem. This is also commonly referred to as divide a
View Document
VIRGINIA TECHCS 1114M S IrwinFall

CS 1114 Chapter Notes - Chapter Online Book: Top-Down And Bottom-Up Design, Postcondition

OC23441221 Page
0
Algorithms are plans for solving a given problem: obtain a description of the problem. Be a developer one who finds a way to solve a problem: analyze t
View Document
VIRGINIA TECHCS 1114M S IrwinFall

CS 1114 Chapter 1: CS-1114 - Notes - Reading 1

OC23441221 Page
0
A class describes all objects of a given classification, while objects are usually an instance the two words are often used interchangeably. Classes wi
View Document
VIRGINIA TECHCS 1114M S IrwinFall

CS 1114 Chapter Notes - Chapter 10: Duplicate Code, Mutator Method, Loose Coupling

OC23441223 Page
0
Observe ~ there are two terms that are central to describing the quality of a class design: coupling and cohesion. The degree of coupling indicates how
View Document
VIRGINIA TECHCS 2114M O EllisSpring

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

OC23441229 Page
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
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 1114M S IrwinFall

CS 1114 Chapter Notes - Chapter 7: Pseudocode

OC23441224 Page
0
Recall ~ java is an imperative object-oriented language. Functional languages are another class of language that use a different style of programming.
View Document
VIRGINIA TECHCS 2114M O EllisSpring

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

OC23441227 Page
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 18 (Searching): Boolean Algebra, Linear Search, Binary Search Algorithm

OC23441224 Page
0
View Document
VIRGINIA TECHCS 2114M O EllisSpring

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

OC23441228 Page
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
0
View Document
VIRGINIA TECHCS 1114M S IrwinFall

CS 1114 Chapter Notes - Chapter 9: Ternary Operation, Code Segment

OC23441222 Page
0
Recall ~ arraylists are not fixed in their capacity unlike arrays. Arrays are a collection type that can store a fixed number of items. Despite this re
View Document
Showing 1 — 12 of 33 result

Textbook Notes (270,000)
US (100,000)
CS (30)