Tim Driven Development | Test until the fear goes away
Ashutosh Sharma
SCJP 1.2, SCEA 5, Brainbench certified J2EE Developer, Documentum Certified Professional
Blog : http://scea5-passingpart2and3.blogspot.com/
Sharma Ashutosh wrote:What's extra in this book compared to other Data structures and Algorithms books?
Does it talk about stable algorithm?
Does it talk about modern day algorithm being used at Big tech? Like the algorithm that was discussed during Facebook whistleblower testimony in Washington D.C.?
Thanks in advance.
Campbell Ritchie wrote:What's a soft heap? Is it one where inactive objects are automatically deleted?
Sharma Ashutosh wrote:What's extra in this book compared to other Data structures and Algorithms books?
Sharma Ashutosh wrote:Does it talk about stable algorithm?
Sharma Ashutosh wrote:Does it talk about modern day algorithm being used at Big tech? Like the algorithm that was discussed during Facebook whistleblower testimony in Washington D.C.?
Sharma Ashutosh wrote:Thanks in advance.
Cosimo Damiano Prete wrote:
Also, I had a look at the index of the book and many "use cases" are more related to AI than to data structures to my knowledge.
How does the book tackle them? Is the focus kept on the A&DS or does it shift a lot on those topics (e.g.: genetic algorithms) as well?
Thanks and hear you soon,
- Cosimo
Marcello La Rocca wrote:
Cosimo Damiano Prete wrote:
Also, I had a look at the index of the book and many "use cases" are more related to AI than to data structures to my knowledge.
How does the book tackle them? Is the focus kept on the A&DS or does it shift a lot on those topics (e.g.: genetic algorithms) as well?
Thanks and hear you soon,
- Cosimo
Hi Cosimo, thanks for your question!
Well, many data structures are used in AI, but I'd argue that doesn't make them fall exclusively in that field.
If anything I'd argue that is AI (here meant like ML) that is used a lot to solve some of the same problems for which these DSs are used.
You mention, for example, genetic algorithms: those are used a lot in optimization problems, but not necessarily in AI or ML. They have been used a lot to find approximate solutions to NP-complete and NP-hard problems, or for instance they were the first really successful technique to tackle protein folding. Which is now best solved using deep-learning (AlphaFold)
To answer your last question, I'd say the focus of the book is mostly on the A&DSs, but even more on the problems that they can help solving.
There are, however, a couple of chapters that are heavily focused on AI/ML: chapters 12 and 13, mostly about unsupervised learning and clustering.
Cosimo Damiano Prete wrote:
Hi Marcello.
All that sounds really interesting.
Do you cover basic A&DS as well (e.g., in an introduction or so)?
Cheers,
- Cosimo
Once you have read about the algorithm, implement it. Try changing it, even introducing errors, and see what happens.Kristian Jacobs wrote:. . . really understand and learn algorythm deeply? . . .
Marcello La Rocca wrote:
Thanks Cosimo!
Yes indeed, we do cover some of the basics:
- Appendix C (and partly appendix D) is an introduction to basic DSs, from arrays versus lists, to hashing. It's not as in-depth as the rest of the book, but it's enough to get started.
- Appendix E is an intro to recursion
- Appendix F gives a brief summary of randomized algorithms and metrics (in particular for classification)
Cheers!
Marcello
I would have thought that was something basic which any book would cover; of course you need both time complexity and space (=memory use) complexity.Cosimo Damiano Prete wrote:. . . explain for every algorithm its complexity . . .
Cosimo Damiano Prete wrote:
Marcello La Rocca wrote:
Thanks Cosimo!
Yes indeed, we do cover some of the basics:
- Appendix C (and partly appendix D) is an introduction to basic DSs, from arrays versus lists, to hashing. It's not as in-depth as the rest of the book, but it's enough to get started.
- Appendix E is an intro to recursion
- Appendix F gives a brief summary of randomized algorithms and metrics (in particular for classification)
Cheers!
Marcello
Do you present and explain for every algorithm its complexity (in terms of big O) and the same for the operations provided by a particular data structure?
Kristian Jacobs wrote:Hello Marcello,
Kristian Jacobs wrote:
Good luck with your new book!
Krisz
Kristian Jacobs wrote:
Is the book helps to understand algorythms better in depth vs. Breadth?
I belive yes, but how?
Kristian Jacobs wrote:
What is a good approach to really understand and learn algorythm deeply?
Thank you; that is useful information to have.Marcello La Rocca wrote:. . . comparative analysis of these values across different data structures . . .
I'm thinking about a new battle cry. Maybe "Not in the face! Not in the face!" Any thoughts tiny ad?
New web page for Paul's Rocket Mass Heaters movies
https://coderanch.com/t/785239/web-page-Paul-Rocket-Mass
|