READ IN REVERSE ORDER Sure thing. On 12/15/06, Matthew Bauer wrote: Great, so can you fit in hash tables in CS331 starting this spring? Matt -----Original Message----- From: beckman.iit@gmail.com [mailto:beckman.iit@gmail.com]On Behalf Of "A. Mattox Beckman, Jr." Sent: Thursday, December 14, 2006 10:02 PM To: Matthew Bauer Subject: Re: hash tables covered in CS331/CS401 Well... the extra lecture time would makes it possible. And certainly if I cut quad trees there's room in the schedule. Normally, I'm not a fan of long lectures, but it does help out in 331 because I can go over more code and in-class activities. And my labs tend to focus more on the after-lab portion. The first few labs of the semester I teach them software engineering tools, like the linux command line, subversion, and junit. So, the shorter lab sessions are good. - Mattox On 12/14/06, Matthew Bauer wrote: You would have time in cs331? instead of quad trees or skip lists? I don't think we can cut anything else. by the way, how was the extra CS331 lecture time this fall? and shorter lab time? Matt -----Original Message----- From: beckman.iit@gmail.com [mailto: beckman.iit@gmail.com]On Behalf Of "A. Mattox Beckman, Jr." Sent: Thursday, December 14, 2006 6:40 PM To: Matthew Bauer Cc: winans@iit.edu Subject: Re: hash tables covered in CS331/CS401 I mention that they exist, but I tell them that they get covered in future courses. I'd be happy to cover them in CS 331 if it's convenient for you. - Mattox On 12/14/06, Matthew Bauer wrote: Is hash tables a regular topic in CS331(beckman)/CS401(winans)? We cover it in 1-2 lectures in CS430 but would like to cover a different topic if CS331/401 hits it Matt -- A. Mattox Beckman, Jr., Ph.D. Computer Science, Illinois Institute of Technology - Where there is life, there is hope. - J. R. R. Tolkien (and others....) -- A. Mattox Beckman, Jr., Ph.D. Computer Science, Illinois Institute of Technology - Where there is life, there is hope. - J. R. R. Tolkien (and others....) -- A. Mattox Beckman, Jr., Ph.D. Computer Science, Illinois Institute of Technology - Where there is life, there is hope. - J. R. R. Tolkien (and others....) ***************************************************** One challenge may be finding the right grad TAs to run the recitations. Matt -----Original Message----- From: Sanjiv Kapoor [mailto:kapoor@iit.edu] Sent: Thursday, December 14, 2006 8:02 PM To: 'Matthew Bauer' Cc: 'David Grossman' Subject: RE: CS430 topics In fact the UG committee may start identifying more courses where recitations might help. It would bring a lot of benefit to the students ---and enhance the image of the UG program, maybe? Yes, adding a recitation is an interesting idea. We are trying that this Spring in CS330 for the first time (two 75 minute lectures, one 50 minute recitation run by a grad TA). We could see how that goes for a couple semesters in CS330. We discussed adding balanced trees to CS331 in the past, but the required object oriented concepts make it hard to add any more data structures. They mention their existance, but no real lecture on them. I'll see how things go this spring in CS430 with removing hash tables and adding Order Statistics and Amortized Analysis, and maybe take some time away from backtracking/branch&bound (three lectures may be heavy for that). thanks Matt -----Original Message----- From: Sanjiv Kapoor [mailto:kapoor@iit.edu] Sent: Thursday, December 14, 2006 7:26 PM To: Matthew Bauer; Xiang-Yang Li Subject: Re: CS430 topics Did any of you feel the need for tutorial sessions (problem solving awy from lectures)? I suggest we add that (like in CS330) and make time by reducing review sessions in class I am not the course manager for CS331 but we might start introducing balanced trees there. ----- Original Message ----- From: "Matthew Bauer" To: "Xiang-Yang Li" Cc: "Sanjiv Kapoor" Sent: Thursday, December 14, 2006 7:12 PM Subject: RE: CS430 topics > Here is the standard CS331(Data Structures) coverage (close to CS401 too > for > grads) > http://prancingtarantula.net/cs331-fa06/schedule.rhtml > They do cover Heaps > > Beckman is willing to add hash tables instead of skip-lists or quad trees > > Matt > > -----Original Message----- > From: Xiang-Yang Li [mailto:xli@babbage2.cs.iit.edu] > Sent: Thursday, December 14, 2006 6:58 PM > To: Matthew Bauer > Cc: Sanjiv Kapoor > Subject: RE: CS430 topics > > > > That could be a good choice. I spent about 1.5 lectures on hash tables. > I think that we could also cover little bit on various heaps (it does take > lots of lectures) --- I do not know which course will cover all different > sorts of heaps and other advaned data structures. > > Best, > > Xiang-Yang Li > Department of Computer Science > Illinois Institute of Technology > xli@cs.iit.edu > www.cs.iit.edu/~xli > > On Thu, 14 Dec 2006, Matthew Bauer wrote: > >> Date: Thu, 14 Dec 2006 18:34:27 -0600 >> From: Matthew Bauer >> To: Sanjiv Kapoor , Xiang-Yang Li > >> Subject: RE: CS430 topics >> >> Thanks for the feedback, and yes backtracking and branch-and-bound is >> usually in an intro AI class, which we are starting to offer again, but >> it >> is just a CS elective for undergrads. >> >> I will check to see if hash tables is covered in our data structures >> class >> (cs331-undegrads, cs401-grads), if it is we can maybe remove hash tables > and >> fit everything else. >> >> thanks again >> Matt >> >> -----Original Message----- >> From: Sanjiv Kapoor [mailto:kapoor@iit.edu] >> Sent: Thursday, December 14, 2006 5:43 PM >> To: Xiang-Yang Li; Matthew Bauer >> Subject: Re: CS430 topics >> >> >> Backtracking may also be covered in introductory courses. >> >> Branch and Bound is very useful to know- >> Can be added, maybe-- squeezing in a little more material may not hurt > the >> students at all -- >> order statistics (linear time median) is done in CS535 often as student > dont >> know it. >> >> ----- Original Message ----- >> From: "Xiang-Yang Li" >> To: "Matthew Bauer" >> Cc: >> Sent: Thursday, December 14, 2006 5:35 PM >> Subject: Re: CS430 topics >> >> >> > >> > I covered thes two topics based on follows >> > >> > 1) order statistics are among first examples that we can do something >> > via careful algorithm design, which our intuition says otherwise. >> > Matrix >> > multiplication is anothere example used in class. >> > >> > 2) amortized analysis is used to show that, besides average case, worst >> > case analysis, a number of other ways of studying performance can be > used. >> > I actually also briefly talked about smooth analysis. >> > >> > Doing the above 2, I hope that we can show students more (although we > did >> > not go deep in amortized analysis). We do cover order statistics deep. >> > >> > For branch and bound, I would like to covere it also, but the space is >> > limited. Next time, I may cover this, instead of amortized analysis. >> > >> > I thouhght that students may have learned backtracking, branch and >> > bound >> > in AI or machine learning >> > -- at least I learned this when I took AI course during my > undergraduate, >> > :-). >> > >> > Best, >> > >> > Xiang-Yang Li >> > Department of Computer Science >> > Illinois Institute of Technology >> > xli@cs.iit.edu >> > www.cs.iit.edu/~xli >> > >> > On Thu, 14 Dec 2006, Matthew Bauer wrote: >> > >> >> Date: Thu, 14 Dec 2006 16:36:58 -0600 >> >> From: Matthew Bauer >> >> To: xli@cs.iit.edu >> >> Cc: kapoor@iit.edu >> >> Subject: CS430 topics >> >> >> >> Xiang-Yang >> >> Thanks for teaching CS430 this fall. I see you chose a couple topics >> >> different from what I have done in the past and I would like your (and >> >> Dr. >> >> Kapoor's) opinion on these changes >> >> >> >> You included: >> >> Order Statistics (median) >> >> Introduction to Amortized Analysis >> >> >> >> Instead of what I usually include: >> >> Introduction to Backtracking and Branch and Bound >> >> >> >> Given we cannot cover both of these sets, which do you think we should >> >> keep >> >> >> >> Thanks >> >> Matt >> >> >> >> >> > >> > >> >> > >