Skip to content
Sale

Dr Heinz M. Kabutz – Data Structures in Java

Original price was: $250.00.Current price is: $48.60.

Data Structures in Java (Late 2017 Edition) is an action-packed 8 hours of tips and tricks that professional Java programmers have used for the past 20 years to produce code that is robust and fast. Every lecture is followed by a short quiz to test your learning

Description

Unlock your potential with the Unlock your potential with the Dr Heinz M. Kabutz – Data Structures in JavaDr Heinz M. Kabutz – Data Structures in Java course for only course for only Original price was: $250.00.Original price was: $250.00.Current price is: $48.60.Current price is: $48.60. at at Giolib.comGiolib.com! Explore our comprehensive library of over 60,000 downloadable digital courses across various ! Explore our comprehensive library of over 60,000 downloadable digital courses across various Business & SalesBusiness & Sales. Get expert-led, self-paced learning at up to 80% savings. Elevate your skills today!. Get expert-led, self-paced learning at up to 80% savings. Elevate your skills today!

Dr Heinz M. Kabutz - Data Structures in Java

Dr Heinz M. Kabutz – Data Structures in Java

Data Structures in Java (Late 2017 Edition) is an action-packed 8 hours of tips and tricks that professional Java programmers have used for the past 20 years to produce code that is robust and fast. Every lecture is followed by a short quiz to test your learning. Sometimes the questions are easy, others require some research on your side. Over 130 quiz questions in total will help you gauge how well you understood the various data structures.Data Structures in Java (Late 2017 Edition) is an action-packed 8 hours of tips and tricks that professional Java programmers have used for the past 20 years to produce code that is robust and fast. Every lecture is followed by a short quiz to test your learning. Sometimes the questions are easy, others require some research on your side. Over 130 quiz questions in total will help you gauge how well you understood the various data structures.

“I am crawling through the material but finding it highly entertaining (no summer in England indeed!)”“I am crawling through the material but finding it highly entertaining (no summer in England indeed!)” – Aristos Tofallis – Aristos Tofallis

“I watched a few videos from the Data Structures course and you have some of the best examples and explanations on the subject that I’ve seen.”“I watched a few videos from the Data Structures course and you have some of the best examples and explanations on the subject that I’ve seen.” – Will Lokes – Will Lokes

Your Instructor Your Instructor

Dr Heinz M. Kabutz

Dr Heinz M. KabutzDr Heinz M. Kabutz

Heinz Kabutz is the author of Heinz Kabutz is the author of The Java Specialists’ Newsletter, a publication enjoyed by tens of thousands of Java experts in over 145 countries. His book “Dynamic Proxies (in German)” was #1 Bestseller on Amazon.de in Fachbücher für Informatik for about five minutes until Amazon fixed their algorithm. Thanks to a supportive mother, he has now sold 5 copies.

Heinz’s Java Specialists’ newsletter is filled with amusing anecdotes of life on the Island of Crete. He is a popular speaker at all the best Java conferences around the world, and also at some of the worst. He teaches Java courses in classrooms around the world, where his prime objective is to make absolutely sure that none of his students fall asleep. He is not always successful.Heinz’s Java Specialists’ newsletter is filled with amusing anecdotes of life on the Island of Crete. He is a popular speaker at all the best Java conferences around the world, and also at some of the worst. He teaches Java courses in classrooms around the world, where his prime objective is to make absolutely sure that none of his students fall asleep. He is not always successful.

Course Curriculum

Data Structures in JavaData Structures in Java
Section 1 – Introduction to Collections in Java Section 1 – Introduction to Collections in Java

1. Welcome (3:08)1. Welcome (3:08)

1.1 Code Samples1.1 Code Samples

2. Computational Time Complexity (22:59)2. Computational Time Complexity (22:59)

3. Space Complexity (4:12)3. Space Complexity (4:12)

4. Arrays (15:20)4. Arrays (15:20)

Section 2 – ListsSection 2 – Lists

5. Lists (13:22)5. Lists (13:22)

6. ArrayList (14:07)6. ArrayList (14:07)

7. Iteration (7:55)7. Iteration (7:55)

8. CopyOnWriteArrayList (7:03)8. CopyOnWriteArrayList (7:03)

9. LinkedList (8:39)9. LinkedList (8:39)

