Algorithms and Programming: Problems and Solutions
Each chapter is more or less independent, containing classical and well-known problems supplemented by clear and in-depth explanations. While program examples are written in Pascal, any other procedural language (e.g., Modula, Oberon, C) may be used instead. Problems at all different levels progress in difficulty. Some problems are somewhat loosely connected to one another, and others are devoted to one specific algorithm (e.g., section on LR-parsing). The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Generation of combinatorial objects
Tree traversal backtracking
12 other sections not shown
Other editions - View all
algorithm array aſil Assume binary Boolean called character compute consider contains context-free grammar correct corresponding delete denoted depth-first search deque diff digits directed graph empty string end else begin equal example exceed finite automaton function graph hash heapsort height Hint inductive initial input string integer invariant relation left subtree LR-process maximal prefix minimal element move nondeterministic finite automaton nonempty nonnegative integers nonrecursive null number of elements number of operations number of vertices outgoing edges pair path pattern permutation polygon polynomial possible preceding problem procedure ReadK processed production rule Prove queue ReadL regular expression replaced requirement right subtree rightmost derivation segment Solution sorted stack State(S string is derivable string of terminals subset substring subtree rooted suffix symbol T-tree terminals and nonterminals topological sorting total number tree traversal variable vertex Write a program writeln