Portraits

Digital Portraits created in Adobe Illustrator and Adobe Sketch for clients and friends.

Exit

Mobile Game

Rapid Alien Fire

Rapid Alien Fire is a single player space shooter game that was created in Xcode, written in Swift, and illustrated in Adobe Illustrator

Rapid Alien Fire is a basic single player space shooter mobile game written with Swift in Xcode and designed in Adobe illustrator. The user can drag the player ship horizontally across the screen and tap to deploy bullets. The player has three lives and must defeat all of the alien ships that try to pass it; if an alien ship passes then the player will lose a life. If the player collides with an enemy then its game over. A tally is stored and displayed for the current game score and also the highest game score.

All images used in the game were created in Adobe Illustrator

This is the player ship.

An explosion will occur everytime a bullet makes contact with an enemy ship and when the player and enemy ships collide.

There are two versions of the enemy ship. This is the first one.

This is the second version.

When the game ends, the gameover screen shows what your score was for the current game, and also the high score. The high score will be saved even if the application closes.

Exit

Videos

Election 2016 is a meme-like appropriated video that satirically depicits the 2016 election between Hillary Clinton and Donald Trump. This video was created for my introduction to video arts course that I took in the fall of 2016.

Consumption is a video I created for my Data Visulatization course. The video represents not only the amount of videos that I watched during the week, but the actual videos themselves. It allows the viewer to observe the metadata that is embedded within the videos and their relationship with each other and myself, the creator. I consumed around 50 videos within the span of the week, and I represent the amount of time spent watching each video by having the videos disappear off the screen based on their duration. If a video was normally 30 minutes long, then the video would stay on the screen for 30 seconds. If it were a five minute video, then it would stay on the screen for 5 seconds, and so on.

Silent Dreams is an indirect PSA that shares the danger of listening to music too loud. The video represents silence and creates tention through its sound design and imagery collaboration.

The Fly is a short video that demonstrates the theme of subjectivity. The video explores the life of a fly from its own perspective and shows the good, the bad, and the ugly.

Exit

C++

Stack and Queue CPP

STACK IMPLEMENTATION FILE
WHAT IS A STACK?
Description: A stack is a conceptual structure consisting of a set of homogeneous elements and is based on the principle of last in first out (LIFO). It is a commonly used abstract data type with two major operations, namely push and pop. Push and pop are carried out on the topmost element, which is the item most recently added to the stack. The push operation adds an element to the stack while the pop operation removes an element from the top position.

