Computer Science A & AB illustrated edition [Paperback / softback]

, , , (Wichita State University USA), (Ryreson University Toronto Canada), , , , , (University of Houston-Downtown, USA)
  • Paperback / softback
  • Hind: 20,95 EUR*
  • Lisa soovinimekirja
  • Lisa ostukorvi
  • Kogus:
  • Tasuta tarne
  • See raamat on trükist otsas, kuid me saadame teile pakkumise kasutatud raamatule.
  • * saadame teile pakkumise kasutatud raamatule, mille hind võib erineda kodulehel olevast hinnast
Included are four sample exams which directly reflect the actual exam's content. Both the multiple-choice and free-response sections are covered thoroughly in the questions and subsequent detailed explanations. The comprehensive review covers language systems, programming methodology, the C++ language, fundamental data structure, and algorithms.
About Research & Education Association iii
Acknowledgments iv
Preface xiii
About the Test xiii
Which Exam Should You Take? xiv
About the Review xv
About the Case Study xv
About the Programs in this Book xvi
Scoring the AP and Practice Exams xvi
Scoring the Multiple-Choice Section xvi
Scoring the Free-Response Questions xvii
The Composite Score xvii
Studying for Your AP Examination xviii
Test-Taking Tips xix
Independent Study Schedule xix
AP Computer Science Course Review
Computer Systems
3(6)
Introduction
3(1)
Operating Systems
4(1)
Primary and Secondary Memory
5(1)
Programs
6(1)
Computer Languages
6(2)
Translation
7(1)
Language Description
7(1)
Types of Computer Systems
8(1)
Programming Methodology
9(4)
Design
9(1)
Top-Down Approach
10(1)
Documentation
10(1)
Program Correctness
11(2)
Assertions
11(1)
Invariants
11(2)
Features of an Object-Oriented Programming Language: C++
13(120)
Introduction
13(1)
Basic C++
13(8)
Program Structure
13(1)
Header Files
13(1)
Minimal C++ Program
14(1)
Declarations
14(1)
Identifiers
15(1)
Fundamental Types
16(2)
Implicit Type Conversion
18(1)
Literals
18(1)
Integer Constants
19(1)
Character Constants
19(1)
Floating Constants
20(1)
String Literals
20(1)
Named Constants
21(5)
Enumerations
22(2)
Sample Program
24(2)
Types
26(39)
Derived Types
27(2)
void
29(1)
Arrays
29(1)
Array Definition
29(2)
Multidimensional Arrays
31(1)
Structures
32(1)
Structure Definition
32(1)
Structure Processing
33(3)
Fields
36(1)
Unions
37(2)
Sample Program
39(5)
Type Equivalency
44(1)
Pointer Types, Pointer Variables and Dynamic Allocation of Memory*
45(1)
Static Sequential Memory Allocation
45(1)
Dynamic Allocation of Memory
46(1)
Pointer Types and Pointer Variables
47(1)
Pointers and Arrays
48(3)
Building Linked Lists
51(3)
Sample Program
54(11)
References
65(1)
Scope of Identifiers
65(1)
Expressions and Evaluation
66(8)
C++ Operators
66(3)
Algebraic Notation*
69(1)
Algebraic Orders and Tree Traversals
69(1)
General Conversion Rules
70(2)
Standard Functions
72(1)
Linkage to Non-C++ Code
73(1)
Sample Program
73(1)
Assignment Statement
74(2)
Examples of Simple Assignment Statements
75(1)
Control Structures
76(17)
Control Structures
76(1)
Sequential Control
77(1)
Boolean Expressions
77(4)
Selection Statements
81(1)
The if Statement
81(1)
Nested if Statements
82(2)
The switch Statement
84(2)
Iteration Statements
86(1)
The for Statement
86(1)
The while Statement
87(1)
The do Statement
88(1)
Procedural Control Structures
89(1)
Labels and Jump Statements
89(1)
Jump Statements
89(1)
The break Statements
90(1)
The continue Statement
90(1)
The return Statement
91(1)
The go to Statement
91(1)
Sample Program
92(1)
Files and Input/Output Operations
93(6)
Files
93(1)
Standard System Input/Output Files
94(1)
Files and Streams
94(1)
Input Operations on Files
94(1)
Output Operations on Files
95(2)
Sample Program
97(2)
Classes
99(10)
Classes and Members
99(2)
Minor Class Features
101(1)
friend Functions
101(1)
Member Name Qualification
102(1)
Nested Classes
102(1)
static Members
103(1)
Pointers to Members
103(1)
Structures and Unions
103(1)
Construction and Destruction
103(1)
Derived Classes
104(1)
Multiple Inheritance
105(1)
Overloading
105(1)
A User-Defined Set Class
105(4)
Functions
109(12)
Functions
110(3)
Recursion
113(2)
Recursive Calls and the Stack
115(3)
Sample Program
118(3)
String Processing
121(1)
Templates
122(2)
Class Templates
122(1)
Function Templates
123(1)
Member Function Templates
123(1)
Standard Template Library
124(1)
Exception Handling
124(9)
Throwing an Exception
125(2)
Constructors and Destructors
127(1)
Handling an Exception
128(1)
Exception Specifications
129(1)
Special Functions
130(1)
The terminate () Function
130(1)
The unexpected () Function
130(1)
Exceptions and Access
131(2)
Fundamental Data Structures
133(70)
Introduction
133(2)
Data and Programs
133(1)
Abstract Data Types
134(1)
Fundamentals
135(9)
Data Abstraction and Classes
135(5)
Pointers*
140(1)
Nodes
141(3)
The Ordered List ADT
144(9)
An Array Implementation
144(4)
The Linked List Implementation
148(3)
Variations
151(1)
Header Nodes
151(1)
Circular Lists
151(1)
Doubly Linked Sets
152(1)
Stacks
153(10)
Stack Structure and Operations*
153(1)
Using Stacks
154(2)
Sample Implementation
156(1)
Array Implementation
156(1)
Coding the Operations
157(2)
Pointer Implementation
159(1)
Coding Some Operations
160(2)
Applications
162(1)
Queue
163(12)
Queue Structure and Operations*
163(1)
Implementing Queues Using Arrays
164(1)
The Underlying Data Structure
164(1)
Presuppositions
165(1)
Issue 1: Storage of Items in a Queue
165(1)
Issue 2: Filling the Underlying Array
166(1)
Issue 3: Testing for an Empty Queue
166(3)
Code for the Operations
169(2)
Implementing Queues and Linked Lists
171(3)
Implementing Queues Using Circular Linked Lists
174(1)
Deques
174(1)
Evaluation
174(1)
Hiding the Implementation*
175(3)
Arrays and Records
178(6)
Aggregate Structures
178(1)
One-Dimension Arrays
178(1)
Storage of Arrays
179(1)
Two-and Higher-Dimension Arrays
180(2)
Declaring Arrays
182(1)
Records
183(1)
Trees*
184(19)
Basic Definitions
184(3)
Traversing Binary Trees
187(2)
Operations on Trees
189(1)
Pointer and Implementation Example
189(2)
Ordered Trees
191(1)
Inserting into an Ordered Tree
192(1)
Example: Repeated Insertions into an Ordered Tree
193(1)
Deleting from an Ordered Tree
193(2)
Balancing and Rotating
195(3)
Threading Trees
198(2)
General Trees
200(3)
Algorithms
203(208)
Introduction
203(1)
Big O
203(1)
Searching
204(9)
Searching Algorithms
204(1)
Linear Search
205(1)
Binary Search
206(2)
Hashing
208(1)
Preliminaries
208(1)
Hash Functions
209(1)
Division
209(1)
Midsquare
210(1)
Folding
211(1)
Digit Analysis
211(1)
Multiplication
211(2)
Elementary Sorting
213(7)
Sorting Algorithms
213(1)
Bubble Sort
213(4)
Straight Selection Sort
217(2)
Stable Sorts
219(1)
Hashing
220(3)
Resolving Clashes
220(1)
Linear Probing
220(1)
Quadratic Probing
221(1)
Rehashing
221(1)
Bucket
222(1)
Chainging
222(1)
Advanced Sorting
223(13)
Heap Sort
223(1)
Basic Definitions
223(3)
Creating the Heap
226(1)
Exchanging Elements and Adjusting
227(1)
Implementation
228(1)
Brief Analysis
229(1)
Quick Sort
230(3)
Index Sorting
233(3)
Numerical Integration*
236(3)
AP COMPUTER SCIENCE A PRACTICE EXAM
Test 1
239(48)
Answer Sheet
240(1)
Test 1
241(26)
Answer Key
267(1)
Detailed Explanations of Answers
268(19)
AP COMPUTER SCIENCE A PRACTICE EXAM
Test 2
287(46)
Answer Sheet
288(1)
Test 2
289(24)
Answer Key
313(1)
Detailed Explanations of Answers
314(19)
AP COMPUTER SCIENCE AB PRACTICE EXAM
Test 3
333(38)
Answer Sheet
334(1)
Test 3
335(24)
Answer Key
359(1)
Detailed Explanations of Answers
360(11)
AP COMPUTER SCIENCE AB PRACTICE EXAM
Test 4
371(40)
Answer Sheet
372(1)
Test 4
373(21)
Answer Key
394(1)
Detailed Explanations of Answers
395(16)
SAMPLE CASE STUDY 411(34)
Specification
413(32)
Problem Analysis
416(5)
Implementation
421(3)
The Text Adventure Program
424(21)
Glossary 445