11 . /cs/www/classes/cs352/fall15/a11/tests /cs/www/classes/cs352/fall15/a11/master problem lam lam.c build make lam test lam case ulimit -t 1; ./lam ... a11/nums a11/lam.1 case ulimit -t 1; ./lam ". " <(seq 100) <(cal -h) case ulimit -t 1; ./lam - a11/nums a11/delivs <(seq 10) a11/lam.1 case ulimit -t 1; ./lam - a11/nums case ulimit -t 1; ./lam x <(seq 1 3 10000000000000) <(seq 1 5 10000000000000) <(seq 1 7 10000000000000) <(seq 1 9 10000000000000) <(seq 1 2 100) case ulimit -t 1; ./lam === a11/d1/*.c case ulimit -t 1; ./lam - a11/nums a11/delivs /dev/null <(seq 10) a11/lam.1 problem mcycle mcycle.c build make mcycle test mcycle case ulimit -t 1; ./mcycle < a11/mcycle.1 case ulimit -t 1; ./mcycle < a11/mcycle.2 case ulimit -t 1; ./mcycle < a11/mcycle.3 case ulimit -t 1; ./mcycle < a11/mcycle.4 case ulimit -t 1; ./mcycle < a11/mcycle.5 case ulimit -t 1; ./mcycle < a11/mcycle.6 case ulimit -t 1; ./mcycle < a11/mcycle.7 problem mar mar.c build make mar test mar1 case ulimit -t 1; ./mar c m1.mar a11/nums2; cat m1.mar case ulimit -t 1; ./mar t m1.mar case ulimit -t 1; ./mar c m2.mar a11/nums2 a11/empty a11/nums a11/lets; cat m2.mar case ulimit -t 1; ./mar t m2.mar case ulimit -t 1; mkdir -p martest; rm -rf martest/*; cd martest; ../mar x ../m2.mar; head -100 * test mar2 case ulimit -t 1; mkdir -p martest; rm -rf martest/*; ./mar c martest/test2.mar a11/d1/*; wc martest/test2.mar a11/d2/test2.mar; cmp martest/test2.mar a11/d2/test2.mar case ulimit -t 1; mkdir -p martest; rm -rf martest/*; cd martest; ../mar x ../a11/d2/test2.mar; wc *; head -3 *.*; sha1sum * case ulimit -t 1; mkdir -p martest; rm -rf martest/*; cd martest; ../mar x ../a11/d2/test2.mar tester.cfg xtester.cfg mcycle.{1,3,5,7} | sort; wc *; sha1sum * case ulimit -t 1; mkdir -p martest; rm -rf martest/*; ./mar c martest/a6.mar a11/../a6/*.*; wc martest/a6.mar case ulimit -t 1; mkdir -p martest; rm -rf martest/*; cd martest; ../mar x ../a11/d2/a6.mar 512.chars matched.1 r.2 r.3 writebytes.c | sort; wc *; sha1sum * test mar3 case ulimit -t 1; ./mar a ../c.mar case ulimit -t 1; ./mar x /c.mar case ulimit -t 1; ./mar c /c.mar . case ulimit -t 1; ./mar c x.mar a11/nums /etc/psword a11/lets case ulimit -t 1; ./mar c x.mar . .. ... case ulimit -t 1; ./mar c x.mar a11/nums case ulimit -t 1; ./mar t a11/nums case ulimit -t 1; ./mar x a11/nums problem alloc alloc.c build gcc -Werror -g -std=c1x -I/cs/www/classes/cs352/fall15/h -c alloc.c test allocs1 build make alloc-shell case ulimit -t 1; (echo p 3 32; echo a 25; echo d 0) | ./alloc-shell | a11/addrmap case ulimit -t 1; (echo a 1024; echo a 1025; echo s) | ./alloc-shell | a11/addrmap case ulimit -t 1; ./alloc-shell < a11/as.1 | a11/addrmap case ulimit -t 1; (echo "# test bad pool size"; echo "p 10 100") | ./alloc-shell | a11/addrmap test alloc1 build make alloc1 case ulimit -t 1; ./alloc1 | a11/addrmap test alloc2 build make alloc2 case ulimit -t 1; ./alloc2 | a11/addrmap test alloc3 build make alloc3 case ulimit -t 1; ./alloc3 | a11/addrmap test alloc4 build make alloc4 case ulimit -t 1; ./alloc4 | a11/addrmap test alloc5 build make alloc5 case ulimit -t 1; ./alloc5 | a11/addrmap test alloc6 build make alloc6 case ulimit -t 1; ./alloc6 | a11/addrmap test alloc7 build make alloc7 case ulimit -t 1; ./alloc7 | a11/addrmap test alloc8 build make alloc8 case ulimit -t 1; ./alloc8 | a11/addrmap