Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

1.2 The structure of a C++ program 5
1.3 Variables, values, and types
1.4 Expressions
1.5 Statements
1.6 Functions
2.1 Enumeration types
2.2 Data and memory
2.3 Pointers
2.4 Arrays
2.5 Pointers and arrays
2.6 Records
2.7 Dynamic allocation
3.1 The concept of an interface
3.2 A random number interface
3.3 Strings
3.4 Standard I/O and file streams
3.5 Other ANSI libraries
4.1 The Vector class
4.2 The Grid class
4.3 The Stack class
4.4 The Queue class
4.5 The Map class
4.6 The Lexicon class
4.8 Iterators
5.1 A simple example of recursion
5.2 The factorial function
5.3 The Fibonacci function
5.4 Other examples of recursion
5.5 Thinking recursively
6.1 The Tower of Hanoi
6.2 Generating permutations
6.3 Graphical applications of recursion
7.2 Backtracking and games
8.1 The sorting problem
8.2 Computational complexity and big-O notation
8.3 Recursion to the rescue
8.4 Standard complexity classes
8.5 The Quicksort algorithm
8.6 Mathematical induction
9.1 A simple example of a class definition
9.2 Implementing a specialized version of the Stack class
9.3 Implementing the Scanner class
10.1 The concept of an editor buffer
10.2 Defining the buffer abstraction
10.3 Implementing the editor using arrays
10.4 Implementing the editor using stacks
10.5 Implementing the editor using linked lists
11.1 Reimplementing stacks as a template class
11.2 Reimplementing stacks using linked lists
11.3 Implementing queues
11.4 Implementing vectors
12.1 An array-based implementation of the map interface
12.2 The advantage of knowing where to look
12.3 Hashing
12.4 Functions as data
12.5 Mapping functions
13.1 Family trees
13.2 Binary search trees
13.3 Balanced trees
13.4 Defining a general interface for binary search trees
14.1 Overview of the interpreter
14.4 Defining an inheritance hierarchy for expressions
14.5 Implementing the expression subclasses
14.6 Parsing an expression
15.1 Sets as a mathematical abstraction
15.2 Designing a set interface
15.3 Implementing the set class
15.4 Enhancing the efficiency of integer sets
16.1 The structure of a graph
16.2 Implementation strategies for graphs
16.3 Designing a low-level graph abstraction
16.4 Graph traversals
16.5 Defining a Graph class
16.6 Finding minimum paths
16.7 An efficient implementation of priority queues
0 of .
Results for:
No results containing your search query
P. 1
CS106BX Reader

CS106BX Reader

Ratings: (0)|Views: 13|Likes:
Published by bucwet

More info:

Published by: bucwet on Sep 12, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 14 to 159 are not shown in this preview.
You're Reading a Free Preview
Pages 173 to 242 are not shown in this preview.
You're Reading a Free Preview
Pages 256 to 412 are not shown in this preview.
You're Reading a Free Preview
Pages 426 to 512 are not shown in this preview.
You're Reading a Free Preview
Pages 526 to 682 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->