000			02116cam a2200253 a 4500
008			091111s1999 maua b 001 0 eng
010			_a980044233
020			_a9780201357486
035			_a(Sirsi) u2614
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a005.133 _2 20
100	1		_aHanly, Jeri R. _94974
245	1	0	_aProblem solving and program design in C / _c Jeri R. Hanly, Elliot B. Koffman.
250			_a3rd ed.
260			_aReading, Mass. : _b Addison-Wesley Pub. Co., _c c1999.
300			_a1 v. (various paging) : _b col. ill. ; _c 24 cm.
500			_aIncludes index.
505	0		_a0. Computer Science as a Career Path -- 1. Overview of Computers and Programming -- 2. Overview of C -- 3. Top-Down Design with Functions -- 4. Selection Structures: if and switch Statements -- 5. Repetition and Loop Statements -- 6. Modular Programming -- 7. Simple Data Types -- 8. Arrays -- 9. Strings -- 10. Recursion -- 11. Structure and Union Types -- 12. Text and Binary File Processing -- 13. Programming in the Large -- 14. Dynamic Data Structures -- 15. Multiprocessing Using Processes and Threads -- 16. On to C++ --
520			_aProblem Solving and Program Design in C is one of the best-selling introductory programming textbooks using the C programming language. It embraces a balanced approach to program development and an introduction to ANSI C. The book provides a gradual introduction to pointers and covers programming with functions early in the text. In later chapters, students learn to implement fundamental data structures such as lists, stacks, queues, and trees in a language that fosters their understanding of stack- and heap-dynamic memory allocation and programmer-controlled pointers. To enhance students’ learning experience it offers the right amount of pedagogical features that include end-of-section and chapter exercises, examples and case studies, syntax and program style display boxes, error discussions and end-of-chapter projects.
650		0	_aC (Computer program language) _9101
700	1		_aKoffman, Elliot B. _94975
596			_a1
999			_c1741 _d1741