By reading this introduction to C, students, with a background in programming, should be able to learn the language and proceed to an understanding of some advanced algorithms and how the flexibility of C may be used to unexpected ways to implement them. The text covers algorithms, including Huffman codes, finite state automata, and Boyer and Moore's string searching algorithm, and evaluating algebraic expressions. It introduces features of the language which are then applied to the implementation of good algorithms on techniques with application in many areas of the daily use of computers. It places strong emphasis on the use of pointers and techniques involving double pointers, points to functions, and arrays of pointers which allow new ways of solving common problems, discusses how to improve the efficiency of programs, uses the ANSI standard of the language, and features several examples which are developed to illustrate software engineering topics, such as modular decomposition, encapsulation and data abstraction.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want