In the ever changing landscape of software programming, it is not surprising that developers and employees have a different set of preferences for desired skills.  However the number one language that developers want to learn according to a survey of developers by technical recruiter, Hacker Rank is Python. This is not a surprise considering that Python has been in demand for several years and programmers tend to really enjoy this language for clear syntax, good OOP support and great shortcuts. Python, named “the language of the year” in 2007 and 2010 in the TIOBE Index and has climbed to #4 status in May of 2018.

According to the study, employers want developers who:

-  Have problem-solving skills, such as the ability to break down large, complex problems.
- Are proficient in their programming language and debugging.
- Can design systems.
- Can optimize performance.
- Have experience in reviewing and testing code.
- Are proficient in database design

Surprisingly, formal education is not the deciding factor when it comes to what companies care about the most. People with computer degrees or certifications on a resume are not necessarily a first choice for hiring managers. Others that have years of experience even if those individuals are partially self-taught in the field stand to be taken seriously in the field.   For those individuals with a passion to learn and master a skill, there are ample opportunities with smaller to mid-sized companies.

Some interesting FAQ’s from the study:

    On average, developers know 4 languages, and they aspire to learn 4 more.
    Younger developers between 18 and 24 plan to learn 6 languages.
    Folks older than 35 only plan to learn and additional 3 languages.
    The top languages developers said they will learn were, Go, Python, Scala, Kotlin, and Ruby.
    There is a large gap between employers seeking developers that know React than there are folks that can do it.

So, Why Learn Python?
It is now the most popular introductory teaching language in U.S. universities.  Python is easy to use, powerful, and versatile, making it a great choice for beginners and experts alike. It allows you to think like a programmer and not waste time understanding difficult syntax that other programming languages can command. And, because of its rapid growth, many developers contribute to the Python community and share Python libraries making creativity that much more a reality

Toshiba has released a new line of solid-state drives (SSD) using 19 nanometers, which is currently the industry’s smallest lithography process.

The lineup will include mini-SATA and 2.5-inch form factors along with drives in 7mm and 9.5mm heights. All drives will use the most current serial ATA 6Gbps interface protocol.

A business rule is the basic unit of rule processing in a Business Rule Management System (BRMS) and, as such, requires a fundamental understanding. Rules consist of a set of actions and a set of conditions whereby actions are the consequences of each condition statement being satisfied or true. With rare exception, conditions test the property values of objects taken from an object model which itself is gleaned from a Data Dictionary and UML diagrams. See my article on Data Dictionaries for a better understanding on this subject matter.

A simple rule takes the form:

if condition(s)

then actions.

An alternative form includes an else statement where alternate actions are executed in the event that the conditions in the if statement are not satisfied:

if condition(s)

then actions

else alternate_actions

It is not considered a best prectice to write rules via nested if-then-else statements as they tend to be difficult to understand, hard to maintain and even harder to extend as the depth of these statements increases; in other words, adding if statements within a then clause makes it especially hard to determine which if statement was executed when looking at a bucket of rules. Moreoever, how can we determine whether the if or the else statement was satisfied without having to read the rule itself. Rules such as these are often organized into simple rule statements and provided with a name so that when reviewing rule execution logs one can determine which rule fired and not worry about whether the if or else statement was satisfied. Another limitation of this type of rule processing is that it does not take full advantage of rule inferencing and may have a negative performance impact on the Rete engine execution. Take a class with HSG and find out why.

Rule Conditions

I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */