No label defined (Q4459313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2062426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2062426 |
Statements
28 March 2004
0 references
C programming
0 references
C language syntax
0 references
data structures
0 references
implementation
0 references
complexity
0 references
The book covers both an introduction to C programming as well as the implementation (in C, of course) of various data structures, including some advanced problems in data structures. To accomplish these goals the book is divided into three separate parts. Part I is devoted entirely to the C language. It starts with a basic introduction to the C language where, in a series of examples, variables, input of the data and basic control structures are gradually introduced. Then separate chapters are devoted to introduction and explanation of data types, C operators, control structures, the \textit{printf} and \textit{scanf} functions, addresses and pointers, arrays, functions, strings, structures and unions. Included are also separate chapters on preprocessing, storage of variables, memory allocation, recursion, and files. Part II deals with data structures. It starts with arrays, sorting and searching, including a section on hashing. Then chapters devoted to stacks and queues, linked lists, and trees follow. This part ends with a chapter on graphs, where besides graph representations and traversals also spanning trees and directed acyclic graphs are covered. ``Advanced problems in data structures'' is the title of the third part of the book. Here collections of more advanced problems are introduced and their solution given. Separate chapters are devoted to problems in arrays, searching, sorting and hashing, as well as problems in linked lists, strings, trees, and graphs. The last chapter presents a collection of miscellaneous problems, like printing all combinations of a string or solving the \(N\)-queens problem. All the chapters follow a unified style of exposition -- brief introduction, program/examples, and an explanation, followed whenever appropriate, by points to remember. Included is also a CD-ROM with all the source codes appearing in the book.
0 references