Programs and Data Structures in C : Based on ANSI C and C++ (Wiley Professional Computing) (2 SUB)

Programs and Data Structures in C : Based on ANSI C and C++ (Wiley Professional Computing) (2 SUB)

  • ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 272 p.
  • 言語 ENG,ENG
  • 商品コード 9780471931232
  • DDC分類 005.133

Full Description


Programs and Data Structures in C Based on ANSI C and C++ Second Edition Leendert Ammeraal Hogeschool Utrecht, The Netherlands Reviews of the first edition: Because this book explains a lot of simple tricks and useful techniques to speed up common programming tasks it is a useful addition to conventional textbooks dealing with more theoretical aspects of programming.' Journal of New Generation Computer Systems The book is especially suitable for advanced programmers who need searching and sorting methods. But it is also a help for the newcomer.' Journal of Information Processing & Cybernetics This book is designed to help you develop and reinforce your programming skills either for self-study or alongside a course text. All programs and exercises conform to the new ANSI C Standard, are accessible for those using either a C or C++ compiler, and are machine independent. The author shows how to use advanced programming techniques, including dynamic data structures, and the emphasis throughout is on how to achieve correctness and efficiency. There is a particular focus on the storage and retrieval of large amounts of data using data structures such as AVL trees and B-trees. Other useful algorithms discussed include those for the generation of permutations, dynamic programming, the criticalpath method, and the evaluation of arithmetic expressions. For the experienced programmer converting to C (or C++), or the beginning student, the wealth of programs, exercises and hints provided here will help increase your programming speed and efficiency.

Table of Contents

  Programming Style, Iteration and Recursion.
Array and File Manipulation.
Some Combinatorial Algorithms.
Linked Lists.
Binary Trees.
B-Trees.
Tries.
Graphs.
Fundamentals of Interpreters and Compilers.
Appendices.
Bibliography.
Index.