Category Archives: Java Video Tutorial

Java Programming

Java ProgrammingIn this Java programming Tutorial I’ll teach you all of the core knowledge needed to write Java code in 30 minutes. This is the most popular request from everyone.

I specifically cover the following topics: primitive data types, comments, class, import, Scanner, final, Strings, static, private, protected, public, constructors, math, hasNextLine, nextLine, getters, setters, method overloading, Random, casting, toString, conversion from Strings to primitives, converting from primitives to Strings, if, else, else if, print, println, printf, logical operators, comparison operators, ternary operator, switch, for, while, break, continue, do while, polymorphism, arrays, for each, multidimensional arrays and more. Continue reading Java Programming

Eclipse Shortcut Keys

Eclipse Shortcut KeysI have been asked many times to cover the Eclipse shortcut keys that I use all of the time, so in this tutorial I will do just that. I did my best to limit the tutorial to the most commonly used shortcuts I use so that they are easier to memorize. I also provide them in a table below.

Both the Auto Complete and the Keystroke shortcuts are covered. I hope this helps you write code quicker. Feel free to leave your own favorites in the comment section below if you think I missed something important. Continue reading Eclipse Shortcut Keys

Install Android Development Tools

Install Android Development ToolsWelcome to my tutorial on how to Install Android Development Tools. I received many requests on how to do this and it is a great topic to cover right before I start my Android Development Tutorial.

I’ll cover how to install Googles ADT plugin, all of the common errors people get and take you through running your first app. Many important things need to be pointed out like the fact that Googles emulators are terribly slow. If you haven’t installed Eclipse yet, definitely checkout my tutorial Install Eclipse for Java first. Continue reading Install Android Development Tools

Java Algorithm Video Tutorial

Java Algorithm Video TutorialWelcome to my Java algorithm video tutorial. Here I provide 18 videos on not only Java algorithms, but I also cover Data Structures in depth.

We cover numerous search and sorting algorithms. We also look at stacks, queues, lists, recursion, Big O Notation, hash tables, trees, heaps and a ton more.

A playlist filled with all the videos is below, along with links to all of the code used. Continue reading Java Algorithm Video Tutorial

Java Heap Tutorial

Java Heap TutorialWelcome to my Java Heap Tutorial. In previous tutorials, I covered how to print out trees in Java. You may want to look at that before continuing here, but it isn’t required.

A Heap is kind of like a tree, but it is normally implemented as an array. There are 2 main rules for using a heap. 1. Every row is complete except for last row. 2. Parent keys are bigger then children. I will cover how to insert and remove items. I’ll show how an array is heaped. I’ll also cover how the Heap Sort works. Everything is covered in the video and code below. Continue reading Java Heap Tutorial

Solving Programming Problems 2

Solving Programming ProblemsIn my previous tutorial Solving Programming Problems, I walked you threw the process of solving a generic programming problem. We made a method that printed out a tree structure in the console.

In this tutorial, I’ll walk through the process of finding bugs in the code and talk about how we can fix those bugs. I think this topic may be the hardest to teach. I hope the video and the code that follows can help you better grasp how to solve most any programming problem. Continue reading Solving Programming Problems 2

Solving Programming Problems

Solving Programming ProblemsTo finish off my Java Algorithm tutorial, I thought it would be interesting to cover solving programming problems in general. So, in this tutorial I’ll answer the question I’ve been getting, which is how to print a tree data structure.

On our journey to better understand how to solve problems I will first solve the basic problem. Then in the next part of the tutorial I will perfect printing any type of tree. The code below will better explain the process of solving this problem. Continue reading Solving Programming Problems

Binary Trees in Java 2

Binary Trees in JavaWelcome to my 2nd video on Binary Trees in Java. If you haven’t seen part 1, definitely watch it first or this will be confusing binary tree in Java.

In this part of the tutorial, I will take you step-by-step through the process of deleting nodes in a binary tree. This topic seems to be confusing to many people. I personally prefer to build trees with the builder design pattern like I showed here Encapsulate Composite with Builder, but it is also important to understand the basics of the binary tree. Continue reading Binary Trees in Java 2

Binary Tree in Java

Binary Tree in JavaWelcome to my tutorial on the Binary Tree in Java. On average a tree is more efficient then other data structures if you need to perform many different types of operations.

In this tutorial I’ll show you what a binary tree is, and how to create, add, traverse and find nodes. I’ll also explain all the terminology used when describing tree structures. We’ll cover nodes, paths (edges), traversing and much more. Continue reading Binary Tree in Java

Java Hash Tables 3

Java Hash Tables 3Welcome to the 3rd part of my Java Hash Tables Tutorial. If you missed the previous parts you should watch them Java Hash Table & Java Hash Tables 2.

