Implementing Efficient Data Structures and Algorithms in Java - Keynote
Offered By: Java via YouTube
Course Description
Overview
Explore a thought-provoking 42-minute keynote address delivered by renowned computer scientist Guy Steele at a Java conference. Delve into advanced programming concepts, including the implementation of EmptySet and AdjoinSet, the advantages of proper tail calls in JVM, and the importance of parallelism through streams and spliterators. Learn about a simple use case, understand how tail calls can enhance modularity, and discover an analogy involving airplane tickets. Gain insights into guaranteeing good behavior in programming, examine an implementation in pure Java, and confirm the benefits of a robust framework. This comprehensive talk covers crucial aspects of Java development, offering valuable knowledge for both experienced programmers and those looking to deepen their understanding of advanced Java concepts.
Syllabus
Intro
Implementation of EmptySet
Implementation of AdjoinSet (1 of 3)
Implementation of Union Set
A Simple Use Case 1 of 2
Tail Calls Can Enhance Modularity
An Analogy: Airplane Tickets
Advantages of Proper Tail Calls in JVM
Please, Please: Proper Tail Calls in JDK9
Parallelism: Streams and Spliterators
Guaranteeing Good Behavior
An Implementation in Pure Java
Confirmation of a Good Framework
of 4)
Conclusions
Taught by
Java
Related Courses
Algorithms, Part IPrinceton University via Coursera Introduction à la programmation orientée objet (en Java)
École Polytechnique Fédérale de Lausanne via Coursera MongoDB for Java Developers
MongoDB University Initiation à la programmation (en Java)
École Polytechnique Fédérale de Lausanne via Coursera Intro to Java Programming
San Jose State University via Udacity