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

As part of our C++ Tutorials series, here is a tutorial on the tricks of the trade for using C++ I/O.  Keep in mind that an application without I/O is just a black box; no communcation is taking place. 

Tricks and Tips for using C++ I/O

In this tutorial I am going to give you a gentle introduction to network programming in Python. If you are new to programming or new to Python then that may seem like a daunting thought. But read on and you will be pleasantly surprised how easy it is.

Like most modern programming languages, Python was designed for networking from the very beginning, and thanks to that, a lot of the networking tasks you would want to accomplish with the language are made a whole lot easier.

Network communication is a large topic, but if it is something that interests you then read on because in this tutorial I will show you how to download a web page. I will show you how easy Python makes tasks like this.

Take a look at the following code:

import urllib
	
con = urllib.urlopen("http://hartmannsoftware.com")
page = con.read()
con.close()
print page

For those newly moving into the realm of programming, the important question to mull over is what programming language or technology to specialize in. On the other hand, those who are already working as a software developer, the constant worry remains whether their current technology would become obsolete very soon.

Both these concerns could be easily addressed by checking the list of programming languages that are highly in demand and formulating the career by modifying your specialization accordingly. The supply for the developers have not met with the demand in these programming languages yet, making them most viable options for career.

Popular Programming Languages Based on TIOBE Index

The top 10 list of programming languages which are highly in demand in 2014 is listed below in the order of popularity. These languages are identified from the TIOBE Programming Community index which consists of 20 top programming languages. TIOBE index is an indicator of the popularity of programming languages and is updated once in every month.  This index is calculated using multiple search engines, and the ratings are based on the number of skilled engineers world-wide, courses and third party vendors.