What is an algorithm?
An algorithm is a finite, ordered procedure that specifies inputs, processing steps, outputs, termination, and correctness.
Study 01. Introduction to Programming and Algorithmic Problem Solving with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is an algorithm?
An algorithm is a finite, ordered procedure that specifies inputs, processing steps, outputs, termination, and correctness.
How does a program differ from an algorithm?
A program is a concrete implementation of an algorithm using the formal rules of a particular programming language.
What determines whether code has valid form?
Syntax is the grammar of a programming language: the rules that determine whether code has a valid form.
What is control flow?
Control flow is the order in which program statements execute. Sequences, conditionals, loops, and function calls shape that order.
What is a variable?
A variable is a named reference to a value; assignment gives it a value or changes the value it refers to.
What value does a Boolean expression produce?
A Boolean expression evaluates to True or False and is commonly used to control program flow.
When is p and q true?
The expression p and q is true only when both p and q are true.
What is a function?
A function is a named, reusable block of code that may accept parameters and produce an output with return.
What is decomposition in problem solving?
Decomposition breaks a task into smaller operations, reducing cognitive complexity and often suggesting useful functions.
What is the purpose of testing?
Testing compares a program’s actual behavior with expected behavior using normal, boundary, special, and invalid cases.
What prerequisite does binary search have?
Binary search requires sorted input because it uses ordering to eliminate half of the remaining search range after each comparison.
What is binary search’s worst-case time complexity?
Binary search has worst-case running time O(log n), because it approximately halves the remaining search range at every iteration.
A practical review of the integrated Java skills, debugging habits, algorithm reasoning, and free-response strategies needed for AP Computer Science A.
A progressive guide to designing, operating, and testing systems that continue useful service despite component faults, overload, data loss, and recovery challenges.
A medium-difficulty quiz on how independently operated networks, protocols, addresses, naming systems, transport services, and routing mechanisms work together to form the Internet.
Learn how to create, modify, traverse, and analyze Java lists with ArrayList, wrapper types, standard algorithms, and the Collections utility class for AP Computer Science A.
Build a clear understanding of Java Boolean expressions, logical operators, selection statements, nested branching, equivalent logic, and systematic code tracing for AP Computer Science A.
A practical introduction to Java program structure, data types, operators, input and output, problem-solving strategy, testing, and debugging for AP Computer Science A.
A practical guide to Java inheritance, constructor chaining, method overriding, polymorphism, access control, and object behavior for tracing and writing AP Computer Science A programs.
A focused guide to Java classes, object references, constructors, methods, strings, wrapper classes, and API usage for AP Computer Science A.
A focused guide to Java primitive types, expression evaluation, numeric conversion, floating-point behavior, integer overflow, and common methods in the Math class for AP Computer Science A.
A focused review of Java primitive types, expression evaluation, numeric conversion, arithmetic behavior, Math methods, randomness, and tracing techniques for AP Computer Science A.
A progressive guide to how packet-switched networks encapsulate data, move it across links, and manage delay, throughput, queues, and congestion.
A structured guide to designing parallel and distributed systems through decomposition, communication, coordination, state management, scalability, and fault tolerance.