Enjoying the preview?
This is the free first lesson. Get full access — request a demo or sign in.
Enjoying the preview?
This is the free first lesson. Get full access — request a demo or sign in.
This Data Structures course introduces types, data structures, and abstract data types. It explains the relationship between data structures and algorithms and shows how the software development life cycle is used to analyze problems and create design candidates.
Viewers will dive deep into the Abstract Data Type (ADT) by discussing the List interface that is implemented by both the ArrayList and LinkedList classes. Big-O notation is introduced to provide a basis for the comparison of these two data structures and their counterparts in the Java JDK library.
Viewers will also explore several implementations of popular data structures. Stacks and queues are discussed, designed, implemented, compared, and contrasted. The use of sets and maps are discussed and demonstrated with both custom code as well as implementations provided by the standard Java Development Kit library.
It introduces types, data structures, and abstract data types, explains the relationship between data structures and algorithms, and covers arrays, linked lists, stacks, queues, sets and maps, hash-based data structures, tree data structures, binary search trees, and graphs. It also introduces Big-O notation and shows how the software development life cycle is used to analyze problems and create design candidates.
You will build skills in abstract data types, data abstraction, data structures, data-structured language, Java Foundation Classes, and programming concepts.
Yes. It explores the List interface implemented by the ArrayList and LinkedList classes, compares data structures with their counterparts in the Java JDK library, and demonstrates sets and maps using both custom code and implementations provided by the standard Java Development Kit library.
Lessons cover understanding data structures, abstract data types, programming applications, arrays and their properties and syntax, Big-O notation, linked lists, stacks, queues, sets and maps, implementing stacks and queues, hash function algorithms, hash-based data structures, HashMap, tree data structures, binary search trees, graphs, and traversal.