Study guide
12.2 Programming Paradigms: Procedural, Object-Oriented, and Others
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
12.2 Programming Paradigms: Procedural, Object-Oriented, and Others
Key Takeaways Explain This Topic AI
Procedural programming organizes a program as a sequence of procedures that operate on data passed to them or stored in variables; key terms include procedure, parameter, return value, local and global variable, and top-down design.
Object-oriented programming organizes a program around objects that bundle state (instance variables) with behavior (methods); key terms include class, object, constructor, encapsulation, inheritance, and polymorphism.
Functional programming emphasizes pure functions without side effects, immutable data, and passing functions as values.
Declarative languages such as SQL describe what result is wanted rather than the steps to compute it.
Many languages, including Python, JavaScript, and C++, are multi-paradigm, so the paradigm describes how code is organized, not just which language is used.
Last updated: September 2026
What this competency asks
ETS asks you to be familiar with different programming paradigms :
Identify the terminology of procedural programming.
Identify the terminology of object-oriented programming.
Compare programming paradigms.
The discussion question asks you to describe differences between paradigms such as procedural and object-oriented.
What a paradigm is
A programming paradigm is a fundamental approach to structuring a program: how data and behavior are organized and how computation proceeds. A language may be designed around one paradigm, as Java is around objects, or support several. Python can be written procedurally, in an object-oriented way, or in a functional style.
Procedural programming
Procedural (imperative) programming describes computation as a sequence of statements that change the program's state (its variables), organized into procedures .
- Term Meaning
- Procedure / function / subroutine A named block of statements that performs a task
- Parameter and argument The inputs to a procedure and the values passed in
- Return value The result a procedure sends back
- Local and global variables Scope of data (Section 9.1)
- Sequence, selection, iteration Control structures
- Top-down design / stepwise refinement Breaking the task into procedures, then refining each
Examples: C, Pascal, and early BASIC; also procedural-style code in Python, JavaScript, and the ETS pseudocode.
Strengths: simple to learn, direct control of the steps, and efficient for straightforward tasks and scripts.
Weaknesses: in large programs, data and the procedures that change it are separate, so many procedures may touch the same data, and a change to the data's structure can ripple through the program.
Object-oriented programming (OOP)
OOP organizes a program around objects , which bundle data and the operations on that data.
- Term Meaning
- Class A blueprint that defines the data and methods of a type of object
- Object / instance A specific thing created from a class, often with new
- Instance variable (field, attribute) Data stored in each object
- Method A procedure defined in a class that operates on an object
- Constructor A special method that initializes a new object
- Encapsulation Keeping data private and exposing it only through public methods
- Inheritance A subclass ( extends ) reuses and extends a superclass
- Polymorphism The same method call behaves differently depending on the object's actual class
- Abstraction Exposing what an object does while hiding how
Examples: Java, C#, C++, Python, and Ruby. Sections 12.3 and 12.4 cover OOP in detail.
Strengths: models real-world entities naturally; encapsulation protects data; inheritance and polymorphism support reuse and extension; and it scales well to large team projects.
Weaknesses: more design effort and code up front, and deep inheritance hierarchies can become rigid.
The same task in two paradigms
Procedural: the data (a balance) and the procedure are separate. The procedure receives the data. double deposit ( double balance, double amount )
- if ( amount > 0 )
- return balance + amount
- end if
- return balance
- end deposit
- Object-oriented: the data and its operations live together in a class. class Account
- private double balance
- public void deposit ( double amount )
- if ( amount > 0 )
- balance ← balance + amount
- end if
- end deposit
- end class Account
In the OOP version, only Account 's methods can change balance , so the rule "deposits must be positive" is enforced in one place.
Other paradigms to recognize
Paradigm Core idea Key terms Examples
Functional Compute by applying and combining functions; avoid changing state Pure function (no side effects), immutability, higher-order function (a function that takes or returns a function), recursion, map / filter / reduce Haskell, Lisp, Scheme; functional features in Python and JavaScript
Declarative Describe what result you want, not how to get it Query, rule, constraint SQL ( SELECT … WHERE … ), HTML, spreadsheet formulas
Logic (a kind of declarative) State facts and rules; the system infers answers Fact, rule, query Prolog
Event-driven Code runs in response to events Event, handler, callback, event loop JavaScript interfaces, Scratch, mobile apps (Section 11.1)
Comparing paradigms
- Question Procedural Object-oriented Functional
- How is code organized? Procedures Classes and objects Functions
Where does data live? Variables and data structures passed to procedures Inside objects, encapsulated Immutable values passed between functions
How is state changed? By assignment statements By methods that change an object's fields Avoided; new values are created instead
Main reuse mechanism Calling procedures Inheritance, composition, polymorphism Composing and passing functions
Well suited to Scripts, algorithms, small programs Large systems of interacting entities: games, interfaces, simulations Data transformation, concurrency (no shared state to corrupt)
No paradigm is best for everything. Choose based on the problem, the team, and the language. A program can also mix styles, for example an OOP application whose methods use procedural loops and functional list operations.