EECS1028M FINAL EXAM 2022 Solutions York University EECS 1028
61 views 0 purchase
Course
EECS 1028
Institution
EECS 1028
York University
Department of Electrical Engineering and Computer Science
Lassonde School of Engineering
EECS1028M FINAL EXAM, April 27, 2022; 2:00–4:00PM
SOLUTIONS
Professor George Tourlakis
Question 1. (a) (1 MARK) What does Principle 2 state?
Answer. “Every state has some state follow...
eecs1028m final exam 2022 solutions york university eecs 1028
york university department of electrical engineering and computer science lassonde school of engineering eecs1028m final exam
Written for
EECS 1028
All documents for this subject (2)
Seller
Follow
ExamsConnoisseur
Reviews received
Content preview
York University
Department of Electrical Engineering and Computer Science
Lassonde School of Engineering
EECS1028M FINAL EXAM, April 27, 2022; 2:00–4:00PM
SOLUTIONS
Professor George Tourlakis
Question 1. (a) (1 MARK) What does Principle 2 state?
Answer. “Every state has some state following it”.
(b) (1 MARK) Define “labelling” of the members of a class A —where the legal labels are
the members of a set L.
Answer. “A Labelling of the members of A from L is the assignment (say, as sub-
scripts) of members of L to each member of A so that we never assign the same label
to any two distinct members of A”.
(c) (2 MARK) State Principle 3.
Answer. “If A has a labelling from a set L, then A is itself a set”.
, EECS 1028 M FINAL EXAM April 2022
Question 2. (a) (2 MARKS ) Let < be an arbitrary order.
Translate in MATHEMATICAL language the quoted statement: “< has MC”.
Definition. < has MC iff every nonempty class A has an <-minimal member a. In
symbols:
“< has MC iff every nonempty class A has some a ∈ A such that NO b ∈ A satisfies b < a”.
Or (this formulation is not required), totally in symbols,
A ̸= ∅ → (∃a ∈ A)A ∩ (a) > = ∅
(b) (2 MARKS ) Does the usual < on the integers Z = {. . . , −2, −1, 0, 1, 2, . . .} have MC?
Justify your answer.
Answer. No. For example, Z ̸= ∅, yet, for any k ∈ Z, we have Z ∋ k − 1 < k.
(c) (5 MARKS) Now suppose that some < —which is NOT THE USUAL ONE on N—
indeed has MC.
Prove that there is NO infinite (enumerable) sequence of objects ai —these are NOT
NECESSARILY NUMBERS— for which the “infinite descending (by size) chain” below
represents a true statement about the ai :
. . . < ai+1 < ai < . . . < a2 < a1 < a0 (1)
Hint. If we do have the truth of (1) for some “well-chosen” ai , then consider the set
WHY is (2) a “SET”?
Proof. Per Hint, consider the class B in (2) above. We assumed we have the chain (1) so the
ai ’s are no fiction: B ̸= ∅. Take any b ∈ B. This is, say, b = ak .
Now ak+1 < b, so b cannot be minimal. As b was arbitrary in B, we contradicted that < has
MC.
Incidentally, by Principle 3, B is a set, but we do not need this fact in the proof.
2
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller ExamsConnoisseur. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $9.49. You're not tied to anything after your purchase.
