| Instructor: | Prof. Stacia Wyman |
| Email: |  |
| Phone: | x4711 |
| Office: | TCL 305 |
| Office Hours: | M 1:00-3:00, F 1:00-2:00 and by appointment |
| Teaching Assistant: | Alex Constantin |
| TA Hours: | TBD |
| Meeting Times: | Lecture: MWF 11:00am-12pm |
| Location: | Lecture: TCL 206 |
Announcements
-
Thu, 9 Mar, 11:30am: Clarifying my clarification:
>And a clarification on top down splay trees: if you have a tree where you >are splaying node x, with a normal splay tree, you search on the way down, >then splay on the way up. With a top down tree, you do the search AND the >splay work to splay x on the way down the tree. You are splaying one node, x.
You are splaying one node x, but it may be that the splaying substeps don't directly involve x.
And a hint: the tree resulting from a top-down splay will not necessarily be the same as the tree resulting from a traditional splay. You might consider answering why that is in your solution to this problem.
-
Thu,9 Mar, 7:30am:
I'm going to have extra office hours this afternoon from 2-4pm. If you can't make that time and have questions, you can email them to me.
-
Thu,9 Mar, 7:30am:
You can assume you have at your disposal methods for which there is pseudocode in the book and the methods which are used in pseudocode. For example, the description of removeElement uses removeAboveExternal, so you may use that method w/o providing code for it.
-
Thu,9 Mar, 6:30am:
A clarification about question three. On (a), by reversing the order, I mean reversing the order of the operations such that the nodes that are at the root are reversed. For example, if we have a tree with node a at the root, then we splay b to the root, then c to the root, then d to the root. To reverse the operations, we would start with the tree with d at the root, splay c to the root, splay b to the root , and finally, splay a to the root. Is a the same tree? You should explore this question, figuring out if it is true for some trees and not for others, and which kind of tree is that where it's possible if it is possible and for trees where it's not, what about it make them not?
A splay operation is NOT a splay substep. A splay operation takes a node and splays it to the root.
And a clarification on top down splay trees: if you have a tree where you are splaying node x, with a normal splay tree, you search on the way down, then splay on the way up. With a top down tree, you do the search AND the splay work to splay x on the way down the tree. You are splaying one node, x.
-
Fri,3 Mar, 9:30pm:
Question: Do we also assume that there is a method called remove(), which deletes the target node and re-arrages the binary tree for us? Or do we need to do that ourselves?Answer: No, since you are required to write psuedocode for this answer, you may assume the methods on p. 141, as I said in the exam:
- You may assume that you have the methods described on page 141 and you can assume the running times described on page 91 for operations.
- You may want to start by writing pseudocode for removeElement(k).
but if you want to use removeElement(k), then you have to write the pseudocode for that as well.
Course Description
This course is concerned with investigating methods of designing efficient and reliable algorithms. By carefully analyzing the underlying structure of the problem to be solved it is often possible to dramatically decrease the computationalresources needed to find a solution. Through such analysis one can also verify that an algorithm will perform correctly, as well as accurately estimate its running time and space requirements. We will present several algorithm design strategies that build on data structures and programming techniques introduced in CS 136, including induction, divide-and-conquer, dynamic programming, and greedy algorithms. Particular topics to be considered will include algorithms in graph theory, computational geometry, string processing, and advanced data structures. In addition, an introduction to complexity theory and the complexity classes P and NP will be provided.Course Text
by Goodrich and Tamassia
The book is available at Water Street Books, or online (i.e. Half.com) and will be on reserve in Schow. You are responsible for the material in the book co vered by the assigned reading.
There is also a website associated with the book which you may use as a resource:
Evaluation
There will be frequent homework assignments which will count as 55% of your grade. Late assignments are not accepted without permission in advance from me, but one or two of the lowest homework scores will be dropped. We may have a programming project during the semester, which would count as 10% of the homework grade.There will be three take home exams each of which you will have approximately 48 hours to complete. Each exam will count as 15% of your final grade.
Policies
- CS Dept. Honor Code
- The take-home exams will be open-book. You may use your text, your own class notes and homework solutions, as well as the provided solutions to homework assignments. No other sources may be used. You may not consult other students, TA's, the web, or other books.
- You may find it helpful to work together on homework problems. This is acceptable (and even encouraged), but you must write up your own solutions. If you work on a problem with other students, indicate those students with whom you have worked. This can be done with a simple note at the top of the assignment such as: "These problems were discussed with Albert Einstein." Working together without indicating so or turning in someone else's write-up of a problem solution is a violation of the Honor Code.
