CSc21200 Section BC (57941) Data Structures, Fall 2017 Name Q1 Q2 Q3 Q4 QR1 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 AF 10.0 10.0 5.0 6.0 7.0 6.0 10.0 10.0 8.0 5.0 10 8.0 7.0 8.0 10.0 BK 10.0 10.0 0.0 5.0 6.0 10.0 5.0 10.0 0.0 2.0 10 7.0 10.0 CC 10.0 10.0 10.0 10.0 6.0 10.0 10.0 10.0 9.5 9.0 10 10.0 10.0 10.0 10.0 CM 10.0 10.0 10.0 10.0 9.0 10.0 10.0 10.0 8.5 9.0 10 10.0 10.0 10.0 10.0 CJ 10.0 5.0 0.0 4.0 7.0 0.0 0.0 0.0 DQ 10.0 0.0 0.0 5.0 5.0 0.0 10.0 0.0 0.0 0 10.0 GD 10.0 8.0 7.0 4.0 8.0 10.0 10.0 0.0 0.0 10 5.0 8.0 GW 10.0 10.0 9.0 9.0 9.0 4.0 8.0 8.0 8.0 10 6.0 10.0 HY 10.0 10.0 8.0 9.0 6.0 4.0 10.0 5.0 10.0 0.0 10 10.0 8.0 10.0 10.0 JP 10.0 10.0 10.0 10.0 10.0 10.0 10.0 10.0 9.0 6.0 10 10.0 9.0 10.0 JM 10.0 10.0 7.0 8.0 5.0 10.0 10.0 10.0 3.0 10 7.0 9.0 7.0 10.0 KF 10.0 8.0 5.0 8.0 7.0 6.0 7.0 10.0 10.0 7.0 10 10.0 9.0 9.0 10.0 LH 10.0 2.0 8.0 7.0 6.0 4.0 10.0 10.0 9.5 4.0 10 7.0 9.0 10.0 LM 10.0 9.0 10.0 10.0 9.0 10.0 10.0 10.0 9.5 9.0 10 10.0 10.0 10.0 10.0 LYF 10.0 0.0 0.0 8.0 5.0 6.0 10.0 10.0 0.0 0 LY 10.0 9.5 10.0 10.0 9.0 10.0 10.0 10.0 10.0 9.0 10 9.0 10.0 10.0 10.0 LJ 10.0 10.0 10.0 10.0 9.0 10.0 10.0 10.0 9.0 8.0 10 8.0 10.0 9.0 10.0 MJ 10.0 9.0 6.0 8.0 8.0 10.0 10.0 10.0 10.0 8.0 10 10.0 6.0 10.0 10.0 MA 10.0 8.0 9.0 10.0 10.0 10.0 10.0 9.5 7.0 10 8.0 9.0 10.0 RM 10.0 10.0 9.0 9.0 8.0 4.0 10.0 7.0 7.0 0 10.0 RJ 10.0 10.0 10.0 10.0 9.0 10.0 10.0 10.0 10.0 7.0 10 9.0 9.0 10.0 10.0 SS 10.0 7.0 5.0 10.0 6.0 10.0 10.0 7.0 8.0 10 4.0 8.0 10.0 SW 10.0 2.0 10.0 7.0 9.0 10.0 8.0 4.0 10.0 0.0 0 9.0 SIU 10.0 2.0 9.0 3.0 4.0 0.0 7.0 10.0 8.0 7.0 10 7.0 8.0 10.0 10.0 TL 10.0 7.0 8.0 8.0 6.0 0.0 10.0 6.0 4.0 10 8.0 10.0 10.0 VaJ 10.0 5.0 10.0 7.0 9.0 10.0 2.0 7.0 0.0 10 5.0 VeJ 10.0 5.0 0.0 8.0 6.0 6.0 7.0 10.0 8.0 4.0 10 7.0 2.0 9.0 10.0 WA 10.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 ZS 10.0 7.0 9.5 9.0 8.0 10.0 10.0 10.0 10.0 0.0 10 9.0 10.0 10.0 ZA 10.0 10.0 8.0 7.0 8.0 6.0 10.0 0.0 6.0 5.0 10 8.0 7.0 Q1: Attendance Q2: Bag class definition Q3: Dynamic array usage Q4 assignment operator for the dynamic bag QR1: Time analysis for bag class functions Q5: Linked lists Q6: Template Q7: Recursion in a member function Q8: Implementing the queue Q9: Heaps implementation Q10: Hash Table in Class Q11. Binary search reimplementation Q12:Selectionsort and Insertionsort Q13: Mergesort Q14: Final Quiz