What is a proposition?
A proposition is a declarative statement that is either true or false, but not both.
Study 08 — Discrete Mathematics for Computer Science with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a proposition?
A proposition is a declarative statement that is either true or false, but not both.
When is an implication P → Q false?
P → Q is false only when P is true and Q is false.
Apply De Morgan’s law to ¬(P ∧ Q).
¬(P ∧ Q) ≡ ¬P ∨ ¬Q. Negating a conjunction negates each part and changes “and” to “or.”
How is ¬(∀x P(x)) rewritten?
¬(∀x P(x)) ≡ ∃x ¬P(x). Not every object has a property exactly when at least one object lacks it.
How many elements does 𝒫(A) have when A has n elements?
If A has n elements, its power set 𝒫(A) has 2ⁿ elements.
What is the Cartesian product A × B?
A × B = {(a,b) | a ∈ A and b ∈ B}; it contains every ordered pair with first component from A and second from B.
How can you prove two sets A and B are equal?
Prove A ⊆ B and B ⊆ A. Equivalently, show for an arbitrary x that x ∈ A ↔ x ∈ B.
What properties define an equivalence relation?
An equivalence relation is reflexive, symmetric, and transitive; it partitions a set into equivalence classes.
What properties define a partial order?
A partial order is reflexive, antisymmetric, and transitive.
What does it mean for a function to be injective?
A function is injective when distinct inputs have distinct outputs: f(a₁) = f(a₂) implies a₁ = a₂.
What does it mean for a function to be surjective?
A function is surjective when every element of its codomain is produced by at least one input.
How is the composition (g ∘ f)(a) defined?
For f : A → B and g : B → C, (g ∘ f)(a) = g(f(a)). Apply f first, then g.
A 14-question medium-difficulty quiz on Boolean algebra, logic gates, truth tables, and combinational circuits.
Learn how computer memory stores and addresses information, how RAM and ROM differ, and how caches and the memory hierarchy balance speed, capacity, and cost.
A 14-question quiz on trees, binary trees, traversals, recursive algorithms, and binary search trees. The questions progress from foundational concepts to applied reasoning about structure, complexity, and BST operations.
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
Learn how to choose, structure, document, and maintain software documentation for users, developers, integrators, and operators.
A structured guide to comparison-based sorting algorithms, their complexity, stability, memory use, and practical selection criteria.
Reviews how interrupts support event handling and multitasking, and how Linux system calls use the RISC-V `ecall` instruction and register conventions.
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.
A quiz on operating-system system calls, including privileged-operation requests, process creation and execution with fork, exec, and waitpid, and signal handling.