Labs
From 6.034 Wiki
(Difference between revisions)
(→The online grader) |
m (→Currently released labs) |
||
(30 intermediate revisions not shown.) | |||
Line 1: | Line 1: | ||
== Currently released labs == | == Currently released labs == | ||
- | + | {{Lab|lab=0|when=Tuesday, September 12}} <!-- ([http://web.mit.edu/6.034/www/labs/lab0_solution.py Solution]) --> | |
- | + | {{Lab|lab=1|when=Tuesday, September 19}} | |
+ | {{Lab|lab=2|when=Thursday, September 21}} | ||
+ | {{Lab|lab=3|when=Monday, September 25}} | ||
+ | <!-- Unreleased labs go below --> | ||
<!-- | <!-- | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
+ | * [[Lab 4]] -- due Friday, October 14 by '''10:00pm''' | ||
+ | * [[Lab 5]] -- due Friday, October 21 by '''10:00pm''' | ||
+ | * [[Lab 6]] -- due Wednesday, November 2 by '''10:00pm''' | ||
+ | * [[Lab 7]] -- due Friday, November 4 by '''10:00pm''' | ||
+ | * [[Lab 8]] -- due Tuesday, November 22 by '''10:00pm''' | ||
+ | * [[Lab 9]] -- due Wednesday, November 30 by '''10:00pm''' | ||
+ | --> | ||
+ | <!-- | ||
Optional: | Optional: | ||
Line 25: | Line 28: | ||
Labs are due by '''10:00 pm''' on the due date. | Labs are due by '''10:00 pm''' on the due date. | ||
- | Labs are anticipated to be released by | + | Labs are anticipated to be released by 11:59 pm on the release date. Each lab release will be announced by email. |
{| cellpadding=5 border=1 cellspacing=0 | {| cellpadding=5 border=1 cellspacing=0 | ||
Line 31: | Line 34: | ||
! Lab !! Subject !! Released !! Due | ! Lab !! Subject !! Released !! Due | ||
|- | |- | ||
- | |lab 0|| Getting Started || 9/ | + | |lab 0|| Getting Started || 9/6 || 9/12 |
|- | |- | ||
- | |lab 1|| Rule-Based Systems || 9/ | + | |lab 1|| Rule-Based Systems || 9/11 || 9/19 |
|- | |- | ||
- | |lab 2|| Search || 9/14 || 9/ | + | |lab 2|| Search || 9/14 || 9/21 |
|- | |- | ||
- | |lab 3|| Games || 9/ | + | |lab 3|| Games || 9/18 || 9/25 |
|- | |- | ||
- | |lab 4|| Constraint Satisfaction Problems || 9/ | + | |lab 4|| Constraint Satisfaction Problems || 9/28 || 10/11 |
|- | |- | ||
- | |lab 5|| k-Nearest Neighbors & ID Trees || 10/ | + | |lab 5|| k-Nearest Neighbors & ID Trees || 10/2 || 10/15 |
|- | |- | ||
- | |lab 6|| Neural Nets || 10/ | + | |lab 6|| Neural Nets || 10/19 || 11/2 |
|- | |- | ||
- | |lab 7|| Support Vector Machines || 10/ | + | |lab 7|| Support Vector Machines || 10/27 || 11/6 |
|- | |- | ||
- | |lab 8|| Bayesian Inference || 11/ | + | |lab 8|| Bayesian Inference || 11/13 || 11/29 |
|- | |- | ||
- | |lab 9|| Adaboost || 11/ | + | |lab 9|| Adaboost || 11/20 || 12/3 |
|} | |} | ||
+ | |||
+ | ''The anticipated release and due dates for all unreleased labs are subject to change.'' | ||
+ | |||
+ | <!-- | ||
== The online grader == | == The online grader == | ||
You will be submitting all of your labs to an online grader. Every lab comes with a file, <tt>tester.py</tt>, that contains the machinery to test your code and to submit it when you're done. | You will be submitting all of your labs to an online grader. Every lab comes with a file, <tt>tester.py</tt>, that contains the machinery to test your code and to submit it when you're done. | ||
Line 59: | Line 66: | ||
Make sure you have an [http://ca.mit.edu/ MIT certificate], and go to https://ai6034.mit.edu/labs . This will give you a file called <tt>key.py</tt>. Keep this file secure; for example, don't put it in a publicly-readable Athena directory. | Make sure you have an [http://ca.mit.edu/ MIT certificate], and go to https://ai6034.mit.edu/labs . This will give you a file called <tt>key.py</tt>. Keep this file secure; for example, don't put it in a publicly-readable Athena directory. | ||
- | If you do not have a valid certificate, https://ai6034.mit.edu/labs will load but | + | If you do not have a valid certificate, https://ai6034.mit.edu/labs will load but will display an error message telling you something is wrong with your certificate. If you encounter this issue, please reinstall your certificate and restart your browser. |
The only thing the grader cares about is whether you pass the tests. It does not care if your code is pretty or well-commented. However, commenting your code can still be important: if you want a TA to help you with your lab, they will be able to give you more help if your code is understandable. | The only thing the grader cares about is whether you pass the tests. It does not care if your code is pretty or well-commented. However, commenting your code can still be important: if you want a TA to help you with your lab, they will be able to give you more help if your code is understandable. | ||
Line 69: | Line 76: | ||
Note that each lab grade is the maximum score out of all of your submissions for that lab. This means that if you re-submit a lab and the command line output shows a lower grade, your grade for the lab will not actually decrease. | Note that each lab grade is the maximum score out of all of your submissions for that lab. This means that if you re-submit a lab and the command line output shows a lower grade, your grade for the lab will not actually decrease. | ||
+ | --> |
Revision as of 03:56, 19 September 2017
Currently released labs
- Lab 0 ~ due Tuesday, September 12 by 10:00pm
- Lab 1 ~ due Tuesday, September 19 by 10:00pm
- Lab 2 ~ due Thursday, September 21 by 10:00pm
- Lab 3 ~ due Monday, September 25 by 10:00pm
Anticipated lab release schedule
Labs are due by 10:00 pm on the due date.
Labs are anticipated to be released by 11:59 pm on the release date. Each lab release will be announced by email.
Lab | Subject | Released | Due |
---|---|---|---|
lab 0 | Getting Started | 9/6 | 9/12 |
lab 1 | Rule-Based Systems | 9/11 | 9/19 |
lab 2 | Search | 9/14 | 9/21 |
lab 3 | Games | 9/18 | 9/25 |
lab 4 | Constraint Satisfaction Problems | 9/28 | 10/11 |
lab 5 | k-Nearest Neighbors & ID Trees | 10/2 | 10/15 |
lab 6 | Neural Nets | 10/19 | 11/2 |
lab 7 | Support Vector Machines | 10/27 | 11/6 |
lab 8 | Bayesian Inference | 11/13 | 11/29 |
lab 9 | Adaboost | 11/20 | 12/3 |
The anticipated release and due dates for all unreleased labs are subject to change.