Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Title
Pointers in C programming : a modern approach to memory management, recursive data structures, strings, and arrays / Thomas Mailund.
ISBN
9781484269275 (electronic book)
1484269276 (electronic book)
9781484269268 (print)
1484269268
Published
[New York, NY] : Apress, 2021.
Language
English
Description
1 online resource (xiii, 537 pages) : illustrations
Item Number
10.1007/978-1-4842-6927-5 doi
Call Number
QA76.73.C15
Dewey Decimal Classification
005.13/3
Summary
Gain a better understanding of pointers, from the basics of how pointers function at the machine level, to using them for a variety of common and advanced scenarios. This short contemporary guide book on pointers in C programming provides a resource for professionals and advanced students needing in-depth hands-on coverage of pointer basics and advanced features. It includes the latest versions of the C language, C20, C17, and C14. You'll see how pointers are used to provide vital C features, such as strings, arrays, higher-order functions and polymorphic data structures. Along the way, you'll cover how pointers can optimize a program to run faster or use less memory than it would otherwise. There are plenty of code examples in the book to emulate and adapt to meet your specific needs. You will: Work effectively with pointers in your C programming Learn how to effectively manage dynamic memory Program with strings and arrays Create recursive data structures Implement function pointers.
Note
Includes index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed May 4, 2021).
1: Introduction
2: Memory, Objects, and Addresses
3: Pointers
4: Pointers and Types
5: Arrays
6: Working with Arrays
7: Strings
8: Substrings Through Ranges
9: Dynamic Memory Management
10: Generic Dynamic Arrays
11: Singly-linked Lists
12: Search Trees
13: Function Pointers
14: Generic Lists and Trees
15: Reference Counting Garbage Collection
16: Allocation Pools
17: Conclusions.