Library of NLP COURSES-
Library of NLP COURSES-
0 Items - $0.00
0
  • No products in the cart.

[Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I

-53%
$9 for [Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I Course

[Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I

Original price was: $19.00.Current price is: $9.00.

Product Delivery: You will receive a download link via your order email immediately
Should you have any question, do not hesitate to contact us:

Add to wishlist
SKU: 3a0af8cd98e9 Category:

Transform your communication with the Transform your communication with the [Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I[Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I course, priced at just course, priced at just Original price was: $19.00.Original price was: $19.00.Current price is: $9.00.Current price is: $9.00. on on NLPLibrary.comNLPLibrary.com! As a dedicated hub for Neuro-linguistic programming, we offer an extensive library of downloadable courses in ! As a dedicated hub for Neuro-linguistic programming, we offer an extensive library of downloadable courses in Neuro-Linguistic ProgrammingNeuro-Linguistic Programming. Achieve mastery with expert-led, self-paced learning and save over 80%. Explore the power of NLP today!. Achieve mastery with expert-led, self-paced learning and save over 80%. Explore the power of NLP today!

[Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I

PLEASE CHECK ALL CONTENTS HERE:PLEASE CHECK ALL CONTENTS HERE:

[wpcc-iframe src=”https://www.loom.com/embed/4f66ccc1a98b470da4b06767d739f731″ frameborder=”0″ allowfullscreen=”allowfullscreen” data-mce-fragment=”1″][wpcc-iframe src=”https://www.loom.com/embed/4f66ccc1a98b470da4b06767d739f731″ frameborder=”0″ allowfullscreen=”allowfullscreen” data-mce-fragment=”1″]
Salepage_https://globalsoftwaresupport.teachable.com/p/algorithms-and-data-structures-in-java-part-iSalepage_https://globalsoftwaresupport.teachable.com/p/algorithms-and-data-structures-in-java-part-i
Archive: https://archive.fo/wip/B8CSL Archive: https://archive.fo/wip/B8CSL

This course is about data structures and algorithms. We are going to implement the problems in Java, but I try to do it as generic as possible: so the core of the algorithms can be used in C++ or Python. The course takes approximately 11 hours to complete. I highly recommend typing out these data structures several times on your own in order to get a good grasp of it.This course is about data structures and algorithms. We are going to implement the problems in Java, but I try to do it as generic as possible: so the core of the algorithms can be used in C++ or Python. The course takes approximately 11 hours to complete. I highly recommend typing out these data structures several times on your own in order to get a good grasp of it.

In the first part of the course we are going to learn about basic data structures such as linked lists, stacks and queues, heaps and some advanced ones such as AVL trees, red-black trees or hash tables. We will try to optimize each data structure ( for example avoiding obsolete references ) as much as possible.In the first part of the course we are going to learn about basic data structures such as linked lists, stacks and queues, heaps and some advanced ones such as AVL trees, red-black trees or hash tables. We will try to optimize each data structure ( for example avoiding obsolete references ) as much as possible.

In each chapter I am going to talk about the theoretical background of each algorithm or data structure, then we are going to write the code on a step by step basis in Eclipse, Java.In each chapter I am going to talk about the theoretical background of each algorithm or data structure, then we are going to write the code on a step by step basis in Eclipse, Java.

Most of the advanced algorithms relies heavily on these topics so it is definitely worth understanding the basics. These principles can be used in several fields: in investment banking, artificial intelligence or electronic trading algorithms on the stock market.Most of the advanced algorithms relies heavily on these topics so it is definitely worth understanding the basics. These principles can be used in several fields: in investment banking, artificial intelligence or electronic trading algorithms on the stock market.

Course Curriculum

  

IntroductionIntroduction
  • PreviewPreview

    Introduction (1:13)Introduction (1:13)

  • PreviewPreview

    Why to use data structures (3:54)Why to use data structures (3:54)

  • PreviewPreview

    Data structures and abstract data types (3:58)Data structures and abstract data types (3:58)

ArraysArrays
  • PreviewPreview

    Arrays introduction – basics (5:55)Arrays introduction – basics (5:55)

  • PreviewPreview

    Arrays introduction – operations (5:54)Arrays introduction – operations (5:54)

  • PreviewPreview

    Using arrays (9:51)Using arrays (9:51)

  • PreviewPreview

    ArraysLists in Java (8:42)ArraysLists in Java (8:42)

Linked ListsLinked Lists
  • StartStart

    Linked lists theory – basics (7:09)Linked lists theory – basics (7:09)

  • StartStart

    Linked list theory – operations (9:32)Linked list theory – operations (9:32)

  • StartStart

    Linked list theory – doubly linked lists (1:40)Linked list theory – doubly linked lists (1:40)

  • StartStart

    Linked list theory – linked lists versus arrays (6:36)Linked list theory – linked lists versus arrays (6:36)

  • StartStart

    Linked list implementation I (4:47)Linked list implementation I (4:47)

  • StartStart

    Linked list implementation II (11:40)Linked list implementation II (11:40)

  • StartStart

    Linked list implementation III (5:59)Linked list implementation III (5:59)

  • StartStart

    Doubly linked list introduction (7:55)Doubly linked list introduction (7:55)

  • StartStart

    Linked lists in java.util (8:14)Linked lists in java.util (8:14)

  

Stacks & QueuesStacks & Queues
  • StartStart

    Stack introduction (4:01)Stack introduction (4:01)

  • StartStart

    Stacks in memory management ( stacks, heaps ) (7:23)Stacks in memory management ( stacks, heaps ) (7:23)

  • StartStart

    Stacks and recursive method calls (7:02)Stacks and recursive method calls (7:02)

  • StartStart

    Stack implementation with linked list I (7:28)Stack implementation with linked list I (7:28)

  • StartStart

    Stack implementation with linked list II (3:38)Stack implementation with linked list II (3:38)

  • StartStart

    Stack implementation with arrays (11:01)Stack implementation with arrays (11:01)

  • StartStart

    Dijkstra’s interpreter introduction (1:18)Dijkstra’s interpreter introduction (1:18)

  • StartStart

    Dijkstra’s interpreter implementation (9:12)Dijkstra’s interpreter implementation (9:12)

  • StartStart

    Java built in java.util.Stack (5:09)Java built in java.util.Stack (5:09)

  • StartStart

    Queues introduction (5:12)Queues introduction (5:12)

  • StartStart

    Queue implementation with linked list (9:43)Queue implementation with linked list (9:43)

  • StartStart

    Java built in java.util.Queue (6:31)Java built in java.util.Queue (6:31)

Binary Search TreesBinary Search Trees
  • StartStart

    Binary search trees theory – basics (10:23)Binary search trees theory – basics (10:23)

  • StartStart

    Binary search trees theory – search, insert (4:25)Binary search trees theory – search, insert (4:25)

  • StartStart

    Binary search trees theory – delete (6:08)Binary search trees theory – delete (6:08)

  • StartStart

    Binary search trees theory – in-order traversal (4:25)Binary search trees theory – in-order traversal (4:25)

  • StartStart

    Binary search trees theory – running times (2:10)Binary search trees theory – running times (2:10)

  • StartStart

    Binary search trees implementation I – Node, Tree (7:02)Binary search trees implementation I – Node, Tree (7:02)

  • StartStart

    Binary search trees implementation II – insertion (9:55)Binary search trees implementation II – insertion (9:55)

  • StartStart

    Binary search tree implementation III – maximum, minimum (7:24)Binary search tree implementation III – maximum, minimum (7:24)

  • StartStart

    Binary search tree implementation IV – traversal (5:41)Binary search tree implementation IV – traversal (5:41)

  • StartStart

    Binary search tree implementation V – remove (9:25)Binary search tree implementation V – remove (9:25)

  • StartStart

    Binary search tree implementation VI – remove II (5:54)Binary search tree implementation VI – remove II (5:54)

  • StartStart

    Custom objects in a tree (6:44)Custom objects in a tree (6:44)

Balanced Trees: AVL TreesBalanced Trees: AVL Trees
  • StartStart

    AVL trees introduction – motivation (4:13)AVL trees introduction – motivation (4:13)

  • StartStart

    AVL trees introduction – basics (5:21)AVL trees introduction – basics (5:21)

  • StartStart

    AVL trees introduction – height (8:44)AVL trees introduction – height (8:44)

  • StartStart

    AVL trees introduction – rotations cases (10:17)AVL trees introduction – rotations cases (10:17)

  • StartStart

    AVL trees introduction – illustration (10:50)AVL trees introduction – illustration (10:50)

  • StartStart

    AVL trees introduction – sorting (3:38)AVL trees introduction – sorting (3:38)

  • StartStart

    AVL implementation – Node and Tree (3:21)AVL implementation – Node and Tree (3:21)

  • StartStart

    AVL implementation – balance and height parameters (4:45)AVL implementation – balance and height parameters (4:45)

  • StartStart

    AVL implementation – implementing the rotations (7:36)AVL implementation – implementing the rotations (7:36)

  • StartStart

    AVL implementation – insertion I (6:03)AVL implementation – insertion I (6:03)

  • StartStart

    AVL implementation – insertion II (8:52)AVL implementation – insertion II (8:52)

  • StartStart

    AVL implementation – testing (3:19)AVL implementation – testing (3:19)

  • StartStart

    AVL tree remove introduction (6:35)AVL tree remove introduction (6:35)

  • StartStart

    AVL tree remove implementation I (8:31)AVL tree remove implementation I (8:31)

  • StartStart

    AVL tree generic implementation (3:55)AVL tree generic implementation (3:55)

Balanced Trees: Red-Black TreesBalanced Trees: Red-Black Trees
  • StartStart

    Red-black trees introduction – basics (10:38)Red-black trees introduction – basics (10:38)

  • StartStart

    The logic behind red-black trees (4:15)The logic behind red-black trees (4:15)

  • StartStart

    Red-black trees rotations- cases I (5:10)Red-black trees rotations- cases I (5:10)

  • StartStart

    Red-black trees rotations- cases II (4:25)Red-black trees rotations- cases II (4:25)

  • StartStart

    Red-black trees rotations- cases III (3:17)Red-black trees rotations- cases III (3:17)

  • StartStart

    Red-black trees rotations- cases IV (2:45)Red-black trees rotations- cases IV (2:45)

  • StartStart

    Red-black trees introduction – example I (4:47)Red-black trees introduction – example I (4:47)

  • StartStart

    Red-black trees introduction – example II (4:19)Red-black trees introduction – example II (4:19)

  • StartStart

    Red-black tree versus AVL tree (3:25)Red-black tree versus AVL tree (3:25)

  • StartStart

    Red-black tree implementation I – Node class (4:28)Red-black tree implementation I – Node class (4:28)

  • StartStart

    Red-black tree implementation II – traverse (2:06)Red-black tree implementation II – traverse (2:06)

  • StartStart

    Red-black tree implementation III – insert (3:40)Red-black tree implementation III – insert (3:40)

  • StartStart

    Red-black tree implementation IV – rotate left / right (5:48)Red-black tree implementation IV – rotate left / right (5:48)

  • StartStart

    Red-black tree implementation V – fixing the violations (9:52)Red-black tree implementation V – fixing the violations (9:52)

  • StartStart

    Red-black tree implementation VI – fixing the violations (5:52)Red-black tree implementation VI – fixing the violations (5:52)

  • StartStart

    Red-black tree implementation VII – testing (1:59)Red-black tree implementation VII – testing (1:59)

Splay TreesSplay Trees
  • StartStart

    Splay tree introduction I – basics (12:49)Splay tree introduction I – basics (12:49)

  • StartStart

    Splay tree introduction II – example (3:52)Splay tree introduction II – example (3:52)

  • StartStart

    Splay tree implementation I – find, rotate (9:44)Splay tree implementation I – find, rotate (9:44)

  • StartStart

    Splay tree implementation II – spalying (3:34)Splay tree implementation II – spalying (3:34)

  • StartStart

    Splay tree implementation III – testing (5:50)Splay tree implementation III – testing (5:50)

HeapsHeaps
  • StartStart

    Priority queues introduction (8:13)Priority queues introduction (8:13)

  • StartStart

    Heap introduction – basics (8:14)Heap introduction – basics (8:14)

  • StartStart

    Heap introduction – array representation (9:17)Heap introduction – array representation (9:17)

  • StartStart

    Heap introduction – remove operation (4:43)Heap introduction – remove operation (4:43)

  • StartStart

    Heap introduction – heapsort (5:13)Heap introduction – heapsort (5:13)

  • StartStart

    Heap introduction – running times (5:05)Heap introduction – running times (5:05)

  • StartStart

    Other types of heaps: binomial and Fibonacci heap (2:59)Other types of heaps: binomial and Fibonacci heap (2:59)

  • StartStart

    Heap implementation I (8:28)Heap implementation I (8:28)

  • StartStart

    Heap implementation II (6:38)Heap implementation II (6:38)

  • StartStart

    Heap implementation III (5:00)Heap implementation III (5:00)

  • StartStart

    Heaps in java.util.PriorityQueue (8:33)Heaps in java.util.PriorityQueue (8:33)

B-TreesB-Trees
  • StartStart

    B-tree introduction – basics (13:01)B-tree introduction – basics (13:01)

  • StartStart

    B-tree and external memory (4:07)B-tree and external memory (4:07)

  • StartStart

    Disk access times (5:41)Disk access times (5:41)

  • StartStart

    B-tree introduction – search (2:46)B-tree introduction – search (2:46)

  • StartStart

    B-tree introduction – insertion (7:10)B-tree introduction – insertion (7:10)

  • StartStart

    B-tree introduction – deletion (5:30)B-tree introduction – deletion (5:30)

  • StartStart

    In-order traversal (4:06)In-order traversal (4:06)

HashtablesHashtables
  • StartStart

    Associative array ADT (2:37)Associative array ADT (2:37)

  • StartStart

    Hashtables introduction – basics (9:04)Hashtables introduction – basics (9:04)

  • StartStart

    Hashtables introduction – collisions (6:59)Hashtables introduction – collisions (6:59)

  • StartStart

    Hashtables introduction – load factor & dynamic resizing (6:03)Hashtables introduction – load factor & dynamic resizing (6:03)

  • StartStart

    Chaining method summary (4:05)Chaining method summary (4:05)

  • StartStart

    Chaining implementation I – put (9:16)Chaining implementation I – put (9:16)

  • StartStart

    Chaining implementation II – get (4:27)Chaining implementation II – get (4:27)

  • StartStart

    Chaining implementation III – testingChaining implementation III – testing

  • StartStart

    Linear probing summary (3:59)Linear probing summary (3:59)

  • StartStart

    Linear probing implementation I – put (5:32)Linear probing implementation I – put (5:32)

  • StartStart

    Linear probing implementation II – get (2:57)Linear probing implementation II – get (2:57)

  • StartStart

    Linear probing implementation III – testing (4:44)Linear probing implementation III – testing (4:44)

  • StartStart

    Generic linear probing implementation I – basics (6:44)Generic linear probing implementation I – basics (6:44)

  • StartStart

    Generic linear probing implementation II – get (4:14)Generic linear probing implementation II – get (4:14)

  • StartStart

    Generic linear probing implementation III – put (5:35)Generic linear probing implementation III – put (5:35)

  • StartStart

    Generic linear probing implementation IV – remove (6:26)Generic linear probing implementation IV – remove (6:26)

  • StartStart

    Generic linear probing implementation V – resize (5:30)Generic linear probing implementation V – resize (5:30)

  • StartStart

    Generic linear probing implementation VI – testing (2:39)Generic linear probing implementation VI – testing (2:39)

  • StartStart

    Generic linear probing implementation – hashCode (2:05)Generic linear probing implementation – hashCode (2:05)

  • StartStart

    Maps in Java Collections (5:52)Maps in Java Collections (5:52)

Least Recently Used (LRU) CacheLeast Recently Used (LRU) Cache
  • StartStart

    Why to use cache? (3:25)Why to use cache? (3:25)

  • StartStart

    LRU cache introduction (8:06)LRU cache introduction (8:06)

  • StartStart

    LRU cache implementation I (4:22)LRU cache implementation I (4:22)

  • StartStart

    LRU cache implementation II (11:18)LRU cache implementation II (11:18)

Course MaterialsCourse Materials
  • StartStart

    SlidesSlides

  • StartStart

    Source codeSource code

Delivery Method

– After your purchase, you’ll see a View your orders link which goes to the Downloads page. Here, you can download all the files associated with your order.– After your purchase, you’ll see a View your orders link which goes to the Downloads page. Here, you can download all the files associated with your order.
– Downloads are available once your payment is confirmed, we’ll also send you a download notification email separate from any transaction notification emails you receive from NLPlib course. – Downloads are available once your payment is confirmed, we’ll also send you a download notification email separate from any transaction notification emails you receive from NLPlib course.
– Since it is a digital copy, our suggestion is to download and save it to your hard drive. In case the link is broken for any reason, please contact us and we will resend the new download link. – Since it is a digital copy, our suggestion is to download and save it to your hard drive. In case the link is broken for any reason, please contact us and we will resend the new download link.
– If you cannot find the download link, please don’t worry about that. We will update and notify you as soon as possible at 8:00 AM – 8:00 PM (UTC+8). – If you cannot find the download link, please don’t worry about that. We will update and notify you as soon as possible at 8:00 AM – 8:00 PM (UTC+8).

Thank You For Shopping With Us!Thank You For Shopping With Us!

Build your expertise with the Build your expertise with the [Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I[Download Now] Holczer Balazs – Algorithms and Data Structures in Java – Part I course at course at NLPLibrary.comNLPLibrary.com! Get lifetime access to a comprehensive collection of NLP resources, designed to enhance your psychological and communication skills.! Get lifetime access to a comprehensive collection of NLP resources, designed to enhance your psychological and communication skills.

  • Lifetime Access:Lifetime Access: Unrestricted, permanent access to your NLP courses. Unrestricted, permanent access to your NLP courses.
  • Cost-Effective Learning:Cost-Effective Learning: Benefit from prices up to 80% lower than market rates. Benefit from prices up to 80% lower than market rates.
  • Guaranteed Security:Guaranteed Security: Enjoy secure and reliable payment processing. Enjoy secure and reliable payment processing.
  • Actionable NLP:Actionable NLP: Acquire practical techniques for immediate application. Acquire practical techniques for immediate application.
  • Instant Download:Instant Download: Start learning immediately after purchase. Start learning immediately after purchase.
  • Anywhere Learning:Anywhere Learning: Access your NLP content on any device, at your convenience. Access your NLP content on any device, at your convenience.

Advance your NLP journey with NLPLibrary.com!Advance your NLP journey with NLPLibrary.com!

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Related products

-71%
Orchestrating Your Inner Voices By John Overdurf
Add to wishlist

Orchestrating Your Inner Voices By John Overdurf

Original price was: $245.00.Current price is: $72.00.
Add to cart
Identity and Evolutionary Change By Robert Dilts
Add to wishlist

Identity and Evolutionary Change By Robert Dilts

$39.00
Add to cart
Advanced Trapping Vol 4 By Rick Young JKD
Add to wishlist

Advanced Trapping Vol 4 By Rick Young JKD

$39.00
Add to cart
Amnesia Negation By Richard Bandler
Add to wishlist

Amnesia Negation By Richard Bandler

$39.00
Add to cart
-70%
NLP Sports Practitioner course video By Jeremy Lazarus, The Lazarus Consultancy Ltd
Add to wishlist

NLP Sports Practitioner course video By Jeremy Lazarus, The Lazarus Consultancy Ltd

Original price was: $161.00.Current price is: $48.00.
Add to cart
-68%
TCU Recording... Beyond Goals 2.0 By John Overdurf
Add to wishlist

TCU Recording… Beyond Goals 2.0 By John Overdurf

Original price was: $225.00.Current price is: $71.00.
Add to cart

Enter your keyword