codepie

You can add the optimization course on coursera https://www.coursera.org/course/optimization to your list. I have been waiting for it to start and it seems that it is finally going to start this month (https://class.coursera.org/optimization-003/forum/thread?thr...).

For a beginner in CTF, https://picoctf.com/ is also a good resource.

Stanford's course http://web.stanford.edu/class/cs97si/ and another one: https://algo.is/t-414-aflv-competitive-programming-course-20...

Problems : https://icpc.baylor.edu/worldfinals/problems/icpc2016.pdf . Problems can be tried online at https://icpc.kattis.com/problems

ICPC WF 2016 problems : https://icpc.baylor.edu/worldfinals/problems/icpc2016.pdf Full rank list : https://icpc.baylor.edu/scoreboard/

I posted[1] asking specifically about this, a couple of days ago. But didn't get any response. [1] https://news.ycombinator.com/item?id=11152976

Thanks for sharing this! I had been looking for something like this for a long time.

Take a look at this course : https://lagunita.stanford.edu/courses/Engineering/Networking... . The recommended book is Computer Networking: A Top-Down Approach by Kurose and Ross.

I was looking for something similar in C. Most of the resources I found (eg : os dev-wiki) do not cover the implementation details in such depth. Can anyone give few pointers?

Same error with the link to MIT Mathematics for Computer Science.

Deciding memory layout is a sub-task of designing cache-oblivious algorithms. Cache-oblivious algorithms optimize the number of memory transfers. I found this very interesting http://erikdemaine.org/papers/BRICS2002/paper.pdf

I think this might provide you a relevant answer : http://stackoverflow.com/questions/9645193/calculating-fibon...

There are many ways to get to Binet's Formula from the recurrence relation. But it gives wrong result for large values of N. I have also written on the same topic http://www.dipkakwani.appspot.com/5651124426113024