Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×

1 Variables, expressions, assignments
1.1 Problems without arrays
1.2 Arrays
2 Generation of combinatorial objects
2.1 Sequences
2.2 Permutations
2.3 Subsets
2.4 Partitions
2.5 Gray codes and similar problems
2.6 Some remarks
2.7 Counting
3.1 Queens not attacking each other: position tree traversal
3.2 Backtracking in other problems
4 Sorting
4.2 Sorting in n log n operations
4.3 Applications of sorting
4.4 Lower bound for the number of comparisons
4.5 Problems related to sorting
5 Finite-state algorithms in text processing
5.2 Numbers input
6.4 Priority queues
7 Recursion
7.1 Examples
7.2 Trees: recursive processing
7.3 The generation of combinatorial objects; search
7.4 Other applications of recursion
8.1 Table of values (dynamic programming)
8.3 Difficult cases
9 Graph algorithms
9.1 Shortest paths
9.2 Connected components, breadth and depth search
10.2 Repetitions in the pattern
10.3 Auxiliary lemmas
10.4 Knuth-Morris-Pratt algorithm
10.5 Boyer-Moore algorithm
10.6 Rabin-Karp algorithm
10.7 Automata and more complicated patterns
11 Set representation. Hashing
11.2 Hashing using lists
12 Sets, trees, and balanced trees
12.1 Set representation using trees
12.2 Balanced trees
13 Context-free grammars
13.1 General parsing algorithm
13.2 Recursive-descent parsing
13.3 Parsing algorithm for LL(1)-grammars
14 Left-to-right parsing (LR)
14.1 LR-processes
14.2 LR(0)-grammars
14.3 SLR(1)-grammars
14.4 LR(1)-grammars, LALR(1)-grammars
14.5 General remarks about parsing algorithms
0 of .
Results for:
P. 1
Algorithms and Programming

# Algorithms and Programming

Ratings: 0|Views: 1,935|Likes:

### Availability:

See More
See less

07/14/2013

pdf

text

original

Pages 4 to 126 are not shown in this preview.
Pages 130 to 230 are not shown in this preview.

## Activity (26)

### Showing

AllMost RecentReviewsAll NotesLikes