Data structures in C
著者
書誌事項
Data structures in C
(The PWS series in computer science)
PWS Pub. Co., c1995
- : acid-free paper
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and indexes
入力は遡及デ-タによる
内容説明・目次
内容説明
There are two overriding features of this text, the first being the use of the C programming language. C is rapidly becoming the vehicle of choice for teaching courses throughout the curriculum. Though cumbersome, C is widely used in industry, and encourages a smooth transition to C++ and object-oriented programming later in the curriculum. The other main feature of this text is the content. In particular, the authors include a graphics example (a fractal known as the von Koch snow flake) throughout several chapters. They also devote a chapter to data compression, a topic in computing that deals with ways in which data may be constructed to minimize the amount of space it occupies on a disk, transmission wire or other medium.
目次
- Program design with C
- Algorithm design
- Program correctness
- Complexity analysis
- Dynamic allocation
- Stacks and queues
- Recursion
- Binary trees
- Multiway trees
- Graphs
- Sorting
- Hashing
- Data compression
- Memory management.
「Nielsen BookData」 より