One Minute Evaluations for 4-6 November

CS 305 - Computer Algorithms I

• Topic: Linked list, stacks and the difference between them.

• Topic: Stacks and more linked lists; learned about doubly linked lists.

• Topic: Linked lists / stacks.

• Topic: Learned: stack, Q, lists.

  Question: None.

• Topic: This week we finished linked list and began stacks.

  Question: Is a stack useful, because it seems that a linked list can do the same, though less efficiently.

  One minute response: It depends on whether or not you believe in using the proper tool for the job.

• Topic: Learned about stacks.

  Question: Please go over stacks in more detail.

  One minute response: O.k. but there's not a lot of detail to go over.

• Topic: Linked lists, stacks, push.

  Question: Can stacks be run filo and backwards.

  One minute response: I guess filo is the same as lifo. I'm not sure what it would mean to run a stack backwards.

• Topic: We learned about stacks and linked lists.

  Question: What is a skip list<?

  One minute response: A probabilistic implementation of a binary search tree using a list.

• Topic: Finished linked lists, discussed stack ADT briefly.

  Question: No questions.

• Topic: Ended discussion of linked lists. Started implementation of stacks.

  Question: Why avoid the STL? Why avoid iterators in a list?

  One minute response: I want you to get first-hand experience with data structures by building and using your own.

• Topic: This week we talked more about linked lists and started talking about stacks.

  Question: How can we make our stacks dynamic.

  One minute response: Three basic ways: use linked lists, use vectors, or use linked lists and vectors.

• Topic: Singly vs. doubly linked lists, stacks.

• Topic: Finish discussion about linked lists, talking about stacks.

  Question: Why use a stack if there is no traversal, why keep data in the middle?

  One minute response: A stack reverses the order of the elements it contains; it's also useful when the only object that's available is the object most recently dealt with.

• Topic: We talked about linked lists and stacks.

  Question: How would you implement top in a stack other than how discussed in class.

  One minute response: Top is so simple I can't imagine another way to implement it.

This page last modified on 16 July 2003.