# Textbook Notes for Novak Gordon

UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 10: Memory Address, Indium Phosphide, Software Engineering

OC10724395 Page
14 Dec 2016
0
With the collection of programs that we now have, solving a physics problem becomes easy: Make a list (set) of the variables in the problem (desired va
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 4: Binary Search Algorithm, Linked List, Lookup Table

OC10724393 Page
14 Dec 2016
0
We can make a sorting routine using merge. Divide and conquer is a technique for solving a large problem by breaking it into two smaller problems, unti
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 14: Linked List, Lookup Table, Global Variable

OC10724394 Page
15 Dec 2016
0
Microcontrollers are small computers that can easily be interfaced to real-world sensors and effectors. They are inexpensive and easy to program, makin
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 9: Hidden Surface Determination, Quadtree, Sparse Matrix

OC10724394 Page
14 Dec 2016
0
Quadtrees a and b can be efficiently intersected: If a = 0 or b = 0, the result is 0. If a = 1, the result is b. If b = 1, the result is a. Otherwise,
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter 8: CS Textbook CH 8

OC10724394 Page
14 Dec 2016
2
The mouse starts in an open position. The mouse has 4 possible moves at each point: w, n, e or s. We have to keep track of where the mouse has been, or
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 24: Integrated Development Environment, Xcode, Apple Developer

OC10724392 Page
16 Dec 2016
0
Swift is a coding language, developed by apple, that was debuted in 2014. This language was kept private until december 2015, when it became open sourc
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 2: Type Safety, Memory Address, Quicksort

OC10724395 Page
13 Dec 2016
1
We will assume that basic operations take constant time. Later, we will consider some exceptions to this assumption: Some library functions may take mo
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 3: Linked List, Doubly Linked List, Infinite Loop

OC10724394 Page
14 Dec 2016
0
Some guidelines for designing recursive functions: write a clear definition of what your function should do, including inputs, outputs, assumptions. Th
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 1: Mapreduce, Fibonacci Number, Apache Hadoop

OC10724396 Page
13 Dec 2016
0
Introduction: why we need clever data structures and algorithms. Representation: how data, pointers, and structures are represented in the computer. Pe
View Document
UT-AUSTINC S 314Novak GordonFall

## C S 314 Chapter Notes - Chapter 5: Abstract Data Type, Parsing, Linked List

OC10724393 Page
14 Dec 2016
0
An array is a contiguous group of elements, all of the same type, indexed by an integer. In a sense, the array is the most basic data structure, since
View Document

Textbook Notes (280,000)
US (110,000)
UT-Austin (1,000)
C S (10)
C S 314 (10)
Novak Gordon (10)