Jump to content

Qubit

Members
  • Posts

    572
  • Joined

  • Last visited

  • Feedback

    100%

Posts posted by Qubit

  1. Sup, I am just wondering if someone could recommend the best framework for me to start with to build a web application I have an idea about. I've been programming in Java for about 6 years now  (Current Masters student in CS), and know cpp, python, and etc..   But I never touched web dev stuff really besides maybe a little js and HTML. Thus I am looking for recommendations for frameworks/stacks that I could easily grasp and start taking off with?

  2. Maybe overkill but look up some classes on Foundations of Computer science or Computer theory, specifically topics in regular expressions and finite state automata. If you're like me and like the theory behind CS concepts, that's the specific area that deals with regex. Then move on to language-specific syntax and implementations. 

  3. Just finessed an internship at Raytheon for software engineering this summer. From my talk with them, it seems that I will be exclusively be using C/C++. I'm finishing my Junior year in University and I have mainly been using Java and haven't really touched C/C++ in over a year. Was wondering you guys would have some projects that you would recommend that touches on a lot of concepts in C++/C so that I can re-familiarize myself with it before the summer begins. 

  4. 5 minutes ago, dreameo said:

    Delete entries that have changed and re enter them in the priority queue for it to remain ordered. 

    Problem is, the remove function in a PQ is linear and every time a min get removed, multiple objects get updated in the PQ. Thus many iterations of the whole PQ is needed

  5. So I have a problem where I have a set of objects with two fields. I need to be able to get the min object of the set at a fast time (using a custom comparator). The problem is, when I get the min object set, it changes the fields of some objects in my original set. Thus, the ordering of the set needs to be changed when I am done with the min object. 

    To me it seems obvious to use a priority queue with a custom comparator, the problem is, the Priority Queue in Java doesn't have a change or decrease key operation. I have tried looking for other implementations online for a priority queue that uses a comparator with the decrease key operation but I cannot find one. Any help would be greatly appreciated at to how to approach this problem? 

  6. 55 minutes ago, Jammer said:

    I don’t get it. Whats the difference between: RS2Object tree = objects.closest("Tree"); 

    and

    List list = new List(); which obviosuly doesn’t work

    To me it seems like it’s the same thing.

     

    In the first statement, you a calling a method that returns a rs2object. In the second statement, you are calling the constructor of the interface, which does not exist because it is an interface. 

    • Like 1
  7. 7 minutes ago, THS said:

    O you do a thesis just for an undergrad degree? What are the requirements?

    Curious, just finished my masters (completely different place of the world)

    I don't know how to explain it, you either do a project pertaining to your depth of knowledge in your major or you go to a project site and solve a problem or project they have.

     

    https://www.wpi.edu/academics/undergraduate/major-qualifying-project

×
×
  • Create New...