ODIn
/
Website
9
0
Fork 1
Code Pull Requests Releases Wiki Activity
Website/src/teaching/cse-250/2022fa/index.erb

1302 lines
50 KiB
Plaintext
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
title: CSE-250 Data Structures (Fall 2022)
staff:
- name: Oliver Kennedy
role: Instructor
hours: Weds 11:00-1:00
location: Capen 212
email: okennedy@buffalo.edu
web: "https://odin.cse.buffalo.edu/"
- name: Eric Mikida
role: Instructor
hours: M/T 1:00-3:00, W 3:00-5:00
location: Capen 212
email: epmikida@buffalo.edu
- name: Nawar Khouri
role: TA
- name: Jacky Lin
role: TA
- name: Amelia Graca
role: TA
- name: Anton Kalinin
role: TA
- name: Joey Poblete
role: TA
- name: Thinh Ho
role: TA
- name: Heba Mahran
role: TA
- name: Riad Mukhtarov
role: TA
- name: Kyle Geffner
role: TA
- name: David Lam
role: TA
- name: Kartike Chaurasia
role: TA
- name: Tirth Shah
role: TA
- name: Dikshit Khandelwal
role: TA
- name: Hope Kara
role: TA
- name: Vrund Patel
role: TA
- name: Sean Grzenda
role: TA
- name: Andrew Schick
role: TA
times:
lecture:
A:
date: M/W/F
time: "5:00 PM - 5:50 PM"
location: NSC 201
code: n/a
instructors:
- Eric Mikida
B:
date: M/W/F
time: "4:00 PM - 4:50 PM"
location: NSC 225
code: n/a
instructors:
- Oliver Kennedy
recitation:
A1:
date: M
time: "10:00 AM - 10:50 AM"
location: Bell 340
code: 10904
instructors:
- Joey Poblete
- Nawar Khouri
A2:
date: M
time: "9:00 AM - 9:50 AM"
location: Bell 340
code: 17647
instructors:
- Andrew Schick
- Sean Grzenda
A3:
date: M
time: "4:00 PM - 4:50 PM"
location: Bell 340
code: 10663
instructors:
- Kyle Geffner
- Heba Mahran
A4:
date: M
time: "3:00 PM - 3:50 PM"
location: Bell 340
code: 10981
instructors:
- Heba Mahran
- Dikshit Khandelwal
A5:
date: Tu
time: "3:00 PM - 3:50 PM"
location: Bell 340
code: 11315
instructors:
- Kyle Geffner
- Anton Kalinin
A6:
date: Tu
time: "11:00 AM - 11:50 PM"
location: Bell 340
code: 16893
instructors:
- Kartike Chaurasia
- Amelia Graca
B1:
date: M
time: "8:00 AM - 8:50 AM"
location: Bell 340
code: 18212
instructors:
- Riad Mukhtarov
- David Lam
B2:
date: Tu
time: "10:00 AM - 10:50 AM"
location: Bell 340
code: 10579
instructors:
- Kartike Chaurasia
- Anton Kalinin
B3:
date: W
time: "3:00 PM - 3:50 PM"
location: Bell 340
code: 19110
instructors:
- Andrew Schick
- Hope Kara
B4:
date: M
time: "11:00 AM - 11:50 PM"
location: Bell 340
code: 11240
instructors:
- Jacky Lin
- Vrund Patel
B5:
date: Tu
time: "12:30 PM - 1:20 PM"
location: Bell 340
code: 16892
instructors:
- Amelia Graca
- Tirth Shah
B6:
date: Tu
time: "2:00 PM - 2:50 PM"
location: Bell 340
code: 16894
instructors:
- Hope Kara
- Sean Grzenda
resign_date: Friday, Nov. 11, 2022
resources:
required_textbooks:
- title: "Object-Orientation, Abstraction, and Data Structures Using Scala, 2nd Edition."
authors: M. Lewis, L. Lacher
isbn: 978-1498732161
note: Required by September 1
- title: "Scala Cookbook"
authors: A. Alexander
isbn: 978-1449339616
note: "Many chapters available freely online: http://scalacookbook.com/"
- title: "Functional Programming in Scala"
authors: Paul Chiusano, Runar Bjarnason
isbn: 978-1617290657
online:
- title: Piazza
url: https://piazza.com/buffalo/fall2022/cse250
- title: Autolab
url: https://autograder.cse.buffalo.edu
info:
- title: Office Hours
url: "https://docs.google.com/spreadsheets/d/1L-GEWEhcRolVxSzY_hTjqVYaEGCbAQQmKSEVzHUakec/edit?usp=sharing"
schedule:
- week: 1
lectures:
- date: 08/29/22
topic: Intro, Logistics
dow: Mon
section_a:
slides: slide/lec01a.pdf
section_b:
slides: slide/0b-Overview.pdf
code: https://github.com/UBOdin/cse250-examples/blob/main/SpeedDemo/Snippets.scala
- date: 08/31/22
topic: Scala
dow: Wed
section_a:
slides: slide/lec02a.pdf
section_b:
slides: slide/1b-Scala.pdf
- date: 09/02/22
topic: Debuggers and Profilers
dow: Fri
section_a:
slides: slide/lec03a.pdf
code: https://github.com/UBOdin/cse250-examples/tree/main/Debuggers
section_b:
slides: slide/2b-WhenThingsGoWrong.pdf
code: https://github.com/UBOdin/cse250-examples/tree/main/Debuggers
- week: 2
lectures:
- date: 09/06/22
special: Add-Drop Deadline
dow: Sun
- date: 09/05/22
special: "No Class: Labor Day"
dow: Mon
- date: 09/07/22
topic: Runtime Analysis - Intuitions
due: AI Quiz
dow: Wed
section_a:
slides: slide/lec04a.pdf
code: https://github.com/UBOdin/cse250-examples/blob/main/SpeedDemo/Snippets.scala
section_b:
slides: slide/3b-FunctionAnalysis.html
- date: 09/09/22
topic: Runtime Analysis - Formalism
dow: Fri
due: PA0
section_a:
slides: slide/4b-AsymptoticNotation.html
section_b:
slides: slide/4b-AsymptoticNotation.html
- week: 3
lectures:
- date: 09/12/22
dow: Mon
topic: Runtime Analysis - Formalism (contd...)
section_a:
slides: slide/4b-AsymptoticNotation.html#/16
section_b:
slides: slide/4b-AsymptoticNotation.html#/16
- date: 09/14/22
topic: Runtime Analysis - Examples
dow: Wed
section_a:
slides: slide/lec07a.pdf
section_b:
slides: slide/6b-AsymptoticExamples.html
- date: 09/16/22
topic: ADTs, Sequences, Arrays
dow: Fri
section_a:
slides: slide/lec08a.pdf
section_b:
slides: slide/7b-ADTsandSequences.html
- week: 4
lectures:
- date: 09/19/22
topic: ArrayBuffer, Amortized Runtime, and Option types
due: PA1
dow: Mon
section_a:
slides: slide/lec09a.pdf
section_b:
slides: slide/8b-ArrayBufferAmortized.html
- date: 09/21/22
topic: Linked Lists and Iterators
dow: Wed
section_a:
slides: slide/lec10a.pdf
section_b:
slides: slide/9b-LinkedListIterator.html
- date: 09/23/22
topic: Recursion Intro
dow: Fri
section_a:
slides: slide/lec11a.pdf
section_b:
slides: slide/10b-Recursion.html
- week: 5
lectures:
- date: 09/26/22
topic: Recursive Analysis; Sorts
dow: Mon
section_a:
slides: slide/lec12a.pdf
section_b:
slides: slide/11b-RecursionAnalysis.html
- date: 09/28/22
topic: Recursive Analysis (contd...)
dow: Wed
due: WA1
section_a:
slides: slide/lec13a.pdf
section_b:
slides: slide/12b-RecursionAndAverage.html
- date: 09/30/22
topic: Stacks, Queues
dow: Fri
section_a:
slides: slide/lec14a.pdf
section_b:
slides: slide/13b-AverageQueueStack.html
- week: 6
lectures:
- date: 10/03/22
topic: "Applications of Stacks, Queues (Mazes)"
dow: Mon
section_a:
slides: slide/lec15a.pdf
section_b:
slides: slide/14b-QueueStackApps.html
- date: 10/05/22
topic: "Graphs; Graph ADTs"
dow: Wed
section_a:
slides: slide/lec16a.pdf
section_b:
slides: slide/15b-Graphs.html
- date: 10/07/22
topic: "Graph Search; DFS"
dow: Fri
section_a:
slides: slide/lec17a.pdf
section_b:
slides: slide/16b-GraphExploration.html
- week: 7
lectures:
- date: 10/10/22
topic: "Graph Search; Pathfinding, BFS"
due: PA2-Tests
dow: Mon
section_a:
slides: slide/lec18.pdf
section_b:
slides: slide/lec18.pdf
- date: 10/12/22
topic: BFS, Shortest Path, Priority Queues
dow: Wed
section_a:
slides: slide/lec19.pdf
section_b:
slides: slide/lec19.pdf
- date: 10/14/22
topic: Order Relations, Priority Queues
dow: Fri
section_b:
slides: slide/19b-Orderings.html
- week: 8
lectures:
- date: 10/17/22
topic: Midterm Review
due: PA2
dow: Mon
- date: 10/19/22
special: Midterm Exam
links:
2021_Fall: ../exams/2021fa_midterm.pdf
dow: Wed
- date: 10/21/22
topic: Organizing Cat Pictures
dow: Fri
- week: 9
lectures:
- date: 10/24/22
topic: Heaps
dow: Mon
- date: 10/26/22
topic: Trees
dow: Wed
- date: 10/28/22
topic: Binary Search Trees, Tree Iteration
due: PA3-Tests
dow: Fri
- week: 10
lectures:
- date: 10/31/22
topic: Balanced Trees (AVL)
dow: Mon
- date: 11/02/22
topic: Balanced Trees (Red-Black)
dow: Wed
- date: 11/04/22
topic: Balanced Trees (contd...)
dow: Fri
due: PA3
- week: 11
lectures:
- date: 11/07/22
topic: Associative Map ADTs
dow: Mon
- date: 11/09/22
due: PA3
topic: Hash Functions
dow: Wed
- date: 11/11/22
topic: Hash Table Basics
dow: Fri
- date: 11/11/22
special: Resign Deadline
dow: Fri
due: WA2
- week: 12
lectures:
- date: 11/14/22
topic: Hash Table Analysis
dow: Mon
- date: 11/16/22
due: WA2
topic: Hash Tables with Open Addressing
dow: Wed
- date: 11/18/22
topic: Double-/Cuckoo-Hashing
dow: Fri
- week: 13
lectures:
- date: 11/21/22
topic: Bloom Filters
dow: Mon
- date: 11/23/22
special: "No Class: Fall Recess"
dow: Wed
- date: 11/25/22
special: "No Class: Fall Recess"
dow: Fri
due: PA4-Tests
- week: 14
lectures:
- date: 11/28/22
topic: Secondary Storage (Paging)
dow: Mon
- date: 11/30/22
topic: Secondary Storage (B+Trees)
dow: Wed
- date: 12/02/22
due: PA4
topic: Buffer / Advanced Data Structures
dow: Fri
- week: 15
lectures:
- date: 12/05/22
topic: Wrap-Up / Review
dow: Mon
- date: 12/07/22
topic: Wrap-Up / Review
dow: Wed
- date: 12/09/22
topic: Wrap-Up / Review
dow: Fri
due: WA3
- week: Exam
lectures:
- date: ???
special: Final Exam
---
<style>
p {
margin-top: 10px;
max-width: 800px;
}
table.schedule tr + tr td {
padding-top: 5px;
}
table.schedule td {
padding-left: 8px;
padding-right: 8px;
text-align: center;
}
table.schedule th {
text-align: center;
padding-left: 8px;
padding-right: 8px;
border-bottom: 1px solid black;
}
table.schedule td + td {
border-left: 1px solid black;
}
table.schedule th + th {
border-left: 1px solid black;
}
table.schedule td.special {
background: #eee;
font-weight: bold;
border-left: none;
}
table.schedule td.weeksplit {
height: 0px;
padding: 0px;
margin: 0px;
border-top: 0.5px solid #ccc;
background: #fff;
}
ul.details {
padding-left: 15px;
margin-top: -5px;
}
ul.details li {
padding-left: 0px;
list-style-type: '↳';
font-size: 90%;
max-width: 750px;
}
ol li {
max-width: 750px;
}
table {
max-width: 800px;
}
table.simple tr + tr td {
padding-top: 5px;
}
table.simple td {
padding-left: 8px;
padding-right: 8px;
text-align: center;
border-top: 1px solid black;
}
table.simple th {
text-align: center;
padding-left: 8px;
padding-right: 8px;
border-bottom: 1px solid black;
background: #eee;
}
table.simple td + td {
border-left: 1px solid black;
}
blockquote {
font-size: 90%;
max-width: 750px;
}
p.callout {
background: #433;
color: #fee;
padding: 10px;
border-radius: 10px;
}
</style>
<h2><%= title %></h2>
<p>This course provides a rigorous analysis of the design, implementation, and properties of advanced data
structures. Topics include time-space analysis and tradeoffs in arrays, vectors, lists, stacks, queues, and
heaps; tree and graph algorithms and traversals, hashing, sorting, and data structures on secondary storage.
Surveys library implementations of basic data structures in a high-level language. Advanced data structure
implementations are studied in detail. Illustrates the importance of choosing appropriate data structures when
solving a problem by programming projects in a high-level language.</p>
<p>4 credit hours (3 credits for lecture + 1 credits for recitation)</p>
<hr>
<h3>Course Resources</h3>
<% [
["Required Textbooks", resources["required_textbooks"]],
# ["Optional Textbooks", resources["optional_textbooks"]],
].each do |tag, books| %>
<h5><%= tag %></h5>
<ul class="details">
<% books.each do |textbook| %>
<li>"<%= textbook["title"] %>"</b> by <%= textbook["authors"] %> (ISBN: <%= textbook["isbn"] %>)
<% if textbook.include? "note" %><br><i><%= textbook["note"] %></i> <% end %>
</li>
<% end %>
</ul>
<% end %>
<h5>Online Resources</h5>
<ul class="details">
<% resources["online"].each do |resource| %>
<li><a href="<%=resource["url"]%>"><%=resource["title"]%></a></li>
<% end %>
</ul>
<h5>Course Logistics</h5>
<ul class="details">
<% resources["info"].each do |resource| %>
<li><a href="<%=resource["url"]%>"><%=resource["title"]%></a></li>
<% end %>
</ul>
<hr>
<h3>Course Staff</h3>
<ul>
<% staff.each do |deets| %>
<li><%=deets["name"]%> (<%=deets["role"]%>)
<%
notes = []
notes = notes + [["Location", deets["location"]]] if deets.include? "location"
notes = notes + [["Email", deets["email"].sub("@", " [by way of] ").sub(".", " [subscripted by] ")]] if deets.include? "email"
notes = notes + [["Web", "<a href='#{deets["web"]}'>#{deets["web"]}</a>"]] if deets.include? "web"
%>
<% unless notes.empty? %>
<%= notes.map { |title, note| "<b>#{title}</b>: #{note}" }.join("; ") %>
<% end %>
</li>
<% end %>
</ul>
<p>Please familiarize yourself with everyone involved with the course. We will strive to offer a
large amount of office hour availability for students to interact with us, the course staff. You
should never hesitate to come ask questions in office hours, whether it be a simple/fundamental
question, something more advanced that you are interested in, or simply to chat about the
material/department/life in general. Remember that you are always welcome with any level of
question and should not be shy to ask. Please report any issues/concerns with office hours ASAP so
we can address problems early in the semester.</p>
<p>If you need to email course staff, please include <b>[CSE 250]</b> at the beginning of the
subject line so your email is not missed. <b>Email omitting this tag from the subject or from non-UB
accounts will be ignored.</b></p>
<hr>
<%
[
["Lectures", times["lecture"]],
["Recitations", times["recitation"]]
].each do |heading, schedule|
%>
<h3><%=heading%></h3>
<table class="schedule">
<tr>
<th>Section</th>
<th>Dates</th>
<th>Time</th>
<th>Location</th>
<th>Registration #</th>
<th>Instructors</th>
</tr>
<% schedule.each do |section, details| %>
<tr>
<td>Section <%= section %></td>
<td><%= details["date"] %></td>
<td><%= details["time"] %></td>
<td><%= details["location"] %></td>
<td><%= details["code"] %></td>
<td><%= details["instructors"].join(", ")%></td>
</tr>
<% end %>
</table>
<% end %>
<p>Please attend the recitation you are registered for.</p>
<hr>
<h3>Course Schedule</h3>
<table class="schedule">
<tr>
<th>Date</th>
<th>Deliverable</th>
<th>Topic</th>
<th>Section A</th>
<th>Section B</th>
</tr>
<% schedule.each do |week| %>
<tr>
<td colspan=5 class="weeksplit"></td>
</tr>
<% week["lectures"].each do |lecture| %>
<tr>
<% if lecture.include? "special" %>
<td class="special"><%=lecture["dow"]%> <%=lecture["date"]%></td>
<td colspan=4 class="special"><%=lecture["special"]%>
<% if lecture.include? "links" %>
[<%= lecture["links"].map { |k,v| "<a href='#{v}'>#{k.sub("_", " ")}</a>" }.join(" | ") %>]
<% end %>
</td>
<% else %>
<td><%=lecture["dow"]%> <%=lecture["date"]%></td>
<td><%=lecture.fetch("due", "")%></td>
<td><%=lecture["topic"]%></td>
<td><%=lecture.fetch("section_a", {}).map do |k, v|
"<a href='#{v}'>#{k}</a>"
end.join(" | ") %></td>
<td><%=lecture.fetch("section_b", {}).map do |k, v|
"<a href='#{v}'>#{k}</a>"
end.join(" | ") %></td>
<% end %>
</tr>
<% end %>
<% end %>
</table>
<hr>
<h3>Prerequisites</h3>
<p>
Introduction to CS for Majors (CSE 116) and Discrete Structures (CSE 191) should be completed prior to
enrolling in this course. There will be assignments with an implementation component that requires prior
knowledge/experience with programming. We will also be covering many mathematics concepts that rely
heavily on skills acquired in discrete structures (such as proofs and mathematical notations), so plan
accordingly if you are not as comfortable with these topics.
</p>
<hr>
<h3>Student Learning Outcomes</h3>
<table class="simple">
<tr>
<th>#</th>
<th>Upon completing this course, students will be able to...</th>
<th>Student Outcome (CS/CE)*</th>
<th>Assessment Methods</th>
</tr>
<tr>
<td>1</td>
<td>compute, compare, and analyze runtime and function growth using asymptotic notation.</td>
<td>(1,2,5,6) / (1,2,5,7)</td>
<td>Written Assignments, Exams</td>
</tr>
<tr>
<td>2</td>
<td>identify functionality of basic data structures.</td>
<td>(1,2,6) / (2,7)</td>
<td>Written and Programming Assignments, Exams</td>
</tr>
<tr>
<td>3</td>
<td>identify the tradeoffs of different data structures, given their implementation. This also includes recognizing which situations benefit or suit the use of one data structure over another.</td>
<td>(1,2,5,6) / (1,2,5,7)</td>
<td>Written Assignments, Exams</td>
</tr>
<tr>
<td>4</td>
<td>use data structures in programming.</td>
<td>(1,2,5,6) / (1,5)</td>
<td>Programming Assignments</td>
</tr>
<tr>
<td>5</td>
<td>implement and analyze basic algorithms such as searching and sorting, as well as recursive algorithms, tree traversal algorithms, and graph traversal algorithms.</td>
<td>(1,2,5,6) / (1,2,5,7)</td>
<td>Written and Programming Assignments, Exams</td>
</tr>
</table>
<p>The Student Outcomes from the Engineering Accreditation Commission of ABET have been adopted; see:</p>
<ul class="details">
<% [
"http://www.abet.org/",
"https://engineering.buffalo.edu/computer-science-engineering/undergraduate/degrees-and-programs/bs-in-computer-science/accreditation-assessment.html",
"https://engineering.buffalo.edu/computer-science-engineering/undergraduate/degrees-and-programs/bs-in-computer-engineering/accreditation-assessment.html",
].each do |url| %>
<li><a href="<%=url%>"><%=url%></a></li>
<% end %>
</ul>
<h4>Program Outcome Support</h4>
<p style="font-size: 80%">0: Not supported&nbsp;&nbsp;&nbsp;1: Minimally Supported&nbsp;&nbsp;&nbsp;2:Supported&nbsp;&nbsp;&nbsp;3: Strongly Supported</p>
<h5>Computer Science ABET Outcomes Support</h5>
<table class="simple">
<tr>
<th>Program Outcome</th>
<th>1</th>
<th>2</th>
<th>3</th>
<th>4</th>
<th>5</th>
<th>6</th>
</tr>
<tr>
<td>Support Level</td>
<td>2</td>
<td>2</td>
<td>0</td>
<td>0</td>
<td>2</td>
<td>2</td>
</tr>
</table>
<h5>Computer Engineering ABET Outcomes Support</h5>
<table class="simple">
<tr>
<th>Program Outcome</th>
<th>1</th>
<th>2</th>
<th>3</th>
<th>4</th>
<th>5</th>
<th>6</th>
<th>7</th>
</tr>
<tr>
<td>Support Level</td>
<td>2</td>
<td>1</td>
<td>0</td>
<td>0</td>
<td>2</td>
<td>0</td>
<td>1</td>
</tr>
</table>
<hr>
<h3>Course Requirements</h3>
<h4>Assignments</h4>
Homework assignments for this course will be composed of:
<ul class="details">
<li>Programming Assignments</li>
<li>Written Assignments</li>
</ul>
<p>
There are two categories of assignments which will be given alongside one another.
Written assignments will generally be given on a shorter basis, with around 1 week to complete.
Programming assignments will generally be longer and assigned over a larger time period, with around 2 weeks to complete.
It is possible that not completing one assignment may disqualify you from completing another related one (for example, a programming assignment may ask you to implement something and then a follow-up written assignment may ask you to explain and analyze your code but if you do not have code, you cannot complete this work).
Due to the nature of the content of the course, you may be required to analyze code that you have written, in addition to providing correct solutions to the problems.
This will likely be separated between the written and programming assignment, though there is no requirement that this is the case.
Expectations will be clearly noted when the assignments come out as well as the duration of the assignment.
Please pay attention to the amount of time that each assignment provides and begin early.
There will be roughly 1 written assignment due each week and roughly 1 programming assignment due every two weeks, though the frequency may be lesser.
<b>You must score a 100% on the Academic Integrity assignment or you will be given an F in the course.</b>
</p>
<p>
For homework assignments, we will only be accepting electronic submissions. These will be accepted via <a href="https://autograder.cse.buffalo.edu">Autolab</a>.
Assignments will be submitted as described in the write-up.
Written submissions are generally accepted in the form of a PDF.
There are two ways to complete your written homework:
</p>
<ul class="details">
<li>You may typeset your written submissions using any word processor you wish (Microsoft Word and LaTeX are good options). <a href="https://overleaf.com/">Overleaf</a> is a convenient web-based options for using LaTeX. If you use Word, make sure to export your submission as a PDF.</li>
<li>You may handwrite your written submission and then scan it. An easy way to scan is using your phone along with the Scan feature in Google Docs (for Android). If you prefer to scan your documents, you may do so with your own scanner or on campus, the libraries provide scanning services.</li>
</ul>
<p>Make sure to <b>double check your assignments before and after submission</b> to ensure that part of your writing wasn't chopped off or distorted, as the integrity of your submission is your responsibility. Also, if you handwrite an assignment, make sure that you write legibly. <b>You will not receive credit if your submission is invalid/corrupt/wrong file format or if your submission is illegible.</b> It is fully your responsibility to determine if your submission is valid.</p>
<h4>Late Policy for Written Assignments</h4>
<p>Late written assignments will be accepted up to 1 day late for a penalty of 50% of the total points. For example,
if the homework is worth 100 points and you submit it one day late, you will receive the maximum of your score
earned minus 50 points and 0 points. <b>No grace days may be applied to written assignments.</b></p>
<h4>Early/Late Policy for Programming Assignments</h4>
<p>The policy for submissions on programming assignments is as follows:</p>
<ul class="details">
<li>More than 5 days (120 hours+) before the deadline: +5 points + 100% of what you earn on your latest submission.</li>
<li>Up to 5 days before the deadline: +1 point per day (24 hours) + 100% of what you earn on your latest submission.</li>
<li>On deadline (within 24 hours): 100% of what you earn (from your latest submission).</li>
<li>Late penalty per day (per 24 hours): 25% point penalty (lower your earned points by 25% of the possible points for the *entire* assignment).</li>
<li>&gt;2 days late: 0 points.</li>
</ul>
<p>
From this policy, you will see that all assignments must be submitted within two days past the assigned deadline.
Each submission receives a grade based on the date it was submitted.
Your final score is the score earned by <b>your most recent submission</b>.
For assignments with multiple component submissions, only 1 penalty will be assessed based on the file submitted latest.
If a staggered deadline is given (e.g., two components due one week apart), the earlier deadline will be a hard deadline and no late submissions will be accepted for the first component.
</p>
<p>
For example, suppose PA1 is a programming assignment assigned September 3 with 3 deliverables: Tests.scala, Foo.scala, and Bar.scala where testing in Tests.scala is due September 10 and a deadline of September 17 at 5pm.
This means that Tests.scala will only be accepted until the hard deadline of September 10 with no late credit.
Suppose you submit Tests.scala on September 10, Foo.scala on September 12, and Bar.scala on September 14 at 3pm.
In this case, you would receive +3 points for PA1 (overall). Alternatively, if you submitted Foo.scala on January 12 at 3pm and Bar.scala on January 18 at 8pm you would be charged 2 grace days for PA1 due to the late submission of the Bar.scala component.
</p>
<p>
You will have the ability to use three grace days throughout the semester, and at most two per programming assignment (since assignments are not accepted beyond two days late).
Using a grace day will negate the 25% point penalty for one day of late submission, but will not allow you to submit more than two days late.
</p>
<p>
Please plan accordingly.
You will not be able to recover a grace day if you decide to work late and your score
was not sufficiently higher.
<b>Grace days are automatically applied</b> to the first instances of late submissions, and are non-refundable.
For example, if an assignment is due on a Friday and you make a submission on Saturday, you will automatically use a grace day, regardless of whether you perform better or not.
<b>Be sure to test your code before submitting</b>, especially with late submissions, in order to avoid wasting grace days.
</p>
<p>
<b>Keep track of the time if you are working up until the deadline</b>.
Submissions become late after the set deadline, even by 1 minute.
Keep in mind that <b>submissions will close 48 hours after the original deadline</b> and you will no longer be able to submit your code after that time.
</p>
<h4>Exams</h4>
<p>
There will be one midterm exam during the semester and one 3-hour final exam during finals week.
The midterm exam is worth 20% of your grade.
The final exam is worth 40% of your grade.
If you have taken the midterm exam and score higher on the final exam, then the final exam score will replace your midterm score.
We reserve the right to change the scaling of the exams.
</p>
<p>
No makeup exams will be given except in <i>provably extreme circumstances</i>.
Please note the following additional policies/suggestions with respect to makeup exams:
</p>
<ul class="details">
<li>Notify your instructor 24 hours prior to the exam via e-mail or telephone (voice mail) if you are going to
miss an exam. If it is medically impossible for you to give prior notice, please obtain a note from a
physician detailing the period (and the reason) you were medically incapable of communicating with the
instructor.</li>
<li>If you miss an examination because of sickness or similar reasons, visit a physician and obtain a note
detailing the period and the reason you were medically incapable of taking the exam.</li>
<li>The midterm and final exam dates are posted. Please plan your travel and other activities accordingly.</li>
<li>The final exam date is scheduled by the university and is posted under the HUB Final Exam Schedule.</li>
<li>Exam times are stressful and one could forget about the exam time. Please make sure you arrange for multiple reminders so that you do not forget about the exam(s). This is another reason to religiously follow the course webpage as there will be numerous reminders about the exam when it gets close to the actual exam date.</li>
</ul>
<h4>Attendance and Participation</h4>
<p>
Attendance in lecture is not mandatory, but highly encouraged. You are, after all, paying us to deliver an interactive experience. If you don't understand something, wouldn't it be nice to just raise your hand and get to the bottom of it then and there? Lectures will typically be recorded, but recordings have been known to get corrupted; do not count on lecture recordings.
</p>
<h4>Recitations</h4>
<p>
We will be meeting for recitation to go over homework assignments and any questions you have about the material.
In addition, the recitations may review or extend lecture and are an excellent environment to ask more individual questions regarding the course material.
<b>Attendence in recitation is mandatory.</b>
Questions posed in recitation may be graded for participation or correctness.
You may miss 3 recitations without penalty for any reason.
After your third missed recitation, you will be penalized 2%-points per absence from your overall course grade.
</p>
<hr>
<h3>Grading Policy</h3>
<p>Here is the split of grades:</p>
<ul class="details">
<li>Assignments (30%)</li>
<li>Attendance/Participation (10%)</li>
<li>Midterm (20%)</li>
<li>Final Exam (40%)</li>
</ul>
<p>The final exam grade will replace the midterm grade if it is higher.</p>
<p>Here is a breakdown of the course grades required for the different letter grades.</p>
<table class="simple">
<tr>
<th>Score (x)</th>
<th>Letter Grade</th>
<th>Quality Points</th>
</tr>
<tr>
<td>90% ≤ x ≤ 100%</td>
<td>A</td>
<td>4.0</td>
</tr>
<tr>
<td>85% ≤ x < 90%</td>
<td>A-</td>
<td>3.67</td>
</tr>
<tr>
<td>80% ≤ x < 85%</td>
<td>B+</td>
<td>3.33</td>
</tr>
<tr>
<td>75% ≤ x < 80%</td>
<td>B</td>
<td>3.00</td>
</tr>
<tr>
<td>70% ≤ x < 75%</td>
<td>B-</td>
<td>2.67</td>
</tr>
<tr>
<td>65% ≤ x < 70%</td>
<td>C+</td>
<td>2.33</td>
</tr>
<tr>
<td>60% ≤ x < 65%</td>
<td>C</td>
<td>2.00</td>
</tr>
<tr>
<td>55% ≤ x < 60%</td>
<td>C-</td>
<td>1.67</td>
</tr>
<tr>
<td>50% ≤ x < 55%</td>
<td>D</td>
<td>1.00</td>
</tr>
<tr>
<td>0% ≤ x < 50%</td>
<td>F</td>
<td>0</td>
</tr>
</table>
<p>
It is possible that these ranges and/or the grade weighting may be adjusted at the end of the semester to address inconsistencies or hardships that arise.
Grades will not be curved/adjusted during the semester.
</p>
<p>
Students will receive <b>a grade of F if they are found in violation of the <a href="#ai_policy">academic integrity policy</a></b>.
Please make sure to thoroughly read and understand the policy for this course.
</p>
<p>
Students that do not complete a substantial portion of the course (do not complete more than 60% | do not attend more than 60% of the course) and achieve a grade of F in the course will receive a grade of <b>FX which denotes failure for non-attendance. </b>
This is only a grade designation for those students that have failed AND did not attend and is not awarded if you passed the course.
Please note that there may be financial aid repercussions so you should consider resigning courses you are not planning on completing.
</p>
<h4>Incompletes</h4>
<p>
<b>A grade of incomplete ("I")</b> indicates that additional course work is required to fulfill the requirements of a given course.
Students may only be given an "I" grade if they have a passing average in coursework that has been completed and have well-defined parameters to complete the course requirements that could result in a grade better than the default grade.
An "I" grade may not be assigned to a student who did not attend the course.
This is especially applicable in instances where a student misses work due to extenuating circumstances and are unable to makeup the work prior to the end of the semester.
For example, missing the final exam due to a car accident and/or being hospitalized for an extended period during the semester are two examples where completing all coursework may not be possible before grades are due.
See also: <a href="https://catalog.buffalo.edu/policies/explanation.html">Explanation of Grades</a> for more regarding the incomplete grade process.
Incompletes will not be given as a shelter for poor grades.
It is the student's responsibility to resign from the course in a timely manner if doing poorly.
<b>The last day to resign with a grade of R is <%=resign_date%> (before 11:59:59pm).</b>
</p>
<hr>
<h3>Accessibility Resources</h3>
<p>
If you have any disability which requires reasonable accommodations to enable you to participate in this course, please contact the Office of Accessibility Resources in 60 Capen Hall, <a href="tel:716-645-2608">716-645-2608</a> and also the instructor of this course during the first week of class.
The office will provide you with information and review appropriate arrangements for reasonable accommodations, which can be found on the web at: <a href="http://www.buffalo.edu/studentlife/who-we-are/departments/accessibility.html">http://www.buffalo.edu/studentlife/who-we-are/departments/accessibility.html</a>
</p>
<hr>
<h3>Critical Campus Resources</h3>
<h4>Sexual Violence</h4>
<p>
UB is committed to providing a safe learning environment free of all forms of discrimination and sexual harassment, including sexual assault, domestic and dating violence and stalking.
If you have experienced gender-based violence (intimate partner violence, attempted or completed sexual assault, harassment, coercion, stalking, etc.), UB has resources to help.
This includes academic accommodations, health and counseling services, housing accommodations, helping with legal protective orders, and assistance with reporting the incident to police or other UB officials if you so choose.
Please contact UB’s Title IX Coordinator at <a href="tel:716-645-2266">716-645-2266</a> for more information.
For confidential assistance, you may also contact a Crisis Services Campus Advocate at <a href="tel:716-796-4399">716-796-4399</a>.
</p>
<h4>Mental Health Services</h4>
<p>
As a student you may experience a range of issues that can cause barriers to learning or reduce your ability to participate in daily activities.
These might include strained relationships, anxiety, high levels of stress, alcohol/drug problems, feeling down, health concerns, or unwanted sexual experiences.
Counseling, Health Services, and Health Promotion are here to help with these or other issues you may experience.
You can learn more about these programs and services by contacting:
</p>
<ul class="details">
<li><b>Counseling Services</b><br/>
<a href="https://www.buffalo.edu/studentlife/who-we-are/departments/counseling.html">https://www.buffalo.edu/studentlife/who-we-are/departments/counseling.html</a><br/>
120 Richmond Quad (North Campus), <a href="tel:716-645-2720">716-645-2720</a>
</li>
<li><b>Health Services</b><br/>
<a href="https://www.buffalo.edu/studentlife/who-we-are/departments/health.html">https://www.buffalo.edu/studentlife/who-we-are/departments/health.html</a><br/>
4350 Maple Road, <a href="tel:716-829-3316">716-829-3316</a>
</li>
<li>
<b>Health Promotion</b><br/>
<a href="https://www.buffalo.edu/studentlife/who-we-are/departments/health-promotion.html">https://www.buffalo.edu/studentlife/who-we-are/departments/health-promotion.html</a><BR/>
114 Student Union (North Campus), <a href="tel:716-645-2837">716-645-2837</a>
</li>
</ul>
<hr>
<h3>Study Time</h3>
<p>
In this course, you are expected to put in significant additional time beyond the scheduled class times.
It is expected that for each credit hour for a course, students should typically expect to put in 2 to 3 hours of work each week outside of class.
Since this course is 4 credit hours, expect roughly 8 to 12 hours of time outside of lecture and recitation each week.
You may want to consider practicing coding to stay up to date and polish your skills to perform better on coding assignments.
This is especially important if you don't feel confident about your programming after CSE-116.
Additionally, the concepts and ideas of the theory in this course are not something you can simply memorize and regurgitate.
You must understand the ideas and concepts in order to be able to apply them to different problems.
</p>
<hr>
<h3>Miscellaneous Notes</h3>
<p>Here are some other policies/suggestions to keep in mind:</p>
<ol>
<li>Your grade will solely depend on your performance in this semester: you will not get any opportunity to do extra work to improve your grade. It is your duty to make sure you understand what is expected of you. This course will require a fair bit of work so if you are busy this semester, please plan accordingly.</li>
<li>If there is a genuine reason for re-grading, please contact the instructor within a week of when the graded material is handed out in class/completed in the grader. In particular, if you do not pick up/view your graded material on time, you may lose the opportunity to get back to us within the stipulated time period.</li>
<li>Feel free to make up a group of students to work on homework and study the course. Piazza offers a mechanism to search for group-mates. In a course like this it is very important to discuss problems with one another to better study. Teaching is the best way to learn material!</li>
</ol>
<hr>
<h3 id="ai_policy">Academic Integrity</h3>
<p>As a gentle reminder, please re-read the academic integrity policy of the course. I will continue to remind you
throughout the semester and hope to avoid any incidents.</p>
<h4>What constitutes a violation of academic integrity?</h4>
<p>These bullets should be obvious things not to do (but commonly occur):</p>
<ul class="details">
<li>Turning in your friend’s code/write-up (obvious).</li>
<li>Turning in solutions you found on Google with all the variable names changed (should be obvious). This is a copyright violation, in addition to an AIviolation.</li>
<li>Turning in solutions you found on Google with all the variable names changed and 2 lines adde
(should be obvious). This is also a copyright violation.</li>
<li>Paying someone to do your work. You may as well not submit the work since you will fail the exams
and the course.</li>
<li>Posting to forums asking someone to solve the problem. Note: Aggregating every [stack overflow answer|result from google|other source] because you "understand it" will likely result in full credit on assignments (if you aren't caught) and then failure on every exam. Exams don't test if you know how to use Google, but rather test your understanding (i.e., can you understand the problems to arrive at a solution on your own). Also, other students are likely doing the same thing and then you will be wondering why 10 people that you don’t know have your solution.</li>
</ul>
<p>You should know that seeking solutions to the assignment does not fall under solving the problem yourself.
Things that may not be as obvious:</p>
<ul class="details">
<li>Working with a tutor who solves the assignment with you. If you have a tutor, please contact me so that I may discuss with them what help is allowed.</li>
<li>Sending your code to a friend to help them. <b>If another student uses/submits your code, you are
also liable and will be punished.</b></li>
<li>Joining a chatroom for the course where someone posts their code once they finish, with the honor
code that everyone needs to change it in order to use it.</li>
<li>Reading your friend’s code the night before it is due because you just need one more line to get
everything working. It will most likely influence you directly or subconsciously to solve the problem
identically, and your friend will also end up in trouble.</li>
</ul>
<p>
<b>The assignments should be solved individually with only assistance from course staff and allowed
resources.</b>
You may discuss and help one another with technical issues, such as how to get your compiler running, etc.
It is not acceptable that you both worked together and have nearly identical code.
If that is going to be a problem for you, don’t solve the problems in that close of proximity.
</p>
<h4>What Collaboration is Allowed?</h4>
<p>
There is a gray area when it comes to discussing the problems with your peers and I do encourage you to work with one another to solve problems.
That is the best way to learn and overcome obstacles.
At the same time you need to be sure you do not overstep and not plagiarize.
Talking out how you eventually reached the solution from a high level is okay:
</p>
<blockquote>
I used a stack to store the data and then looked for the value to return.
</blockquote>
<p>but explaining every step in detail/pseudocode is not okay:</p>
<blockquote>
I copied the file tutorial into my code at the start of the function, then created a stack and pushed all of the data onto the stack, and finished by popping the elements until the value is found and use a return statement.
</blockquote>
<p>
The first example is OK but the second is basically a summary of your code and is not acceptable, and remember that you shouldn’t be showing any code at all for how to do any of it.
Regardless of where you are working, you must always follow this rule: <b>Never come away from discussions with your peers with any written work, either typed or photographed, and especially do not share or allow viewing of your written code.</b>
</p>
<p class="callout">
If you have concerns that you may have overstepped or worked closely with someone, please address this with me <b>prior to deadlines for the assignment</b>, for example by sending me an email as below:
</p>
<blockquote>
Dear Dr. Kennedy, <br/><br/>
I wish to inform you that I ... on my submission for Assignment N.
The functions foo() and bar() are not entirely of my own authorship.
I wish to withdraw my submission to preserve academic integrity.<br/><br/>
J.Q. Student<br/>
Person #12345678<br/>
UBIT: jqstuden<br/><br/>
Sincerely, J
</blockquote>
<p>
Upon receipt of this email, I would award J a zero for Assignment N, but disregard any AI issues with the problematic submission.
</p>
<h4>What Resources are Allowed?</h4>
<p>
With all of this said, please feel free to use any [files|examples|tutorials] that we provide directly in your code (with proper attribution).
Feel free to directly use anything from lecture or recitations.
You will never be penalized for doing so, but should always provide attribution/citation for where you retrieved code from.
Just remember, if you are citing an algorithm that is not provided by us, then you are probably overstepping.
</p>
<p>
More explicitly, you may use any of the following resources (with proper citation/attribution in your code):
</p>
<ul class="details">
<li>Any example files posted on the course webpage (from lecture or recitation).</li>
<li>Any code that the instructor provides.</li>
<li>Any code that the TAs provide.</li>
<li>Any code from the tour of Scala (<a href="https://docs.scala-lang.org/tour/tour-of-scala.html">https://docs.scala-lang.org/tour/tour-of-scala.html</a>)</li>
<li>Any code from Scala Collections (<a href="https://docs.scala-lang.org/overviews/collections-2.13/introduction.html">https://docs.scala-lang.org/overviews/collections-2.13/introduction.html</a>)</li>
<li>Any code from Scala API (<a href="https://www.scala-lang.org/api/2.13.0/">https://www.scala-lang.org/api/2.13.0/</a>)</li>
<li>Additional references may be provided as the semester progresses, but only those provided publicly by course staff are allowed to be utilized. These will be listed on Piazza under Resources.</li>
</ul>
<p class="callout">
Omitting citation/attribution will result in an AI violation (and lawsuits later in life at your job). This is true
even if you are using resources provided.
</p>
<p>
Lastly, if you think you are going to violate/have violated this policy, please come talk to me ASAP so we can figure out how to get you on track to succeed in the course.
This policy on assignments is here so that you learn the material and how to think yourself.
There is no benefit to submitting solutions (which likely exist in some form).
</p>
<h4>Formal Departmental AI Info</h4>
<p>
Academic integrity is a fundamental university value.
Through the honest completion of academic work, students sustain the integrity of the university while facilitating the university's imperative for the transmission of knowledge and culture based upon the generation of new and innovative ideas.
</p>
<p class="blocklink">
<a href="https://www.buffalo.edu/academic-integrity.html">The University Office of Academic Integrity.</a>
</p>
<p>
The academic degrees and the research findings produced by our Department are worth no more than the integrity of the process by which they are gained.
If we do not maintain reliably high standards of ethics and integrity in our work and our relationships, we have nothing of value to offer one another or to offer the larger community outside this Department, whether potential employers or fellow scholars.
For this reason, the principles of Academic Integrity have priority over every other consideration in every aspect of our
departmental life, and we will defend these principles vigorously.
It is essential that every student be fully aware of these principles, what the procedures are by which possible violations are investigated and adjudicated, and what the punishments for these violations are.
Wherever they are suspected, potential violations will be investigated and determinations of fact sought.
In short, breaches of Academic Integrity will not be tolerated.
</p>
<h4>Departmental Statement on AI in Homework Assignments</h4>
<p>
The following statement further describes the specific application of these general principles to a common context in the CSE Department environment, the production of source code for project and homework assignments.
It should be thoroughly understood before undertaking any cooperative activities or using any other sources in such contexts.
</p>
<blockquote>
<b>All academic work must be your own.</b>
Plagiarism, defined as copying or receiving materials from a source or sources and submitting this material as one's own without acknowledging the particular debts to the source (quotations, paraphrases, basic ideas), or otherwise representing the work of another as one's own, is never allowed.
Collaboration, usually evidenced by unjustifiable similarity, is never permitted in individual assignments.
Any submitted academic work may be subject to screening by software programs designed to detect evidence of plagiarism or collaboration.<br/><br/>
It is your responsibility to maintain the security of your computer accounts and your written work.
Do not share passwords with anyone, nor write your password down where it may be seen by others.
Do not change permissions to allow others to read your course directories and files.
Do not walk away from a workstation without logging out.
These are your responsibilities.
<b>In groups that collaborate inappropriately</b>, it may be impossible to determine who has offered work to others in the group, who has received work, and who may have inadvertently made their work available to the others by failure to maintain adequate personal security.
In such cases, <b>all will be held equally liable</b>.
</blockquote>
<h4>Departmental Policy on Violations of Academic Integrity</h4>
<p class="blocklink">
<a href="https://engineering.buffalo.edu/computer-science-engineering/information-for-students/undergraduate-program/cse-undergraduate-academic-policies/cse-academic-integrity-policy.html">CSE Departmental AI Policy.</a>
</p>
<p>
The CSE Department has a zero-tolerance policy regarding academic integrity (AI) violations.
</p>
<p>
When there is a potential violation of academic integrity in a course, the course director shall first notify the concerned students.
This notification begins the UB Academic Integrity Policy review and appeals process (Consultative Resolution, Departmental Level Procedures, Decanal Level Procedures, Vice Provost Level Procedures).
</p>
<p>
Upon conclusion of the review and appeals process, if the department, school, and university have determined that the student has committed a violation, the following sanctions will be imposed upon the student:
</p>
<ol>
<li><b>Documentation</b>. The department, school, and university will record the student's name in departmental
decanal, and university-level academic integrity violations databases.</li>
<li><b>Penalty Assessment</b>. The standing policy of the department is that all students involved in an academic integrity violation will receive an F grade for the course and may lose financial aid and/or lose financial support from the department. The course director may recommend a lesser penalty for the first instance of academic integrity violation, and the adjudication committees that hear the appeal at the department, decanal and provost level may recommend a lesser or greater penalty.</li>
</ol>
<hr>
<p>Portions of this syllabus derived from the CSE-250 2021 Spring syllabus by Andrew Hughes, and Ethan Blanton's Academic Integrity policy.</p>
View Git Blame Copy Permalink