Wallace Wang - Beginning Programming All-in-One For Dummies

16 Book 3 Chapter 3FIGURE 3-1: Collections expand automatically each time you store new data.FIGURE 3-2: You can insert data before a specific location in an array.FIGURE 3-3: You can insert new data after an existing location in a collection.FIGURE 3-4: When you remove data from a collection, the collection renumbers th...FIGURE 3-5: Identify data by its location or by a key.FIGURE 3-6: Retrieving data by index numbers is unreliable because they can cha...FIGURE 3-7: Hash tables make searching faster by dividing data into distinct se...FIGURE 3-8: Hash tables convert each key into a numeric value.FIGURE 3-9: Chaining lets a single hash value point to a list of multiple items...FIGURE 3-10: Double hashing creates miniature hash tables within a larger hash ...

17 Book 3 Chapter 4FIGURE 4-1: Stacks store the oldest data on the bottom and the newest data on t...FIGURE 4-2: When you add data to a stack, the oldest data keeps getting pushed ...FIGURE 4-3: The Peek command retrieves data, but the Popcommand retrieves and ...FIGURE 4-4: The Undocommand offered in most programs can be easily implemented...FIGURE 4-5: The queue data structure mimics a line of people.FIGURE 4-6: The oldest data appears at the front while the newest data appears ...FIGURE 4-7: The Peekcommand retrieves data, but the Dequeuecommand retrieves ...FIGURE 4-8: A deque acts like a two-way queue.FIGURE 4-9: Each node in a deque contains two pointers that point to the next a...FIGURE 4-10: Two ways to implement a deque as a linked list.FIGURE 4-11: A deque can grow in two different directions.FIGURE 4-12: A deque could be used by an antivirus program to scan messages.

18 Book 3 Chapter 5FIGURE 5-1: Modeling a map of different cities.FIGURE 5-2: A graph data structure can model the mapping problem better than an...FIGURE 5-3: The three types of graphs.FIGURE 5-4: The Seven Bridges of Königsberg represented as a graph.FIGURE 5-5: A tree is a hierarchical graph.FIGURE 5-6: A tree consists of one root node and multiple leaf and internal nod...FIGURE 5-7: A tree can organize names alphabetically by last name.FIGURE 5-8: An ordered binary tree stores and sorts data by value.FIGURE 5-9: An ordinary tree is more difficult to search than an ordered binary...FIGURE 5-10: In a B-tree, all leaf nodes appear at the same level.FIGURE 5-11: The four different ways to traverse a tree.FIGURE 5-12: Inserting new data in an ordered binary tree.FIGURE 5-13: After deleting data from a tree, you may need to rearrange the rem...FIGURE 5-14: Pruning a tree removes two or more nodes from a tree.FIGURE 5-15: Grafting a sub-tree can require rearranging the entire modified tr...FIGURE 5-16: A tree can help a computer plan its next move.

19 Book 4 Chapter 1FIGURE 1-1: A bubble sort repetitively compares two adjacent items.FIGURE 1-2: The bubble sort algorithm examines the entire list of data several ...FIGURE 1-3: Selection sort repetitively moves the smallest value to the front o...FIGURE 1-4: Insertion sort only examines a list once to sort it.FIGURE 1-5: Shell sort performs multiple insertion sorts on parts of a long lis...FIGURE 1-6: Valid and invalid heap binary trees.FIGURE 1-7: Heap sort uses a tree data structure to sort and store items tempor...FIGURE 1-8: An array can mimic a heap data structure.FIGURE 1-9: Manipulating data in an array that mimics a heap.FIGURE 1-10: Merge sort breaks a long list into several smaller lists and then ...FIGURE 1-11: Quick sort repetitively divides a large list into two smaller list...

20 Book 4 Chapter 2FIGURE 2-1: The speed of sequential search depends directly on the size of the ...FIGURE 2-2: Sequential search can be made faster by searching from either the f...FIGURE 2-3: Block searching can speed up a sequential search on sorted data.FIGURE 2-4: Binary searching divides a list in half until it eventually finds i...FIGURE 2-5: Interpolation searching tries to jump straight to the approximate l...FIGURE 2-6: Fibonacci numbers divide and search a list more efficiently than a ...FIGURE 2-7: Comparison of hash tables and indexes.FIGURE 2-8: Clustered indexes physically rearrange data, whereas unclustered in...FIGURE 2-9: A tree can analyze the best possible move.FIGURE 2-10: Assigning values to possible moves helps the computer evaluate the...

21 Book 4 Chapter 3FIGURE 3-1: Sequential search examines every character.FIGURE 3-2: The Boyer–Moore algorithm skips over partially matched characters.FIGURE 3-3: The Rabin–Karp algorithm searches for hash values.FIGURE 3-4: The Shift Or algorithm creates an array of matching characters.FIGURE 3-5: The Shift Or algorithm creates a two-dimensional array.FIGURE 3-6: A finite state machine consists of nodes and arrows.

22 Book 4 Chapter 4FIGURE 4-1: Reconstructing the original data from the BWT transformation.FIGURE 4-2: Uncompressing data requires using a dictionary to replace codes wit...FIGURE 4-3: The LZ77 algorithm replaces redundant data with pointers.FIGURE 4-4: The LZW algorithm stores increasingly larger strings as numbers.FIGURE 4-5: Comparison of compressed graphic images.

23 Book 4 Chapter 5FIGURE 5-1: How a stream cipher works.FIGURE 5-2: The electronic codebook encrypts blocks of data separately with the...FIGURE 5-3: Cipher-block chaining uses the output from one block as the input f...FIGURE 5-4: A single password can encrypt and decrypt a message.FIGURE 5-5: Public keys encrypt data, and private keys decrypt data.FIGURE 5-6: Public-key and private-key encryption can work together.

24 Book 5 Chapter 1FIGURE 1-1: HTML can create six different headings.FIGURE 1-2: You can specify text to appear center- or right-aligned.FIGURE 1-3: The

Whether you learn about programming using a simpler language or jump right in and start with C, you'll eventually need to learn one of the more popular programming languages based on C. This family of related languages is known as the curly-bracket language family.

The curly-bracket language family gets its name because all the languages use curly brackets to define the start and end of a block of commands, like this:

#include void main(){ printf("Notice how the curly brackets\n"); printf("identify the beginning and end\n"); printf("of your commands?\n");}

Rather than use curly brackets, programming languages like Ada or Pascal use descriptive words, like Beginor End, to identify the start and end of a block of code. Descriptive words look clearer but can be more cumbersome to type. To eliminate curly brackets or descriptive words like Beginor End, Python uses indentation to define the beginning and end of a block of code.

The most popular curly-bracket language is C. The C language is popular for several reasons:

Power

Efficiency

Portability

The C language is a curious combination of assembly language and high-level languages, like BASIC. Like assembly language, C provides commands for directly manipulating every part of the computer, including memory, hard disks, and printers. Like a high-level language, C lets you focus on the logic of your program without worrying about the technical details of the computer, so you get the best of both assembly language and high-level languages.