Fall 2012,  CSC 21200 section FG - DATA STRUCTURES (Reg code: 0537) 
Name	Q1	Q2	Q3	Q4	Q5	Q6	Q7	Q8	Q9	Q10	Q11	Q12	Q13	Q14
AB	9	9	W	W	W	W	W	W	W	W	W	W	W	W
AJ	9	8	10	8	7	10	10	9	7	14	10	8	10	20
AW	5	2	3	2	7	2	10	9		9	8	7	4	20
BA?	0	0	8	4	0	7	0	9	6	9	9	0	10	20
BM	6	10	9.5	7	3	7	10	8	10	6	8	8	6	20
Cj	8	6	2	0	7	0	9	5	10	10	8	0	4	20
DK*	9	W	W	W	W	W	W	W	W	W	W	W	W	W
FU	4	2	2	4	7	2	10	6	8	9	8	7	2	20
FA	10	10	9.5	9	7	7	9	10			10	7	10	20
FR	5	10	9.5	8	7	10	9	6	10	14	10	0	8	20
GV	7	10	9.5	9	7	8	6	10	5	13	8	0	9	20
GS	10	10	10	10	7	10	10	10	8		10	8	10	20
GB	8	7	8	4	7	2	10	4	10	7	8	0	6	20
HK	9	10	10	10	7	9	9	8	10	12	10	8	7	20
HL	8	10	2	4	7	10	10	9	10	10	6	5	6	20
HR	6	10	4	7	7	8	5	10	7		8	0	7	15
JA	4	10	10	9	10	10	0	7	10		0	7	9	20
JI	4	10	1	2	0	0	0	0	0	0	0	0	0	0
KT	5	2	2	2	10	8	10	4	10	4	8	5	8	20
KI	8	5	8	7	3	7	0	10	7	8	10	6	7	20
KY	4	10	10	2	10	8	9	10		15	10	7	8	0
KM	10	10	10	10	9	10	10	10	10	15	8	10	9	20
LK	7	6	9	8	7	8	0	9	10	9	12	0	8	20
MP	7	8	5	6	10	9	0	8	8	6	8	0	6	20
PJ	6	4	10	8	10	8	10	9	10	10	10	7	6	20
PC	9	9	2	10	5	10	8	9	10	11	8	0	6	20
QW	9	5	4	9	3	10	10	10		9	8	10	7	20
VD	5	4	0	10	0	2	10	9	8	15	10	0	6	20
YA	8	8	6	7	3	6	0	10	10	7	8	0	6	20

Q1	for loop and big O
Q2	array 
Q3	class
Q4	bag
Q5	pointers and dynamic array
Q6	linked list - pointers and nodes
Q7	template practice
Q8	complete binary tree
Q9	CSc212 change feedback
Q10	Heap Implementation
Q11	selectionsort online: if selecting largest or incorrect in Q3, -2
Q12	binarysearch re-writing
Q13	Exam 3 Review- recursion of trees
Q14	Final Quiz