Home > Store

Book on C, A: Programming in C, 4th Edition

Register your product to gain access to bonus material or receive a coupon.

Book on C, A: Programming in C, 4th Edition

Book

  • Your Price: $63.99
  • List Price: $79.99
  • Usually ships in 24 hours.

About

Features

Ira Pohl is a Professor of Computer Science at the University of California, Santa Cruz and holds a Ph.D. in Computer Science from Stanford University. His research interests include artificial intelligence, the C and C++ programming languages, practical complexity problems, heuristic search methods, deductive algorithms, and educational and social issues. He originated error analysis in heuristic search methods and deductive algorithms.

Professor Pohl was formerly a Mackay professor at University of California- Berkeley and a ZWO fellow in the Netherlands. He is the author or co-author of Object-Oriented Programming Using C++, C++ Distilled: A Concise Ansi/Iso Reference and Style Guide, C by Dissection: The Essentials of C Programming, A Book on C: Programming in C, C++ for C Programmers, C++ for Fortran Programmers, C++ for Pascal Programmers, and Turbo C: The Essentials of C Programming, all published by Addison-Wesley.

Description

  • Copyright 1998
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 752
  • Edition: 4th
  • Book
  • ISBN-10: 0-201-18399-4
  • ISBN-13: 978-0-201-18399-3

Now in its fourth edition, A Book on C retains the features that have made it a proven, best-selling tutorial and reference on the ANSI C programming language. This edition builds on the many existing strengths of the text to improve, update, and extend the coverage of C, and now includes information on transitioning to Java and C++ from C.

Beginners and professional programmers alike will benefit from the numerous examples and extensive exercises developed to guide readers through each concept. Step-by-step dissections of program code illuminate the correct usage and syntax of C language constructs and reveal the underlying logic of their application. The clarity of exposition and format of the book make it an excellent reference on all aspects of C.

