• Breaking News

    Wednesday, January 20, 2021

    What is your favorite computer science podcast? Computer Science

    What is your favorite computer science podcast? Computer Science


    What is your favorite computer science podcast?

    Posted: 19 Jan 2021 05:23 PM PST

    I just got done with an interview where he asked how I stay in touch with the industry. So I thought I would ask y'all how do you keep up with the changing technologies and tech accomplishments?

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

    Someone please explain. How will an electron microscope gain access to encrypted data?

    Posted: 19 Jan 2021 10:56 PM PST

    Counting elephants from space

    Posted: 19 Jan 2021 10:06 AM PST

    Satellite images are a promising new tool for surveying endangered wildlife, thanks to the help of computer algorithms devised at the University of Bath https://www.bath.ac.uk/announcements/counting-elephants-from-space/

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

    How to set Visual Studio 2019 to auto-complete {} but not (), “”, and []?

    Posted: 20 Jan 2021 12:20 AM PST

    How can I set Visual Studio 2019 to auto-complete {} but not (), "", and []?

    This is a screenshot of a setting that will disable all brace completion, but isn't what I want:

    https://preview.redd.it/w359ydfm5gc61.png?width=640&format=png&auto=webp&s=75921924ace747b7ee1753748c105575e74c51bb

    This can be done in Dev-C.

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

    How to analyze the time complexity of a recursive algorithm that doesn't have just a single base case?

    Posted: 19 Jan 2021 01:19 PM PST

    For example, I can follow how to do this one more or less okay.

    But for another example like this where the base case isn't just n==0 but instead n<10, I'm more confused.

    Also sorry if it's weird that the first example is pseudo code but the second one is Java

    What I've done so far (not sure if any of it is right):

    Base case: T(n) = n + 3, when n<10 Recursive case: T(n) = T(n-1) + 2, when n >= 10

    T(n) = T(n - k) + 2k

    Honestly don't really know what I'm doing or where to go from here, or how right or wrong I am so far

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

    Computer science

    Posted: 19 Jan 2021 03:59 PM PST

    What is the difference Between 'Computer science' under computer studies and 'mathematics and Computer science' under applied sciences

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

    Need clarification on asymptotic analysis

    Posted: 19 Jan 2021 09:36 AM PST

    I know in general you're supposed to ignore constants and only focus on the dominant power (for example if you have 4n2 + 3n, it would just be O(n2)).

    But for example here's an example from my book:

    suppose T_1(N) = O(f(N)) and T_2(N) = O(f(N)). Is the following true? T_1(N) + T_2(N) = O(f(N)).

    So I picked some arbitrary functions: T_1(N) = 4N+2 and T_2(N) = 5N+3 and f(N) = 6N.

    Now my question is: are these correct functions as far as the first part goes (the "suppose" bit)? If I graph them, it's obvious that this is true, as 6N grows faster than the others. But is this "correct"? Because if I'm supposed to ignore constants, then isn't that the same as saying all three functions are just N?

    If I add them, then I get 4N+2 + 5N+3 = 9N + 5, which is no longer upper bounded by 6N. But again, if I'm supposed to ignore constants, then I'm actually comparing N to N, not comparing 9N+5 to 6N.

    So am I supposed to ignore constants or not???

    Can someone help me understand this????

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

    Bachelor thesis topic?

    Posted: 19 Jan 2021 07:04 AM PST

    I think I have a rough idea what I want to do research on, something about Java and C# being compiled on a virtual machine. Obviously the advantages of this are already well known (portability) so Im not sure what exactly to do research on, maybe looking into the cons of this might be worth looking into. It does seem like there are already a lot of papers on the JVM so maybe specifically focusing on common language runtime would be a good idea.

    Any suggestions?

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

    Getting an education in computer sci

    Posted: 19 Jan 2021 12:55 PM PST

    Hi guys :)

    I'm not sure if this is the right place to ask but I'm currently a student and I really want to learn computer science and take a class on it possibly, however I am absolutely TERRIBLE at math like to the point where simple algebra gives me a headache!

    Any of you have a career or education in computer science and is also not amazing at math? Or was and now is?

    Maybe this isn't the right career for me lol

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

    No comments:

    Post a Comment