Skip to main content

GTx: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues

5.0 stars
5 ratings

Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.

Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
5 weeks
9–10 hours per week
Progress at your own speed
Optional upgrade available

Choose your session:

28,913 already enrolled! After a course session ends, it will be archivedOpens in a new tab.
Starts Dec 1
Starts Jan 17, 2024
Starts Jan 15, 2025

About this course

Skip About this course

The Data Structures & Algorithms course begins with a review of some important Java techniques and nuances in programming. The course requires some prior knowledge of Java and object-oriented programming, but not in data structures or algorithms. This course introduces you to time complexity, and threads this concept throughout all data structures and algorithms presented in the course. You will work with the principles of data storage in Arrays and LinkedList nodes. You will program the low-level data structures: Singly, Circular and Doubly LinkedLists; and explore edge cases and efficiencies. LinkedLists and Arrays are used to implement Abstract Data Types, ADTs: Stacks, Queues and Deques. Harnessing the power of recursion to move through these data structures is necessary. As the size changes in your data structures, it becomes important to examine amortized analysis of the operations.

The course design has several components and is built around modules. A module consists of a series of short (3-5 minute) instructional videos. In between the videos, there are textual frames with additional content information for clarification, as well as video errata dropdown boxes. All modules include an Exploratory Lab that incorporates a Visualization Tool specifically designed for this course. The lab includes discovery questions that lead you towards delving deeper into the efficiency of the data structures and examining the edge cases. This is followed by a set of comprehension questions on topics covered in the module that count for 10% of your grade. The modules end with Java coding assignments which are 60% of your grade. Lastly, you'll complete a course exam, which counts for the remaining 30% of your grade.

This is a great course that has been derived from the on-campus version of CS1332 at the Georgia Institute of Technology, and is backed with an impressive reputation.

At a glance

  • Institution: GTx
  • Subject: Computer Science
  • Level: Intermediate
  • Prerequisites:

    Prerequisites for the course are basic knowledge of the Java programming language and object oriented principles.

  • Language: English
  • Video Transcript: English
  • Associated programs:
  • Associated skills: Data Storage Technologies, Time Complexity, Object-Oriented Programming (OOP), Algorithms, Operations, Abstract Data Types, Data Structures, Java (Programming Language), Nodes (Networking)

What you'll learn

Skip What you'll learn
  • Develop mature Java programming skills with the use of generics, references and interfaces
  • Understand the principles of data storage in Node objects
  • Program various low-level data structures like Singly, Doubly and Circular LinkedLists
  • Design and implement ADTs like Lists (backed by Arrays), Stacks and Queues
  • Examine the edge cases that occur in these linear data structures
  • Analyze the time complexity of linear data structures and their algorithms
  • Compute amortized analysis for Arrays, ArrayLists, Stacks and Queues
  • Implement recursive methods that operate on linear data structures
  • Extend knowledge of these concepts to other structures like PriorityQueues and Deques

Module 0: Introduction and Review

  • Review of important Java principles involved in object-oriented design
  • The Iterator & Iterable design patterns, and the Comparable & Comparator interfaces
  • Basic “Big-Oh” notation and asymptotic analysis

Module 1: Arrays, ArrayLists and Recursion

  • The array class, access vs. search of an array, static allocation and efficiency
  • The List abstract data type (ADT) which is backed by an array and uses dynamic resizing and amortized analysis
  • Recursive methods that are applied to the array and ArrayList data structures

Module 2: LinkedLists

  • The Singly LinkedList data structure, its implementation, methods and time complexity
  • The use of the iterable interface and recursive methods in LinkedLists
  • Creating variations of LinkedLists such as Doubly-Linked and Circularly-Linked

Module 3: Stacks, Queues, and Deques

  • The Stack ADT based on the last-in, first-out principle, and its implementations using Arrays and LinkedLists
  • The Queue ADT based on the first-in, first-out principle, and its implementations using Arrays and LinkedLists
  • Creating variations of Stacks and Queues such as Priority Queues and Deques

Who can take this course?

Unfortunately, learners residing in one or more of the following countries or regions will not be able to register for this course: Iran, Cuba and the Crimea region of Ukraine. While edX has sought licenses from the U.S. Office of Foreign Assets Control (OFAC) to offer our courses to learners in these countries and regions, the licenses we have received are not broad enough to allow us to offer this course in all locations. edX truly regrets that U.S. sanctions prevent us from offering all of our courses to everyone, no matter where they live.

This course is part of Data Structures and Algorithms Professional Certificate Program

Learn more 
Expert instruction
4 skill-building courses
Progress at your own speed
5 months
9 - 10 hours per week

Interested in this course for your business or team?

Train your employees in the most in-demand topics, with edX For Business.