These are the Computer Science courses I have taken at Virginia Polytechnic Institute and State University
CS 2114 - Software Design and Data Structures
CS 2104 - Intro to Problem Solving in CS
CS 2505 - Intro Computer Organization I
CS 2506 - Intro Computer Organization II
CS 3114 - Data Structures and Algorithms
CS 3214 - Computer Systems
CS 3304 - Comparative Languages
CS 3604 - Professionalism in Computing
CS 3704 - Intermediate Software Design
CS 3714 - Mobile Software Development
CS 3754 - Cloud Software Development
CS 4264 - Principles of Computer Security
CS 4704 - Software Engineering Capstone
CS 5024 - Ethics and Professionalism in CS
CS 5114 - Theory of Algorithms
CS 5244 - Web Application Development(In-Progress)
CS 5594 - Blockchain Technologies
CS 5614 - Database Managment Systems (Big Data Engineering)
CS 5704 - Software Engineering
CS 5744 - Software Design and Quality(In-Progress)
CS 5934 - Capstone Project(In-Progress)
(Teaching Assistant)
Math and Technical Courses
These are the Math and Technical courses I have taken at Virginia Polytechnic Institute and State University
COMM 2004 - Public Speaking
MATH 2204 - Intro Multivariable Calculus
MATH 2114 - Introduction to Linear Algebra
MATH 2534 - Intro Discrete Math
MATH 3134 - Applied Combinatorics
ENGL 3764 - Technical Writing
Major Course Projects (Click Buttons for More Information)
CS 2114 Space Colonies
The purpose of this project was to utilize different data types and data structures taught throughout the semester in order to create a system that assists in the process of placing applicants in homes on colonies in outer space. People were placed on certain planets based on their 3 skill traits (MEDICINE, AGRICULTURE, and TECHNOLOGY) and their personal planet preferences. If there was room on the requested planet, then the program compared the person’s scores against the planet’s minimum requirements and made the decision to allow the user to accept or reject their application. If the person had no colony request, the user would be given the option to accept or decline the person for the planet colony with the most available space whose minimum requirements were suitable. If the person did not qualify for their planet preference, then they were rejected.
The Circular Array Queue Data Structure was used to keep track of the people who were waiting in line to be accepted or rejected from the planet. Other data types were utilized to represent the different characteristics of the program such as a Person data type, a Skills data type, and a Planet data type.
CS 2505 GIS System in C
The purpose of this project was to put together different C concepts taught throughout the semester in order to create a program that indexed and provided search features for a
file of GIS records.
The resulting system had to support the following operations:
1. Retrieve data for all GIS records matching a given feature
name and state.
2. Retrieve data for the unique GIS record matching a given feature ID.
3. Report the orthodromic distance between two features
specified by their feature IDs.
4. Display the in-memory indices in a human-readable manner.
The program began by parsing the provided script file in order to insert the correct GIS records into the hash table used for indexing the feature names and the array for the feature id indexing. After that, the program parses out the commands from the command script and prints out their outputs into seperate
log files.
CS 3114 GIS System in Java
The purpose of this project was to develop a system that indexed and provided search features for a file of GIS records by using the data structures taught throughout the semester.
The resulting system had to support the following operations:
- Import new GIS records into the database file based off the criteria provided in the script file
- Retrieve data for all GIS records matching given geographic coordinates
- Retrieve data for all GIS records matching a given feature name and state
- Retrieve data for all GIS records that fall within a given (rectangular) geographic region
- Display the in-memory indices in a human-readable manner
In order to complete these tasks, the system needed to implement a name index and a coordinate index that contained the GIS records that were from the constructed database file. The name index used a hash table to store a feature name and state abbreviation and the
file offset(s) of the matching record(s). The coordinate index used a bucket PR quadtree to store the geographic coordinates and offsets of the GIS records in the database file.
In addition to this, a LRU buffer pool was used to store GIS records so that search results may be read from DRAM rather than the disk (the database file). This was implemented so that the program executed faster by not having to spend as much time having to retrieve records that were already read from the disk as opposed to finding the record in the DRAM.
CS 3714 Hokie Movie Finder
The purpose of this app was to incorporate android components taught throughout the semester in order to develop an app of our choosing. The name of my android application was the Hokie Movie Finder. This application aimed to accomplish the task of finding today’s movies that are playing in the city of Blacksburg and displaying the showtimes of the theaters they are playing in.
