Course: Data Structures & Algorithms in Java

$209.00
$252.89 incl. vat

duration: 12 hours |

Language: English (US) |

access duration: 90 days |

Incompany available

Details

In this course, you will learn about different tools and features for data structures and algorithms in Java. You start this course with an introductory part, where you explore the importance of data structures and algorithms in writing efficient and correct code. Then, you move on to working with singly, doubly and circular linked lists. In addition, you’ will learn to examine the behavior and characteristics of the stack data structure. Finally, you learn how to implement a queue using arrays and linked lists, and you will also examine a related data structure, the deque, basically the queue with additional operations.

Result

After completing this course, you will be ready to set up and work with different data sets, structures and algorithms in Java.

Prerequisites

No formal prerequisites.

Target audience

Software Developer, Web Developer

Content

Data Structures & Algorithms in Java

12 hours

Data Structures & Algorithms in Java: Introduction

Refine your programming skills by exploring the most commonly-used data structures and algorithms in Java. In this course, you'll learn about the importance of data structures and algorithms in writing efficient and correct code. You'll explore the differences between abstract data types and data structures. You'll then learn how you can use complexity to measure the performance of your code based on running time, space, network usage, and other resources. Next, you'll examine the big-O notation to measure complexity. Finally, you'll learn how to analyze different methods to determine their running time, expressed using the big-O notation.

Data Structures & Algorithms in Java: Working with Singly Linked Lists

In Java, a linked list is a sequence of nodes, each node is linked to the previous and next node in the sequence. In this course, you'll learn how to implement the singly linked list and write code to perform a range of operations on the linked list. First, you'll gain a conceptual understanding of how a node in a singly linked list allows you to connect to all other nodes using the Next reference. Then you'll move on to examine how to perform common operations on this linked list, such as inserting a new node, searching for a node, counting nodes, and deleting nodes. For each of these operations, you'll learn to assess the time complexity of the code that you’ve written.

Data Structures & Algorithms in Java: Doubly & Circular Linked Lists

Discover how to implement the linked list in Java, including the doubly linked list and the circular linked list, and learn how to perform operations on these linked lists. In this course, you’ll explore variations on the singly linked list that you covered earlier. You’ll see how the doubly linked list holds an additional reference to the previous node in the linked list along with a reference to the next node. This means additional space is required to store each node, but it also makes certain operations faster, such as traversing backwards over the elements in the linked list. You'll also learn about the circular linked list, where the tail of the linked list points back to the head of the linked list.

Data Structures & Algorithms in Java: Working with Stacks

The stack in Java allows us to access data in a last in, first out manner and in the best case scenario, both of these operations are performed in constant time. In this course, you'll get started by examining the behavior and characteristics of the stack data structure. The stack is often referred to as LIFO - or last in, first out - since the last element that you push on to a stack is the first element that you access. You'll learn how you can implement the stack data structure using arrays and linked lists and how to assess the trade-offs between these two implementations. Lastly, you'll see how to write code to perform common operations on a stack such as push(), pop(), and peek() and how to assess the running time for each of these operations.

Data Structures & Algorithms in Java: Working with Queues

In this course, you’ll explore a popular data structure, the queue. Queues offer first in, first out access. All additions to the queue are done at one end, which is the rear of the queue, and removals from the queue are done from the front of the queue. You'll learn how to implement a queue using arrays and linked lists and you’ll also examine a related data structure, the deque - basically the queue with additional operations. Next, you'll learn about implementations of the stack and queue, which are part of the standard Java library. Finally, you'll see how you can work with the priority queue, which allows you to access elements in the order of priority.

Course options

We offer several optional training products to enhance your learning experience. If you are planning to use our training course in preperation for an official exam then whe highly recommend using these optional training products to ensure an optimal learning experience. Sometimes there is only a practice exam or/and practice lab available.

Optional practice exam (trial exam)

To supplement this training course you may add a special practice exam. This practice exam comprises a number of trial exams which are very similar to the real exam, both in terms of form and content. This is the ultimate way to test whether you are ready for the exam. 

Optional practice lab

To supplement this training course you may add a special practice lab. You perform the tasks on real hardware and/or software applicable to your Lab. The labs are fully hosted in our cloud. The only thing you need to use our practice labs is a web browser. In the LiveLab environment you will find exercises which you can start immediatelyThe lab enviromentconsist of complete networks containing for example, clients, servers,etc. This is the ultimate way to gain extensive hands-on experience. 

WHY_ICTTRAININGEN

Via ons opleidingsconcept bespaar je tot 80% op trainingen

Start met leren wanneer je wilt. Je bepaalt zelf het gewenste tempo

Spar met medecursisten en profileer je als autoriteit in je vakgebied.

Ontvang na succesvolle afronding van je cursus het officiële certificaat van deelname van Icttrainingen.nl

Krijg inzicht in uitgebreide voortgangsinformatie van jezelf of je medewerkers

Kennis opdoen met interactieve e-learning en uitgebreide praktijkopdrachten door gecertificeerde docenten

Orderproces

Once we have processed your order and payment, we will give you access to your courses. If you still have any questions about our ordering process, please refer to the button below.

read more about the order process

What is included?

Certificate of participation Yes
Monitor Progress Yes
Award Winning E-learning Yes
Mobile ready Yes
Sharing knowledge Unlimited access to our IT professionals community
Study advice Our consultants are here for you to advice about your study career and options
Study materials Certified teachers with in depth knowledge about the subject.
Service World's best service

Platform

Na bestelling van je training krijg je toegang tot ons innovatieve leerplatform. Hier vind je al je gekochte (of gevolgde) trainingen, kan je eventueel cursisten aanmaken en krijg je toegang tot uitgebreide voortgangsinformatie.

Life Long Learning

Follow multiple courses? Read more about our Life Long Learning concept

read more

Contact us

Need training advise? Contact us!


contact