|
| |
Homework Guidelines
Please, adhere to the following guidelines when preparing
your homework for submission:
-
All homework
assignments MUST be electronically submitted to aboutams@jmu.edu. You may use
any Microsoft Office program to create your document. Only one document per
assignment is expected. The subject line of the e-mail you send should be
"CS-252 - Section n Homework
m", where n is your class section; either 1
or 2, and m is the homework number in the format
text_chapter.text_section; e.g. 3.5
-
Write your official name, i.e. the name on University records, and
e-mail address at the top of your document and in the body of your e-mail
message.
-
Late homework submissions are NOT accepted,
except when pre-arranged with me before the due date and for a reason I consider
acceptable.
-
All homework
assignments are due by 11:59pm EST on the due date
-
Make sure
you answer all the required problems and nothing else. Read each problem
carefully.
-
All Truth
tables should be formatted as instructed in the classroom.
I will
really appreciate and reward those who conform to the above guidelines.
Chapter
|
Section
|
Problems
|
Due Date
11:59pm
on
|
To Practice
(Unmarked only) |
To Submit |
|
|
|
|
|
|
Ch 10
|
10.1 |
1 -- 26 |
4(d) , 22 |
Fri 11/14/2003 |
| 10.2 |
1 -- 20 |
None, but as an Extra Credit submit
4(b) , 12(d) , 14(c) |
Mon 11/17/2003 |
| 10.3 |
1 -- 20 |
4 , 6(d) |
Mon 11/24/2003 |
| 10.4 |
1 -- 14 |
6(c) , 14(d) |
Wed 12/03/2003 |
|
Ch 7
|
7.1 |
1 -- 57 |
6(a,d) , 32 , 34(e,g) , 54(b) |
Mon 11/03/2003 |
|
Xtra Credit:
Prove or disprove: if R, S, and T are relations on a set A
( R ◦ S ) ◦
T = R ◦ ( S
◦ T ). That is the composition of relations
is associative.As a special case, is R2
◦ R = R ◦ R2 ? |
| 7.3 |
1 -- 36 |
none |
|
| 7.4 |
1 -- 26 |
6 , 26(b) |
Fri 11/7/2003 |
| 7.5 |
1 -- 48 |
8 , 18 , 38 |
Wed 11/12/2003 |
|
Ch 4
|
4.1 |
1 -- 58 |
38 , 52 |
Wed 10/22/2003 |
|
| 4.3 |
1 -- 41 |
24 , 40 |
Fri 10/24/2003 |
| Xtra Credit: Pseudo code for C(n,k) using Pascal's Identity |
| 4.4 |
1 -- 38 |
12 , 14 |
Mon 10/27/2003 |
| Xtra Credit: Prove Theorem 4 (os section 4.4) using Induction |
|
Ch 3
|
3.2 |
1 -- 30 |
4 , 16(b) , 24 |
Wed 10/15/2003 |
| 3.3 |
1 -- 30 |
10 , 14 , 20 |
Sun 10/19/2003 |
|
Ch. 2
|
2.4 |
1 -- 58 |
6 , 8(b,d,f) , 10(c,f,h) , 18(c,d) , 32 , 42 , 54(b) |
Wed 10/1/2003 |
|
Extra-Credit assignment. Only first 5
submissions of each section will be graded. |
| 2.5 |
1 -- 24 |
2(b) , 20 , 22(d) |
Mon 10/6/2003 |
|
Extra Credit: Do problem 27. Hint show that if k³1
then (3 divides 10k - 1) |
|
Here is a model of how you
should solve No. 20 |
|
Ch. 1
|
1.1 |
1 -- 34 |
6(c, e) , 18(b, g) , 24(e) |
Mon 9/1/2003 |
| 1.2 |
1 -- 48 |
nothing |
N/A |
| 1.3 |
1 -- 50 |
8(a, b) , 36(c, d) , 48 |
Mon 9/8/2003 |
| 1.4 |
1 -- 43 |
10(g, h) , 18(c, d) , 36(c) |
Tue 9/9/2003 |
| 1.5 |
1 -- 45 |
8(a) , 38 |
Wed 9/17/2003 |
| 1.6 |
1 -- 28 |
nothing |
N/A |
| 1.7 |
1 -- 53 |
11(b) , 18 , 28 , 49 (c, e) |
Sun 9/21/2003 |
| 1.8 |
1 -- 68 |
8, 18, 28, 62 |
Fri 9/26/2003 |
|
|
|
|
|
|
|
