CSC 222	    Problem Set A
Fall 2000

Due: Nov 2nd at the start of class (40 points total)

Directions: Hand in a printout of each program. Please put
	the programs in order, add a cover sheet with your name,
	then staple. Highlight any 'extras'

1) Write a program that will find the largest and smallest element
	in an array of integers (assume they will fit in a word).
	Print them out in base 10.
	You may store the array in the data section:
A	dw	6, 3, 8, 10, 2, 5
(7 + 3)

2) Write a program that will sort an array of integers. Then print 
	then out in octal. Read in up to 10 integers (you will need
	a counter).
(7 + 3)

3) Write a program that will read in a base 10 number and print out
	the result in binary, octal, or hex.
example:
13H
D
(14 + 6)