using namespace std;
#include
#include "stack.h"
//PURPOSE: Constructor must initialize top to be -1 to begin with.
stack::stack()
{
top = -1;
} // indicate an empty stack
//PURPOSE: Destructor does not have to do anything since this is a static array.
stack::~stack()
{ }// nothing to do
//PURPOSE: checks top and returns true if empty, false otherwise.
//when top is equal to -1, then the stack is empty
bool stack::isEmpty()
{
if (top == -1)
return true;
else
return false;
}
//PURPOSE: checks top and returns true if full, false otherwise.
//when top equals MAX-1 then the stack is full
bool stack::isFull()
{
if (top == MAX-1 )
return true;
else
return false;
}
//PURPOSE: calls isFull and if true, throws an exception (Overflow)
// Otherwise, adds an element to el after incrementing top.
//PARAMETER: pass the element (elem) to be pushed
void stack::push(el_t elem)
{
if (isFull())
throw Overflow();
else
{
top++;
el[top] = elem;
}
}
//PURPOSE: calls isEmpty and if true, throws an exception (Underflow)
// Otherwise, removes an element from el and gives it back.
//PARAMETER: provide a holder (elem) for the element popped (pass by ref)
void stack::pop(el_t& elem)
{
if (isEmpty())
throw Underflow();
else
{
elem = el[top];
top--;
}
}
// PURPOSE: calls isEmpty and if true, throws an exception (underflow)
// Otherwise, gives back the top element from el.
//PARAMETER: provide a holder (elem) for the element (pass by ref)
void stack::topElem(el_t& elem)
{
if (isEmpty())
throw Underflow();
else
{
elem = el[top];
}
}
//PURPOSE: dislayAll calls isEmpty and if true, displays [ empty ].
// Otherwise, diplays the elements vertically.
void stack::displayAll()
{
if (isEmpty())
cout << "[ empty ]" << endl;
else
for (int i=top; i>=0; i--)
{
cout << el[i] <<
}
void stack::clearIt()
{
el_t temp; //temp variable for elements waiting to be popped
while(!isEmpty())
{
pop(temp);
}
}

QUEUE IMPLEMENTATION FILE
WHAT IS A QUEUE?
Description: A queue is an ordered collection of items where the addition of new items happens at one end, called the “rear,” and the removal of existing items occurs at the other end, commonly called the “front.” As an element enters the queue it starts at the rear and makes its way toward the front, waiting until that time when it is the next element to be removed.

using namespace std;
#include
#include "queue.h"
// constructor
queue::queue()
{
//initializing variables
front=0;
rear=-1;
count=0;
}
//destructor
queue::~queue()
{
}
// PURPOSE: returns true if queue is empty, otherwise false
bool queue::isEmpty()
{
if(count==0)
{
return true;
}
else
return false;
}
// PURPOSE: returns true if queue is full, otherwise false
bool queue::isFull()
{ if(count==MAX_SIZE)
{
return true;
}
else
return false;
}
// PURPOSE: if full, throws an exception Overflow
// if not full, enters an element at the rear
// PAREMETER: provide the element (newElem) to be added
void queue::add(el_t newElem)
{
if(isFull())
{
throw Overflow();
}
else
{
rear = (rear+1) % MAX_SIZE;
el[rear] = newElem;
count++;
}
}
// PURPOSE: if empty, throw Underflow
// if not empty, removes the front element to give it back
// PARAMETER: provide a holder (removedElem) for the element removed (pass by ref)
void queue::remove(el_t& removedElem)
{ if(isEmpty())
{
cout<<"**EMPTY**"<<
}
else
{
removedElem=el[front];
front=(front+1) % MAX_SIZE;
count--;
}
}
// PURPOSE: if empty, throws an exception Underflow
// if not empty, give back the front element (but does not remove it)
//PARAMETER: provide a holder (theElem) for the element (pass by ref)
void queue::frontElem(el_t& theElem)
{
if(isEmpty())
{
throw Underflow();
}
else
theElem=el[front];
}
// PURPOSE: returns the current size to make it
// accessible to the client caller
int queue::getSize()
{
return count;
}
// PURPOSE: display everything in the queue horizontally from front to rear
// enclosed in []
// if empty, displays [ empty ]
void queue::displayAll()
{
if(isEmpty())
{
cout<< "**EMPTY**" <<
}
for(int i=0; icount; i++) //looping to display all items in the queue
{
cout<< el[(front+i) % MAX_SIZE] << " "<<
}
}
// PURPOSE: if empty, throws an exception Underflow
//if queue has just 1 element, does nothing
//if queue has more than 1 element, moves the front one to the rear by
//doing remove followed by add.
void queue::goToBack()
{
el_t temp;
if(isEmpty())
throw Underflow();
else if(count==1)
return;
else
temp=el[front];
remove(temp);
add(temp);
}

Exit

Animations

Animations were created in Adobe After Effects and designed in Adobe Illustrator.

Exit

Assembly Language

Program Description: This program uses loop to get the summation of numbers from the user

inputPrompt: .asciiz "How many numbers would you like to add together? "
sumPrompt: .asciiz "The sum of the even numbers is: "
.text
li $v0,4
la $a0, header #for header
syscall
la $a0,header1 #for program description
syscall
la $a0, header2 #for name
syscall
la $a0,header3 #for date
syscall
la $a0,header #for header
syscall
la $a0,inputPrompt #user interface question
syscall
li $v0, 5 #reads input from user
syscall
move $s0,$v0 #put number from user into s0
addi $s3, $s3,-1 #decrement counter
addi $s2,$0,2 #s2= integer 2
j loop #jump
counter:
add $s0,$s3,$s0 #decrement user input after going through loop
beq $s0,$0, exit #if equal to 0, exit
loop:
li $v0,5 #gets user input
syscall
move $s4, $v0 #transfer user date into s4
div $s4,$s2 #is divisible by 2 for even
mfhi $t1 #remainder
mflo $t2 #coefficient
bne $t1,$0,counter #if not even, loop to counter
sum:
add $s7,$s7, $s4 #if even add it to the sum of even integers
j counter #jump to counter to get next input
exit:
li $v0,4
la $a0,sumPrompt #user interface for sum
syscall
li $v0,1
add $a0, $s7, $0 #prints the sum of all of the even numbers
syscall
li $v0,10 #exits the program
syscall

Program description: This program will calculate the price of all items entered from the user and deduct the total amount of valid coupons used from the total.

.data
enterItem: .asciiz "Please enter the number of items you are purchasing (should be less than or equal to 20): "
tooManyItems: .asciiz "\nSorry too many items to purchase!! Please enter the number of items: "
enterPrice: .asciiz "\nPlease enter the price of item: "
couponNum: .asciiz "\n***** Please enter the coupons you want to use ***** "
enterCoupon: .asciiz "\nPlease enter the coupon amount: "
invalidCoupon: .asciiz "\nSorry! This coupon cannot be accepted!! \n"
total: .asciiz "\nYour total charge is: "
thankYou: .asciiz "\nThank you for shopping with us!"
priceArray: .word 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
couponArray: .word 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
.text
start:
#declaring arrays: price and coupon
la $s0, priceArray
la $s1, couponArray
li $v0,4
la $a0,enterItem #asking user to enter number of items
syscall
enterNumItems:
li $v0, 5 #loading users answer
syscall
addi $v0, $v0, 1
add $a1, $0, $v0
bgt $a1, 20, greaterThan20 #error cannot have more that 20 items
ble $a1, 20, FillPrice
greaterThan20:
li $v0, 4
la $a0,tooManyItems
syscall
j enterNumItems #ask user to enter number of items again
FillPrice: #calling subroutine FillPriceArray
jal FillPriceArray
add $t1, $0, $v0
FillCoupon:
#calling subroutine FillCouponArray
jal FillCouponArray
add $t2, $0, $v1
sub $s6, $t1, $t2 #subtracting coupons from price
print:
li $v0, 4
la $a0, total
syscall
li $v0, 1
add $a0, $0, $s6 #printing the total amount w/ deducted coupon amnt
syscall
li $v0, 4
la $a0, thankYou
syscall
li $v0, 10 #exit
syscall
FillPriceArray:
add $s5, $0, $a1
li $s3, 0
li $s2, 1
loop1: beq $s2, $s5, priceSum #if all items have been entered get sum
li $v0,4
la $a0, enterPrice
syscall
li $v0,5 #loading user input
syscall
add $s3, $s3, $v0 #storing input into s3
sw $v0, 0($s0) #putting input into the array
addi $s0, $s0, 4 #next slot in array
addi $s2, $s2, 1 #counter
j loop1
priceSum:
add $v0, $0, $s3 #sum of the price
jr $ra #return to FillPrice
FillCouponArray:
la $s0, priceArray
add $s5, $0, $a1
li $v0, 4
la $a0 couponNum
syscall
li $s4, 0
li $s2, 1
loop2:
beq $s2, $s5, returnCoupon #if all coupons have been accounted for
li $v0,4
la $a0, enterCoupon
syscall
lw $t0, 0($s0)
addi $t2, $0, 10 #for checking if coupons are greater than 10
li $v0,5 #loading user input
syscall
add $t3, $0, $v0
bgt $t3, $t2, couponValueInvalid #coupon is greater than 10
bgt $t3, $t0, couponValueInvalid #coupon is greater than the price of the item
j couponArrayFill
couponValueInvalid:
li $v0, 4
la $a0, invalidCoupon
syscall
addi $t3, $0, 0 #storing 0 into t3 for invalid coupon value used below
couponArrayFill:
add $s7, $s7, $t3
sw $t3, 0($s1) #storing 0 into coupon array
addi $s0, $s0, 4 #next slot in price array
addi $s1, $s1, 4 #next slot in coupon array
addi $s2, $s2, 1 #counter
j loop2
returnCoupon:
add $v1, $0, $s7 #sum of valid coupons
jr $ra

Exit