Algorithmic Problems in Java [2018]

Algorithmic Problems in Java [2018]

.MP4, AVC, 300 kbps, 1280x720 | English, AAC, 192 kbps, 2 Ch | 6h 55m | 948 MB

Instructor: Holczer Balazs
Backtracking, dynamic programming, Sudoku, knapsack problem, binpacking, closest pair of points, recursion, monte carlo

This course is about the fundamental concepts of algorithmic problems, focusing on backtracking and dynamic programming. As far as I am concerned these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or research & development.

The first chapter is about backtracking: we will talk about problems such as N-queens problem or hamiltonian cycles, coloring problem and Sudoku problem. In the second chapter we will talk about dynamic programming, theory then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.


[Fast Download] Algorithmic Problems in Java [2018]

Ebooks related to "Algorithmic Problems in Java [2018]" :
The answers of the assignments of Java quizmaster for beginners: The work book
Distributed Virtual Worlds: Foundations and Implementation Techniques Using VRML, Java, and CORBA
Eloquent Javascript: A Modern Introduction to Programming, 3rd Edition
Spring: Developing Java Applications for the Enterprise
OCA / OCP Java SE 8 Programmer Practice Tests
Pro JSP 2, Fourth Edition
Learning Spring 5.0
Java 7 Pocket Guide
Learn JavaFX 8: Building User Experience and Interfaces with Java 8
Java kompakt: Eine Einfuhrung in die Software-Entwicklung mit Java
Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.