Programming, Problem Solving and Abstraction with C, Pearson Original Edition, 2nd edition

Published by Pearson (December 19, 2012) © 2013

  • Alistair Moffat University of Melbourne
Products list
$76.69 AUD

Price Reduced From: $102.25 AUD

Free delivery

This product is expected to ship within 5-7 business days for Australian customers.

Title overview

This Pearson Original edition is specifically published for Melbourne University.

Table of contents

  • 1 Computers and Programs
  • 1.1 Computers and computation
  • 1.2 Programs and programming
  • 1.3 A First C Program
  • 1.4 The task of programming
  • 1.5 Be careful
  • 2 Numbers In, Numbers Out
  • 2.1 Identifiers
  • 2.2 Constants and variables
  • 2.3 Operators and expressions
  • 2.4 Numbers in
  • 2.5 Numbers out
  • 2.6 Assignment statements
  • 2.7 Case study: Volume of a sphere
  • 3 Making Choices
  • 3.1 Logical expressions
  • 3.2 Selection
  • 3.3 Pitfalls to watch for
  • 3.4 Case study: Calculating taxes
  • 3.5 The switch statement
  • 4 Loops
  • 4.1 Controlled iteration
  • 4.2 Case study: Calculating compound interest
  • 4.3 Program layout and style
  • 4.4 Uncontrolled iteration
  • 4.5 Iterating over the input data
  • 5 Getting Started with Functions
  • 5.1 Abstraction
  • 5.2 Compilation with functions
  • 5.3 Library functions
  • 5.4 Generalizing the abstraction
  • 5.5 Recursion
  • 5.6 Case study: Calculating cube roots
  • 5.7 Testing functions and programs
  • 6 Functions and Pointers
  • 6.1 The main function
  • 6.2 Use of void
  • 6.3 Scope
  • 6.4 Global variables
  • 6.5 Static variables
  • 6.6 Pointers and pointer operations
  • 6.7 Pointers as arguments
  • 6.8 Case study: Reading numbers
  • 7 Arrays
  • 7.1 Linear collections of like objects
  • 7.2 Reading into an array
  • 7.3 Sorting an array
  • 7.4 Arrays and functions
  • 7.5 Two-dimensional arrays
  • 7.6 Array initializers
  • 7.7 Arrays and pointers
  • 7.8 Strings
  • 7.9 Case study: Distinct words
  • 7.10 Arrays of strings
  • 7.11 Program arguments
  • 8 Structures
  • 8.1 Declaring structures
  • 8.2 Operations on structures
  • 8.3 Structures, pointers, and functions
  • 8.4 Structures and arrays
  • 9 Problem Solving Strategies
  • 9.1 Generate and test
  • 9.2 Divide and conquer
  • 9.3 Simulation
  • 9.4 Approximation techniques
  • 9.5 Physical simulations
  • 9.6 Solution by evolution
  • 10 Dynamic Structures
  • 10.1 Run-time arrays
  • 10.2 Linked structures
  • 10.3 Binary search trees
  • 10.4 Function pointers
  • 10.5 Case study: A polymorphic tree library
  • 11 File Operations
  • 11.1 Text files
  • 11.2 Binary files
  • 11.3 Case study: Merging multiples
  • 12 Algorithms
  • 12.1 Measuring performance
  • 12.2 Dictionaries and searching
  • 12.3 Hashing
  • 12.4 Quick sort
  • 12.5 Merge sort
  • 12.6 Heap sort
  • 12.7 Other problems and algorithms
  • 13 Everything Else
  • 13.1 Some more C operations
  • 13.2 Integer representations and bit operations
  • 13.3 The C pre-processor
  • 13.4 What next?

Need help?Get in touch