Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
4Activity
0 of .
Results for:
No results containing your search query
P. 1
Foundations of Computer Science

Foundations of Computer Science

Ratings: (0)|Views: 54|Likes:
Published by Jeff Pratt
Al Aho's and Jeff Ullman's introductory text to computer science. C edition.
Al Aho's and Jeff Ullman's introductory text to computer science. C edition.

More info:

Published by: Jeff Pratt on Jun 24, 2013
Copyright:Attribution Non-commercial

Availability:

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

07/24/2013

pdf

text

original

 
TABLE OF CONTENTS
v
33 33
Table of Contents 
Preface
ix
Chapter 1. Computer Science: The Mechanization of Abstraction 11.1. What This Book Is About 31.2. What This Chapter Is About 61.3. Data Models 61.4. The C Data Model 131.5. Algorithms and the Design of Programs 201.6. Some C Conventions Used Throughout the Book 221.7. Summary of Chapter 1 231.8. Bibliographic Notes for Chapter 1 24Chapter 2. Iteration, Induction, and Recursion 252.1. What This Chapter Is About 272.2. Iteration 272.3. Inductive Proofs 342.4. Complete Induction 442.5. Proving Properties of Programs 522.6. Recursive Definitions 592.7. Recursive Functions 692.8. Merge Sort: A Recursive Sorting Algorithm 752.9. Proving Properties of Recursive Programs 842.10. Summary of Chapter 2 872.11. Bibliographic Notes for Chapter 2 88Chapter 3. The Running Time of Programs 893.1. What This Chapter Is About 893.2. Choosing an Algorithm 903.3. Measuring Running Time 913.4. Big-Oh and Approximate Running Time 963.5. Simplifying Big-Oh Expressions 1013.6. Analyzing the Running Time of a Program 1093.7. A Recursive Rule for Bounding Running Time 1163.8. Analyzing Programs with Function Calls 1273.9. Analyzing Recursive Functions 1323.10. Analysis of Merge Sort 1363.11. Solving Recurrence Relations 1443.12. Summary of Chapter 3 1543.13. Bibliographic Notes for Chapter 3 155Chapter 4. Combinatorics and Probability 1564.1. What This Chapter Is About 1564.2. Counting Assignments 1574.3. Counting Permutations 1604.4. Ordered Selections 167
 
vi
TABLE OF CONTENTS
4.5. Unordered Selections 1704.6. Orderings With Identical Items 1784.7. Distribution of Objects to Bins 1814.8. Combining Counting Rules 1844.9. Introduction to Probability Theory 1874.10. Conditional Probability 1934.11. Probabilistic Reasoning 2034.12. Expected Value Calculations 2124.13. Some Programming Applications of Probability 2154.14. Summary of Chapter 4 2204.15. Bibliographic Notes for Chapter 4 221Chapter 5. The Tree Data Model 2235.1. What This Chapter Is About 2235.2. Basic Terminology 2245.3. Data Structures for Trees 2315.4. Recursions on Trees 2395.5. Structural Induction 2485.6. Binary Trees 2535.7. Binary Search Trees 2585.8. Efficiency of Binary Search Tree Operations 2685.9. Priority Queues and Partially Ordered Trees 2715.10. Heapsort: Sorting with Balanced POTs 2805.11. Summary of Chapter 5 2845.12. Bibliographic Notes for Chapter 5 285Chapter 6. The List Data Model 2866.1. What This Chapter Is About 2866.2. Basic Terminology 2876.3. Operations on Lists 2916.4. The Linked-List Data Structure 2936.5. Array-Based Implementation of Lists 3016.6. Stacks 3066.7. Implementing Function Calls Using a Stack 3126.8. Queues 3186.9. Longest Common Subsequences 3216.10. Representing Character Strings 3276.11. Summary of Chapter 6 3346.12. Bibliographic Notes for Chapter 6 335Chapter 7. The Set Data Model 3377.1. What This Chapter Is About 3377.2. Basic Definitions 3387.3. Operations on Sets 3427.4. List Implementation of Sets 3517.5. Characteristic-Vector Implementation of Sets 3577.6. Hashing 3607.7. Relations and Functions 3667.8. Implementing Functions as Data 3737.9. Implementing Binary Relations 380
 
TABLE OF CONTENTS
vii7.10. Some Special Properties of Binary Relations 3867.11. Infinite Sets 3967.12. Summary of Chapter 7 4017.13. Bibliographic Notes for Chapter 7 402Chapter 8. The Relational Data Model 4038.1. What This Chapter Is About 4038.2. Relations 4048.3. Keys 4118.4. Primary Storage Structures for Relations 4148.5. Secondary Index Structures 4198.6. Navigation among Relations 4238.7. An Algebra of Relations 4288.8. Implementing Relational Algebra Operations 4368.9. Algebraic Laws for Relations 4408.10. Summary of Chapter 8 4498.11. Bibliographic Notes for Chapter 8 450Chapter 9. The Graph Data Model 4519.1. What This Chapter Is About 4519.2. Basic Concepts 4529.3. Implementation of Graphs 4599.4. Connected Components of an Undirected Graph 4669.5. Minimal Spanning Trees 4789.6. Depth-First Search 4849.7. Some Uses of Depth-First Search 4959.8. Dijkstra’s Algorithm for Finding Shortest Paths 5029.9. Floyd’s Algorithm for Shortest Paths 5139.10. An Introduction to Graph Theory 5219.11. Summary of Chapter 9 5269.12. Bibliographic Notes for Chapter 9 527Chapter 10. Patterns, Automata, and Regular Expressions 52910.1. What This Chapter Is About 53010.2. State Machines and Automata 53010.3. Deterministic and Nondeterministic Automata 53610.4. From Nondeterminism to Determinism 54710.5. Regular Expressions 55610.6. The UNIX Extensions to Regular Expressions 56410.7. Algebraic Laws for Regular Expressions 56810.8. From Regular Expressions to Automata 57110.9. From Automata to Regular Expressions 58210.10. Summary of Chapter 10 58810.11. Bibliographic Notes for Chapter 10 589Chapter 11. Recursive Description of Patterns 59111.1. What This Chapter Is About 59111.2. Context-Free Grammars 59211.3. Languages from Grammars 59911.4. Parse Trees 602

Activity (4)

You've already reviewed this. Edit your review.
1 hundred reads
srajkumarslv liked this
choiap liked this
bhn2you liked this