CS161 Questions and Answers Pack | New One | Grade A+

Refutation Theorem Ans: ∆╞ α iff ∆^¬α is inconsistent. Modus Ponens Ans: If the knowledge base contains α and α⇒β, then add β to the knowledge base. Modus Tollens Ans: If knowledge base contains α⇒β and ¬β, then add ¬α to knowledge base. ∆╞ α Ans: ∆ entails α, M...

Asymptotic Notation Ans: the classification of runtime complexity that uses functions that indicate only the growth rate of a bounding function Big-Oh Notation Ans: Represents the upper bound of the run-time of an algorithm, aka worst-case complexity O(g(n)) = { f(n): there exist positive cons...

What is a skolem constant? Ans: Used to remove existential quantifier from FOL to transform to propositional logic. C1. What is a definite clause? Give an example Ans: A clause with exactly one positive literal. Example: - NOT A or NOTB or C - C What is a Horn Clause? Is it CNF or DNF? Ans: ...

authenticity Ans: you can verify that the message came from the correct person confidentiality Ans: no one can read the message except the intended recipient integrity Ans: no one can change the message without being detected IND-CPA Ans: indistinguishable under chosen plaintext attack. defin...

Assuming goodData is a Boolean variable, the following two tests are logically equivalent. if (goodData == false) if (!goodData) Ans: T When a loop is nested inside another loop, the outer loop goes through all its iterations for each iteration of the inner loop. Ans: F To check if a variabl...

C++ arrays check for out-of-range index values Ans: false A for-loop is a convenient way to step through an array Ans: true A recursive function is a function whose definition contains a call to the function being defined. Ans: true . A recursive function can have local variables. Ans: true...