I have functionality for my trackpad set up similar to how you’re able to just tap without actually pressing down / “clicking”, since I have not always had mouse access… lol. You can try this out even if it might take some getting use to… but it’s really fast and I like it at least.. 😄:
You also need to go to the accessibility tab under system preferences and check these under “Trackpad Options…”:
Work in progress.
CREATE TABLE phones (
Inserting Data into Tables:
INSERT INTO phones (name, manufacturer, price, units_sold)
('N8', 'Nokia', 150, 7543),
('Droid', 'Motorola', 150, 8395),
('Wave S8500', 'Samsung', 175, 9259);
area NOT IN(3043, 8223)
OR name = 'Delhi'
OR name = 'Tokyo';
Renaming Columns and Performing Calculations in “Where” Clauses:
price * unit sold AS total_revenue
price * unit sold > 1000000;
Add / Insert:
INSERT INTO cities (name, country, population, area)
A full stack Auth app requires:
install jwt + bcrypt
setup login, registration
authorize request => application
Need to be able to have a user sign up, the process is as follows:
You’ll need a form with username and password and a submit button
a route => user create
user model (has_secure_password) which comes with a particular gem called..bcrypt
bcrypt + jwt
Following the above instructions requires some serious insight. If you want to be good at…
I’m currently pursuing a virtual internship opportunity with JPMorgan Chase to help them add stock monitoring functionality to a trader’s dashboard. Being apart of the software engineering team is hypothetical but something that I could be working with while on their development team.
I’m assisting with the development of an alternative way to visualize and analyze share price data for JPMorgan Chase traders. My work is ultimately alerting the traders of potential trading opportunities for their clients.
JPMorgan Chase has traders in all the major financial centers around the globe and a marketplace for asset classes, such as stocks, bonds…
When we talk about recursion and computer science, we are talking about a function that calls itself. This type of technique is really good at certain problems because of its ability to maintain state at different levels of recursion.
One thing we want to be careful of with recursion is this idea of stack overflow. This added memory space as we keep calling the same function over and over until we possibly reach a limit and get a stack overflow.
A good rule of thumb is that we should use recursion when it makes code more readable. …
There are many types of graphs. However, certain characteristics allow us to describe graphs.
There are directed and undirected graphs. These types of graphs are useful for describing traffic flow (i.e. of some kind of a system in which movement is not bi-directional).
A good way to think about an undirected graph is to think of it as a highway between two cities where you can go back and forth. On the other hand, directed will be a one way street where you can only go one way.
Another way to think about it is Facebook. What kind of graph…
Selection sort is one of the simpler possible ways to sort a list. This algorithm works by scanning a list of items for the smallest element and then swapping that element for the one in the first position. Refer to the above image to see the smallest item seen, where it sorts based on locating the smallest item and then the next smallest item through the list in consecutive order. It keeps doing this to find the next smallest item in the list that hasn’t already been discovered.
Selection sort still has a time complexity of O(n²). It’s not very…