SETTINGS

Settings

Select a category to the left.

Appearance

Theme

Light or dark? Choose how the site looks to you by clicking an image below.


Light	Dark

Language

Preferred Language

All content on utk.claranguyen.me is originally in UK English. However, if content exists in your preferred language, it will display as that instead. Feel free to choose that below. This will require a page refresh to take effect.

About

"utk.claranguyen.me" details

Domain Name:	claranguyen.me
Site Version:	3.0.1
Last Updated:	2019/08/18

Synopsis

Welcome to CS140! This class is named "Data Structures and Algorithms I". In this course, you will be going back to C++ (from your last class) and continue to learn more about it. Furthermore, you will also cover more about how to actually implement some of the features and algorithms of the STL library, and understand Data Structures (hence the course name).

This time around, I'm the head TA of the course. Each of you are assigned one of three lab sections. Unlike in CS102, these labs are nearly 2 hours long. If you are in Sections 1 or 3, you're in one of my sections. Depending on which section you attend, I may have another TA as an assistant to help out.

Section 1 (8:00 - 9:55): I'm hosting.
Section 2 (10:10 - 12:05): The first half will be hosted by John Carmack. I'll host the second half.
Section 3 (12:20 - 14:15): I'm hosting.

Office Hours:
Min H. Kao Building
Room 313

By Appointment (Email "ssmit285@vols.utk.edu" to set up a time).

Changes due to COVID-19:
Because of COVID-19, all courses have moved to online. This class is obviously no exception. I already post all notes that I put up on the dry-erase board online. You may find those here. All TA office hours have moved to Zoom, as well as lecture and lab. Please go to Piazza for details on that. I may post more guides than usual to provide as much content online as possible.

Guides

This section will have links to guides or documentation that I write and find valuable for this course. Typically it's for common issues I notice among students. Check frequently!

Lab Sections

In lab, I may write various example programs on a projector or write concepts on the board. I archive every file from every lab session, and may put them up online (depending on the material). I do not post lab solutions.

Each module below will have tags that will let you to tell what content is in them. Here are the possible tags you may find:

Mini-Guides	Mini-guides on concepts that you will use in each lab.
Template Code	Template code that is for the assignment is given.
Simulator	There is a simulator to compare your code results to.
Lab Hints	There are lab instructions, procedures, suggested development order, or hints.
Side Files	There are files on file.claranguyen.me for that module. These are "SIDE" files, which may be miscellaneous programs, notes, or board drawings. As such they may help you on the lab assignment, but they may not.
None	No guide available.

Just a heads up: Do not rely on me writing guides. I may write them... And I may not. I recommend taking notes just in case. There may not even be a lab guide. In that case, the module will be greyed out and unclickable.

Past Lab Assignments:

AVL Trees

Due Date:	2020/04/25
Description:	Now for a real challenge. With working BST code, implement node rotation, AVL auto-balancing and recursive node copying.
Contents:	Side Files

Binary Search Trees

Due Date:	2020/04/18
Description:	Implement helper functions for a Binary Search Tree API. Compute depth and height of a BST. Also be able to generate a balanced BST. Implement these functions recursively.
Contents:	Side Files

Recursion: Enum & Shape Shifter!

Due Date:	2020/04/11
Description:	Your first attempt at recursion. Two Tasks. Recursively generate strings with a specific amount of 1s and 0s. Use recursion to brute-force all possible combinations to solve a puzzle!
Contents:	Lab Hints Template Code

Linked Lists

Due Date:	2020/04/01
Description:	Manually implement a doubly-linked list using nodes and pointers. Handle insertion and deletion, as well as deep copying via copy constructor and operator overloading.
Contents:	Side Files Template Code

Code Processor

Due Date:	2020/03/25
Description:	Use STL maps and sets to make a local "server" to store users, prizes, and codes. Be able to save the state of the server so it's fault-tolerant.
Contents:	None

Candy Crush

Due Date:	2020/03/11
Description:	Linked List and STL Iterator Tutorial. Erase specific candy and all surrounding ones of the same type in a list.
Contents:	Side Files Lab Hints Template Code

Bit Matrices

Due Date:	2020/03/04
Description:	Construct a program to read, manipulate, and store bit matrices. Implement a hash table with separate chaining.
Contents:	Side Files

Hash Tables with Open Addressing

Due Date:	2020/02/19
Description:	Implement hashing via XOR and Last7 and use it in a Hash Table.
Contents:	None

More fun with PGM files

Due Date:	2020/02/10
Description:	More specific PGM edits: Image rotation, cropping, padding.
Contents:	None

Fun with PGM files

Due Date:	2020/01/29
Description:	Manipulate PGM files. 5 parts: pgminfo, bigwhite, neg, hflip, vflip.
Contents:	None

Checkerboard & Moonglow

Due Date:	2020/01/22
Description:	Generate a checkerboard of chars and decode an esoteric grading format with the ultimate test of cin.
Contents:	None

0.5

Counting Gold

Due Date:	2020/01/18
Description:	Read in a text file and determine how much "gold" is in it based on characters read.
Contents:	None

Learning Unix

Due Date:	2020/01/13
Description:	No coding here. Set up a private "cs140" directory and tell us a little bit about yourself.
Contents:	None