I will review linked lists because I’ve received many requests on them. I’ll also show you how to hash strings, so that we can make a tool that can be used as a dictionary, spell checker, or something like Google Instant. I also show how to use lists in hash tables to demonstrate something called Separate Chaining. Continue reading Java Hash Tables 3

Java Hash Table 2

Java Hash Tables 2Welcome to the 2nd part of my Java Hash Tables tutorial. If you missed part 1, definitely watch it first here Java Hash Table.

In this tutorial, I will cover all of the following and more: 1. Why We Use Prime sized hash tables 2. How to Increase Hash Table Size 3. How to Avoid Clustering 4. How Double Hashing Works 5. How to Find Values in a Double Hashed Hash Table

This video provides many useful algorithms aside from the info on hash tables. Continue reading Java Hash Table 2

Java Hash Table

Java Hash TableWelcome to my Java Hash Table tutorial. A Hash Table is a data structure offers fast insertion and searching capabilities. The negative is that they are limited in size because they are based on arrays. They are also hard to order.

People get confused about them because of the Hash Function. A hash function is used to generate a unique key for every item in the array. Since every item is entered using a calculation, this allows you to reverse the calculation to immediately find the proper index. This way you can find items without the need to search through the whole array. Continue reading Java Hash Table

Big O Notations

Big O NotationsWelcome to my Big O Notations tutorial. Big O notations are used to measure how well a computer algorithm scales as the amount of data involved increases. It isn’t however always a measure of speed as you’ll see.

This is a rough overview of Big O and I hope to simplify it rather than get into all of the complexity. I’ll specifically cover the following O(1), O(N), O(N^2), O(log N) and O(N log N). Between the video and code below I hope everything is completely understandable. Continue reading Big O Notations

Java Quick Sort

Java Quick SortWelcome to my Java Quick Sort tutorial! In most situations the Quick Sort is the fastest sorting algorithm.

In essence, the quick sort works by partitioning arrays so that the smaller numbers are on the left and the larger are on the right. I’ll cover what partitioning is in this video.

The Quick Sort then recursively sends small parts of larger arrays to itself and partitions again. Between the code and the video below you will completely get it in the end. Continue reading Java Quick Sort

Java Shell Sort

Java Shell SortWelcome to my Java Shell Sort tutorial! I really tried to have fun explaining how the Shell Sort works in this tutorial. I show how it works in 4 different ways. We see it graphically, in a presentation format, explained during execution and again in the code itself. Everything can be found after the video.

The Shell Sort is one of the fastest of the easier to understand sorting algorithms. It is similar to the insertion sort, but it has an added feature in which it partially sorts the array before the insertion sort is used. The video and code below will explain everything. Continue reading Java Shell Sort

Java Recursion

Java RecursionWelcome to my Java Recursion tutorial. In the video below, I’m going to cover java recursion in 5 different ways. I figured if I show it using many different diagrams that it will make complete sense.

A recursive method is just a method that calls itself. As these calls are made the problem gets simpler until you reach a condition that leads to the method no longer making calls upon itself. This is known as the base case. The video and code below will make recursion easy to understand. I also cover the Merge Sort. Continue reading Java Recursion

Linked List in Java 2

Linked List in Java 2In my previous Linked List in Java tutorial, I showed you how to create Linked Lists and how to manipulate them.

In this tutorial, I will cover Double Ended Linked Lists which have a reference to the first and last link. I cover how a Doubly Linked List allows you to go backwards and forwards in a list. Then we take a look at Iterators.

Numerous other topics are covered and the code and video below will help you learn. Continue reading Linked List in Java 2

Linked List in Java

linked list in javaIn this video, I’ll cover how work with a linked list in java. I’ll show you how they work in 4 different ways.

We’ll cover how to create them, what a link is, how to add and delete links, how to search through them and a whole bunch more. The basics you need to understand at the end are that: 1) A Link is an Object 2) Each Link has a reference to another Link in the List 3) The LinkedList has only a reference to the last Link added to it. Continue reading Linked List in Java

Stacks and Queues

Stacks and QueuesWelcome to my tutorial on Java Stacks and Queues. The data structures most are used to such as Arrays, linked lists, trees, etc. are best for data that represents real objects. Stacks and Queues are instead used to complete a task and are soon after discarded.

A major difference is that stacks and queues allow only a single item to be added or removed at a time. Stacks then provide access to the last item in, while queues provide access to the first item in. The video and code below will cover everything. Continue reading Stacks and Queues

Java Sort Algorithm

java sort algorithmWelcome to my Java sort algorithm tutorial. Here I will cover all of the elementary sorting algorithms : Bubble, Selection and Insertion sort.

I also created a new method we can use to analyze the arrays so we can learn how the sorts work. I want this video to be very interactive so that you really understand the sort algorithms.

I also cover the linear and binary search algorithms. The code below will help you learn these algorithms perfectly. Continue reading Java Sort Algorithm