CompSci Weekend SuperThread (February 23, 2018) Computer Science |
- CompSci Weekend SuperThread (February 23, 2018)
- University vs Technical University
- What do the control flow graphs look like for different for loop executions?
- What Diff algorithms are commonly used?
- Complexity of testing if two sets of m points in R^n differ only by rotation? (and its connection with graph isomorphism problem)
- Reviewability of a pull request
- Any Jaron Lanier fans out there? Would love to chat!
CompSci Weekend SuperThread (February 23, 2018) Posted: 22 Feb 2018 05:06 PM PST /r/compsci strives to be the best online community for computer scientists. We moderate posts to keep things on topic. This Weekend SuperThread provides a discussion area for posts that might be off-topic normally. Anything Goes: post your questions, ideas, requests for help, musings, or whatever comes to mind as comments in this thread. Pointers
Caveats
[link] [comments] |
University vs Technical University Posted: 22 Feb 2018 12:55 PM PST I am looking at going to school with the ultimate goal of becoming a software engineer. I have been coding for fun for years now and want to make it my career path, but my funds for college are limited. I am considering one of two options: Going to a Community college and the transferring to a State University (University of Rhode Island), or going to a Technical University (New England Institute of Technology). I have toured both and both seem to have solid bachelor's programs, however I don't know the difference between the two types of school, other than the fact that a Technical University focuses on STEM and their program is a 3.5 year accelerated program. The state school's bachelor's program is a BS in Computer Science, and does not specifically focus on software engineering until the Masters level. The Technical University has an actual Software Engineering bachelor's, which seems to cut out a lot of the courses I don't find relevant to the field in which my interests lie (chemistry labs, poetry, etc). Are there any downside to doing one path over the other? The Technical University costs a little more, but the difference isn't too bad. The Technical University also accepts 100% of applicants which honestly gave me pause, but my grades before now were pretty awful for a variety of reasons that will not be a factor anymore in college. Which path makes more sense typically? I can specify the actual schools if it helps. TL;DR: CS Degree at a State University VS IT/SE Degree at a Technical University. Costs/benefits? EDIT: The state school is University of Rhode Island and the Tech school is New England Institute of Technology. [link] [comments] |
What do the control flow graphs look like for different for loop executions? Posted: 23 Feb 2018 03:25 AM PST In a course I am currently taking, testing and maintenance, we are covering control flow graphs. I understand how to represent a program as a control flow graph. I also understand that the cyclomatic complexity of a graph represents the different linear paths through a given graph. Even with understanding these I am having some difficulty with representing for loops. My current understanding is that if a for loop will execute a variable number of times then the ending node for the loop will point back to the first node, and the first node of the loop will branch to some second node. This has a complexity of two because there are two possible paths. With that being said, how would you represent a for loop that is going to execute a pre-determined number of times? For example, a for loop that will always execute five times regardless of change in variables will only have one possible path and therefore should have a cyclomatic complexity of 1. Would you not draw the aforementioned for loop as feeding from the last node of the loop back to the first therefore allowing for a complexity of 1 instead of 2? I have attempted to read the textbook provided and look for the answer online, but this specific case is stumping me. In my head there is a sort of contradiction in trying to draw the graph to match the execution of the program, but also wanting to represent the correct number of paths. [link] [comments] |
What Diff algorithms are commonly used? Posted: 22 Feb 2018 05:25 AM PST Apart from Myers' O(ND) algorithm, what algorithms are there? Are there special ones for natural language or other specific use cases? [link] [comments] |
Posted: 22 Feb 2018 06:54 AM PST |
Reviewability of a pull request Posted: 22 Feb 2018 12:07 PM PST Hi all, we are investigating what factors contribute to the reviewability of a pull request. In general, we see that size of the patch and the inclusion of tests affect the perception of the reviewability of a PR. We would like to design a new tool that automatically investigates the reviewability of a PR, but for that we need to understand what factors are perceived to be most important. So if you could, please fill out this simple (anonymous) survey: http://www.surveygizmo.com/s3/4184036/Reviewability-factors [link] [comments] |
Any Jaron Lanier fans out there? Would love to chat! Posted: 22 Feb 2018 12:51 PM 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