Superintelligence Paths, Dangers and Strategies – Book

Superintelligence: Paths, Dangers, Strategies by Nick ...During the past few months it has been somewhat hectic for me. I used to write and post on my blog more often. Lately I have set aside only weekend mornings to learn new things and refresh (courses), experiment, and write posts.

A few weeks ago I finished reading Superintelligence Paths, Dangers and Strategies by Nick Bostrom. If I am not mistaken the book made it to the NYT bestseller list during 2014. A teammate at work mentioned the book so I decided to get a copy and read it. Continue reading “Superintelligence Paths, Dangers and Strategies – Book”

Element Replication

Motivation

When one decides to take a paid on-line course there may be one or more reasons behind it. I can think of a few. You need or want to learn the skills offered by the course. You might just want to refresh and/or learn new things. Or you might just want to have the completion certificate that you finished and met the requirements for the course to get a diploma. I personally like to refresh, learn, and have proof that I actually completed the course. Continue reading “Element Replication”

Algorithms and Data Structures for Massive Datasets

Algorithms and Data Structures for Massive Data Sets

I just finished reading and to some extent experimenting with most of the concepts presented in the book by Dzejla Medjedovic, Emin Tahirovic with illustrations by Ines Dedovic © 2022 Manning Publications ISBN: 9781617298035.

I signed up on Amazon to get the book as soon as it was released. As with most work, the first edition has a few typos. In addition, the book could have had more examples. It seems that as the book progresses the number of examples diminishes. Overall a nice book! Continue reading “Algorithms and Data Structures for Massive Datasets”

Rabin-Karp Algorithm – Revisited

In this post we will revisit the implementation of a string-search algorithm developed by Richard Karp and Michael Rabin.

We visited this algorithm in this blog a few years ago. My motivation is a book that I am currently reading. As soon as I am done reading and experimenting with some more advanced algorithms, I will generate several posts associated with the book.

In the meantime, let’s refresh what the Rabin-Karp algorithm is used for and go over an implementation using the Java programming language. Continue reading “Rabin-Karp Algorithm – Revisited”

What Have I Been Up To In The Past Few Months

Good day! It is a sunny Saturday summer morning in the Twin Cities of Minneapolis and St. Paul. THIS POST DOES NOT COVER TECHNICAL SUBJECT(S).

I like to listen to constructive comments. I can then do some research, think about the pros and cons, and finally make an educated decision. Since no one is perfect, your decisions are not always the best, but by following a set of steps like the ones I outlined in this paragraph, in retrospect most of the decisions made seem to be the right ones.

If a post is based on a specific technical subject, I will indicate so to avoid readers wasting their time with a post that might not be useful for their immediate needs. Continue reading “What Have I Been Up To In The Past Few Months”

Insertion Sort – Revisited

Insertion Sort implements an algorithm similar to ordering a hand of cards in ascending order. The algorithm is O(n^2) execution and typically is useful when sorting a rather small number of elements.

Several years ago (November 03, 2016) I generated the post Insertion Sort in this blog. The code snippets do not look nice. It seems that the tool I was using to format source code is no longer working as expected. Continue reading “Insertion Sort – Revisited”

Bubble Sort in Java

It has been a few weeks since my last post. I apologize for this. Will let you know after my current quest is completed. Hopefully everything will turn out as I desire.

In the meantime I have been taking a few on-line courses.

I am almost done with the course C++20 Fundamentals by Paul J. Deitel. The course was released July, 2021 and published by Pearson3. The ISBN: 013687518. This online course is made available through O’Reilly. I am a member of the Association of Computing Machinery and have access to several O’Reilly titles. Continue reading “Bubble Sort in Java”

Largest Triple Product Third Post in Java

In this post we will revisit a practice question Largest Triple Products. Not sure if today this question would be of interest to Facebook and /or to Meta Platforms technical job seekers.

My original post Largest Triple Products was superseded by Largest Triple Products – Revisited and by this latest post.

The motivation for this post came from a question left by Brent Boyer which suggested an implementation for the function of interest. I have included it in this post as `findMaxProduct3`. Continue reading “Largest Triple Product Third Post in Java”

Fibonacci Numbers in C++

In this post we will write a couple functions to generate Fibonacci Numbers using the C++ programming language and the Visual Studio 2022 IDE, on a Windows 11 computer.

The motivation came from the on-line course C++20 Fundamentals by Paul J. Deitel, included in the O’Reilly Learning Platform offered by the Association for Computing Machinery.

C++20 for Programmers
by Paul Deitel and Harvey Deitel
Format:	        Paperback
Language:	    English
ISBN:	        0136905692
ISBN13:	        9780136905691
Release Date:	March 2022
Publisher:	    Pearson Education
Length:	        1008 Pages

I have preordered the new book associated with the course on Amazon. Hopefully it should arrive next month. Continue reading “Fibonacci Numbers in C++”

LeetCode 111. Minimum Depth of Binary Tree in Java

In this post we will solve LeetCode 111. Minimum Depth of Binary Tree problem using Java and the VSCode IDE on a Windows computer. Not that it matters, but I am using Windows 11.

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path 
from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Constraints:

o The number of nodes in the tree is in the range [0, 10^5].
o -1000 <= Node.val <= 1000

Related Topics:

o Tree
* Depth-First Search
* Breadth-First Search
o Binary Tree

We are given the root of a binary tree and are asked to find the minimum depth of the tree. A couple years ago we solved in this post Maximum Depth of a Binary Tree.

The definition of minimum depth is provided in the requirements for the problem at hand. Continue reading “LeetCode 111. Minimum Depth of Binary Tree in Java”