(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){ (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o), m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m) })(window,document,'script','//www.google-analytics.com/analytics.js','ga'); ga('create', 'UA-47423994-1', 'fortunecity.ws'); ga('send', 'pageview');

SIBT COMP 125

Week 6 Practical Exercises

1.Write a program which reads 10 integers from input (one per line). Store these integers in a BOUNDED_QUEUE [INTEGER]. On the next line after the integers, read a character. If the character is

`a', print out all the integers read in.
`e', print out only the even integers read in.
`o', print out only the odd integers read in.

2. Enter your solution to Tutorial Question 3 and get it working. Make sure you understand how and why it uses multiple classes. Discuss this with Andi or Dave if you don't get it.

3. Homework: In lectures this week, we saw how a dynamic stack could be implemented using the NODE class. Based upon this, write a complete class, SIBT_DYNAMIC_QUEUE [G], which will implement a dynamic queue using the NODE class. To make sure this works, instead of using BOUNDED_QUEUE [INTEGER] in Question 1, use SIBT_DYNAMIC_QUEUE [INTEGER]. This should not require any other modification to the code you wrote than changing the ADT. NOTE: This would be a good exam style question for the mid-semester.