Instructor: 326 Davis 645-4738 Office hours: Tue. 1--2:30pm; Wed. 2-3pm (definite), other times TBA
TAs: 1. Mingxi Lei
302 Davis no phone
Ofc. hrs.: TBA
2. Yutian Yan
302 Davis no phone
Ofc. hrs.: TBA
GTAs 3. Praneeth Sai Kotha
302 Davis no phone
Ofc. hrs.: TBA
4. Vindhya Nuthalapati
302 Davis no phone
Ofc. hrs.: TBA
UTAs 5. Sarthak Agarwal
302 Davis no phone
Ofc. hrs.: TBA
6. Sean Grzenda
302 Davis no phone
Ofc. hrs.: TBA
7. Pantelis Kiamos
302 Davis no phone
Ofc. hrs.: TBA
8. Korey Liu
302 Davis no phone
Ofc. hrs.: TBA
9. Vrund Patel
302 Davis no phone
Ofc. hrs.: TBA
10. Romika Sairam
302 Davis no phone
Ofc. hrs.: TBA
Sample Final Exam (from Fall 2014 but translated into Scala; key will appear Thursday 5/19) Its Answer Key.
Prelim II Answer Key with extra notes on key handling and Scala quirks.
Sample Prelim I Practice Exam Its answer key
This is a Scala translation of the original in C++ given in Spring 2014. (FYI: The key to that version)
Sample Prelim II, again translated from C++.
Its answer key (plain .txt)
Course Organization
and Policies (syllabus updated for Spring 2022).
Main possible differences from others' policies:
Piazza Page for CSE250
Last term's policies from "Incompletes" to the bottom of the page will all be followed.
Course topics in brief and roughly in order:
Scala, list/sequence/queue/stack, asymptotic notation, recursion, linked structures (graphs),
sorting, search trees (sorted data structures), hashing (unsorted data structures), advanced topics
(B-trees and hierarchical storage; thread safety) as time allows.
1. Textbook: Object-Orientation, Abstraction, and Data Structures using Scala, Second Edition by Mark C. Lewis and Lisa L. Lacher.
2. A working Scala system, version 2.13.x or later but not Scala 3.
(will be added to, not all need be used)
CSE250 Course Resources in Scala
Includes links to pages on official Scala site worth particular attention.
(Old C++ course page and resources, for the curious)
Small Sample Scala Programs (Some will be shown in lectures.)
MaxWords area with Assignment 2 key (extending Assignment 1)
Scala Data Structures (for upcoming work after break)
Final Project Area (so far adds BST to above repo)
Quick-Reference Handout on Asymptotic Notation (by Tom Bylander of U.T. San Antonio, was given out in class on 9/14/11). Running Time Graphs by Jim Marshall of Sarah Lawrence. Slides on (``Algorithms and Complexity'') by Zeph Grunschlag, including examples of counting code statements, loops, and recursion.
Fibonacci Algorithms lecture by Prof. Hung Ngo, delivered in place of my own Fibonacci lecture with "BigInt' by TA Chris Kim on 2/11/13.
Minimal Coding Guidelines, for submissions
in this course.