Java for Beginners 8 – Creating a Multi-User Application

With the recent fast adoption of Internet and cloud environments, the focus of software development shifted from building single user type applications, into a realm of constructing software capable of handling numerous local or remote users. The core benefit of multi-user applications lies in their capacity to tolerate synchronized access from simultaneous users. Other advantages often include the ability to support different types of desktop and mobile devices using a variety of operating systems. [Read more…]

Java for Beginners 7 – Abstract Classes and Interfaces

The Java recognizes the limited nature of abstract classes and interfaces and their inability to become an object or a traditional class. Nevertheless, it is the absence of the qualities above and the ability to use abstract classes in various objects that proves to be incredibly useful to developers. In this article, I briefly outline the possible application of abstract classes and interfaces as well as provide examples to highlight the contrast between them.

[Read more…]

Java for Beginners 4 – Working with Java Loop Statements

Java recognizes three types of loops, namely ‘for,’ ‘while’ and ‘do-while’ loops that all accomplish the similar goals of iterating the block of code until a certain condition is met. The following article explores the differences between each of the loop variants and demonstrates the situations when choosing one type of loop over the other can be a benefit. There are many examples of using all three types of loops, but I’ve selected the general form and the infinite loop to illustrate the primary differences.

[Read more…]

Polyomino Combinatorics: How to count distinct n- letter long array permutations

Let’s say we have 3 arrays of following tetromino letters: J, L, O. Tetromino J is a 4 member long array (J[0],J[1],J[2],J[3]), signifying the number of positions J block can take. L tetromino is also a 4 member long array and O is a square tetromino that has only one position (1 member long array). How do we calculate the total number of all unique n-letter long permutations, without programmatically permuting through them? [Read more…]