## Homework 2

Homework 2 is due on Monday, May 31st.

1. Read Chapter 4. Indicating in at most three sentences one or more of the following: the passage in the reading— including its page number—you:

• Found most difficult
• Found most surprising
• Would like to have discussed in the next lectur

2. To successfully complete a B.S. degree in CISE, students must satisfy the following requirements:

• Complete at least 5 of 10 core courses.
• Complete at least 72 credit hours.

Know that each course worths 3 credit hours and there are 20 optional coures. A student plans to complete the degree with minimum number of credit hours. How many choice does he have, no matter the order of selected courses.

3. Seven darts are thrown onto a circular dartboard of radius 10 units. Can we show that there will always be two darts  which are at most 10 units apart?

4. Lattice paths are paths in the plane from (0, 0) to (x, y) (x, y are integers) where at each step you must move either one unit up or one unit right. Count the number of lattice paths from (0, 0) to (x, y).

5. How many 9-digit numbers are there if each has exactly one 5 digit and a 4 digit?

## Homework 1

Homework 1 is due on Monday, May 24th.

1. Read Chapter 1 and 4.1, 4.2. Indicating in at most three sentences one or more of the following: the passage in the reading— including its page number—you:

• Found most difficult
• Found most surprising
• Would like to have discussed in the next lecture

2. Prove or disprove:

$(A \vee B)\wedge(A \vee C \vee \neg B) \equiv (B \wedge C) \vee (A \wedge \neg B) \vee (A \wedge \neg C)$

3. Working at the local pizza parlor, I have a stack of unbaked pizza doughs. For a most pleasing presentation, I wish to arrange them in order of size, with the largest pizza on the bottom. I’m able to place my spatula under one of the pizzas and flip over the whole stack above the spatula (reversing their order). This is the only move I can do to change the order of the stack; however, I am willing to keep repeating this move until I get the stack in order. Is it always possible for me to get the pizzas in order? Prove your answer.

4. Explain what’s wrong with this reasoning: The students set off home for the weekend. Their teacher said: “You shall have an examination at nine in the morning one day next week; but you will not know in advance which day-it will be a surprise.” “Suppose,” thought one to herself with the desperation available only to the damned and the examinable: “Suppose we were still unexamined until Friday. I know there will be an examination some time this week, and so I would be able to expect the Friday examination. Therefore the teacher cannot possibly leave it until Friday.”  “Suppose further,” she thought to herself: “Suppose that I am still unexamined on Thursday. I know the examination cannot be on Friday, so it would have to come on Thursday. But then too I would have been able to predict its day. So, the teacher cannot leave it until Thursday either. Or Wednesday… or Tuesday… or Monday.. In fact, he cannot possibly set any examination at all, since no day would be a surprise!” And when the teacher handed out exam papers at nine o’clock on Wednesday morning — wasn’t she surprised!

5. Project idea: Investigating Automated Theorem Provers.

## Welcome to COT 3100

Welcome to COT 3100!

This site provides almost necessary  information relating the class. Students feel free to enter questions and answers here. The instructor and TAs will monitor and answer the questions regarding to lectures, projects and homeworks. To receive notification of new posts, check “Notify me of site updates” when posting a comment. Then the system will send out an confirmation email, click on the confirmation link in that email to complete the subscription.

Have an excellent summer together.