CS610 - Discrete Math & Algorithm Analysis
Fall 2008


Loyola College > Department of Computer Science > CS 610 > Homework
Homework Due Date Assignment
1 9/16/2008 pp. 15-17 Exercise Set 1.1: 1, 2, 14, 15, 17, 22, 25, 26, 41, 43, 47, 49
pp. 27-29 Exercise Set 1.2: 5, 10, 15, 18, 20b, 20f, 34, 38, 41
pp. 41-43 Exercise Set 1.3: 2, 5, 6, 10, 12, 13, 26, 29, 39
2 9/23/2008 pp. 41-43 Exercise Set 1.3: 26, 29, 39
pp. 55 Exercise Set 1.4: 12
i) Convert from base 2 to base 10: 110101001.1001; ii) Convert from base 10 to base 2: 709.76
pp. 86-88 Exercise Set 2.1: 1adf, 4, 9, 12
pp. 95-97 Exercise Set 2.2: 2, 9, 15abd, 21
pp. 108-111 Exercise Set 2.3: 3ac, 12bcd, 13, 38
3 9/30/2008 pp. 95-97 Exercise Set 2.2: 29, 32, 42, 45
pp. 108-111 Exercise Set 2.3: 57
pp. 122-124 Exercise Set 2.4: 2, 6, 22
pp. 213-215 Exercise Set 4.1: 7, 11, 16, 24, 28, 37, 47, 55, 62a
pp. 226-227 Exercise Set 4.2: 4, 5
4 10/7/2008 pp. 226-227 Exercise Set 4.2: 2, 11, 32
pp. 233-235 Exercise Set 4.3: 9, 17, 20, 23
pp. 253-254 Exercise Set 4.5: 6, 9
pp. 267-269 Exercise Set 5.1: 7, 9abef, 11aeg, 21bde, 29b
5 10/14/2008 pp. 267-269 Exercise Set 5.1: 22, 26
pp. 280-282 Exercise Set 5.2: 1, 2, 6, 8, 13, 21cd, 29, 31
pp. 290-292 Exercise Set 5.3: 7, 8, 19, 27, 39a, 43, 50, 51
6 10/21/2008 pp. 296 Exercise Set 5.4: 11
pp. 304-306 Exercise Set 6.1: 8, 12, 18
pp. 318-320 Exercise Set 6.2: 1, 6, 8, 9, 32, 36
pp. 330-333 Exercise Set 6.3: 2, 8, 14, 21, 24, 26abc
pp. 347-349 Exercise Set 6.4: 2
Extra Credit: How many different ways can the World Series proceed to its end?
7 11/4/2008 pp. 399-402 Exercise Set 7.1: 2, 11, 14, 15abc, 23, 28b
pp. 347-349 Exercise Set 7.2: 2, 6, 7, 12a, 36, 42
8 11/11/2008 pp. 430-431 Exercise Set 7.3: 7, 13, 26, 28
pp. 441-443 Exercise Set 7.4: 1, 5, 7, 15
pp. 760-763 Exercise Set 12.2: 3, 9, 10cd, 13, 16, 22, 29
1) Given the following formal definition of an NFA: 
     a) S = {s,p}
     b) I = {a,b}
     c) N(s,a) = {s,p}
        N(s,b) = {p}
        N(p,a) = &empty
        N(p,b) = {s}
     d) start state = s
     e) accepting state = s
   i) Draw the NFA
   ii) Find the equivalent DFA
   iii) Draw the DFA
2) Given the following formal definition of an NFA: 
     a) S = {s,p,q}
     b) I = {a,b}
     c) N(s,a) = {q}
        N(s,b) = {p}
        N(p,a) = {s}
        N(p,b) = &empty
        N(q,a) = {p}
        N(q,b) = {q,p}
     d) start state = s
     e) accepting state = p
   i) Draw the NFA
   ii) Find the equivalent DFA
   iii) Draw the DFA
pp. 760-763 Exercise Set 12.2: Extra Credit: 51
9 11/18/2008 pp. 773-775 Exercise Set 12.3: 1, 7
pp. 472-475 Exercise Set 8.1: 2, 6, 18, 22, 37, 39
pp. 485-487 Exercise Set 8.2: 1, 11, 20, 25
10 11/25/2008 pp. 485-487 Exercise Set 8.2: 29, 36
pp. 498-499 Exercise Set 8.3: 2, 3, 8, 9, 12, 18, 19, 24, 25
11 12/2/2008 pp. 517-518 Exercise Set 9.1: 1, 2, 13, 22, 26
pp. 529-531 Exercise Set 9.2: 4, 7, 15, 18
12 12/9/2008 pp. 529-531 Exercise Set 9.2: 5, 28, 30, 35
pp. 540-543 Exercise Set 9.3: 1, 4, 7, 9, 16, 31, 33
pp. 662-665 Exercise Set 11.1: 4, 8, 17, 18, 20, 22, 26
pp. 679-683 Exercise Set 11.2: 1, 9, 12, 16, 20
pp. 703-704 Exercise Set 11.4: 1, 4, 7