question archive Week 3 · Ideally this week's class would be run in a laboratory where students could input various algorithms as per the slides and time them, either manually or using system timers
Week 3 · Ideally this week's class would be run in a laboratory where students could input various algorithms as per the slides and time them, either manually or using system timers
Subject:Computer SciencePrice: Bought3
Week 3
· Ideally this week's class would be run in a laboratory where students could input various algorithms as per the slides and time them, either manually or using system timers.
· If this is not possible, then it should be run in a classroom just using the slides.
· Slides 58-60 important, relates back to example at beginning of slide and then remainder of the slides
· Use week 2 programs for Stacks with Linked Lists and Stacks with Array and time them.
Homework Exercises
Questions 2 and 3 in week 2 looked at the efficacy of linked lists or resizing arrays for implementations of stacks and queues. Redo these 2 questions expressing each implementation in terms of operations using N.
