One Minute Evaluations for 11-13 November

CS 305 - Computer Algorithms I

• Topic: Learned about stacks and queues. Implementing both and comparing implementations based on efficiency of linked list, array based.

  Question: No questions.

• Topic: Implementing stacks and queues in array-based linked list [?] and how to make them dynamic.

• Topic: Stacks and queues.

• Topic: Stacks, queues, when to use and what they do. Implementation based on arrays, lists, and doubly linked lists.

  Question: How is a tree not a type of queue, if [?] [?] it is?

  One minute response: As we'll see next week, a tree is a queue that allows access in the middle.

• Topic: Can there be an.

• Topic: Stacks and queues.

• Topic: We talked about queues this week.

  Question: Why don't we go into templates? They are easy to implement and very important for effective reuse programming.

  One minute response: Because this isn't a C++ course; it's a data structures course. It's bad enough I have to spend all this time talking about proper pointer use in C++. Oh, and if you think templates are easy, I have a 550 page book for you to read.

• Topic: Learned about stacks and queues, lifo and fifo.

  Question: If you can append two queues together, will that strike chaos over the fifo concept?

  One minute response: I'm not sure how you'd append two queues together, but the result would still be a queue. The elements in the back queue would lose their fifo status, but overall the elements would still fifo.

• Topic: We talked about stacks and queues.

  Question: No questions.

• Topic: Stacks, queues, dynamic arrays and dynamic linked lists.

• Topic: This week we discussed stacks and queues.

  Question: Which implementation of a queue would you choose, array-based or linked list? It seems to me there is a lot more room for error in linked lists.

  One minute response: Probably an array based implementation. The cost of expanding (and perhaps contracting) the queue wouldn't be that large with doubling.

• Topic: We learned about stacks and queues.

  Question: Why does Nyhoff use a tree and an stack for his implementation of arithmetic expression solving?

  One minute response: They are two different ways to solve the same problem, but the tree is more general, as well as being simpler if you ignore the question about where the tree came from.

• Topic: We finished stacks and discussed queues.

  Question: Given that a queue is fair but inefficient, do [?] [?] it is [?] best structure for a print system to use?

  One minute response: The cost of printing a job is many orders of magnitude larger than the cost of queuing the job, so a queue's inefficiency doesn't enter into it.

This page last modified on 16 July 2003.