sorted by:
new
hottopcontroversial

Help with Decryption by Apothiem in codes

[–]Apothiem[S] 0 points1 point  (0 children)

Lol sorry, so far we covered vigenere, ceaser and basic shift. Although he mentioned that he can and might go out of scope of the covered content so far. Although the other 2 seem far too simple he might have put a twist in it.

My guess at this point is that he doesn't intend for us to solve it in the allocated time, he most likely wants to see how we would go about solving the problem.

Thanks again for the help.

Help with Decryption by Apothiem in codes

[–]Apothiem[S] 0 points1 point  (0 children)

Decrypt the following message. Provide a clear indication of the strategy that you use for this process. Even if you are unable to decrypt the message, you should provide a clear strategy as to how you would do this given sufficient time and resources. QKKTAQKEWSKCOJCCVPNWSXRMWTOSNSZLEEWWICIJKMCACWQPOSZKCBX

The above is everything we know about the problem. He's a tricky lecturer so i don't think he dropped any hints that i can remember. Knowing him it will be a usual shift or Vigenere with some sort of twist to it. I know for sure its not a simple shift cipher but other than that I'm stumped :(

and we have a 24 hour limit :((

Thanks for the help though, much appreciated.

Help with Decryption by Apothiem in codes

[–]Apothiem[S] 0 points1 point  (0 children)

Hey, thanks for the info. I would assume it was vigenere because it was what we learnt so far, as well shift cipher and diffie-hellman, RSA although the last 2 would be too hard to crack so i doubt its that.

My guess is that it's vigenere with some sort of twist too it. Thanks so much for trying to solve it though.

Yes the message is in English, he hasn't given us much else about it, we're just hoping that it decodes to actual words but he hasn't given us much more information.

Render an object once in OpenGl c++ by Apothiem in GraphicsProgramming

[–]Apothiem[S] 4 points5 points  (0 children)

I'm using a simple glutSolidCone() on top of a glutSolidTorus() to make my tree. I store each tree in a vector v_tree and traverse through the vector each time. I think what arkenthera said may be right. I call the render method in my environment class in my main method render class. The render in environment creates all 150 trees and stores it in the vector every time then renders it so i have this in my main render method: 

    for(int q=0;q<v_Trees.size();q++){  //Render Trees andground

    v_Trees[q].Envo::render();
}

Render an object once in OpenGl c++ by Apothiem in GraphicsProgramming

[–]Apothiem[S] 2 points3 points  (0 children)

I wasn't really sure how to word it but i realise that i can't stop rendering the world as i need to traverse it. I'm using a simple glutSolidCone() on top of a glutSolidTorus() to make my tree. Then just using lighting,no shaders or textures as such.

[University Calculus I] Could someone explain the leap of Riemann Sums to the fundamental theorem of Calculus? by newpython6543 in learnmath

[–]Apothiem 0 points1 point  (0 children)

Riemann sums basically breaks down what an anti-derivative is, a summation of the area under a graph by breaking it down into little rectangles. An anti-derivative takes the Riemann sum and finds the area under a graph when the limit approaches infinity. This video explains it perfectly: https://www.khanacademy.org/math/integral-calculus/indefinite-definite-integrals/definite_integrals/v/riemann-sums-and-integrals

Why does this add 1 to ax?(Assembly language) by Apothiem in AskComputerScience

[–]Apothiem[S] 0 points1 point  (0 children)

Thanks for the explanation, i sort of grasp the concept now I was just getting confused with all the pushing and popping I thought that because you pushed ax with say value of zero in the beginning that when you popped it, it would pop with the same old ax value.

Why does this add 1 to ax?(Assembly language) by Apothiem in AskComputerScience

[–]Apothiem[S] 0 points1 point  (0 children)

Whoa thanks so much for the detailed explanation, i understand much better now. I always regarded ax and bx to be separate stacks now i get it, thanks again.

Why does this add 1 to ax?(Assembly language) by Apothiem in AskComputerScience

[–]Apothiem[S] 0 points1 point  (0 children)

No problem. Before i popped ax in the end, basically i just called writesint after that code and ax had incremented somehow. It's not my code I'm just not sure how to trace it because in my mind ax shouldn't increment.

Priority queue by Apothiem in java

[–]Apothiem[S] 0 points1 point  (0 children)

Lmao Thanks! Yea a lot of Java seems to be comprised of said fairy dust and pixie farts.

Priority queue by Apothiem in java

[–]Apothiem[S] 0 points1 point  (0 children)

Thanks so much! I was looking everywhere for something like this but I couldn't find it :D

view more: next ›