Brian
Search
CTRL + K
Brian
Search
CTRL + K
Leeds University
Computer Science
Compulsory Modules
Computer Architecture
Section 1 - Organisation
History
Section 1 - Organisation
Section 10 - Cache Memory
Associative Cache Mappings
Associative Cache Mappings
Set Associative Mapping
Definitions
Magic Memory
Memory Hierarchy
Wishful Memory
Direct Mapped Cache
Direct Mapped Cache
DMC - Spatial Locality
Average Memory Access Time
Cache Block Replacement Policies
Section 10 - Cache Memory
Why Caching Works
Section 11 - Operating System Support and Virtual Memory
Page Table
Page Table Entry (PTE)
Page Table
Translation Look-Aside Buffer (TLB)
Page Fault
Section 11 - Operating System Support and Virtual Memory
Virtual Memory
Section 17 - The System Bus
Address Lines
Control Lines
Data Lines
Section 17 - The System Bus
Section 2 - Systems Concepts and Systems Architecture
Section 2 - Systems Concepts and Systems Architecture
Systems Architecture
Section 3 - Number Systems
Section 3 - Number Systems
Section 4 - Representing Numbers
Definitions
Most Significant Bit
Scientific Representation
Normalisation
Scientific Representation
Signed Integer Representation
Sign-Magnitude Representation
Signed Integer Representation
Two_s Compliment
127-Bias Notation
Binary Coded Decimal
Floating Point
Section 4 - Representing Numbers
Section 5 - The Instruction Cycle
Section 5 - The Instruction Cycle
Section 6 - System Interrupts
Section 6 - System Interrupts
Section 8 - CPU Structure and Pipelining
Section 8 - CPU Structure and Pipelining
Section 9 - Memory
Definitions
Access Time
Checksum
Direct Access
Dynamic RAM
Hamming Distance
Machine Word
Memory Capacity
Memory Cycle Time
Parity Bit
RAM
Random Access
ROM
Sequential Access
Static RAM
Transfer Rate
Memory Errors
Section 9 - Memory
Semiconductor Memory
Computer Architecture
CW1 Notes
Computer Processors
Logic Gates
Minimisation
Arithmetic Logic Unit
Computer Processors
Hardware Description Language
Machine Code
Memory
Registers
Databases
1. Introduction
1. Introduction
10. Ethics
10. Ethics
2. Database Environment & Architecture
2. Database Environment & Architecture
3. Relational Data Model
3. Relational Data Model
4. Relational Algebra
4. Relational Algebra
5. Entity-Relationship Modelling
5. Entity-Relationship Modelling
6. Logical Database Design
6. Logical Database Design
7. Normalisation
7. Normalisation
8. Database Security and Administration
8. Database Security and Administration
9. Transaction Management
9. Transaction Management
Combined
Databases
Discrete Mathematics
1. Combinatorics
1.1 Basic Counting Principles
1.1 Basic Counting Principles
Sequential Counting Procedures
The Addition Principle
The Multiplication Principle
1.2 Selections
1.2 Selections
1.2.1 Permutations
1.2.2 Combinations
1.2.3 Permutations with Unlimited Repetition
1.2.4 Combinations with Unlimited Repetition
1.3 Binomial Coefficients and Combinatorial Identities
1.3 Binomial Coefficients and Combinatorial Identities
1.4 The Pigeonhole Principle
1.4 The Pigeonhole Principle
Definitions
Combinatorial Proof
Theorems
Theorem 1.1
Theorem 1.2
Theorem 1.3
Theorem 1.4
Theorem 1.5
Theorem 1.6
Theorem 1.7
1. Combinatorics
2. Discrete Probability Theory
Definitions
Event
Experiment
Sample Space
Theorems
Corollary 2.1
Theorem 2.1
Theorem 2.2
Theorem 2.3
Theorem 2.4
2. Discrete Probability Theory
2.1 Finite Probability Spaces
2.2 Equiprobable Spaces
2.3 Conditional Probability
2.4 Independent Events
2.5 Bayes' Theorem
3. Graph Theory
Definitions
Directed Graph
Loop
Multigraph
Parallel Edge
Path
Simple Graph
Simple Path
Weighted Graph
Theorems
Corollary 3.1
Lemma 3.1
Theorem 3.1
3. Graph Theory
3.2 Graph Models
3.3 Isomorphic Graphs
3.4 Vertex Degree
3.5 Paths and Cycles
Discrete Mathematics
Fundamental Math Concepts
5. Set Theory
Definitions
Definition 5.1 (Sets)
Definition 5.10 (Cardinality)
Definition 5.12 (The Power Set)
Definition 5.14 (Pairs and Tuples)
Definition 5.16 (Cartesian Product of Two Sets)
Definition 5.18 (Cartesian Product)
Definition 5.19 (Set Operations)
Definition 5.20 (Compliments)
Definition 5.25 (Relations)
Definition 5.26 (Function)
Definition 5.27 (Domain, Codomain, Image, Preimage)
Definition 5.27.1 (Domain, Codomain)
Definition 5.27.2 (Image, Preimage)
Definition 5.27.3 (Range)
Definition 5.28 (Injective)
Definition 5.29 (Surjective)
Definition 5.3 (Empty Set)
Definition 5.30 (Bijective)
Definition 5.31 (Real and Integer Valued)
Definition 5.32 (Composition of Functions)
Definition 5.34 (Equivalence Relations)
Definition 5.36 (Equivalence Classes, Representitives)
Definition 5.36 (Relations)
Definition 5.37 (Reflexive)
Definition 5.37
Definition 5.38.1 (Symmetric)
Definition 5.38.2 (Antisymmetric)
Definition 5.39 (Transitive)
Definition 5.41 (Total)
Definition 5.5 (Subsets and Supersets)
Theorems
Theorem 5.22 - Laws of Intersections and Unions
Absorption Laws
Associative Laws
Commutative Laws
Distributive Laws
Idempotent Laws
Theorem 5.22 - Laws of Intersections and Unions
Theorem 5.23 - Laws of Complements
Theorem 5.24
Theorem 5.35
Theorem 5.9
5. Set Theory
5.1 Sets
5.4 Relations
Definitions
Definition 2.30 (Directed Graph)
Fundamentals of Logic
Definitions
Contingency
Contradiction
Formula
Literal
Tautology
Truth Assignment
Truth Value
Normal Forms
Conjunctive Normal Form
Disjunctive Normal Form
Normal Forms
Predicate Logic
Negating Quantification
Negating a Universal Quantification
Negating an Existential Quantification
Negating Quantification
Quantification
Existential Quantification
Universal Quantification
Free and Bound Variables
Predicate Logic
Propositional Logic
Connectives
Biconditional
Conjunction
Disjunction
Implication
Negation
De Morgan_s Laws
Logical Equivalence
Logical Laws
Propositional Logic
Fundamentals of Logic
Proof Techniques
Definitions
Parity
Theorem
Theorems
Theorem 4.2
Theorem 4.7
Equivalence Proofs
Proof by Contradiction
Proof by Contraposition
Proof by Induction
Proof Techniques
Fields
Fundamental Math Concepts
Inner Product
Linear Functions
Vector Product
Vector Space
OOP Programming
Baccarat
OOP Programming
Procedural Programming
Double Pointers
Dynamic Memory Allocation
Pointers
Procedural Programming
Professional Computing
!Ethics
!Ethics
1. Introduction to Ethics and Professionalism
2. Moral Responsibility
3. Challenging Authority
4. Surveillance and Privacy
5. Hacking and Property
6. Equality and Inclusion
CW1 - Group Project
CW1 - Group Project
Functional and Non-Functional Requirements
CW2 - Technical Report
CW2 - Technical Report
Report Plan
Report Structure
Todos
Week 2.1 - Age of Computing
Week 2.1 - Age of Computing
Week 2.2 - Hardware
Early Computing
Week 2.2 - Hardware
Week 3.1 - Networks and Software
Early History of the Internet and Web
Early Networks
Week 3.1 - Networks and Software
Week 3.2 - Software Development Process
1. Initiation
2. Feasibility Study
3. Requirements Analysis
4. System Design
5. Build
6. Implement
7. Maintain
8. Kill
Week 3.2 - Software Development Process
Week 7.1 - Designing and Buying Systems
Definitions
Analysis
Design
Week 7.1 - Designing and Buying Systems
Y1 Talks
Real Life Software Engineering
Professional Computing
Report Writing
Compulsory Modules
Optional Modules
Intro to Programming
Intro to Programming
Intro to Web Technologies
Design for Coursework 2
Intro to Web Technologies
Optional Modules
Computer Science
Leeds University
Template
Publish Template
Homer
Contradiction
##Definition
A
formula
that is false under every
truth assignment
.