;Disclaimer: The test case is only an example and is provided for your 
;benefit. The test cases we provide are by not exhaustive and you must 
;write your own test cases to ensure that your program works. Just because 
;a program works for our test cases does NOT mean that it works in all 
;cases. We will use several additional test cases when we will grade the 
;program.

; NOTE: The outcome of your problem with this list should be the same as smalltest1.asm

.ORIG x3300
ADDRFIRSTNODE .FILL NODE1

.BLKW xD00 ;any random number here to prove that first node can be anywhere

NODE1	.FILL NODE2
	.FILL NAME1
	.FILL MAJR1
NAME1	.STRINGZ "chen"
MAJR1	.STRINGZ "math"

.BLKW xE00 ;any random number here to prove that nodes need not be sequential in memory
NODE2	.FILL NODE3
	.FILL NAME2
	.FILL MAJR2
NAME2	.STRINGZ "martinez"
MAJR2	.STRINGZ "ece"

.BLKW x1200 ;any random number here to prove that nodes need not be sequential in memory
NODE3	.FILL x0000
	.FILL NAME3
	.FILL MAJR3
NAME3	.STRINGZ "patel"
MAJR3	.STRINGZ "bio"
.END