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

(4 customer reviews)

$19.56

Category:

Description

The Data Structures & Algorithms course begins with a review of some critical 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, examining amortized analysis of the operations becomes essential.

The course design has several components and is built around modules. 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 incorporating a Visualization Tool designed for this course. The lab consists of discovery questions that lead you to delve deeper into the data structures’ efficiency and examine the edge cases. This is followed by 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.