Math 221 C
Discrete Mathematics for Computer Science
Fall 1999

Problems and Exercises

Notation: 	n	manditory problem


		{n} 	optional problem


		(n)	helper problem


		[n]	ungraded problem


Bracketed problems do not have to be turned in.


PS	Sec	Prob	Description/Notes
==	===	====	=================
#5 	3.1	1-4	different numeration systems

#6	3.2 	1,[2]	base 5 counting
		(5),6,7	conversions to base ten
		(8),9	conversions to other bases

#7 	3.3 	1, 2ab 	addition
		5 6ab	subtraction
		11	base four addition table
		12abfh	base four operations
		13 	missing digits
		[14,15]	missing digits
		16adh	which base?

#8 	3.4 	1	modeling multiplication
		[2]	modeling multiplication
		[4]	area and instructional algorithm 1
		[7]	what is being modeled?
		8	multiply with instructional algorithm 1
		10ab	scaffold method
		11ab	short division
		[13]	what is being modeled?
		14abc	base 5 multiplication
		15ab	base 5 division
		18a	lattice algorithm
		[30]	base 5 computations 
			

Back to Math 221 Home Page