CS 594 - Computer Systems Fundamentals

Contact Information:

Lecturer: Katie Schuman
Email: cdschuman@gmail.com | cschuman@utk.edu
Office: Claxton Complex 224

Course Information:

General Information
Course Description
All Lecture Notes
Course Schedule
Grading
Course Policies
Lab Submission Requirements

General Information

Time: Monday/Wednesday/Friday, 1:00 PM - 3:00 PM
Location:
- Lecture days: Claxton 211
- Lab days: Cetus Lab - Claxton 103

Course Description

The graduate computer science curriculum at the University of Tennessee assumes a significant background in computer sciences topics. Though many of the graduate-level classes, such as data mining, scientific computing, biologically-inspired computing, and optimization, may be of significant use to non-computer science major, there is currently no course available that allows a targeted review of computer science knowledge required for graduate-level classes.

The course described below would fill this need by providing a comprehensive review of material covered in the key undergraduate courses at the University of Tennessee, knowledge that is assumed to be known by all students in the graduate-level classes. This course provides a gateway for students in other disciplines, such as mathematics, biology, or physics, or with backgrounds in other disciplines to comfortably enter a graduate-level computer science class with confidence in their ability to succeed.

All Lecture Notes

Course Schedule

Wednesday, June 1	Lab: Linux basics Lab 1: CS 140: Lab 3 - PGM Files OR CS 302: Lab 1 - PPM Files Due: 12:00 PM - June 8 For more information on PGM files, see CS 140: Lab 2. For more information about procedure calls and reference parameters in C++, see Procedures lecture notes. For more information about vectors in C++, see Vectors lecture notes. For a makefile for CS 140: Lab 3, click here. (Right click to save makefile.) Gradescript for CS 140: Lab 3 is on our lab machines in ~plank/cs140/Labs/Lab3/ Run the gradescript in the directory containing your lab executable by calling ~plank/cs140/Labs/Lab3/gradeall or any individual gradescript by calling ~plank/cs140/Labs/Lab3/gradescript #, where # is the number of the gradescript you want to run.
Friday, June 3	Guest Lecture on high performance computing by Dr. Jack Dongarra
Monday, June 6	Lecture: Lists Stacks/Queues Sets and Maps Using maps as associative arrays Data structures that point to each other and traversal
Wednesday, June 8	Lab: Lab 2: CS 302: Lab 3 -- Music File Information Due: 12:00 PM - June 15 Data structures that point to each other and traversal is an especially useful set of notes for this lab. Please submit a makefile for this lab. Gradescript for CS 302: Lab 3 is on our lab machines in ~plank/cs302/Labs/Lab3/
Friday, June 10	Lecture: Makefiles Makefile tutorial -- We won't go over the Rcs portion of these notes. Another makefile tutorial -- for your use only Make manual -- The GNU manual Vi tips and tricks Vi shortcuts More shortcuts UTK's Vi tutorial videos Emacs introduction If you're interested in learning about Emacs, type `emacs` in your terminal window and step through the tutorial and/or guided tour. Emacs tutorial Emacs vs. Vi Why you have to include ./ in front of your executable and Dr. Plank does not
Monday, June 13	Lecture: Trees and Binary Search Trees AVL Trees
Wednesday, June 15	Lab: Lab 3: CS 140: Lab 9 -- AVL Trees Due: 12:00 PM - June 22
Friday, June 17	TBD
Monday, June 20	Lecture: Sorting algorithms -- Lonnie Interesting links with sorting: Graphical examples and pseudocode What sorting algorithms sound like
Wednesday, June 22	Lab: Lab 4: CS 302: Lab 5 -- Sorting Due: 12:00 PM -- June 29
Friday, June 24	Lecture: Introduction to Graphs and Graph Algorithms
Monday, June 27	Lecture: Disjoint Sets Minimum Spanning Trees -- Denise Kruskal's Video Pseudocode Kruskal Prim Graph Prim Matrix Prim's Pseudocode
Wednesday, June 29	Lab: Lab 5: CS 302: Lab 6 -- The Maze Solver (Depth First Search and Recursion) Due: 12:00 PM, July 6
Friday, July 1	Lecture: Dijkstra's Algorithm Dijkstra's Algorithm Video Network Flow -- Heike Ford Fulkerson Algorithm Applet Exhaustion of Paths Video Another Ford Fulkerson Applet Newtork Flow Implementations
Monday, July 4	NO CLASS
Wednesday, July 6	Lecture: Dynamic Programming -- Joe
Friday, July 8	Lab: Lab 6: CS 302: Lab B -- Dynamic Programming Due: 12:00 PM, July 15
Monday, July 11	Lecture: Introduction to C Some C Tutorials: C strings C File I/O Libfdr Notes
Wednesday, July 13	Lab: Lab 7: CS 360: Lab 1 -- Fields/Dllist/Red-black tree libraries Due: 12:00 PM, July 22 Some useful links: Fields library notes Jval library notes Doubly-linked list library notes Red-black tree library notes
Friday, July 15	Lecture: Introduction to System Calls Memory Using Valgrind to detect memory leaks
Monday, July 18	Lecture: Links Stat Recursive Directory Traversal
Wednesday, July 20	Lab: Lab 8: CS 360: Lab 5 -- Jtar (Challenge lab) or CS 360: Lab 2 -- Reading nasty data, part 1 Due: 12:00 PM, July 29 Using valgrind to check for memory leaks. Run valgrind with --leak-check=full flag for memory leak information.
Friday, July 22	Lecture: Not covered, but recommended reading: Fork, Exec/Wait, Dup, Pipes Sockets Threads 1, 2
Monday, July 25	Lecture: Threads 3, 4 Condition Variables
Wednesday, July 27	Lab: Lab 9: CS 360: Lab A -- Threaded Chat Server (Challenge lab) or CS 360: Lab 3 -- Reading nasty data, part 2 Due: 12:00 PM, August 5
Friday, July 29	Visit to ORNL for tour and demonstrations has been CANCELLED.

