[Request] Solutions to exercises in the book: "Computational Geometry: Algorithms and Applications" (author: de Berg) Computer Science |
- [Request] Solutions to exercises in the book: "Computational Geometry: Algorithms and Applications" (author: de Berg)
- Examples of prominent programmers and/or new practices in the 2010s
- [D] Resources required for working numericals of Operating System
- time complexity of Sieve_of_Eratosthenes
- Are there any algorithms for finding the closest two black pixels, given any pixel in an image?
- Best resource to comprehensively understand computers (Windows CLI, Linux, why/how, etc)
Posted: 29 Jul 2019 02:58 AM PDT Hello, I've started this book, but as usual, there are no solutions provided, and there's no separate solutions manual available either. https://www.goodreads.com/book/show/316275.Computational_Geometry I was wondering if we could work together on producing these solutions? Maybe a separate subreddit could be setup for solutions to exercises in books, where we can post specific problems and verify each other's solutions for correctness. Let me know what do you think [link] [comments] |
Examples of prominent programmers and/or new practices in the 2010s Posted: 28 Jul 2019 08:35 AM PDT Many of the core principles for software development that are used today were conceived in the 90s and early 2000s, like:
Therefore, when reading software development theory, it's very common to see the news of those like Kent Beck, Martin Falwer, etc, etc... So the concrete question is: Are there any new software principles, paradigms, practices or very prominent programmers (who have invented any of the words mentioned before) that from the decade of the 2010s? Or is most of the software built today still based on those core principles from the 90s/2000s? [link] [comments] |
[D] Resources required for working numericals of Operating System Posted: 29 Jul 2019 03:32 AM PDT What are the resources available, which contains more no of numericals on Operating System especially on Memory Management, Deadlock and Semaphore. [link] [comments] |
time complexity of Sieve_of_Eratosthenes Posted: 29 Jul 2019 01:58 AM PDT For https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Algorithmic_complexity, why time complexity = O(n*log(log n)) ? [link] [comments] |
Are there any algorithms for finding the closest two black pixels, given any pixel in an image? Posted: 28 Jul 2019 11:59 PM PDT |
Best resource to comprehensively understand computers (Windows CLI, Linux, why/how, etc) Posted: 28 Jul 2019 11:01 AM PDT I'm adept at using computers and fixing issues when they arise but I fumble around with the command line when I have to use it, I recently got a Synology NAS and the differences between it and Windows (like shared folders) confuse me greatly, etc. I have limited programming knowledge. I want to have a theoretical and practical understanding of computers from the bottom up. This should include anything that I would need to know to really understand it, like the history and evolution of things to understand why things are the way they are, CPU architecture, networking, etc. But I do want it to be efficient so I'm not wasting my time. Are there specific text books I should read or a particular YouTube series? Thanks. [link] [comments] |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment