Monday, May 29, 2017


This week, we're using JPA, the Java Persistence API, which is a type of ORM, object relational mapping, to access and manage data between Java objects / classes and a relational database in MySQL.

We're also studying measuring the time complexity of a recursive algorithm using initial conditions, backwards substitution and recurrence relations, after studying the non-recursive mathematical analysis of algorithms last week.  We find the basic operation, then create a function including the recursion and any other multiplications that occur, then look for a pattern in the backwards substitution. From that we find a general form that can be compared to the initial condition, so you solve for that, and you can produce an expression that will be in the range of Big Theta, between an upper and lower bound, or if there are possible variations to efficiency based on the input, O and Omega, as well.

No comments:

Post a Comment