Just finished python crash course and I feel stupid.... Computer Science |
- Just finished python crash course and I feel stupid....
- Incompleteness Ex Machina [pdf]: "Godel's work, rightly viewed, needs to be split into two parts: the transport of computation into the arena of arithmetic on the one hand and the actual incompleteness theorems on the other."
- Where can I begin learning about discrete structures using c++?
- NVIDIA “Super SloMo” Makes Video Smooth
- How to skill up in non-http networking protocols?
- Type theory: question about algebraic effects
- Tusk - Evernote on steroids
- What are the best resources to learn Android Development?
- 2018 In Review: 10 Open-Sourced AI Datasets
| Just finished python crash course and I feel stupid.... Posted: 31 Dec 2018 08:30 PM PST I finished crash course and saw a challenge online that asked you to generate the permutations of a given string and after 2 hours I gave up..... I could do it for 'abc', but didn't know how to do it for a string of any length. Did any of you struggle with these kinds of problems at the beginning? Is there any way I can improve at these because I just don't want to have to google for solutions all the time.... Edit: Thanks for the help everyone. I think I was expecting to make too much progress too fast. I kind of get recursion now. To get permutation of a word of length N just get the permutation of N-1 and loop the final letter into each position of all of the permutations of N-1. Of course looping the function will get the permutation all the way back to length of 1, solving the problem. I need to learn to think like a programmer and hopefully will make progress. Thanks for the support. [link] [comments]  |
| Posted: 31 Dec 2018 05:31 AM PST |
| Where can I begin learning about discrete structures using c++? Posted: 31 Dec 2018 09:10 PM PST Any good references to which algorithms and topics I should know? [link] [comments]  |
| NVIDIA “Super SloMo” Makes Video Smooth Posted: 31 Dec 2018 12:48 PM PST |
| How to skill up in non-http networking protocols? Posted: 31 Dec 2018 05:02 PM PST |
| Type theory: question about algebraic effects Posted: 31 Dec 2018 11:51 AM PST When it comes to effect systems, I always see the effects a computation performs (or, alternatively, the abilities it requires) attached to the result of the computation in the type signature. Examples of this include the language Frank from the paper Do Be Do Be Do (Lindley, McBride, and McLaughlin, 2017), in which type signatures look like this … … as well as the language Koka, in which the function declared by has type What is the reasoning behind this syntax? It seems as sensible to me, if not more so, to associate the list of effects with the entire computation and not just the result type. [link] [comments]  |
| Posted: 31 Dec 2018 01:03 PM PST |
| What are the best resources to learn Android Development? Posted: 31 Dec 2018 07:59 AM PST Both free and paid resources would be appreciated. [link] [comments]  |
| 2018 In Review: 10 Open-Sourced AI Datasets Posted: 31 Dec 2018 08:33 AM PST |
| 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