Grading

Each student in this course will use the automated grading script for their weekly lab. Weekly labs account for 70 percent of their grade. Course attendance will be 10 percent of each students grade and weekly lecture participation will encompass the remaining 20 percent.

Course Policies

Each student will be required to complete one weekly lab. Depending on the student's skill level, a more advanced lab may be selected (by the student and approved by the TA) from the following list of labs to replace a simpler labs in the course list:

Lab Policy:

Labs will be due at noon, one week after they are assigned unless otherwise noted on the schedule. A 10-point late penalty will be assigned for each day late. Any lab turned in after five days will be given a 0. The lab scores will be based on the score received by the gradescript provided. A student's lab average will be 70 percent of their final score.

As discussed in class, students will be allowed one free late lab. Email the TA for more information about using your free late lab.

Attendance Policy

If a student must miss a class period, the TA must be notified in advance and a makeup assignment will be prepared. Course attendance will be 10 percent of each student's score.

Class Participation

Participation in lecture will comprise 20 percent of each student's score. A student may be asked to present materials on topics with which they are familiar.

Lab Submission Requirements

For each lab, a student will submit a tar file to the TA via email. The tar file will contain only the .c, .cpp, or .h files required and a makefile.
The subject of the email should be the number of the lab specified in bold on the course calendar, followed by the lab assigned.
- Example Subject: Lab 1 - CS 302: Lab 1
The title of the tar file should be the student's username followed by an underscore, followed by lab#, where # is the number of the lab specified in bold on the course calendar.
- Example tar file name: cschuman_lab1.tar
- To create a tar file like this, do the following:
  1. Make a directory that contains all of the necessary files and navigate to that directory.
  2. Execute the following command, where username and # are replaced as necessary: tar cvf username_lab#.tar *