Amazon cover image
Image from Amazon.com

Problem solving and program design in C / Jeri R. Hanly, Elliot B. Koffman.

By: Contributor(s): Material type: TextTextBoston : Pearson, [2013]Description: xviii, 482 pages : illustrations 23 cmISBN:
  • 9780132936491
Subject(s): LOC classification:
  • QA 76.73.C15 .H195 2013
Summary: Problem 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. --Amazon.com
List(s) this item appears in: SCOMJ111L_COMPUTER PROGRAMMING JAVA (NCII) | SCOMJ211L_COMPUTER PROGRAMMING 3
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Circulation Circulation DLSU-D HS Learning Resource Center Circulation QA 76.73.C15 .H195 2013 (Browse shelf(Opens below)) Available 3SHS2016000180

Includes index.

Problem 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. --Amazon.com

There are no comments on this title.

to post a comment.