Computing Paradigm Flashcards
Fundamental approach to programming and problem solving,
defining how software is designed and implemented.
COMPUTING PARADIGM
Uses control structures like loops (for, while), conditionals (if, else), and sequences to create clear, readable code.
STRUCTURED PROGRAMMING
Focuses on describing how a program operates with explicit instructions.
IMPERATIVE PROGRAMMING
Breaks down tasks into procedures or functions, which encapsulate specific operations.
PROCEDURAL PROGRAMMING
Divides programs into separate modules or components, each handling a specific aspect of the application.
MODULAR PROGRAMMING
Organizes software around objects that combine data (attributes) and behavior (methods).
OBJECT-ORIENTED PROGRAMMING(OOP)
Specifies what the program should achieve without dictating how to accomplish it.
DECLARATIVE PROGRAMMING
Treats computation as the evaluation of mathematical functions, avoiding state changes and mutable data.
FUNCTIONAL PROGRAMMING
Uses facts, rules, and queries to derive conclusions, focusing on problem-solving through logical inference.
LOGIC PROGRAMMING
Specialized languages tailored for specific application areas, simplifying tasks in those domains.
DOMAIN-SPECIFIC LANGUAGES (DSLs)
Involves executing multiple computations simultaneously to improve performance and responsiveness.
CONCURRENT COMPUTING
Executes multiple processes in parallel, using multiple processors or cores to solve large-scale problems efficiently.
PARALLEL COMPUTING
Distributes tasks across multiple networked computers, allowing for resource sharing and scalability.
DISTRIBUTED COMPUTING
Program behavior is determined by events such as user actions, sensor outputs, or messages.
EVENT-DRIVEN PROGRAMMING
Features: Utilizes event loops and handlers to manage asynchronous tasks efficiently.
Employs quantum mechanics principles to perform calculations, offering potential for massive parallelism and complex problem-solving.
QUANTUM COMPUTING
Features: Uses quantum bits (qubits) that can exist in multiple states simultaneously (superposition) and be entangled for complex interactions.
Specific framework or architecture used to implement and organize computations.
COMPUTING MODEL
A computer architecture model where a single memory stores both instructions and data.
VON NEUMANN ARCHITECTURE
An architecture that separates storage and pathways for instructions and data.
HARVARD MODEL
Utilizes multiple processors to perform computations simultaneously.
PARALLEL COMPUTING MODEL
Uses a network of independent computers to work together on a problem.
DISTRIBUTED COMPUTING MODEL
Divides tasks between servers (providing resources/services) and clients (requesting resources/services).
CLIENT-SERVER MODEL
All nodes in the network have equal roles and can act as both clients and servers.
PEER-TO-PEER (P2P) MODEL
Provides on-demand computing resources and services over the internet.
CLOUD COMPUTING MODEL
Utilizes principles of quantum mechanics to perform computations.
QUANTUM COMPUTING MODEL
Theoretical framework based on the Turing machine, a model of computation introduced by Alan Turing.
TURING MODEL
