• Breaking News

    Sunday, February 2, 2020

    UC Berkeley told to cough up $5m in compensation to comp-sci, engineering students recruited to teach classes Computer Science

    UC Berkeley told to cough up $5m in compensation to comp-sci, engineering students recruited to teach classes Computer Science


    UC Berkeley told to cough up $5m in compensation to comp-sci, engineering students recruited to teach classes

    Posted: 01 Feb 2020 06:26 PM PST

    Compiler and Language Research Topics

    Posted: 02 Feb 2020 02:51 AM PST

    I am trying to set up research into the field of compilers and language design, however the amount of possible things to look into in this field is quite large to say the least. In a sense I'm falling victim to my own curiosity because it is all fun to look into, but I need to narrow it down to a more concrete problem or topic. I have spoken to others about it to get some directions, but I would love to get more views on the subject.

    Currently, I have two ideas that might be worth looking into:

    • Visual Programming (applied research)
      I have looked around a bit after Apple made this way of programming more popular with their Shortcuts app. Their way of doing it is different from the more, let's say traditional visual languages which use some kind of flow diagram, I like the Shortcuts app, but I wonder if their is an even better way of doing it. Some form of visual programming that is very easy to understand and works on multiple platforms so it could be of use to many people. A possible use case for it would be for people to automate recurring tasks in their own work.
       
    • Formalizing Optimization (theoretical research)
      This is something that an acquaintance of mine though of, and came out of his experience with implementing optimizations in compilers. Honestly, I need to check this better because there might be work done on this already, but I wanted to put it in here to get more opinions on it. There are formal ways of describing rules for a language's syntax, grammer, etc. When the compiler's front end is done reading in the program and parsing it according to the aforementioned rules, it generates an Abstract Syntax Tree (AST). It seems though there is not yet a tool which can take in a similar formal syntax for optimizing an AST. The main idea here is to formalize optimizations and transformations of the AST so there can be a simple and concise way of specifying these.

    I would very much like to hear your opinions, pointers and criticism as to the merit and novelty of these ideas. I would also love to hear about your own interest in this field.

    submitted by /u/OrdanOccluded
    [link] [comments]

    Is Agile considered to be a methodology or framework?

    Posted: 01 Feb 2020 09:28 AM PST

    I've always heard Agile referred to as a methodology, but in the Software Engineering class I am taking, it refers to it as a framework. So which is it? Would Agile be a framework and then things like Scrum or XP be considered Agile methodologies?

    submitted by /u/ChronoPsyche
    [link] [comments]

    Computer Science Map

    Posted: 02 Feb 2020 12:38 AM PST

    ELI5: Dotnet Core, Dotnet Framework, Dotnet Standard

    Posted: 02 Feb 2020 01:14 AM PST

    I know core, framework and standard are all apart of the dotnet 'framework' in a sense of premade functions for the Microsoft Windows platform

    Can someone given an ELI5 explanation of the differences between the three?

    From reading different documentation on the three, I still don't have a clear idea of the difference between the three/what different problems the three seem to be solving

    They all seem to be doing the same thing

    submitted by /u/Truetree9999
    [link] [comments]

    Set Cover and Aliens

    Posted: 01 Feb 2020 09:15 AM PST

    Making Backpropagation, Autograd, MNIST Classifier from scratch in Python

    Posted: 01 Feb 2020 01:20 PM PST

    Quick question on complexity theory

    Posted: 01 Feb 2020 01:05 PM PST

    Hi all,

    Just want someone to check my logic,

    Say we have 2 binary values of size L,

    The binary complexity of mulitplying them is O(2L), since worst case both are all 1's of size L giving result of 2L

    That makes sense to me, but how come the complexity of addition is O(log k + L) instead of O(L+1), where k is a general step in the addition.

    Thanks

    submitted by /u/WilsonsPrimes
    [link] [comments]

    My friend is doing a survey on CI/CD usage for a class project

    Posted: 01 Feb 2020 02:17 PM PST

    Would you all be willing to help? You can take his SurveyMonkey survey at here

    submitted by /u/ianfabs
    [link] [comments]

    What was your capstone project idea? Or if you could go back and do it again, what will your idea be now?

    Posted: 01 Feb 2020 11:18 AM PST

    Tryna get some inspiration here

    submitted by /u/pieceoffrie
    [link] [comments]

    No comments:

    Post a Comment