Problem solving and program design in C
By: Hanly, Jeri R
Title By: Koffman, Elliot B
Material type: BookPublisher: Boston : Pearson, c2016.Edition: 8th global ed.Description: 839 p. : ill. ; 24 cm.ISBN: 9781292098814Program: CSCI291Subject(s): C (Computer program language) | Programming languageDDC classification: 005.133 HA PR Online resources: Ebook | Location MapItem type | Home library | Call number | url | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
REGULAR | University of Wollongong in Dubai Main Collection | 005.133 HA PR (Browse shelf) | link | Available | October2018 | T0060351 | ||
CRS | University of Wollongong in Dubai Closed Reserve | 005.133 HA PR (Browse shelf) | Available | T0060352 | ||||
3 DAY LOAN | University of Wollongong in Dubai Main Collection | 005.133 HA PR (Browse shelf) | Available | Ebook Available | T0057507 |
, Shelving location: Closed Reserve Close shelf browser
005.117 MA RE Requirements analysis and system design / | 005.12 SA SY Systems analysis and design in a changing world / | 005.133 DE JA Java : | 005.133 HA PR Problem solving and program design in C | 005.133 HO JA Java for everyone : | 005.133 MA CP C++ programming : | 005.133 MA CP C++ programming : |
Includes index.
Overview of computers and programming -- Overview of C -- Top-down design with functions -- Selection structures : if and switch statements -- Repetition and loop statements -- Pointers and modular programming -- Arrays -- Strings -- Recursion -- Structure and union types -- Text and binary file processing -- Programming in the large -- Dynamic data structures -- Multiprocessing using processes and threads -- On to C++.
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.
CSCI291