ODIn/Website
9
0
Fork 1
Code Pull requests Releases Wiki Activity

Grading Criteria for Checkpoint 1 added

Browse source
This commit is contained in:
Gokhan Kul 2018-02-12 16:44:21 -05:00
parent 7f58bf50c0
commit e1aa1dfb8c
1 changed files with 57 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

62
src/teaching/cse-562/2018sp/checkpoint1.erb
View file

@ -220,10 +220,10 @@ Eval eval = new Eval(){
<p>For example (<span style="color: red">red</span> text is entered by the user/grader):</p>
<pre>bash&gt; <span style="color: red">ls data</span>
R.dat
S.dat
T.dat
bash&gt; <span style="color: red">cat data/R.dat</span>
R.csv
S.csv
T.csv
bash&gt; <span style="color: red">cat data/R.csv</span>
1|1|5
1|2|6
2|3|7
@ -237,4 +237,56 @@ $> <span style="color: red">SELECT A + B AS Q FROM R;</span>
3
5
</pre>
<p>For this project, your code will not be timed, but you will need to answer some queries with a cap on available memory. You will receive up to 7 points for answering queries successfully, up to 3 additional points for beating the reference implementation timewise.</p>dr
<p>For this project, your code will be timed, for only two queries. You will receive up to 7 points for answering queries successfully, up to 3 additional points for matching the reference implementation timewise.</p>
<p>For this project, we will issue 5 queries to your program excluding <tt>CREATE TABLE</tt> queries. 3 of these queries will NOT be timed, and they will evaluated based on the correctness of the query results. Answering each query successfully will bring you 1 point each. An example file you will read the data from is given <a href="https://www.cse.buffalo.edu/~gokhanku/R.csv">here</a>. This file is the same size and has the same structure with what we will use to evaluate these three queries. The remaining two queries will be timed, and they will run on a file that has 4000 tuples (~200 KB). You will get 2 point for each query if you can return correct results. You will receive additional 1.5 points for each query for matching or beating the reference implementation timewise. Also keep in mind that for ALL queries, the grader will time out and exit after 5 minutes.
</p>
<style type="text/css">
.tg {border-collapse:collapse;border-spacing:0;}
.tg td{font-family:Arial, sans-serif;font-size:14px;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
.tg th{font-family:Arial, sans-serif;font-size:14px;font-weight:normal;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
.tg .tg-s6z2{text-align:center}
.tg .tg-baqh{text-align:center;vertical-align:top}
.tg .tg-hgcj{font-weight:bold;text-align:center}
.tg .tg-amwm{font-weight:bold;text-align:center;vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-s6z2"></th>
<th class="tg-hgcj">Points for<br>Correctness</th>
<th class="tg-hgcj">Points for<br>Performance</th>
<th class="tg-amwm">Table<br>Size</th>
</tr>
<tr>
<td class="tg-hgcj">Query 1</td>
<td class="tg-s6z2">1</td>
<td class="tg-s6z2">0</td>
<td class="tg-baqh">~10 tuples</td>
</tr>
<tr>
<td class="tg-hgcj">Query 2</td>
<td class="tg-s6z2">1</td>
<td class="tg-s6z2">0</td>
<td class="tg-baqh">~10 tuples</td>
</tr>
<tr>
<td class="tg-hgcj">Query 3</td>
<td class="tg-s6z2">1</td>
<td class="tg-s6z2">0</td>
<td class="tg-baqh">~10 tuples</td>
</tr>
<tr>
<td class="tg-amwm">Query 4</td>
<td class="tg-baqh">2</td>
<td class="tg-baqh">1.5</td>
<td class="tg-baqh">~4000 tuples</td>
</tr>
<tr>
<td class="tg-amwm">Query 5</td>
<td class="tg-baqh">2</td>
<td class="tg-baqh">1.5</td>
<td class="tg-baqh">~4000 tuples</td>
</tr>
</table>