A Decades-Old Computer Science Puzzle Was Solved in Two Pages Computer Science |
- A Decades-Old Computer Science Puzzle Was Solved in Two Pages
- Graph Proof With Single Cycle
- Specialized books that can help me grow?
- Trying to find the appropriate graduate program.
| A Decades-Old Computer Science Puzzle Was Solved in Two Pages Posted: 05 Aug 2019 01:31 AM PDT |
| Posted: 04 Aug 2019 02:57 PM PDT Hi everyone. Let's say there is a circular graph of length k and two pointers begin at the same node. One pointer then begins moving in steps of size n and the other in steps of size m (where regular traversal would be "steps" of size 1). How would you go about proving or disproving that it is possible for there to be a combination of k,n, and m such that these two pointers never land at the same node ever again besides at the beginning? I came up with this problem while trying to solve a fun cycle detection question and found a sub-issue in one of my possible solutions (if the pointers I am comparing to detect a cycle actually just hope over each other infinitely). If any of you intelligent people could help guide me in the right direction I would greatly appreciate it :D [link] [comments]  |
| Specialized books that can help me grow? Posted: 05 Aug 2019 03:58 AM PDT Not sure if this is the right subreddit for this, apologies if its not. I'm currently a junior programmer in PHP & C#. I have a lot of colleagues that know CS-related things that I don't. I need to learn the following topics as I was self-taught and missed out on CS knowledge.
What are some books, courses, or articles that can help me here? [link] [comments]  |
| Trying to find the appropriate graduate program. Posted: 04 Aug 2019 06:42 PM PDT Greetings everyone, A little bit of background. I formally studied mathematics and statistics while minoring in computer science and philosophy. During my time studying comp-sci, I went further into the program than I need to for the minor, taking courses in introduction to AI and analysis of algorithms. Unfortunately, since it was only a minor I do not have experience with assembly, compilers, OS, and networks. I found a few topics that interest me enough to consider doing a masters program. (1) Machine Learning, data mining, deep learning, parallel programs/systems (I believe this area would be the most demanding from the topics I'm unfamiliar with). (2) Algorithm analysis and design, and complexity theory. Moreover, the majority of master programs I found are held in the engineering department, which is skewed towards a lot of classes being from (1) but lacking the knowledge listed above I don't know how feasible this is. However, (2) is more math-oriented but I would still have to do comprehensive exams from the material I lack, I believe. Does anyone knows of or has done a masters/Ph.D. in theoretical computer from a mathematics department that they could recommend? I do understand that just learning the material I'm missing would offer the chance to become a software-engineer if I went into industry. But I wanted to see if there was something more aligned with the skills I've already learned. [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