"Black Jack"
|
|
The Black Jack game was a lab activity I completed in ITEC 220. We had to use existing code from our professor and complete the implementation. The original design supported only one player. After we got the game working, we had to support a two player game, which of course, had to follow the rules of taking turns and knowing when a player’s turn was finished.
|
"Traffic Control"
|
|
Traffic Control was a project I created for ITEC 220 as well, but because it was a project, it was created from scratch. The original project simulated a T-intersection, but for fun I made another project that simulated a cross-intersection where traffic flow for north and south was a two-lane one way street.
Both programs used a linked list implementation of queues for each lane of traffic. A timer would control when everything happened, and during each new event, a car was either enqueued or dequeued which was determined randomly. The cars would obey the traffic signals and the main roads (running east to west) were prioritized (given green) if the other queues were empty.
If an empty queue had a new car enqueued it would trigger that in the traffic cycle and make sure it would receive a green light within a preset number of seconds. If a queue was waiting too long, a trigger would allow that queue to be dequeued until it was empty or the time it was given had elapsed.
The first version of this project had 6 buttons which set the timer to start, refreshed (cleared all the queues and reset the timer), temporarily stopped the timer, allowed a manual frame-by-frame view, and the last two buttons incremented and decremented how fast the timer would run. The GUI would also keep track for the user how many seconds had elapsed and how many cars have went through the intersection.
The second version of the project was never finished. It was something I did for fun to improve the interface and have a cross-intersection. It only had the play and stop buttons. I was going to include crosswalks with a queue for pedestrians.
|
"Lingo Word Finder"
|
|
The Lingo Word Finder is a program I did for my own entertainment and programming practice. It was a cheat I wrote for a game called Lingo Plus which can be played against people online.
About the game: Lingo requires players to guess five letter words with only the first letter revealed. The player’s guess has to be a valid word consisting of exactly 5 letters. As you play, the game’s interface shows players which letters were guessed in the correct place (red in the game and in my program), which letters were included in the word but out of place (yellow), and letters not in the word.
In my program you would select the first character, and click load (this would load a huge file with 100s of 5 letter words starting with that letter). As you guess words on your own, you enter them in the corresponding boxes and click update, and the GUI will display which characters could possibly belong. As you make the right guesses and fill out the text boxes, your options will be narrowed down. Resetting will clear everything, and the individual clear will just clear that row of characters you entered incase you made a mistake.
|
"Minesweeper"
|
|
I love the game minesweeper and I thought it would be fun and challenging to program my own. I haven’t touched this program in a while, but just about everything works except for one major part. If you click a button where the game would normally reveal blank buttons, my recursive method fails.
|
"Calculator"
|
|
A simple 4 function calculator I created for a lab project.
|
"Double Elimination Contest"
|
|
The contest program was a project for my Procedural Analysis and Design class which taught Ada95. This simulated a double elimination contest with a dynamic implementation of a queue and stack. There is a queue and stack package specification file and the implementation file for each. In the data file (the first picture) players names and their skill were entered. As a result of the contest their name, arrival number, skill level, number of wins, and number of losses are a displayed. Two queues were used for players had zero losses and one loss, and the last was a stack for the eliminated players with two losses. Players with no losses play matches until only one remains with no losses. Then, players with one loss continue to play matches until only one player remains with one loss. Finally, the two players who have exactly zero and one losses play one or two matches until one of them has exactly two losses (and the other has zero or one loss).
|
^ Back to top
|
