Main.Syllabus History
Show minor edits - Show changes to output
Changed line 10 from:
(:cell:) TR 11:00am-12:15pm at Engineering E206
to:
(:cell:) TR 11:00am-12:15pm at CSB 325
Changed lines 3-6 from:
|| ||Office
||
||**Lecture** ||TR 11
to:
(:table border=0 cellpadding=0 cellspacing=0:)
(:cellnr:) **Instructor**
(:cell:) [[http://www.cs.colostate.edu/~asa | Asa Ben-Hur]] \\
Office: 448\\
Office Hours: By appointment.
(:cellnr:) **Lecture**
(:cell:) TR 11:00am-12:15pm at Engineering E206
(:tableend:)
(:cellnr:) **Instructor**
(:cell:) [[http://www.cs.colostate.edu/~asa | Asa Ben-Hur]] \\
Office: 448\\
Office Hours: By appointment.
(:cellnr:) **Lecture**
(:cell:) TR 11:00am-12:15pm at Engineering E206
(:tableend:)
Changed lines 5-7 from:
|| ||Office Hours: Tue 10-11am, Wed after class ||
||**Lecture** ||MWF 9-9:50am at room 425 in the new building ||
||**Lecture** ||
to:
|| ||Office Hours: By appointment ||
||**Lecture** ||TR 11:00am-12:15pm at Engineering E206 ||
||**Lecture** ||TR 11:00am-12:15pm at Engineering E206 ||
Changed lines 40-44 from:
!!!Textbooks:
||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.gif
We will also use:\\
||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.gif
We will also use:\\
to:
!!!Textbook:
Added lines 45-49:
Also useful:
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004
Changed lines 54-66 from:
||Assignments || 30% ||Programing and written assignments
||Project ||30% || Includes a written report and class presentation
||Exams || 40% ||Midterm (15%) and Final (25%)
----
===Important Dates
Midterm: TBA
Final Exam: TBA
||Project ||
||Exams || 40% ||Midterm (15%) and Final (25%)
----
===Important Dates
Midterm: TBA
Final Exam: TBA
to:
||Assignments || 60% ||Programming and written assignments
||Project || 40% || Includes a written report and class presentation
||Project || 40% || Includes a written report and class presentation
Changed line 6 from:
||**Lecture** ||MWF 9-9:50am at room 325 in the new building ||
to:
||**Lecture** ||MWF 9-9:50am at room 425 in the new building ||
Changed lines 52-54 from:
||Assignments || 35% ||Programing and written assignments
||Project ||35% || Includes a written report and class presentation
||Exams ||30% ||Midterm (13%) and Final (17%)
||Project ||
||Exams ||
to:
||Assignments || 30% ||Programing and written assignments
||Project || 30% || Includes a written report and class presentation
||Exams || 40% ||Midterm (15%) and Final (25%)
||Project || 30% || Includes a written report and class presentation
||Exams || 40% ||Midterm (15%) and Final (25%)
Changed lines 4-5 from:
|| ||Office #448 in the new computer science building ||
|| ||Office Hours:TBA ||
|| ||Office Hours:
to:
|| ||Office: 448 in the new computer science building ||
|| ||Office Hours: Tue 10-11am, Wed after class ||
|| ||Office Hours: Tue 10-11am, Wed after class ||
Changed lines 42-44 from:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.gif
-> We will also use:\\
to:
||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.gif
We will also use:\\
We will also use:\\
Changed line 36 from:
to:
!!!Prerequisites:
Changed line 36 from:
to:
!!!!!Prerequisites:
Changed lines 42-43 from:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.jpg
to:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.gif
Changed line 42 from:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 || %width=100px%Attach:bioalgs.jpg ||
to:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 ||%width=100px%Attach:bioalgs.jpg
Deleted line 49:
Deleted lines 54-55:
----
Changed lines 42-44 from:
||
|| ||
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004|| %width=100px%Attach:bioalgs.jpg||
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004|| %width=100px%Attach:bioalgs.jpg||
to:
|| ||Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004 || %width=100px%Attach:bioalgs.jpg ||
Changed line 55 from:
||Exams || 30% || Midterm (13%) and Final (17%)
to:
||Exams || 30% ||Midterm (13%) and Final (17%)
Changed lines 7-8 from:
to:
Changed lines 10-11 from:
===Course Description
to:
===Course Outline
Changed lines 43-44 from:
|| ||Data Abstraction and Problem Solving with Java,\\ 2nd edition\\Frank Carrano and Janet Prichard || %width=100px%Attach:walls.jpg||
to:
|| ||
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004|| %width=100px%Attach:bioalgs.jpg||
Neil C. Jones and Pavel A. Pevzner\\An introduction to bioinformatics algorithms\\ MIT Press, 2004|| %width=100px%Attach:bioalgs.jpg||
Changed lines 47-49 from:
Kenneth Rosen
to:
Richard Durbin, Sean R. Eddy, Anders. Krogh and Graeme Mitchison. Biological Sequence Analysis. Cambridge UP, 1998.
Changed lines 55-78 from:
||Assignments || 45% ||Programing and written assignments
||Quizzes || 10% ||
||Midterms (2) || 25% ||1st Midterm: 12%\\2nd Midterm: 13%
||Final Exam || 20% ||Comprehensive
Assignments will be done individually, except selected programming assignments
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given.
No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit(maximum of one per student per class session). Three chits earned translate into 10 additional points on the next quiz.
The assignment of letter grades will be made as follows:
||
||Letter Grade || Point Range
|| A || 90-100 ||
|| B || 80-89.9 ||
|| C || 70-79.9 ||
|| D || 60-69.9 ||
|| F || below 60 ||
NOTE: We will NOT cut higher than these points (but may cut lower).
||
||Midterms (2) || 25% ||1st Midterm: 12%\\2nd Midterm: 13%
Assignments will be done individually, except selected programming assignments
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given.
No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit
The assignment of letter grades will be made as follows:
||
||Letter Grade || Point Range
|| A || 90-100 ||
|| B || 80-89.9 ||
|| C || 70-79.9 ||
|| D || 60-69.9 ||
|| F || below 60 ||
NOTE: We will NOT cut higher than these points (but may cut lower).
to:
||Assignments || 35% ||Programing and written assignments
||Project || 35% || Includes a written report and class presentation
||Exams || 30% || Midterm (13%) and Final (17%)
||Project || 35% || Includes a written report and class presentation
||Exams || 30% || Midterm (13%) and Final (17%)
Deleted lines 60-73:
**Midterm and Finals:** Make-up exams are only given in extraordinary circumstances (e.g., illness, death of family member). Students must consult with the instructor as soon as possible, preferably before the start of the exam. Course examination dates are listed in the syllabus; be aware of them and plan accordingly.
No make-ups will be given for missed quizzes.
**Programming assignments** are to be submitted electronically using the [[http://www.cs.colostate.edu/~cs200/checkin.html |checkin]] program. Always check the assignment page for due dates. Late assignments submitted within 48 hours of the time required (or otherwise specified) will receive a 20% late penalty. Electronic submission is closed 48 hours after assignments are due (or as otherwise specified); students not having submitted programs receive an automatic zero on the assignment.
**Written assignments** are to be submitted in class. These may be handwritten, but must be legible.
The instructors and TAs reserve the right to decide whether or not a paper is legible.
Late assignments are accepted in class on the first MWF after the original due date, and will receive a 20% late penalty.
Assignment will be returned within 5 working days of the end of the late period.
Changed lines 64-68 from:
Second Midterm:
to:
Midterm: TBA
Changed lines 69-72 from:
Course withdrawal date:
to:
Deleted lines 72-93:
All students are expected to conduct themselves professionally. We assume you are familiar with the policies in the
[[http://www.cs.colostate.edu/~info/student-info | student information sheet]].
Additionally, you are (beginning) computing professionals, so you should be familiar with the
[[http://www.acm.org/about/code-of-ethics|code of conduct]] for the primary professional society,
the Association for Computing Machinery (ACM).
>>center<<
You MAY discuss assignments but the work you turn in must be your own.
>><<
We work to maintain an environment supportive of learning in the classroom and laboratory.
Towards this end, we require that you be courteous to and respectful of your fellow participants
(i.e., classmates, instructors, TAs and tutors). In particular:
* Please turn off the ring on your cell phone. If you are expecting an emergency call, sit near the door and slide out discretely to take it.
* If you plan to use a laptop during class, please sit at the back of the classroom and turn off any sound from the machine. The tap-tap of the keyboard and the images showing on a screen can be distracting to those sitting around you. Also, be aware if you IM during class, that giggles, snorts or other reactions to what you are reading can be heard by the class and instructors and may be completely inappropriate with what is going on in the classroom.
* Laptops and other personal computing devices must be shut during exams and quizzes.
\\
Changed lines 6-13 from:
||**TAs** ||email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours:
|| ||Nick Parrish email: njamesp (at) gmail (dot) com
|| ||Office Hours:
|| ||
||**Tutors** ||
|| ||
||**Lecture** ||MWF 2-3pm at Wagar 231 ||
|| ||Office Hours:
|| ||Nick Parrish email: njamesp (at) gmail (dot) com
|| ||Office Hours:
|| ||
||**Tutors** ||
|| ||
||**Lecture** ||MWF 2-3pm at Wagar 231
to:
||**Lecture** ||MWF 9-9:50am at room 325 in the new building ||
Changed lines 8-13 from:
|| ||Tue 5:00-6:40 ||
|| ||Thu 6:00-7:40pm ||
|| ||All recitations are in room 215 in the new computer science building ||
to:
Changed lines 13-23 from:
The course is taught using the Java language
Topics
* Linear Data Structures: Stacks and Queues
* Advanced Sorting
* Trees
* Graphs
* Computational Complexity
to:
* A primer in biology; computational problems arising in biology (week 1)
* Sequence alignment for DNA and protein sequences (weeks 2 – 4)
** Concepts: homology, sequence similarity and sequence alignment; dynamic programming algorithms
** Pairwise alignment
** Global and local alignment using dynamic programming
** Heuristic alignment methods: BLAST/FASTA and the statistics of local alignments
** Multiple sequence alignment
*** Definition, scoring, techniques
*** Aligners for proteins sequences
*** Spliced alignment
* Motif finding in DNA and proteins (week 5)
* Hidden Markov models (HMMs) (week 6 – 8)
** The basic HMM algorithms: forward, backward, Viterbi, Baum-Welch
** Applications: CpG islands, gene finding, profile HMMs, pair HMMs
* Genome assembly (week 9)
* Analysis of high-throughput sequencing data (week 10)
* Phylogenetic analysis (week 11 – 12)
** Why phylogeny?
** Neighbor joining, parsimony, and maximum likelihood methods
* Comparative genomics: gene regulation, gene finding, genome rearrangements (week 13)
* High throughput biological data: microarrays, mass spectrometry, and protein-protein interactions (week 14)
* Student project presentations and class summary (week 15)
* Sequence alignment for DNA and protein sequences (weeks 2 – 4)
** Concepts: homology, sequence similarity and sequence alignment; dynamic programming algorithms
** Pairwise alignment
** Global and local alignment using dynamic programming
** Heuristic alignment methods: BLAST/FASTA and the statistics of local alignments
** Multiple sequence alignment
*** Definition, scoring, techniques
*** Aligners for proteins sequences
*** Spliced alignment
* Motif finding in DNA and proteins (week 5)
* Hidden Markov models (HMMs) (week 6 – 8)
** The basic HMM algorithms: forward, backward, Viterbi, Baum-Welch
** Applications: CpG islands, gene finding, profile HMMs, pair HMMs
* Genome assembly (week 9)
* Analysis of high-throughput sequencing data (week 10)
* Phylogenetic analysis (week 11 – 12)
** Why phylogeny?
** Neighbor joining, parsimony, and maximum likelihood methods
* Comparative genomics: gene regulation, gene finding, genome rearrangements (week 13)
* High throughput biological data: microarrays, mass spectrometry, and protein-protein interactions (week 14)
* Student project presentations and class summary (week 15)
Changed lines 38-39 from:
to:
Some background in statistics and ability to program (R and matlab are good enough)
Deleted line 9:
Changed line 19 from:
|| ||All recitations are in COMSC 215 ||
to:
|| ||All recitations are in room 215 in the new computer science building ||
Changed line 37 from:
to:
**Prerequisites:**\\
Changed lines 40-41 from:
to:
**Textbooks:**
Changed line 43 from:
|| ||Data Abstraction and Problem Solving with Java, 2nd edition || %width=100px%Attach:walls.jpg||
to:
|| ||Data Abstraction and Problem Solving with Java,\\ 2nd edition\\Frank Carrano and Janet Prichard || %width=100px%Attach:walls.jpg||
Changed line 15 from:
|| || ||
to:
|| ||
Changed line 43 from:
|| ||Data Abstraction and Problem Solving with Java, 2nd edition || Attach:walls.jpg||
to:
|| ||Data Abstraction and Problem Solving with Java, 2nd edition || %width=100px%Attach:walls.jpg||
Changed line 6 from:
||**TAs** || email: (at) cs (dot) colostate (dot) edu
to:
||**TAs** ||email: (at) cs (dot) colostate (dot) edu
Deleted lines 7-8:
|| ||Office Hours: Tue 10am - 12pm
Changed line 14 from:
||**Lecture** || MWF 2-3pm at Wagar 231 ||
to:
||**Lecture** ||MWF 2-3pm at Wagar 231 ||
Changed lines 4-7 from:
|| ||Office #448 in the new computer science building
email: (at) cs (dot) colostate (dot) edu
to:
|| ||Office #448 in the new computer science building ||
|| ||Office Hours: TBA ||
||**TAs** || email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours: TBA ||
||**TAs** || email: (at) cs (dot) colostate (dot) edu
Changed line 8 from:
|| || email: (at) cs (dot) colostate (dot) edu
to:
|| ||email: (at) cs (dot) colostate (dot) edu
Added lines 1-135:
===Who, Where, When
||**Instructor** ||[[http://www.cs.colostate.edu/~asa | Asa Ben-Hur]]
|| ||Office #448 in the new computer science building
|| ||Office Hours: TBA
||**TAs** || email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours:
|| || email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours: Tue 10am - 12pm
|| ||Nick Parrish email: njamesp (at) gmail (dot) com
|| ||Office Hours:
|| ||
||**Tutors** ||
|| ||
||**Lecture** || MWF 2-3pm at Wagar 231 ||
|| || ||
||**Recitation** ||Mon 5:00-6:40pm ||
|| ||Tue 5:00-6:40 ||
|| ||Thu 6:00-7:40pm ||
|| ||All recitations are in COMSC 215 ||
----
===Course Description
CS200 revisits and extends the principles of programming and discrete math that are introduced in CS161 and applies them to the development, analysis and implementation of data structures and efficient software.
The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graphs. Complementary topics from theory include recurrence relations, trees, and graphs. The course requires larger programs and team programming.
Topics
* Linear Data Structures: Stacks and Queues
* Advanced Sorting
* Trees
* Graphs
* Hash Tables
* Computational Complexity
-> **Prerequisites:**\\
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
-> Textbooks:
||
|| ||Data Abstraction and Problem Solving with Java, 2nd edition || Attach:walls.jpg||
-> We will also use:\\
Discrete Mathematics and Its Applications, Sixth Edition\\
Kenneth Rosen
----
===Grading:
||Assignments || 45% ||Programing and written assignments
||Quizzes || 10% ||
||Midterms (2) || 25% ||1st Midterm: 12%\\2nd Midterm: 13%
||Final Exam || 20% ||Comprehensive
Assignments will be done individually, except selected programming assignments
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given.
No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit (maximum of one per student per class session). Three chits earned translate into 10 additional points on the next quiz.
The assignment of letter grades will be made as follows:
||
||Letter Grade || Point Range
|| A || 90-100 ||
|| B || 80-89.9 ||
|| C || 70-79.9 ||
|| D || 60-69.9 ||
|| F || below 60 ||
NOTE: We will NOT cut higher than these points (but may cut lower).
----
===Late and Makeup Policy
**Midterm and Finals:** Make-up exams are only given in extraordinary circumstances (e.g., illness, death of family member). Students must consult with the instructor as soon as possible, preferably before the start of the exam. Course examination dates are listed in the syllabus; be aware of them and plan accordingly.
No make-ups will be given for missed quizzes.
**Programming assignments** are to be submitted electronically using the [[http://www.cs.colostate.edu/~cs200/checkin.html |checkin]] program. Always check the assignment page for due dates. Late assignments submitted within 48 hours of the time required (or otherwise specified) will receive a 20% late penalty. Electronic submission is closed 48 hours after assignments are due (or as otherwise specified); students not having submitted programs receive an automatic zero on the assignment.
**Written assignments** are to be submitted in class. These may be handwritten, but must be legible.
The instructors and TAs reserve the right to decide whether or not a paper is legible.
Late assignments are accepted in class on the first MWF after the original due date, and will receive a 20% late penalty.
Assignment will be returned within 5 working days of the end of the late period.
----
===Important Dates
First Midterm: TBA
Second Midterm: TBA
Final Exam: TBA
All midterm exams are in the same room as the lecture.
Course withdrawal date:
----
===Professional Conduct
All students are expected to conduct themselves professionally. We assume you are familiar with the policies in the
[[http://www.cs.colostate.edu/~info/student-info | student information sheet]].
Additionally, you are (beginning) computing professionals, so you should be familiar with the
[[http://www.acm.org/about/code-of-ethics|code of conduct]] for the primary professional society,
the Association for Computing Machinery (ACM).
>>center<<
You MAY discuss assignments but the work you turn in must be your own.
>><<
We work to maintain an environment supportive of learning in the classroom and laboratory.
Towards this end, we require that you be courteous to and respectful of your fellow participants
(i.e., classmates, instructors, TAs and tutors). In particular:
* Please turn off the ring on your cell phone. If you are expecting an emergency call, sit near the door and slide out discretely to take it.
* If you plan to use a laptop during class, please sit at the back of the classroom and turn off any sound from the machine. The tap-tap of the keyboard and the images showing on a screen can be distracting to those sitting around you. Also, be aware if you IM during class, that giggles, snorts or other reactions to what you are reading can be heard by the class and instructors and may be completely inappropriate with what is going on in the classroom.
* Laptops and other personal computing devices must be shut during exams and quizzes.
\\
||**Instructor** ||[[http://www.cs.colostate.edu/~asa | Asa Ben-Hur]]
|| ||Office #448 in the new computer science building
|| ||Office Hours: TBA
||**TAs** || email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours:
|| || email: (at) cs (dot) colostate (dot) edu
|| ||Office Hours: Tue 10am - 12pm
|| ||Nick Parrish email: njamesp (at) gmail (dot) com
|| ||Office Hours:
|| ||
||**Tutors** ||
|| ||
||**Lecture** || MWF 2-3pm at Wagar 231 ||
|| || ||
||**Recitation** ||Mon 5:00-6:40pm ||
|| ||Tue 5:00-6:40 ||
|| ||Thu 6:00-7:40pm ||
|| ||All recitations are in COMSC 215 ||
----
===Course Description
CS200 revisits and extends the principles of programming and discrete math that are introduced in CS161 and applies them to the development, analysis and implementation of data structures and efficient software.
The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graphs. Complementary topics from theory include recurrence relations, trees, and graphs. The course requires larger programs and team programming.
Topics
* Linear Data Structures: Stacks and Queues
* Advanced Sorting
* Trees
* Graphs
* Hash Tables
* Computational Complexity
-> **Prerequisites:**\\
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
-> Textbooks:
||
|| ||Data Abstraction and Problem Solving with Java, 2nd edition || Attach:walls.jpg||
-> We will also use:\\
Discrete Mathematics and Its Applications, Sixth Edition\\
Kenneth Rosen
----
===Grading:
||Assignments || 45% ||Programing and written assignments
||Quizzes || 10% ||
||Midterms (2) || 25% ||1st Midterm: 12%\\2nd Midterm: 13%
||Final Exam || 20% ||Comprehensive
Assignments will be done individually, except selected programming assignments
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given.
No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit (maximum of one per student per class session). Three chits earned translate into 10 additional points on the next quiz.
The assignment of letter grades will be made as follows:
||
||Letter Grade || Point Range
|| A || 90-100 ||
|| B || 80-89.9 ||
|| C || 70-79.9 ||
|| D || 60-69.9 ||
|| F || below 60 ||
NOTE: We will NOT cut higher than these points (but may cut lower).
----
===Late and Makeup Policy
**Midterm and Finals:** Make-up exams are only given in extraordinary circumstances (e.g., illness, death of family member). Students must consult with the instructor as soon as possible, preferably before the start of the exam. Course examination dates are listed in the syllabus; be aware of them and plan accordingly.
No make-ups will be given for missed quizzes.
**Programming assignments** are to be submitted electronically using the [[http://www.cs.colostate.edu/~cs200/checkin.html |checkin]] program. Always check the assignment page for due dates. Late assignments submitted within 48 hours of the time required (or otherwise specified) will receive a 20% late penalty. Electronic submission is closed 48 hours after assignments are due (or as otherwise specified); students not having submitted programs receive an automatic zero on the assignment.
**Written assignments** are to be submitted in class. These may be handwritten, but must be legible.
The instructors and TAs reserve the right to decide whether or not a paper is legible.
Late assignments are accepted in class on the first MWF after the original due date, and will receive a 20% late penalty.
Assignment will be returned within 5 working days of the end of the late period.
----
===Important Dates
First Midterm: TBA
Second Midterm: TBA
Final Exam: TBA
All midterm exams are in the same room as the lecture.
Course withdrawal date:
----
===Professional Conduct
All students are expected to conduct themselves professionally. We assume you are familiar with the policies in the
[[http://www.cs.colostate.edu/~info/student-info | student information sheet]].
Additionally, you are (beginning) computing professionals, so you should be familiar with the
[[http://www.acm.org/about/code-of-ethics|code of conduct]] for the primary professional society,
the Association for Computing Machinery (ACM).
>>center<<
You MAY discuss assignments but the work you turn in must be your own.
>><<
We work to maintain an environment supportive of learning in the classroom and laboratory.
Towards this end, we require that you be courteous to and respectful of your fellow participants
(i.e., classmates, instructors, TAs and tutors). In particular:
* Please turn off the ring on your cell phone. If you are expecting an emergency call, sit near the door and slide out discretely to take it.
* If you plan to use a laptop during class, please sit at the back of the classroom and turn off any sound from the machine. The tap-tap of the keyboard and the images showing on a screen can be distracting to those sitting around you. Also, be aware if you IM during class, that giggles, snorts or other reactions to what you are reading can be heard by the class and instructors and may be completely inappropriate with what is going on in the classroom.
* Laptops and other personal computing devices must be shut during exams and quizzes.
\\