• Breaking News

    Thursday, October 18, 2018

    Home Unlabelled đź’ˇAlgorithms tutorial series for beginners Computer Science

    đź’ˇAlgorithms tutorial series for beginners Computer Science

    October 18, 2018

    ��Algorithms tutorial series for beginners Computer Science

    ��Algorithms tutorial series for beginners

    Posted: 17 Oct 2018 08:47 AM PDT

    Help need for college mini project.

    Posted: 17 Oct 2018 09:37 PM PDT

    We were kind of handed down this project and hence I have no idea how to begin this stuff.

    Basically the problem statement is to extract data from the results published by the university and create an analysis out of it. But the university publishes the result in pdf format.

    Can someone tell me how to script download the pdf results of the all the colleges under the university and also how code extract the data from a pdf into a database.

    Any help is appreciated;

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

    Runtime aspect weaving through metaprogramming - Baker & Hsieh (2002)

    Posted: 17 Oct 2018 09:12 AM PDT

    Designing effective reduction function for rainbow table generation

    Posted: 17 Oct 2018 01:36 PM PDT

    Okay so I know that my password space is one that follows this: pattern = re.compile('[A-Z, a-z]{6,8}[0-9]{1,2}$')

    and I know that for an effective reduction function it should map any hash back to a password within my domain and it should be as uniform as possible. I also know that as I expand each chain in the rainbow table I need to use a different reduction function each time. Rather than write 256 reduction functions I figured I would iterate my reduction function somehow, but it is apparent the best way to do this that would prevent collisions and chain merges.

    My current reduction function in non-iterative form:

    #decToCharDictionary takes a number 0-52 and returns a char assigned to it from a-Z def reduce(hashVal, decToCharDictionary): newPass = "" baseCharLength = 6 baseNumLength = 1 #this portion allows passwords of 6-8 letters with 1-2 numbers to be uniform to all possible passwords letterLength = (int(hashVal[1:2], 16) % 3) + 6 numberLength = (int(hashVal[4:5], 16) % 2) + 1 baseOffset = 7 for x in range(letterLength): startIndex = baseOffset + (x * 3) letterVal = int(hashVal[startIndex: (startIndex + 2)], 16) % 52 letter = decToCharDictionary.get(letterVal) newPass = newPass + "" + letter baseOffset = 2 for x in range(numberLength): startIndex = baseOffset + (x * 3) digit = int(hashVal[startIndex: (startIndex + 2)], 16) % 10 newPass = newPass + "" + str(digit) return newPass

    How would I be able to iterate this reduction function to fit my needs without killing performance, is it even possible to iterate this and avoid collisions for 256 links in a chain?

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

    I'm in my final year and at a mental block for final year projects

    Posted: 17 Oct 2018 12:36 PM PDT

    I've had some ideas floating around however I don't think any of them are worth doing. I'm at a mental block trying to come up with something. The supervising lecturer basically lives in his terminal so he'll take on anything thats based around terminal/shell (any systems programming really). We pitched creating a simple OS to him however that'll take too long. I'm really stuck trying to find a project that will hit a timeframe sweet spot.

    Any suggestions related to this area are super appreciated.

    Can't wait to hear what you's have to say!!

    submitted by /u/rdog_
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment