A few weeks ago I was looking in Amazon for books that dealt with photogrammetry. During my search some associated books showed up. After taking a look at the table of content on two that called my attention, I decided to go with both, not for depth in the subject, but to get a broad look at GIS.
One of the books I selected is titled Geographic Information Systems – An Introduction by Tor Bernhardsen published by Wiley in 2002. In chapter 10 Data Collection II, section 10.3 Photogrammetry Mapping provides a simple and high level description of the basics in the subject. To be honest, you can get a more up to date and extensive description in Wikipedia. Continue reading “Geographic Information Systems (GIS)”
The requirements for this project call for some type of interface which will allow clients to access storage services in a uniform way. On some occasions the client (e.g., on a smart phone, tablet or desktop) might want to store an object locally while on other occasions the same client might want to store or retrieve the same or other objects using a remote storage system. Continue reading “Storage Interface”
Went after the LeetCode challenge Coin Change 2 which you can find at the following URL: https://leetcode.com/problems/coin-change-2/?tab=Description
There are two approaches typically used to solve this type of problem. They are:
I consider dynamic programming more of an art than a science. I believe developers need to use it often enough to solve adequate problems to achieve and maintain proficiency in the technique.
I visited the Wikipedia page on Dynamic Programming and took notes which I present in the following couple paragraphs. That is simpler and quicker than starting from scratch ;o) Continue reading “Coin Change 2”
What is Test Driven Development? Is it useful? Should I and my team make use of it?
According to Wikipedia (I have edited the following paragraphs):
“Test-driven development (TDD) is a software development process that relies on the repetition of a very short development cycle: Requirements are turned into very specific test cases. The software is improved to pass new tests, only. This is opposed to software development that allows software to be added that is not proven to meet requirements. Continue reading “Test Driven Development”
In today’s world most systems are architected as a set of services implemented in different programming languages deployed on multiple hardware platforms. Often it is required for a piece of software written in a different programming language than the module it needs to interface with. I have been in situations when modules written in C# or Java had the need to interface with code written using the C programming language (typically for performance, separations of concern reasons or to allow the Java program access functionality written in a different language). Continue reading “Java Native Interface (JNI)”
I have been working and developing software on Linux, UNIX and Windows for a while. On the Microsoft platforms I started on MS DOS. Last week I was talking with a colleague and he mentioned that while still in BETA, Microsoft has something called Bash on Ubuntu on Windows. I do enjoy the simplicity and power of the Linux shells. I decided to give the Microsoft BETA software a run. Continue reading “Bash on Ubuntu on Windows”
The following question came up a couple weeks ago: Why would I use Apache Cassandra? First of all let’s get a definition for Apache Cassandra. Edited from Wikipedia (https://en.wikipedia.org/wiki/Apache_Cassandra):
“Apache Cassandra is a free and open-source distributed database management system designed to handle large amounts of data across many commodity servers, providing high availability with no single point of failure. Cassandra offers robust support for clusters spanning multiple datacenters, with asynchronous master less replication allowing low latency operations for all clients. Continue reading “Why Apache Cassandra?”
I spent some time reading (section 2.1 in the Algorithms fourth edition by Robert Sedgewick and Kevin Wayne) and experimenting with the Shell Sort algorithm.
The Shell sort algorithm is an optimized Insertion sort. The idea is to reduce the number of exchanges by presorting elements in sub sequences. Continue reading “Shell Sort”
Earlier today I was looking at a challenge. The problem was stated as:
“Print in reverse order a Fibonacci series”.
I have learned and used a couple times the Fibonacci series but time goes by and I am a firm believer that one should not memorize what you can look up. Software developers would look up the definition or better yet, a Class and associated method that would generate it.
Let’s start with a definition of what a Fibonacci series is from Wikipedia: Continue reading “Reverse Fibonacci Series”
It seems like anagrams are becoming quite popular in challenges. What is an anagram? The edited definition from Wikipedia follows:
“An anagram is direct word switch or word play, the result of rearranging the letters of a word or phrase to produce a new word or phrase, using all the original letters exactly once. Any word or phrase that exactly reproduces the letters in another order is an anagram”. Continue reading “Valid Anagram”