Readings from Java Data Structures, 1st Edition

Joao Azevedo, James Cutajar

Copyright 2020
{{checkPublicationMessage('Published', '2020-04-15T00:00:00+0000')}}

Starting At £53.00 See pricing and ISBN options

Instructor Next Steps

Students: Buy now

Readings from Java Data Structures 1st Edition by Joao Azevedo/James Cutajar

Quick Navigation

Overview
Meet the Authors
Table of Contents
Pricing

Overview

MindTap for Azevedo/Cutajar's Java Data Structures, 1st Edition is the digital learning solution that powers students from memorization to mastery. This course teaches students how to write systematic code in Java and improve application efficiency with hands-on practice, step-by-step instruction, and provides immediate feedback and troubleshooting support on their code. Students will develop skills that are in-demand by employers by completing authentic, real-world coding projects that can be added to their GitHub portfolios.

Meet the Authors

{{collapseContainerClosed['meet-the-author'] ? 'Show More' : 'Show Less'}}

Joao Azevedo

Joao Azevedo is a Software Engineer currently working at ShiftForward, where he is involved in the development of large-scale systems for the online advertising industry. His interests in computer science usually revolve around artificial intelligence, machine learning, data mining, algorithms, data structures, and programming language theory. He is fond of reading computer science textbooks and science-fiction novels. He makes an effort to keep as much of the code he writes open-source.

James Cutajar

James Cutajar is a software developer with an interest in scalable, high-performance computing, and distributed algorithms. He is also an author, open source contributor, blogger, and a tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or ?ying light aircraft. He was born in Malta, lived in London for almost a decade, and is now working in Portugal.

{{collapseContainerClosed['table-of-contents'] ? 'Show More' : 'Show Less'}}

Module 1:
Algorithms and Complexities:
Developing Our First Algorithm.
Measuring Algorithmic Complexity with Big O Notation.
Identifying Algorithms with Different Complexities.

Module 2:
Sorting Algorithms and Fundamental Data Structures:
Introducing Bubble Sorting.
Understanding Quick Sort.
Using Merge Sort.
Getting Started with Fundamental Data Structure.

Module 3:
Hash Tables and Binary Search Tree:
Introducing Hash Tables.
Getting Started with Binary Search Trees.

Module 4:
Algorithm Design Paradigms:
Introducing Greedy Algorithms.
Getting Started with Divide and Conquer Algorithms.
Understanding Dynamic Programming.

Module 5:
String Matching Algorithms:
Naive Search Algorithms.
Getting Started with the Boyer-Moore String.
Searching Algorithms.
Introducing Other String Matching Algorithms.

Module 6:
Graphs, Prime Numbers, and Complexity Classes:
Representing Graphs.
Traversing A Graph.
Calculating Shortest Paths.
Prime Numbers in Algorithms.
Other Concepts in Graphs.
Understanding Complexity Classes of Problems.