Study guide
14.2 Simulation and Modeling
Praxis Computer Science 5652
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode
1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy
2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects
2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations
3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security
3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage
4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation
4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing
5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization
5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range
6 Chapter 6: Algorithms: Searching, Sorting, and Recursion
6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents
7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions
7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra
8 Chapter 8: Programming: Selection, Iteration, and Writing Code
8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code
9 Chapter 9: Programming: Procedures, Arrays, and Data Structures
9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)
10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality
10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback
11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs
11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs
12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design
12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding
13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection
14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing
15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments
15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored
16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity
16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs
14.2 Simulation and Modeling
Key Takeaways Explain This Topic AI
A model is an abstraction of a real system that keeps the features relevant to a question; a simulation is a program that runs the model to see how the system behaves.
A simulation needs initial conditions, rules that update the state at each step, parameter values, often random events, and the outputs to record.
A model is validated by comparing its results with real-world observations or experiments, not by running it on different computers or rewriting its code.
Adding variables or detail can make a simulation more realistic but also slower, more complex, and harder to validate; running more random trials makes estimates more reliable.
Simulations are used when real experiments would be too dangerous, slow, expensive, or impossible, as in weather forecasting, epidemics, traffic, flight training, and ecology.
Last updated: September 2026
What this competency asks
ETS asks you to be familiar with the use of computing in simulation and modeling :
Describe questions that can be answered with a given simulation, or explain what data and process are required to answer a given question.
Trace code in a simulation context.
Identify missing code in a simulation context.
Identify the impact of changes to simulations (for example, more or fewer variables, more or less data).
Identify applications of simulation and modeling.
ETS's sample question asks how to validate a plant-growth simulation. The answer is to run real-world experiments and compare their results with the simulation's.
Models and simulations
A model is a simplified representation of a system. It keeps what matters for the question and leaves out the rest, which is abstraction (Section 4.1). A simulation is a program that runs the model: it starts from initial conditions and repeatedly applies rules to update the state, over time steps or across many random trials.
- Component Example: disease-spread model
- State variables Number of susceptible, infected, and recovered people
- Initial conditions 990 susceptible, 10 infected, 0 recovered
- Parameters Infection probability per contact; days until recovery
- Rules / process Each day, some susceptible people become infected, and some infected people recover
- Random events (if stochastic) Whether a particular contact results in infection
- Outputs Peak number infected; day of the peak; total ever infected
What questions can a simulation answer?
A simulation can answer only questions about quantities it models . A traffic simulation that includes signal timing and car arrivals can estimate average waiting time under different signal plans. It cannot tell you about air pollution unless emissions are part of the model. When a question asks what data and process a simulation needs, list the state variables, parameters, rules, and outputs connected to the question.
- Tracing simulation code
- Deterministic growth (the same result every run): // population is an int; / performs integer division
- int population ← 50
- int hours ← 0
- while ( population < 200 )
- population ← population + population / 2
- hours ← hours + 1
- end while
- print hours
- hours (after update) population
- 0 50
- 1 50 + 25 = 75
- 2 75 + 37 = 112
- 3 112 + 56 = 168
- 4 168 + 84 = 252
The loop stops once population reaches 200 or more, so the program prints 4 . Integer division truncated 75 / 2 to 37, a small modeling approximation.
Stochastic simulation (results vary from run to run): estimate the probability of rolling a sum of 7 with two dice. int sevens ← 0
- int trials ← 10000
- for ( int i ← 0; i < trials; i ← i + 1 )
- int roll ← randomInt ( 1, 6 ) + randomInt ( 1, 6 )
- if ( roll == 7 )
- sevens ← sevens + 1
- end if
- end for
- print sevens / trials // assume floating-point division
The estimate will be close to the exact value, 6/36 ≈ 0.167, and closer with more trials. This is a Monte Carlo simulation (Section 5.3).
The impact of changes
Change Likely effect
More variables or finer detail (weather, driver behavior) More realistic, but slower, more complex, needing more data, and harder to validate
Fewer variables (simplifying assumptions) Faster and easier to understand, but may miss important effects and bias results
- More data for setting parameters More accurate parameters and more trustworthy results
- Less data , or unrepresentative data Less reliable parameters; results may not generalize
- More trials (random simulation) Estimates vary less between runs and are more reliable
- Smaller time steps More accurate tracking of change, but more computation
- Changing one parameter at a time Shows how sensitive the outcome is to that factor
- Validating a simulation
Validation asks: does the model match reality? The standard method is to compare simulation output with real-world data or experiments under the same conditions. If a traffic model predicts 45-second average waits at an intersection where cameras measured 47 seconds, it is behaving plausibly.
Actions that do not validate a model:
Running it on different computers. You get the same answers but learn nothing about reality.
Rewriting it recursively instead of iteratively. That checks the code, not the model.
Making it faster. Efficiency is not accuracy.
Checking that the code correctly implements the intended model is verification , which is also necessary but different.
Why simulate?
- Advantage Example
- Safety Pilot training in flight simulators; crash testing virtual cars
- Cost Testing a bridge design before building it
- Speed Simulating a century of climate in days
- Impossible experiments Galaxy formation; nuclear reactions
- What-if exploration Evacuation plans; school bell schedules; vaccination strategies
- Repeatability Identical conditions, or a fixed random seed, for fair comparisons
Limitations: results depend on assumptions; important factors may be left out; random simulations give estimates, not exact answers; and complex models can demand large computing resources.
Applications
Weather and climate forecasting, epidemic modeling, traffic and transit planning, ecology (predator–prey populations), economics and finance, engineering (stress, airflow, crash tests), medicine and drug design, sports and games, and education. Agent-based tools such as NetLogo let students simulate many individual agents, such as birds, cars, or people, and watch group behavior emerge from simple rules.