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

Massive Open Online Course
  • Overview
  • Course Content
  • Requirements & Materials
Overview

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

Course Description

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. You’ll be introduced to time complexity and threads this concept throughout all data structures and algorithms presented in the course, and you will work with the principles of data storage in Arrays and LinkedList nodes. In addition, you will program the low-level data structures – Singly, Circular, and Doubly LinkedLists – and explore edge cases and efficiency.

Course Content

REVIEW OF IMPORTANT JAVA PRINCIPLES INVOLVED IN OBJECT-ORIENTED DESIGN

ARRAYS, ARRAYLISTS, AND RECURSION

LINKEDLISTS – SINGLY, DOUBLY AND CIRCULAR

STACKS, QUEUES, AND DEQUES

Requirements & Materials
Requirements

 

    Prerequisites

    Recommended

    • Basic knowledge of the Java programming language, and object-oriented principles.
    Materials

    Required

    • Internet connection (DSL, LAN, or cable connection desirable)

    Session Details

    Who Should Attend

    This course is designed for anyone who wants to learn how to differentiate between linear data structures like linkedlists, arrays, arraylists, stacks, and queues, and select the correct structure for a given situation.

    Adult professional learning on a laptop

    What You Will Learn

    • Mature Java programming skills using generics, references, and interfaces
    • The principles of data storage in Node objects
    • Low-level data structures like Singly, Circular, and Doubly LinkedLists
    • How to design and implement Abstract Data Types (ADTs) like ArrayLists, Stacks, Queues, and Deques
    • “Big-Oh” notation and asymptotic analysis
    Female professional in computer science lab looking at tablet

    How You Will Benefit

    • Experience in examining edge cases that occur within these linear data structures.
    • Implement linear data structures and their operations efficiently.
    • Analyze time complexity and compute amortized analysis for Arrays, ArrayLists, LinkedLists, Stacks, and Queues.
    • Use recursive techniques to move and traverse linear data structures.
    • Extend these concepts to other structures like PriorityQueues and Deques.
    • Taught by Experts in the Field icon
      Taught by Experts in the Field
    • Grow Your Professional Network icon
      Grow Your Professional Network
    Global Learning Icon - White section icon

    Want to see all Massive Open Online Courses?

    The course schedule was well-structured with a mix of lectures, class discussions, and hands-on exercises led by knowledgeable and engaging instructors.

    - Abe Kani
    President

    TRAIN AT YOUR LOCATION

    We enable employers to provide specialized, on-location training on their own timetables. Our world-renowned experts can create unique content that meets your employees' specific needs. We also have the ability to deliver courses via web conferencing or on-demand online videos. For 15 or more students, it is more cost-effective for us to come to you.

    • Save Money
    • Flexible Schedule
    • Group Training
    • Customize Content
    • On-Site Training
    • Earn a Certificate
    Learn More

    Want to learn more about this course?