Android Application Buttons

 




    This week I learned a bit more about the way Android applications are built. I started learning about the button objects in android development. A button is just what it sounds like a button you attach to the screen however the logic of the button is attached by your java file. In this week I decided to have different buttons on the screen and depending on what button the user clicks a toast message would appear. A toast message is just a message that appears that stays on your screen for 3 seconds the goes away. The toast message that I made appear just says "You have just clicked the (color) button". It may seem simple but there are many things going on in the background.    

    When I placed these button objects on the screen I attached an ID to them to make a connection to them in my java file. Once they are all properly identified I connect them in my java file by calling a built in method. Once I did that I implemented an interface that has a method called on onclick. Onclick allows you to provide logic to your object if the button is clicked. Once I did that I simply created a switch and every one of my cases it connected to every different color button on my screen. Once I did that I called another method that creates a toast message when the specific button is clicked. I am still learning how to create different activities on the same app and once I do I will create buttons that take you to different activities in the app. 

Comments

Post a Comment

Popular posts from this blog

First Non Repeating Character Coding Challenge

Image
      For this semester I will be solving different coding problems that are commonly asked in developer interviews. I have applied for several developer internships this last month and need to get prepared on solving these problems along with being able to explain my solutions. The first problem I did this week is called first non repeating character.     The goal of this problem is to be able to write a function that takes in a string. You want to be able to return the index of the first non repeating character in the string. For example if you are give the string "aabbcddee" the first non repeating character would be the letter c. In this case you would return the index number 4. If you were given the string "aabbccddee" you would return -1. This is because part of the problem is if there is not a non repeating character is a string then we just return -1.     The way I go about these problems is I try to break it down into smaller problem...
Read more

Stock Market Max Profit

Image
      For this week I did a problem called maxProfit. I found that this problem was actually a bit more practical for real life. The problem is that you are given a list containing integers that represent the price of a stock at a certain day. For example a list of [4,3,2,6,8,1,18,3,5,7]. For example at index 0 the stock was at 4 dollars and index 1 the price was 3 dollars. We would want to buy the stock at the lowest price possible and sell the stock at the highest price possible. For example in this case we would want to buy at price 1 and sell at price 18. We take the difference of that and our profit would be 17.      At first I thought right away of going to a double for loop and taking the difference at every step and seeing if that was the max profit. I however have been reading about big o(N) notation and that would not be optimal. That would be O(N^2). I thought about a faster solution where would would just go through the list once and have ...
Read more

Tandem Bicycle Coding Problem

Image
      For this weeks assignment I decided to do one of the longer coding challenges. This one is called tandem bicycle. A tandem bike is a bike that has 2 or more seats on it with every rider pedaling. If there are 2 people riding one bike than the speed of the bike will be determined by the faster peddler and the slower peddler will be ignored. The way this challenge works is you are given an 2 arrays with integer values that represent 2 different groups of riders. One of the groups are red riders and the other group is blue riders. Every index inside of the arrays represent one rider and the value inside of that index determines the speed of the rider. The higher the speed the faster the rider can peddle. You are also given another variable called target which is a boolean and will either be False or True. If the target is True then we are trying to find a way to pair every blue rider with every red rider to find the fastest ...
Read more