ADHD & Programming Computer Science |
- ADHD & Programming
- Is it always better to build your own sorting algorithms?
- NN in Metric TSP
- Splay tree animation
- Genetic Algorithms
- What are some interesting computer science research areas today that could have a tangible impact on the world?
- School project questions
- Notes On Kafka
- Recursion
- Built a Resource and Event Management System for my club at college. Automates bulk mailing, form generation, certificate generation and a lot of other functionalities. Check out the repo below.
- What are some hard things to do that will make/made you grow up as a programmer - but that are reasonably viable for one person?
- Is there a way to make an AND operation with three RE?
| Posted: 25 Apr 2021 03:51 PM PDT |
| Is it always better to build your own sorting algorithms? Posted: 25 Apr 2021 08:46 AM PDT In school, our professors always pushed sorting algorithms in the curriculum, but some languages, such as Python, have their own built-in sorting function. Are there any advantages to building your own sorting algorithms? Or is it more of a teaching tool. [link] [comments]  |
| Posted: 26 Apr 2021 03:40 AM PDT (Posted this before on r/AskComputerScience a while back, but got no response there, figured I might try it here.) Consider applying the cubic-algorithm of performing nearest neighbor n times to Metric TSP - taking the minimum of n runs where in each run a different vertex is taken as starting point. Are there theoretical bounds on how bad the solution can be? I vaguely remember a result that showed that NN can have an arbitrarily large optimality gap, but I'm unsure whether this applied to Metric TSP or regular TSP, and I'm almost sure that this applied to a single NN run - so not taking the minimum over multiple runs. I'm also interested in how bad it actually is in practice, in comparison to other heuristics, but haven't found much - TSP and NN are horribly general terms. I did find a paper by Junger et al that reports a 5-35% optimality gap range for different TSP benchmark instances, but I think they just use single runs of NN, and I can't seem to find which of the considered benchmark instances are Metric and which are not.. :| Anyone with some pointers? [link] [comments]  |
| Posted: 25 Apr 2021 05:58 AM PDT |
| Posted: 25 Apr 2021 05:06 PM PDT How can genetic algorithm help in the optimal sizing of hybrid wind/solar power system In a layman's term, what is local and global optima? [link] [comments]  |
| Posted: 24 Apr 2021 02:39 PM PDT Hi all, I would like to get involved in computer science research soon, and would like some advice/perspective in choosing an area to specialize in. I have two criteria for a prospective research area:
At the moment, my passion lies in distributed systems, and while it fits the first criteria, it seems like a lot of the problems being solved today are around beating the CAP theorem or coming up with a new consensus algorithm, or a new fancy database, something similar. While these are definitely interesting and challenging, I'm finding it harder to convince myself that solving these problems will provide any great benefit to people outside computer science that care about these things, beyond what we already have today. I also have this challenge with the field of Programming Language Theory. Now, it could be that I'm just lacking perspective and missing why these fields can be beneficial, so I'd definitely appreciate some perspective here. But also, what other computer science fields have active research going into solutions that could help tackle things like diseases, poverty, inequality, etc.? I'm aware that ML/AI is one, but I'm curious about what other fields I should be looking into. Thanks! [link] [comments]  |
| Posted: 25 Apr 2021 04:26 PM PDT Hi, I'm a high school student from Quebec, Canada. As an activity for our PPO, or personal orientation project in English (I think), our teacher gave us the task to find a job which seemed interesting to us and do a little presentation about it. After a bit of back and forth between, VLSI engineer and compiler engineer, I choose the latter one. Since this is a pretty specific field, I had a hard time finding someone to answer the questions needed for my presentation. Here are the questions, 1)In your average day, what kind of tasks are you doing? 2)What education is needed to find work as a compiler engineer? 3)In your opinion, what qualities are most important for a compiler engineer to possess? 4)Who do you work with? 5)How would you describe the work/life balance? 6)Is it a competitive field? 7)What are the benefits of working as a compiler engineer? 8)Is there any downsides to the job? Finally, this is optional as I understand that sharing personal info might make you uncomfortable, but you can also include where you worked, and if you want, your name. [link] [comments]  |
| Posted: 24 Apr 2021 12:01 PM PDT |
| Posted: 25 Apr 2021 01:48 AM PDT Hi, What is the difference between difference styles of recursion? Are there well established names for different kinds of recursion? Where can I read about it? Below I provide a few styles to use recursion. Probably there are more which I don't know about. Examples: 1. You have a Linked list and a method with a single parameter: a node. Method prints the value and then if the next node exists calls itself with the next node. 2. Like 1 but method called 2 times: You have a binary search tree and method to traverse. Method accepts a node. Inside it prints value and calls itself for the left child if that exists, and then right child if that exists. 3. Extension of 2 but with a control structure that allows the method to be called only once: inside a method a node value is printed, then its left and right child are put into an array and then in a loop a node from an array is taken and a method is called for that node. At maximum loop will iterate 2 times, if both left and right child is present. 4. Like 3, but you pass the array with nodes as a parameter: initially array contains only a root node. On a method call you take remove a node from the array, print its value and add its left and right child back into the array and call the method with the array as parameter. Depending on how you remove and add nodes from and to the array (in begin or and) you can implement either Breadth First or Depth First traversal. This method is essentially an iterative approach but with recursion added to it. I am not even sure if this approach qualifies as a recursion because even though the recursion is there its completely unneeded (in my opinion). [link] [comments]  |
| Posted: 24 Apr 2021 09:20 AM PDT |
| Posted: 24 Apr 2021 10:47 AM PDT Like making a game engine from scratch is very difficult and will make you a thousand time better programmer than you were before starting, but someone could question that is a wise choice for only one person. What are some hard things to build that will make you/made you grow as a programmer, acknowledging scope/scale since you're only on your own? [link] [comments]  |
| Is there a way to make an AND operation with three RE? Posted: 24 Apr 2021 10:30 AM PDT Hi, I'm trying to find a RE for the language that has an odd number of a's and even number of b's and d's given the alphabet {a,b,c,d}. But the concatenation of these three languages doesn't seem to work, I'm using JFLAP for the test runs. Is there an operation that requires these three machines to be in the accepting state to accept a given string? Here are the three RE that I've found: [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