Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Amazon

Data Structures and Algorithms

Amazon via Coursera

Overview

In this course, you will gain a deep understanding of various fundamental data structures and algorithms essential for building efficient and scalable software solutions. Starting with Advanced Data Structures, you'll explore arrays, ArrayLists, linked lists, stacks, queues, and maps, understanding their implementations, operations, advantages, and use cases. Moving on to Searching and Sorting Algorithms, you'll manipulate essential algorithms like linear and binary search, as well as various sorting algorithms, including bubble sort, insertion sort, selection sort, merge sort, and quick sort. You will grasp the theoretical concepts and implement these algorithms in Java, gaining hands-on experience in algorithmic problem-solving. Additionally, you will be introduced to basic testing methodologies using JUnit testing, test cases, and test-driven development, ensuring the quality and reliability of your code. By the end of this course, you will be equipped with the knowledge and skills required to design efficient algorithms, manipulate complex data structures, and write robust, high-performance Java applications After completing this course, you’ll be able to: • Identify and implement basic data structures and algorithms in Java. • Analyze the efficiency and performance of data structures and algorithms in Java applications. • Identify and apply principles of recursion in Java to solve complex problems. • Implement search and sorting algorithms in Java to optimize data processing and retrieval.

Syllabus

  • Data Structures
  • Searching and Sorting Algorithms
  • Basic Testing

Taught by

Amazon

Reviews

Start your review of Data Structures and Algorithms

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.