───✱*.。:。✱*.:。✧*.。✰*.:。✧*.。:。*.。✱ ───

Module 15

    • a. No
    • b. Yes
    • c. No
    • a. Domain: set of all bit strings, Range:
    • b. Domain: set of all bit strings, Range: {2𝑛|𝑛0}
    • c. Domain: set of all bit strings, Range: {0,1,2,3,4,5,6,7}
    • d. Domain: +, Range: {𝑛2|𝑛+}
    • a. Domain: +×+, Range: +
    • b. Domain: +, Range: {0,1,2,,9}
    • c. Domain: set of all bit strings, Range: 0
    • d. Domain: set of all bit strings, Range: 0
    • a.1
    • b.0
    • c.0
    • d.1
    • e.3
    • f.1
    • g.2
    • h.1
    • a. Yes
    • b. No
    • c. No
    • a. Yes
    • b. No
    • c. No
    • a. each teacher has a unique office
    • b. each bus has at most one teacher assigned
    • c. each teacher has a distinct salary
    • d. always one-to-one if each teacher has a unique ssn
    • a. there are no unoccupied offices
    • b. no bus is left without a teacher
    • c. no salary level goes unused
    • d. every ssn is assigned to some teacher
    • a. Yes
    • b. No
    • c. Yes
    • d. No

Module 16

    • a.𝑂(1)
    • b.𝑂(𝑛)
    • c.𝑂(𝑛2)
    • d.𝑂(log𝑛)
    • e.𝑂(𝑛)
    • f.𝑂(𝑛)
    • a.3
    • b.4
    • c.1
    • d.0
    1. 1000log𝑛,𝑛,𝑛21000000,𝑛log𝑛,2𝑛,3𝑛,𝑛!,2𝑛!
    • a.𝑂(𝑛3)
    • b.𝑂(𝑛5)
    • c.𝑂(𝑛!)

───✱*.。:。✱*.:。✧*.。✰*.:。✧*.。:。*.。✱ ───