• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 2 out of 14 pages
Exam (elaborations)

DISCRETE STRUCTURES EXAM QUESTIONS ANSWERED CORRECTLY LATEST VERSION ()

Document preview thumbnail
Preview 2 out of 14 pages

DISCRETE STRUCTURES EXAM QUESTIONS ANSWERED CORRECTLY LATEST VERSION () p ∧ T = p - Answers Identity Laws p ∨ F = p - Answers Identity Laws p ∨ T = T - Answers Domination Laws p ∧ F = F - Answers Domination Laws p ∨ p = p - Answers Idempotent Law p ∧ p = p - Answers Idempotent Law ¬ ( ¬p ) - Answers Double Negation Law p ∨ q = q ∨ p - Answers Commutative Law p ∧ q = q ∧ p - Answers Commutative Law ( p ∧ q ) ∧ r = p ∧ ( q ∧ r ) - Answers Associative Law ( p ∨ q ) ∨ r = p ∨ ( q ∨ r ) - Answers Associative Law p ∨ (q ∧ r ) = ( p ∨ q ) ∧ ( p ∨ r ) - Answers Distributive Law p ∧ (q ∨ r ) = ( p ∧ q ) ∨ ( p ∧ r ) - Answers Distributive Law ¬ ( p ∧ q ) = ¬p ∨ ¬q - Answers De Morgan's Law ¬ ( p ∨ q ) = ¬p ∧ ¬q - Answers De Morgan's Law p ∧ ( p ∨ q ) = p - Answers Absorption Law p ∨ ( p ∧ q ) = p - Answers Absorption Law p ∧ ¬p = F - Answers Negation Law / Complement Law p ∨ ¬p = T - Answers Negation Law / Complement Law Mathematical language of computer science. - Answers DISCRETE STRUCTURES Set of steps for a computer program to accomplish a task. - Answers ALGORITHM Audio & Video Compression - Answers Lossless Lossy Route Finding Algorithms - Answers Dijkstra's Algorithm A* Search Algorithm D* Search Algorithm Optimization & Scheduling Algorithm - Answers Min-min Max-max Science of necessary inference or study of reasoning. - Answers LOGIC identifies valid mathematical argument. - Answers LOGIC TOOLS FOR DISCRETE STRUCTURES - Answers Logic Set Theory Functions Sequences Declarative sentence that is either true or false, but not both. - Answers STATEMENT Logic of compound statements built from simpler statements using boolean statements - Answers PROPOSITIONAL LOGIC Combination of one or more proposition. - Answers COMPOUND PROPOSITION Formed using logical operators. - Answers COMPOUND PROPOSITION ⊕ - Answers XOR ∧ - Answers CONJUNCTION (AND) ∨ - Answers DISJUNCTION (OR) ¬ - Answers NEGATION → - Answers IMPLICATION / CONDITIONAL ↔ - Answers BICONDITIONAL Statement that is always true. - Answers TAUTOLOGY Statement that is always false. - Answers CONTRADICTION Neither a Tautology or a Contradiction. - Answers CONTINGENCY p → q - Answers IMPLICATION q → p - Answers CONVERSE ¬p → ¬q - Answers INVERSE ¬q → ¬p - Answers CONTRAPOSITIVE Implication is LOGICALLY EQUIVALENT to ? - Answers CONTRAPOSITIVE Converse is LOGICALLY EQUIVALENT to? - Answers INVERSE Contrapositive is LOGICALLY EQUIVALENT to? - Answers IMPLICATION Inverse is LOGICALLY EQUIVALENT to? - Answers CONVERSE If they have the same truth table. - Answers LOGICAL EQUIVALENCE Predictable logic. - Answers QUANTIFIER LOGIC ∀ - Answers All ∃ - Answers Exists Which of the following is not your job as a Computer Scientist? Creating new algorithms none of the above Proving that your algorithm works Proving that your algorithms terminate - Answers none of the above You can't create your own algorithms. True False - Answers False Which algorithm is being used by Facebook to transmit videos quickly on the Internet. audio and video compression algorithm route finding algorithm scheduling algorithm

Content preview

DISCRETE STRUCTURES EXAM QUESTIONS ANSWERED CORRECTLY LATEST VERSION (2024-2025)



p ∧ T = p - Answers Identity Laws

p ∨ F = p - Answers Identity Laws

p ∨ T = T - Answers Domination Laws

p ∧ F = F - Answers Domination Laws

p ∨ p = p - Answers Idempotent Law

p ∧ p = p - Answers Idempotent Law

¬ ( ¬p ) - Answers Double Negation Law

p ∨ q = q ∨ p - Answers Commutative Law

p ∧ q = q ∧ p - Answers Commutative Law

( p ∧ q ) ∧ r = p ∧ ( q ∧ r ) - Answers Associative Law

( p ∨ q ) ∨ r = p ∨ ( q ∨ r ) - Answers Associative Law

p ∨ (q ∧ r ) = ( p ∨ q ) ∧ ( p ∨ r ) - Answers Distributive Law

p ∧ (q ∨ r ) = ( p ∧ q ) ∨ ( p ∧ r ) - Answers Distributive Law

¬ ( p ∧ q ) = ¬p ∨ ¬q - Answers De Morgan's Law

¬ ( p ∨ q ) = ¬p ∧ ¬q - Answers De Morgan's Law

p ∧ ( p ∨ q ) = p - Answers Absorption Law

p ∨ ( p ∧ q ) = p - Answers Absorption Law

p ∧ ¬p = F - Answers Negation Law / Complement Law

p ∨ ¬p = T - Answers Negation Law / Complement Law

Mathematical language of computer science. - Answers DISCRETE STRUCTURES

Set of steps for a computer program to accomplish a task. - Answers ALGORITHM

Audio & Video Compression - Answers Lossless

Lossy

, Route Finding Algorithms - Answers Dijkstra's Algorithm

A* Search Algorithm

D* Search Algorithm

Optimization & Scheduling Algorithm - Answers Min-min

Max-max

Science of necessary inference or study of reasoning. - Answers LOGIC

identifies valid mathematical argument. - Answers LOGIC

TOOLS FOR DISCRETE STRUCTURES - Answers Logic

Set Theory

Functions

Sequences

Declarative sentence that is either true or false, but not both. - Answers STATEMENT

Logic of compound statements built from simpler statements using boolean statements - Answers
PROPOSITIONAL LOGIC

Combination of one or more proposition. - Answers COMPOUND PROPOSITION

Formed using logical operators. - Answers COMPOUND PROPOSITION

⊕ - Answers XOR

∧ - Answers CONJUNCTION (AND)

∨ - Answers DISJUNCTION (OR)

¬ - Answers NEGATION

→ - Answers IMPLICATION / CONDITIONAL

↔ - Answers BICONDITIONAL

Statement that is always true. - Answers TAUTOLOGY

Statement that is always false. - Answers CONTRADICTION

Neither a Tautology or a Contradiction. - Answers CONTINGENCY

p → q - Answers IMPLICATION

Document information

Uploaded on
December 28, 2024
Number of pages
14
Written in
2024/2025
Type
Exam (elaborations)
Contains
Questions & answers
$8.89

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
TutorJosh
3.5
(76)
Sold
501
Followers
16
Items
32942
Last sold
20 hours ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions