User contributions for Bfh-sts

Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

20 October 2025

  • 14:3314:33, 20 October 2025 diff hist +1,492‎ N DMA & System Architectures (Amiga→PC→SoC) ‎ Created page with "= DMA & System Architectures (Amiga→PC→SoC) = This page explains how Direct Memory Access (DMA) improves system performance and shows examples of different hardware architectures. == Direct Memory Access (DMA) == In a system without DMA, the CPU must handle every data transfer: # Read data from peripheral into a register. # Write the data from the register into memory. This creates overhead and slows down performance. With DMA, a peripheral can transfer data direc..." current
  • 14:3314:33, 20 October 2025 diff hist +1,779‎ N CPU & Buses: How the CPU Talks to the World ‎ Created page with "= CPU & Buses: How the CPU Talks to the World = This page introduces the internal structure of the CPU and explains how it communicates with memory and peripherals through buses. == CPU building blocks == The CPU is the central unit that executes instructions. Its main components are: * Arithmetic Logic Unit (ALU) for arithmetic and logical operations. * Registers for storing temporary values and instruction pointers. * Control logic for decoding instructions and direct..." current
  • 14:3314:33, 20 October 2025 diff hist +3,163‎ N Memory in Practice: Organization, Caches, Alignment, ROM & Storage ‎ Created page with "__TOC__ = Memory in Practice: Organization, Caches, Alignment, ROM & Storage = This page explains how modern memory works in practice: how dynamic RAM is organized, why caches are necessary, how alignment affects performance, and how ROM and storage devices differ from RAM. == DRAM organization and access time == Dynamic RAM (DRAM) is arranged in a grid of rows and columns. * To read a bit, a whole row (often thousands of bits) must first be activated. * After activati..." current
  • 14:3314:33, 20 October 2025 diff hist +3,917‎ N Memory: From Relays to DRAM ‎ Created page with "= Memory: From Relays to DRAM = This page traces the evolution of memory technology: how information was stored, from mechanical relays to modern transistor-based RAM. It explains why each step was necessary and what trade-offs were involved. == What Is Memory? == In computer science, '''memory''' is any container that holds a pattern (0/1) until it is changed. * Everyday example: a light switch. The switch remembers its position until flipped. * In computers: voltag..." current
  • 14:3314:33, 20 October 2025 diff hist +2,318‎ N Hardware & OS: Overview ‎ Created page with "= Hardware & OS: Overview = This page introduces the basic model of a computer and explains how the '''hardware''' and the '''operating system''' interact. It provides the mental map for the following pages. == What is a Computer Built Of? == A computer can be very simple (a microcontroller in an electric toothbrush) or highly complex (a multi-CPU server). In both cases, the core elements are the same: * '''Central Processing Unit (CPU)''': executes instructions (c..." current
  • 14:3214:32, 20 October 2025 diff hist +571‎ N Category:Hardware and Operating Systems ‎ Created page with "= Overview = This category is part of ''Computer Science Basics''. It covers core hardware concepts (CPU, memory, I/O) and the essentials of operating systems. == Pages == * Hardware & OS: Overview * Memory: From Relays to DRAM * Memory in Practice: Organization, Caches, Alignment, ROM & Storage * CPU & Buses: How the CPU Talks to the World * DMA & System Architectures (Amiga→PC→SoC) * Operating Systems: Evolution, Models & Families * GNU/L..." current
  • 14:3214:32, 20 October 2025 diff hist +1,234‎ N Tautologies and contradictions ‎ Created page with "= Tautologies and contradictions = Tautologies and contradictions are special types of logical formulas that are always true or always false, regardless of the truth values of their components. == Tautologies == A tautology is a statement that evaluates to true under all possible interpretations. Tautologies are useful in proofs and as logical identities. === Examples === * p ∨ ¬p (Law of excluded middle) * (p → q) ∨ (q → p) * (p ∨ q) → (q ∨ p)..." current
  • 14:3214:32, 20 October 2025 diff hist +724‎ N Contraposition ‎ Created page with "= Contraposition = Contraposition is a transformation of an implication that produces a logically equivalent statement by reversing and negating its components. == Statement == * p → q ≡ ¬q → ¬p == Explanation == The implication "If p, then q" is equivalent to "If not q, then not p". This is often used in mathematical proofs. == Example == * "If it rains, then the ground is wet" ≡ "If the ground is not wet, then it does not rain". == Truth Table == {..." current
  • 14:3114:31, 20 October 2025 diff hist +986‎ N Implication transformations ‎ Created page with "= Implication transformations = Implication can be expressed using other logical operators. These transformations allow ''p → q'' to be rewritten in equivalent forms. == Statements == * p → q ≡ ¬p ∨ q * ¬(p → q) ≡ p ∧ ¬q * p ↔ q ≡ (p → q) ∧ (q → p) == Explanation == * The implication ''p → q'' is equivalent to "not p or q". * The negation of ''p → q'' is equivalent to "p and not q". * Equivalence ''p ↔ q'' can be defined using tw..." current
  • 14:3114:31, 20 October 2025 diff hist +65‎ Neutral and dominance laws ‎No edit summary current
  • 14:3114:31, 20 October 2025 diff hist +1,033‎ N Neutral and dominance laws ‎ Created page with "= Absorption laws = The absorption laws show how certain combinations of conjunction and disjunction can be simplified by "absorbing" one proposition into another. == Statements == * p ∨ (p ∧ q) ≡ p * p ∧ (p ∨ q) ≡ p == Explanation == Adding extra conditions that are already implied by ''p'' does not change the truth value. These laws allow expressions to be reduced in complexity. == Examples == * "I study OR (I study AND I rest)" is logically equivalen..."
  • 14:3114:31, 20 October 2025 diff hist +1,033‎ N Absorption laws ‎ Created page with "= Absorption laws = The absorption laws show how certain combinations of conjunction and disjunction can be simplified by "absorbing" one proposition into another. == Statements == * p ∨ (p ∧ q) ≡ p * p ∧ (p ∨ q) ≡ p == Explanation == Adding extra conditions that are already implied by ''p'' does not change the truth value. These laws allow expressions to be reduced in complexity. == Examples == * "I study OR (I study AND I rest)" is logically equivalen..." current
  • 14:3114:31, 20 October 2025 diff hist +1,273‎ N De Morgan's laws ‎ Created page with "= De Morgan's laws = De Morgan's laws describe the interaction between negation, conjunction, and disjunction. They provide rules for transforming logical statements into equivalent forms. == Statements == * ¬(p ∧ q) ≡ ¬p ∨ ¬q * ¬(p ∨ q) ≡ ¬p ∧ ¬q == Explanation == Negating a conjunction is equivalent to the disjunction of the negations. Negating a disjunction is equivalent to the conjunction of the negations. These transformations are widely u..." current
  • 14:3014:30, 20 October 2025 diff hist +689‎ N Double negation ‎ Created page with "= Double negation = The law of double negation states that the negation of a negation returns the original proposition. == Statement == * ¬(¬p) ≡ p == Explanation == If it is not the case that ''p'' is false, then ''p'' must be true. This allows simplification of expressions with two consecutive negations. == Example == * "It is not true that it is not raining" is equivalent to "It is raining". * In Python: <code>not (not p)</code> evaluates to the same as <cod..." current
  • 14:3014:30, 20 October 2025 diff hist +727‎ N Law of non-contradiction ‎ Created page with "= Law of non-contradiction = The law of non-contradiction states that a proposition and its negation cannot both be true at the same time. == Statement == * p ∧ ¬p ≡ falsch (false) == Explanation == No proposition can be simultaneously true and false. This principle is a cornerstone of classical logic and prevents contradictions in reasoning. == Example == * For ''p'' = "It is raining", it cannot be both "It is raining" and "It is not raining" at the same time..." current
  • 14:3014:30, 20 October 2025 diff hist +802‎ N Law of excluded middle ‎ Created page with "= Law of excluded middle = The law of excluded middle states that for any proposition ''p'', either ''p'' is true or its negation ''¬p'' is true. There is no third possibility. == Statement == * p ∨ ¬p ≡ wahr (true) == Explanation == Every proposition is either true or false, never both, and never something in between. This principle is central to classical logic, but is not accepted in some non-classical logics (e.g. intuitionistic logic). == Example == *..." current
  • 14:3014:30, 20 October 2025 diff hist +1,515‎ N Distributive laws ‎ Created page with "= Distributive laws = The distributive laws describe how conjunction and disjunction distribute over each other. They show that a conjunction can be distributed over a disjunction, and a disjunction can be distributed over a conjunction. == Statements == * p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) * p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) == Explanation == These rules are similar to the distributive property in arithmetic. They allow logical formulas to be r..." current
  • 14:3014:30, 20 October 2025 diff hist +1,353‎ N Associative laws ‎ Created page with "= Associative laws = The associative laws state that when combining three or more propositions with conjunction or disjunction, the grouping of the operations does not affect the truth value. == Statements == * (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) * (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) == Explanation == Parentheses can be rearranged without changing the logical meaning. == Examples == * "((I study AND I practice) AND I succeed)" is equivalent to "(I study AND (I practi..." current
  • 14:2914:29, 20 October 2025 diff hist +952‎ N Commutative laws ‎ Created page with "= Commutative laws = The commutative laws state that the order of propositions does not affect the truth value of conjunction or disjunction. == Statements == * p ∧ q ≡ q ∧ p * p ∨ q ≡ q ∨ p == Explanation == The logical value of a conjunction or disjunction remains unchanged when the order of the operands is swapped. == Examples == * "I study AND I pass the exam" is equivalent to "I pass the exam AND I study". * "It rains OR it snows" is equivalent to "I..." current
  • 14:2914:29, 20 October 2025 diff hist +750‎ N Idempotent laws ‎ Created page with "= Idempotent laws = The idempotent laws state that combining a proposition with itself using either conjunction or disjunction does not change its truth value. == Statements == * p ∧ p ≡ p * p ∨ p ≡ p == Explanation == A proposition combined with itself is logically equivalent to the proposition alone. == Examples == * "I study AND I study" is logically the same as "I study". * "I study OR I study" is also logically the same as "I study". == Truth Table (Con..." current
  • 14:2914:29, 20 October 2025 diff hist +889‎ N Peirce arrow ‎ Created page with "= Peirce arrow = The Peirce arrow (also called ''NOR'') is a logical operation that returns true only when both propositions are false. It is functionally complete, meaning all other logical operations can be expressed in terms of it. == Symbols == * p ↓ q (mathematical notation) * p NOR q (common name) * ¬(p ∨ q) (definition) == Definition == The Peirce arrow produces the negation of disjunction. == Truth Table == {| class="wikitable" ! p !! q !! p ↓ q |- |..." current
  • 14:2914:29, 20 October 2025 diff hist +959‎ N Exclusive disjunction ‎ Created page with "= Exclusive disjunction = Exclusive disjunction (often abbreviated as XOR) is the logical operation that returns true if exactly one of the propositions is true, but not both. == Symbols == * p ⊕ q (standard notation) * p XOR q (common in computer science) * (p ∨ q) ∧ ¬(p ∧ q) (definition using basic operators) == Definition == The exclusive disjunction ''p ⊕ q'' is true if either ''p'' or ''q'' is true, but false if both are true or both are false. == Tru..." current
  • 14:2814:28, 20 October 2025 diff hist +991‎ N Sheffer stroke ‎ Created page with "= Sheffer stroke = The Sheffer stroke (also called ''NAND'') is a logical operation that returns true unless both propositions are true. It is functionally complete, meaning all other logical operations can be built from it. == Symbols == * p ↑ q (mathematical notation) * p NAND q (common name) * NOT (p ∧ q) (definition) == Definition == The Sheffer stroke produces the negation of conjunction. == Truth Table == {| class="wikitab..." current
  • 14:2814:28, 20 October 2025 diff hist +897‎ N Equivalence ‎ Created page with "= Equivalence = Equivalence is the logical operation corresponding to "IF AND ONLY IF". It states that two propositions are logically identical in truth value. == Symbols == * p ↔ q (standard notation) * p ⇔ q (alternative) * p IFF q (short for "if and only if") == Definition == The equivalence ''p ↔ q'' is true if ''p'' and ''q'' have the same truth value. It is false if their truth values differ. == Truth Table == {| class="wikitable" ! p !! q !! p ↔ q..." current
  • 14:2814:28, 20 October 2025 diff hist +943‎ N Implication ‎ Created page with "= Implication = Implication is the logical operation corresponding to "IF ... THEN". It expresses that if one proposition holds, then another must also hold. == Symbols == * p → q (standard notation) * p ⊃ q (alternative) * IF p THEN q (verbal) == Definition == The implication ''p → q'' is false only when ''p'' is true and ''q'' is false. In all other cases it is true. Additionally, ''p → q'' can be reformed into ''¬ p ∨ q'' == Truth Table == {| class..." current
  • 14:2814:28, 20 October 2025 diff hist +766‎ N Disjunction ‎ Created page with "= Disjunction = Disjunction is the logical operation corresponding to "OR". It returns true if at least one of the propositions is true. == Symbols == * p ∨ q (standard notation) * p | q (alternative) * p OR q (in programming) == Definition == The disjunction of ''p'' and ''q'' is true if either ''p'', or ''q'', or both are true. == Truth Table == {| class="wikitable" ! p !! q !! p ∨ q |- | T || T || T |- | T || F || T |- | F || T || T |- | F || F || F |} == E..." current
  • 14:2814:28, 20 October 2025 diff hist +748‎ N Conjunction ‎ Created page with "= Conjunction = Conjunction is the logical operation corresponding to "AND". It returns true only if both propositions are true. == Symbols == * p ∧ q (standard notation) * p & q (common alternative) * p AND q (in programming) == Definition == The conjunction of ''p'' and ''q'' is true if and only if both are true. == Truth Table == {| class="wikitable" ! p !! q !! p ∧ q |- | T || T || T |- | T || F || F |- | F || T || F |- | F || F || F |} == Examples == * If..." current
  • 14:2714:27, 20 October 2025 diff hist +681‎ N Negation ‎ Created page with "= Negation = Negation is the logical operation that inverts the truth value of a proposition. If a proposition ''p'' is true, then its negation ''¬p'' is false, and vice versa. == Symbols == * ¬p (standard notation) * ~p (alternative notation) * NOT p (common in programming) == Definition == Negation produces the opposite truth value of its operand. == Truth Table == {| class="wikitable" ! p !! ¬p |- | T || F |- | F || T |} == Examples == * If ''p'' = "It is ra..." current
  • 14:2714:27, 20 October 2025 diff hist +1,989‎ N Category:Propositional logic (Aussagenlogik) ‎ Created page with "= Overview = This page lists the most important terms and laws for the BFH module: '''Diskrete Mathematik I (BZG1155pa) 25/26''' = Propositional logic = Propositional logic (''Aussagenlogik'') is a formal system in logic that studies propositions and their relationships through logical connectives. It is the foundation of mathematical logic, computer science, and digital circuit design. == Propositions == A <code>proposition</code> (''Aussage'') is a declarative sta..." current
  • 14:2714:27, 20 October 2025 diff hist +13,061‎ N Data Types ‎ Created page with "= Java Data Type Categories = Java groups data into two families: '''primitive types''' (hold simple values) and '''reference types''' (hold references to objects on the heap). Unlike Python’s dynamic typing, Java is '''statically typed''': every variable has a declared type, checked at compile time. If you’ve used Go, that idea will feel familiar. == Quick map (what to reach for) == * Whole numbers: int (default) → long for timestamps/big ranges * Real numbers: d..." current
  • 14:0014:00, 20 October 2025 diff hist +22‎ Category:Computer Science Basics (BTI1021p) 25/26 ‎No edit summary current
  • 14:0014:00, 20 October 2025 diff hist +22‎ Category:Diskrete Mathematik I (BZG1155pa) 25/26 ‎No edit summary
  • 14:0014:00, 20 October 2025 diff hist +22‎ Category:Programming 1 with Java (BTI1001q) 25/26 ‎No edit summary current
  • 13:5913:59, 20 October 2025 diff hist +20‎ N Category:Kommunikation 1 Deutsch für die Informatik (BZG3110p) 25/26 ‎ Created page with "Category:Sidebar" current
  • 13:5913:59, 20 October 2025 diff hist −20‎ Category:Sidebar ‎No edit summary current
  • 13:5913:59, 20 October 2025 diff hist +115‎ N Category:Sidebar ‎ Created page with "= Overview = Subcategories of this category are displayed in the wiki sidebar on the left side. Category: Wiki" Tag: Visual edit: Switched
  • 13:5413:54, 20 October 2025 diff hist +77‎ Main Page ‎No edit summary
  • 13:5313:53, 20 October 2025 diff hist +1,981‎ N MediaWiki cheat sheet ‎ Created page with "= Cheat Sheet for the Mediawiki = = Overview = A list of commonly used MediaWiki formats. = Tips = To create a newline, you need to press Enter twice: <pre> This must be on a new line </pre> This must be on a new line <pre> This must be on a new line </pre> This must be on a new line = Lists = <pre> * One ** Two *** Three </pre> One ** Two *** Three <pre> # One # Two ## Two.one ### Two.one.one </pre> One Two Two.one Two.one.one = Bold and italic = <..." current
  • 13:5113:51, 20 October 2025 diff hist +51‎ N User:Bfh-sts ‎ Created page with "Collective consciousness of the students at the BFH" current
  • 12:0912:09, 20 October 2025 diff hist +29‎ Main Page ‎No edit summary
  • 12:0812:08, 20 October 2025 diff hist +94‎ Main Page ‎ →‎Welcome to the BFH BSCCS Documentation Wiki
  • 12:0012:00, 20 October 2025 diff hist +12‎ N File:this is fine.jpg ‎No edit summary current
  • 11:5311:53, 20 October 2025 diff hist −5‎ Main Page ‎ →‎Contributing
  • 11:5311:53, 20 October 2025 diff hist −38‎ Main Page ‎ →‎Welcome to the BFH BSCCS Documentation Wiki
  • 11:5311:53, 20 October 2025 diff hist +439‎ Main Page ‎No edit summary
  • 11:4711:47, 20 October 2025 diff hist +2,723‎ Main Page ‎No edit summary
  • 09:5109:51, 20 October 2025 diff hist +403‎ N Category:Computer Science Basics (BTI1021p) 25/26 ‎ Created page with "= Overview = This is the category of the BFH module Computer Science Basics (BTI1021p) 25/26. = Topics = * Category: Hardware and Operating Systems * Category: Numeral Systems * Category: Representing Numerical Values * Category: Text * Category: Development Process * Category: Programming Model * Category: Assembly Programming == Propositional logic - Exercises =="
  • 09:5109:51, 20 October 2025 diff hist +275‎ N Category:Diskrete Mathematik I (BZG1155pa) 25/26 ‎ Created page with "= Overview = This is the category of the BFH module Diskrete Mathematik I (BZG1155pa) 25/26. = Topics = * Category: Propositional logic (Aussagenlogik)‎ == Propositional logic - Exercises == * Exercises - 01 Kontrollaufgaben * Exercises - 02 Kontrollaufgaben"
  • 09:5009:50, 20 October 2025 diff hist +42‎ N Category:Programming 1 with Java (BTI1001q) 25/26 ‎ Created page with "This is the Jave Programming course at BFH"
  • 09:5009:50, 20 October 2025 diff hist +318‎ N Main Page ‎ Created page with "This is a category for all BFH Related documentations == Module == * Category: Kommunikation 1 Deutsch für die Informatik (BZG3110p) 25/26 * Category: Programming 1 with Java (BTI1001q) 25/26 * Category: Diskrete Mathematik I (BZG1155pa) 25/26 * Category: Computer Science Basics (BTI1021p) 25/26"
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://bsccs.stoney-wiki.com/wiki/Special:Contributions/Bfh-sts"