UCLA STAT 251 (section 1) Winter 2002

• Project Submission Rules
• Project 1, due Monday, Jan. 28, 2002. Turn in at the end of lecture. And its (suggested) solutions. Some hints to the problem are here and here is a C++ code (quite easily extendable for much more interesting situations when we read alot more than 4 base-pairs), and a makefile that you can use to compile the code (see http://www.borland.com for a free C++ compiler). In addition, a compiles EXE file for Pentium III / Win2K can be found here. A set of analytic solutions are given here.
• Project 2, due Monday, Feb. 11, 2002. Turn in at the end of lecture. And its (suggested) solutions.
• Project 3, due Wednesday, Feb. 27, 2002. Turn in at the end of lecture. And its (suggested) solutions.
• Project 4, due Friday, Mar. 15, 2002. Turn in at the end of lecture.