CS Notes

Search

SearchSearch
      • Algorithmic Techniques
      • Algorithms and Data Structures
      • AVL Trees
      • Binary Heaps
      • Branch-and-Bound
      • Complexity Bounds
      • Data Types and Structures
      • Divide and Conquer
      • Dynamic Programming
      • Greedy Algorithm
      • Iterative Method for Recursive Complexities
      • Master Method for Recursive Complexities
      • Queues
      • Recursive Complexity Definitions
      • Substitution Method for Recursive Complexities
        • Addressing Modes
        • Arithmetic Operations
        • ARM Assembly
        • Assembler Directives
        • Booleans and Bitwise Operations
        • Conditional Execution
        • Implementing Arrays
        • Implementing Functions
        • Implementing Selection
        • Memory and Constants
        • Registers
        • Shifts and Rotations
      • Architecture
      • Assemblers
      • Direct Memory Access
      • Instruction Set Architectures
      • Polling and Interrupts
      • System Calls
      • Artificial Intelligence
      • Bayes Networks
      • Constraint Satisfaction Problems
      • Event Calculus
      • Feature Detection and Matching
      • Knowledge Acquisition
      • Language Models
      • Minimax
      • Monte Carlo Tree Search
      • Visual Odometry
      • Computation
      • Defining Languages
      • Regular Expressions
      • Bayesian Probability
      • Data Science
      • Hypothesis Testing
      • Machine Learning
      • Measures of Central Tendency
      • Measures of Spread
      • Sampling
      • Statistics as Parameter Estimation
      • Uncertainty
        • Assignment
        • Modules
        • Selection
        • Stimuli and Testbenches
        • Synthesis
        • Verilog
      • Binary Representation
      • Boolean Algebra
      • CAD Tooling
      • CPU Cache
      • Decoders
      • Engineering
      • Finite State Machines
      • MU0 Processor
      • NRZI Encoding
      • Register Transfer Level
      • Runtime Instruction Modification
      • SRAM and DRAM
      • Three Box Model
      • Timing and Delays
      • BCS Code of Conduct
      • Copyright
      • Ethical Frameworks
      • Ethics and Law
        • Clausal Normal Form
        • DPLL
        • Logic
        • Polarity
        • Quantified Boolean Formulae
        • Randomised Satisfiability Algorithms
        • Semantic Tableaux
        • Machine Learning
        • Bayesian Updating and Random Variables
        • Complex Numbers
        • Equivalence Classes and Partial Orders
        • Equivalence of Formulae and Their Normal Forms
        • Equivalence Relations and Modular Arithmetic
        • Formal Derivations and First-Order Logic
        • Functions and Sets
        • Induction for the Natural Numbers and Partial Functions
        • Injectivity and Surjectivity
        • Maths
        • Natural Deduction Rules
        • Notions for Partial Orders
        • Propositional Logic
        • Recursion for Syntax and the Natural Numbers
        • Rigorous Arguments and Binary Operations
        • Rules and Conditional Probabilities
        • Simple Probability
        • Compilers
        • Programming
    Home

    ❯

    Ethics and Law

    ❯

    Ethical Frameworks

    Ethical Frameworks

    1 min read

    An Ethical Framework is a set of rules and guidelines that should be followed in order to maintain ethical standards.

    Many organisations subscribe to or maintain an ethical framework, which must be observed by all members.

    Some ethical frameworks include:

    • BCS Code of Conduct
    • IEEE Code of Ethics
    • Ten Commandments of Computer Ethics
    • ACS Code of Ethics
    • ACS Code of Professional Conduct
    • ACM Code of Ethics and Professional Conduct

    Graph View

    Backlinks

    • Ethics and Law