10. Vector (4:10)10. Vector (4:10)

11. Stack (5:34)11. Stack (5:34)

12. Sorting lists (49:41)12. Sorting lists (49:41)

Section 3 – SetsSection 3 – Sets

13. Sets (10:06)13. Sets (10:06)

14. TreeSet (35:19)14. TreeSet (35:19)

15. ConcurrentSkipListSet (9:43)15. ConcurrentSkipListSet (9:43)

16. CopyOnWriteArraySet (18:02)16. CopyOnWriteArraySet (18:02)

Section 4 – HashingSection 4 – Hashing

17. Hashing (16:25)17. Hashing (16:25)

18. HashSet (13:43)18. HashSet (13:43)

19. ConcurrentHashMap.newKeySet() (3:28)19. ConcurrentHashMap.newKeySet() (3:28)

Section 5 – MapsSection 5 – Maps

20. Maps (2:11)20. Maps (2:11)

21. HashMap (28:34)21. HashMap (28:34)

22. ConcurrentHashMap (6:28)22. ConcurrentHashMap (6:28)

23. TreeMap (18:42)23. TreeMap (18:42)

24. ConcurrentSkipListMap (9:02)24. ConcurrentSkipListMap (9:02)

25. Hashtable (18:15)25. Hashtable (18:15)

26. LinkedHashMap and LinkedHashSet (13:16)26. LinkedHashMap and LinkedHashSet (13:16)

27. Highly Specialized Collections: EnumSet, EnumMap, IdentityHashMap, Properties, WeakHashMap (19:53)27. Highly Specialized Collections: EnumSet, EnumMap, IdentityHashMap, Properties, WeakHashMap (19:53)

Section 6 – Queues and DequesSection 6 – Queues and Deques

28. Queues and Deques (4:33)28. Queues and Deques (4:33)

29. ConcurrentLinkedQueue and ConcurrentLinkedDeque (9:15)29. ConcurrentLinkedQueue and ConcurrentLinkedDeque (9:15)

30. ArrayDeque (11:29)30. ArrayDeque (11:29)

31. BlockingQueues (1:50)31. BlockingQueues (1:50)

32. LinkedBlockingQueue and LinkedBlockingDeque (14:12)32. LinkedBlockingQueue and LinkedBlockingDeque (14:12)

33. ArrayBlockingQueue (6:26)33. ArrayBlockingQueue (6:26)

34. Highly specialized queues: DelayQueue, SynchronousQueue, LinkedTransferQueue (16:00)34. Highly specialized queues: DelayQueue, SynchronousQueue, LinkedTransferQueue (16:00)

35. PriorityQueue and PriorityBlockingQueue (18:04)35. PriorityQueue and PriorityBlockingQueue (18:04)

Section 7 – Collection FacadesSection 7 – Collection Facades

36. java.util.Collections (17:35)36. java.util.Collections (17:35)

37. java.util.Arrays (11:02)37. java.util.Arrays (11:02)

Section 8 – Thanks for WatchingSection 8 – Thanks for Watching

38. Conclusion And Where To Next? (1:24)38. Conclusion And Where To Next? (1:24)


Sales Page
Archive Page

Future-proof your knowledge with the Future-proof your knowledge with the Dr Heinz M. Kabutz – Data Structures in JavaDr Heinz M. Kabutz – Data Structures in Java course at course at GiOlibGiOlib! Enjoy lifetime access to high-quality digital content, crafted to advance your career and personal development.! Enjoy lifetime access to high-quality digital content, crafted to advance your career and personal development.

  • Lifetime Access:Lifetime Access: Permanent access to all purchased courses. Permanent access to all purchased courses.
  • Smart Savings:Smart Savings: Benefit from prices up to 80% off original course costs. Benefit from prices up to 80% off original course costs.
  • Safe Transactions:Safe Transactions: Process your payments securely. Process your payments securely.
  • Practical Insights:Practical Insights: Gain actionable skills relevant to today's demands. Gain actionable skills relevant to today's demands.
  • Instant Availability:Instant Availability: Begin your course immediately after payment. Begin your course immediately after payment.
  • Flexible Learning:Flexible Learning: Access content effortlessly on any device. Access content effortlessly on any device.

Start expanding your horizons with Start expanding your horizons with GiOlibGiOlib!!

Cart
Back To Top