Highlights of A Book on C, Fourth Edition :

  • New and updated programming examples and dissections—the authors' trademark technique for illustrating and teaching language concepts.
  • Recursion is emphasized with revised coverage in both the text and exercises.
  • Multifile programming is given greater attention, as are the issues of correctness and type safety. Function prototypes are now used throughout the text.
  • Abstract Data Types, the key concept necessary to understanding objects, are carefully covered.
  • Updated material on transitioning to C++, including coverage of the important concepts of object-oriented programming.
  • New coverage is provided on transitioning from C to Java.
  • References to key programming functions and C features are provided in convenient tables.



    0201183994B04062001

  • Downloads

    Source Code

    Click below for Source Code related to this title:
    abc_4e_code.tar

    Sample Content

    Table of Contents

    (Each chapter concludes with a Summary and Exercises.)

    Preface.


    Starting from Zero.

    Why C?

    ANSI C Standard.

    From C to C++.

    From C and C++ to Java.



    1. An Overview of C.

    Programming and Preparation.

    Program Output.

    Variables, Expressions, and Assignment.

    The Use of #define and #include.

    The Use of printf() and scanf().

    Flow of Control.

    Functions.

    Call-by-Value.

    Arrays, Strings, and Pointers.

    Arrays.

    Strings.

    Pointers.

    Files.

    Operating System Considerations.

    Writing and Running a C Program.

    Interrupting a Program.

    Typing an End-of-file Signal.

    Redirection of the Input and the Output.



    2. Lexical Elements, Operators, and the C System.

    Characters and Lexical Elements.

    Syntax Rules.

    Comments.

    Keywords.

    Identifiers.

    Constants.

    String Constants.

    Operators and Punctuators.

    Precedence and Associativity of Operators.

    Increment and Decrement Operators.

    Assignment Operators.

    An Example: Computing Powers of 2.

    The C System.

    The Preprocessor.

    The Standard Library.



    3. The Fundamental Data Types.

    Declarations, Expressions, and Assignment.

    The Fundamental Data Types.

    Characters and the Data Type char.

    The Data Type int.

    The Integral Types short, long, and unsigned.

    The Floating Types.

    The Use of typedef.

    The sizeof Operator.

    The Use of getchar() and putchar().

    Mathematical Functions.

    The Use of abs() and fabs().

    UNIX and the Mathematics Library.

    Conversions and Casts.

    The Integral Promotions.

    The Usual Arithmetic Conversions.

    Casts.

    Hexadecimal and Octal Constants.



    4. Flow of Control.

    Relational, Equality, and Logical Operators.

    Relational Operators and Expressions.

    Equality Operators and Expressions.

    Logical Operators and Expressions.

    Short-circuit Evaluation.

    The Compound Statement.

    The Expression and Empty Statement.

    The if and the if-else Statements.

    The while Statement.

    The for Statement.

    An Example: Boolean Variables.

    The Comma Operator.

    The do Statement.

    An Example: Fibonacci Numbers.

    The goto Statement.

    The break and continue Statements.

    The switch Statement.

    The Conditional Operator.



    5. Functions.

    Function Definition.

    The return Statement.

    Function Prototypes.

    Function Prototypes in C++.

    An Example: Creating a Table of Powers.

    Function Declarations from the Compiler’s Viewpoint.

    Limitations.

    An Alternate Style for Function Definition Order.

    Function Invocation and Call-by-Value.

    Developing a Large Program.

    What Constitutes a Large Program?

    Using Assertions.

    Scope Rules.

    Parallel and Nested Blocks.

    Using a Block for Debugging.

    Storage Classes.

    The Storage Class auto.

    The Storage Class extern.

    The Storage Class register.

    The Storage Class static.

    Static External Variables.

    Default Initialization.

    Recursion.

    Efficiency Considerations.

    An Example: The Towers of Hanoi.



    6. Arrays, Pointers, and Strings.

    One-dimensional Arrays.

    Initialization.

    Subscripting.

    Pointers.

    Call-by-Reference.

    The Relationship Between Arrays and Pointers.

    Pointer Arithmetic and Element Size.

    Arrays as Function Arguments.

    An Example: Bubble Sort.

    Dynamic Memory Allocation With calloc() and malloc().

    Offsetting the Pointer.

    An Example: Merge and Merge Sort.

    Strings.

    String-Handling Functions in the Standard Library.

    Multidimensional Arrays.

    Two-dimensional Arrays.

    The Storage Mapping Function.

    Formal Parameter Declarations.

    Three-dimensional Arrays.

    Initialization.

    The Use of typedef.

    Arrays of Pointers.

    Arguments to main().

    Ragged Arrays.

    Functions as Arguments.

    Functions as Formal Parameters in Function Prototypes.

    An Example: Using Bisection to Find the Root of a Function.

    The Kepler Equation.

    Arrays of Pointers to Function.

    The Type Qualifiers const and volatile.



    7. Bitwise Operators and Enumeration Types.

    Bitwise Operators and Expressions.

    Bitwise Complement.

    Two’s Complement.

    Bitwise Binary Logical Operators.

    Left and Right Shift Operators.

    Masks.

    Software Tools: Printing an int Bitwise.

    Packing and Unpacking.

    Multibyte Character Constants.

    Enumeration Types.

    An Example: The Game of Paper, Rock, Scissors.



    8. The Preprocessor.

    The Use of #include.

    The Use of #define.

    Syntactic Sugar.

    Macros with Arguments.

    The Type Definitions and Macros in stddef.h.

    An Example: Sorting with qsort().

    An Example: Macros with Arguments.

    The Macros in stdio.h and ctype.h.

    Conditional Compilation.

    The Predefined Macros.

    The Operators # and ##.

    The assert() Macro.

    The Use of #error and #pragma.

    Line Numbers.

    Corresponding Functions.

    An Example: Quicksort.



    9. Structures and Unions.

    Structures.

    Accessing Members of a Structure.

    Operator Precedence and Associativity: A Final Look.

    Using Structures with Functions.

    Initialization of Structures.

    An Example: Playing Poker.

    Unions.

    Bit Fields.

    An Example: Accessing Bits and Bytes.

    The ADT Stack.



    10. Structures and List Processing.

    Self-referential Structures.

    Linear Linked Lists.

    Storage Allocation.

    List Operations.

    Some List Processing Functions.

    Insertion.

    Deletion.

    Stacks.

    An Example: Polish Notation and Stack Evaluation.

    Queues.

    Binary Trees.

    Binary Tree Traversal.

    Creating Trees.

    General Linked Lists.

    Traversal.

    The Use of calloc() and Building Trees.



    11. Input/Output and the Operating System.

    The Output Function printf().

    The Input Function scanf().

    The Functions fprintf(), fscanf(), sprintf(), and sscanf().

    The Functions fopen() and fclose().

    An Example: Double Spacing a File.

    Using Temporary Files and Graceful Functions.

    Accessing a File Randomly.

    File Descriptor Input/Output.

    File Access Permissions.

    Executing Commands from Within a C Program.

    Using Pipes from Within a C Program.

    Environment Variables.

    The C Compiler.

    Using the Profiler.

    Libraries.

    How to Time C Code.

    The Use of make.

    The Use of touch.

    Other Useful Tools.



    12. Advanced Applications.

    Creating a Concurrent Process with fork().

    Overlaying a Process: the exec...() Family.

    Using the spawn...() Family.

    Interprocess Communication Using pipe().

    Signals.

    An Example: The Dining Philosophers.

    Dynamic Allocation of Matrices.

    Why Arrays of Arrays Are Inadequate.

    Building Matrices with Arrays of Pointers.

    Adjusting the Subscript Range.

    Allocating All the Memory at Once.

    Returning the Status.



    13. Moving from C to C++.

    Output.

    Input.

    Functions.

    Classes and Abstract Data Types.

    Overloading.

    Constructors and Destructors.

    Object-oriented Programming and Inheritance.

    Polymorphism.

    Templates.

    C++ Exceptions.

    Benefits of Object-oriented Programming.



    14. Moving from C to Java.

    Output.

    Variables and Types.

    Classes and Abstract Data Types.

    Overloading.

    Construction and Destruction of Class Types.

    Object-oriented Programming and Inheritance.

    Polymorphism and Overriding Methods.

    Applets.

    Java Exceptions.

    Benefits of Java and OOP.



    Appendix A. The Standard Library.

    Diagnostics.

    Character Handling.

    Testing a Character.

    Mapping a Character.

    Errors.

    Floating Limits.

    Integral Limits.

    Localization.

    Mathematics.

    Nonlocal Jumps.

    Signal Handling.

    Variable Arguments.

    Common Definitions.

    Input/Output.

    Opening, Closing, and Conditioning a File.

    Accessing the File Position Indicator.

    Error Handling.

    Character Input/Output.

    Formatted Input/Output.

    Direct Input/Output.

    Removing or Renaming a File.

    A.13 General Utilities.

    Dynamic Allocation of Memory.

    Searching and Sorting.

    Pseudo Random-Number Generator.

    Communicating with the Environment.

    Integer Arithmetic.

    String Conversion.

    Multibyte Character Functions.

    Multibyte String Functions.

    Leaving the Program.

    Memory and String Handling.

    Memory-Handling Functions.

    String-Handling Functions.

    Date and Time.

    Accessing the Clock.

    Accessing the Time.

    Miscellaneous.

    File Access.

    Using File Descriptors.

    Creating a Concurrent Process.

    Overlaying a Process.

    Interprocess Communication.

    Suspending Program Execution.



    Appendix B. Language Syntax.

    Program.

    Function Definition.

    Declaration.

    Statement.

    Expression.

    Constant.

    String Literal.

    Preprocessor.



    Appendix C. ANSI C Compared to Traditional C.

    Types.

    Constants.

    Declarations.

    Initializations.

    Expressions.

    Functions.

    Conversions.

    Array Pointers.

    Structures and Unions.

    Preprocessor.

    Header Files.

    Miscellaneous.



    Appendix D. ASCII Character Codes.


    Appendix E Operator Precedence and Associativity.


    Index. 0201183994T04062001

    Preface

    A Book on C conveys an appreciation for both the elegant simplicity and the power of this general-purpose programming language. By presenting interactive running programs from many application areas, this book describes the ANSI version of the C language. The complete language is presented in a step-by-step manner, along with many complete working programs.

    Where appropriate, we discuss the differences between traditional C and ANSI C. (Traditional C still remains in wide use.) Dozens of example programs are available to illustrate each important language feature, and many tables summarize key information and provide easy access for later reference. Each chapter ends with a summary and exercises. The summary reviews key elements presented in the chapter, and the exercises augment and extend the text.

    This book assumes a general-purpose knowledge of the C language. It is intended for use in either a first or second programming course. However, it can be readily used in conjunction with courses on topics such as comparative programming languages, computational linguistics, data structures, database systems, fractal geometry, graphics, numerical analysis, operating systems, programming methodology, and scientific applications. C is suitable for applications from each of these domains, and all features of C needed to code such applications are explained. This book is appropriate for a data structures course because advanced data structuring features such as enumeration types, unions, self-referential structures, and ragged arrays are discussed. For operating systems courses concerned with UNIX or Windows 95/NT, the book explores the file structure and systems routines that enable the C programmer to add to existing systems libraries and understand the C code underlying the operating system. For applications programming and scientific programming, there is discussion of how to write sample function libraries. Statistics, root finding, sorting, text manipulation, file handling, and game playing are all represented with working code.

    New Java Section. In Chapter 14, "Moving from C to Java," we discuss how the C programmer can very naturally and easily begin programming in Java, a language of interest for work on the Internet. The Java programming language borrows ideas from both C and C++ and is designed to run in a machine- and system-independent manner. This makes it suitable for Internet work, such as writing applets for Web pages that get used by browsers. Because Java is an extension of C and C++, it is readily learned by the C programmer.

    Complete ANSI C Language. Computer professionals will have access to a complete treatment of the language, including enumeration types, list processing, and the operating system interface. Chapter 1, "An Overview of C," presents an overview of the language. After reading this chapter, the professional will already be able to write C code. Since the chapters are self-contained, the knowledgeable reader can skip to particular sections as needed. Chapter 11, "Input/Output and the Operating System," gives a thorough introduction to the connections to the operating system. This information will benefit the professional systems programmer needing to use C to work within an MS-DOS or UNIX environment.

    Interactive Environment. This book is written entirely with the modern interactive environment in mind. Experimentation is encouraged throughout. Keyboard and screen input/output is taken as the norm, and its attendant concerns are explained. Thus, the book is appropriate for users of small home and business computers as well as to users of large interactive systems. We assume that the reader will have access to an interactive ANSI C system. During the writing of this book, we used a number of different C systems: various Borland and Microsoft compilers running on IBM-compatible Pentium machines, the GNU gcc compiler and native compilers running on various workstations from DEC, SGI, and Sun, and the C compiler that runs on the Cray supercomputer in San Diego.

    Working Code. Our approach to describing the language is to use examples, explanation, and syntax. Working code is employed throughout. Small but useful examples are provided to describe important technical points. Small because small is comprehensible. Useful because programming is based on a hierarchy of building blocks and ultimately is pragmatic. The programs and functions described in the book can be used in actual systems. The authors' philosophy is that one should experiment and enjoy.

    Dissections. We use highlighted "dissections" on many programs and functions throughout the book. Dissection is a unique pedagogical tool first developed by the authors in 1984 to illuminate key features of working code. A dissection is similar to a structured walk-through of the code. Its intention is to explain to the reader newly encountered programming elements and idioms found in working code.

    Flexible Organization. This book is constructed to be very flexible in its use. Chapter 1, "An Overview of C," is in two parts. The first part explains the crucial programming techniques needed for interactive input/output, material that must be understood by all. The second part of Chapter 1 goes on to survey the entire language and will be comprehensible to experienced programmers familiar with comparable features from other languages. This second part can be postponed in a first programming course. Caution: Beginning programmers should postpone the second part of Chapter 1.

    Chapter 2, "Lexical Elements, Operators, and the C System," describes the lexical level of the language and syntactic rules, which are selectively employed to illustrate C language constructs. The instructor may decide to teach Backus-Naur-Form (BNF) notation as described in Chapter 2 or may omit it without any loss of continuity. The book uses BNF style syntactic descriptions so that the student can learn this standard form of programming language description. In addition, language components are thoroughly described by example and ordinary explanation.

    Reference Work. This book is designed to be a valuable reference to the C language. Throughout the book, many tables concisely illustrate key areas of the language. The complete ANSI C standard library, along with its associated header files, is described in the Appendix A, "The Standard Library." Sections in the appendix are devoted to explaining each of the standard header files such as ctype.h, stdio.h, and string.h. Where appropriate, example code is given to illustrate the use of a particular construct or function.

    In Appendix B, "Language Syntax," we provide the complete syntax of the C language. In Appendix C, "ANSI C Compared to Traditional C," we list the major differences between ANSI C and traditional C. Finally, special care has been taken to make the index easy to use and suitable for a reference work.

    The Complete ANSI C Language. Chapters 3 through 10 cover the C language feature by feature. Many advanced topics are discussed that may be omitted on first reading without loss of comprehension, if so desired. For example, enumeration types are relatively new to the language, and their use can be omitted in a first course. Machine-dependent features such as word size considerations and floating-point representation are emphasized, but many of the details need not concern the beginner.

    The Preprocessor. Chapter 8, "The Preprocessor," is devoted entirely to the preprocessor, which is used to extend the power and notation of the C language. Macros can be used to generate inline code that takes the place of a function call. Their use can reduce program execution time. The chapter presents a detailed discussion of the preprocessor, including new features added by the ANSI committee. In traditional C, the preprocessor varies considerably from one compiler to another. In ANSI C, the functionality of the preprocessor has been completely specified.

    Recursion and List Processing. Chapter 5, "Functions," has a careful discussion of recursion, which is often a mystifying topic for the beginner. The use of recursion is illustrated again in Chapter 8, "The Preprocessor," with the quicksort algorithm and in Chapter 10, "Structures and List Processing," with basic list processing techniques. A thorough knowledge of list processing techniques is necessary in advanced programming and data structure courses.

    Operating System Connection. Chapter 11, "Input/Output and the Operating System," makes the operating system connection. In this chapter, we explain how to do file processing and discuss at length the various input/output functions in the standard library. We also explain how to execute a system command from within a C program and how to set file permissions and use of environment variables. We give explicit examples showing the use of the profiler, the librarian, and the make facility.

    Advanced Applications. We discuss a number of advanced applications in Chapter 12, "Advanced Applications." We present topics such as creating concurrent processes, overlaying a process, interprocess communication, and signals, along with working code. Also, we discuss the dynamic allocation of vectors and matrices for engineers and scientists. These advanced topics can be used selectively according to the needs of the audience. They could form the basis for an excellent second course in programming practice. This book can be used, too, as an auxiliary text in advanced computer science courses that employ C as their implementation language.

    Tables, Summaries, and Exercises. Throughout the book are many tables and lists that succinctly summarize key ideas. These tables aid and test language comprehension. For example, C is very rich in operators and allows almost any useful combination of operator mix. It is essential to understand order of evaluation and association of each of these operators separately and in combination. These points are illustrated in tables throughout the text. As a reference tool, the tables and code are easily looked up.

    The exercises test elementary features of the language and discuss advanced and system-dependent features. Many exercises are oriented to problem solving, others test the reader's syntactic or semantic understanding of C. Some exercises include a tutorial discussion that is tangential to the text but may be of special interest to certain readers. The exercises offer the instructor all levels of question, so as to allow assignments suitable to the audience.

    Acknowledgments

    Our special thanks go to Debra Dolsberry, who acted as the chief technical editor for this book. She was largely responsible for using FrameMaker to create PostScript files suitable for the typesetting of this book. Our special thanks also go to Robert Field, ParcPlace Systems, Mountain View, California, who acted as the chief technical reviewer for the first edition of this book. We found his expertise and suggestions extremely valuable. The ''Tower of Hanoi'' picture in Chapter 5, "Functions," and the "Dining Philosophers" picture in Chapter 10, "Structures and List Processing," are due to John de Pillis, University of California, Riverside. Our special thanks go to him, too.

    We also want to thank other people who provided us with helpful suggestions: Murray Baumgarten, University of California, Santa Cruz; Michael Beeson, San Jose State University, San Jose, California; Randolph Bentson, Colorado State University, Ft. Collins; Jim Bloom, University of California, Berkeley; John Bowie, Hewlett-Packard Co., Inc.; Skona Brittain, University of California, Santa Barbara; Timothy Budd, University of Arizona, Tucson; Nick Burgoyne, University of California, Santa Cruz; Jim Chrislock, Mindcraft, Inc.; Al Conrad, University of California, Santa Cruz; Jeff Donnelly, University of Illinois, Urbana; Dick Fritz, AT&T Bell Laboratories; Rex Gantenbein, University of Wyoming, Laramie; Harry Gaver, SRI International, Georgia; Leonard Garrett, Temple University, Philadelphia; William Giles, San Jose State University, San Jose, California; Susan Graham, University of California, Berkeley; Jorge Hankamer, University of California, Santa Cruz; Robert Haxo, Auspex, Inc., San Jose, California; Mike Johnson, Oregon State University, Corvallis; Keith Jolly, Chabot College, San Leandro, California; Carole Kelley, Cabrillo College, Aptos, California; Clifford Layton, Rogers State University; Darrell Long, University of California, Santa Cruz; Charlie McDowell, University of California, Santa Cruz; Andrew Pleszkun, University of Colorado, Boulder; Geoffrey Pullum, University of California, Santa Cruz; Peter Rosencrantz, The Santa Cruz Operation, Inc.; Mike Schoonover, HewlettPackard Co., Inc.; Peter Scott, University of California, Santa Cruz; Alan Shaw, University of Washington, Seattle; Tilly Shaw, University of California, Santa Cruz; Matt Stallmann, University of Denver.

    In addition, we would like to thank our sponsoring editor Carter Shanklin for his enthusiasm, support, and encouragement; and we would like to thank John Fuller for his careful attention to the production of this book on C.

    Al Kelley
    Ira Pohl
    University of California, Santa Cruz


    0201183994P04062001

    Updates

    Submit Errata

    More Information

    InformIT Promotional Mailings & Special Offers

    I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

    Overview


    Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

    This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

    Collection and Use of Information


    To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

    Questions and Inquiries

    For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

    Online Store

    For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

    Surveys

    Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

    Contests and Drawings

    Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

    Newsletters

    If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

    Service Announcements

    On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

    Customer Service

    We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

    Other Collection and Use of Information


    Application and System Logs

    Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

    Web Analytics

    Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

    Cookies and Related Technologies

    This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

    Do Not Track

    This site currently does not respond to Do Not Track signals.

    Security


    Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

    Children


    This site is not directed to children under the age of 13.

    Marketing


    Pearson may send or direct marketing communications to users, provided that

    • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
    • Such marketing is consistent with applicable law and Pearson's legal obligations.
    • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
    • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

    Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

    Correcting/Updating Personal Information


    If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

    Choice/Opt-out


    Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

    Sale of Personal Information


    Pearson does not rent or sell personal information in exchange for any payment of money.

    While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

    Supplemental Privacy Statement for California Residents


    California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

    Sharing and Disclosure


    Pearson may disclose personal information, as follows:

    • As required by law.
    • With the consent of the individual (or their parent, if the individual is a minor)
    • In response to a subpoena, court order or legal process, to the extent permitted or required by law
    • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
    • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
    • To investigate or address actual or suspected fraud or other illegal activities
    • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
    • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
    • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

    Links


    This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

    Requests and Contact


    Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

    Changes to this Privacy Notice


    We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

    Last Update: November 17, 2020