This activity has been designed as extra credit. Those who successfully participate in the activity will have the opportunity to earn up to 20 points extra credit on their Midterm Exam grade. Points will be awarded based on level of participation and success in the assignment.
NOTE: Everyone's midterm exam had a number on the lower right corner. This is your group number. Each group has been assigned a task that needs to be completed by the middle of class Monday for a brief presentation of results in the second half of Monday/beginning of Wednesday's class. It is in your best interest to look at the assignment ahead of time so that you are not wasting time in the groups on Monday figuring out what the assignment is.
Assignment (See your group number)
- Group 1
- Email sent to you personally about your assignment
- Group 2
- You will build an implementation of a deque on an STL vector. Your group will present its solution to the class.
- Group 3
- You will take the code as you wrote it and type it into a C++ file. Add any code that would be needed to ensure that the class definition would work, but do not change or modify the code you wrote from the exam. Compile the code. If it does not compile, record the errors and discuss them in your group. If it does compile, write a simple testing program to test your implementation. Bring results of success and failure to class. Your group will report on this experience.
- Group 4
- Your group will look at the implementations you created for the deque and decide as a group which person's implementation was the best. You should use the criterion of correctness, ease of implemenation, extensibility and code readability to make your decision. You will state your choice and your argument for the implemenation in your presentation to the class.
- Group 5
- You will build an implementation of a deque using no underlying structure. Your group will present its solution to the class.
- Group 6
- You will build an implementation of a deque using a native C++ array. Your group will present its solution to the class.
- Group 7
- You will build an implementation of a deque using the STL list (doubly-linked). Your group will present its solution to the class.
- Group 8
- Your group will build an implementation of a deque using a queue. You can not change the interface to the queue. Queues only support enqueue and dequeue and a peek at the beginning of a queue. Your group will present its solution to the class.
- Group 9
- Your group will build an implementation of a deque using a stack. You can not change the interface to the stack. Stacks only support push, pop, and peek. Your group will present its solution to the class.
- Group 10
- Your group will build an implementation of a deque using a singly-linked list. Your group will present its solution to the class.
- Group 11
- You will build an implementation of a deque using no underlying structure. Your group will present its solution to the class.
- Group 12
- Your group will build an implemenation of a deque using the STL list (doubly-linked). Your group will present its solution to the class.
