Road to CS – Second set of Exam!

-
Hi everybody! Since we’re in march (29 of February, i lied!), and i’ve finally ended my exam season, i’m back with the second set of exams of my road to CS!

This fall (or spring? i hadn’t still got it) the courses are

    Algorithm (which i’ve already started, and wow. Now it’s the hardest course i’ve taken in my entire life. I’ve got courses at university (biotechnology) which are fairly MORE EASY), done by Princeton (in java. I don’t really like that language),and it’s a two part course
    Linear Algebra (with a particular focus on the programming site of that), done by Brown University
    Databases, course done by Stanford
    Calculus One, as before, through Massimo Gobbino, of University of Pisa (started in September, but don’t have even reached 1/3 of the course! is literally IMMENSE, but i really love how massimo teaches Calculus and i absolutely want to end the course)

So, this is it. 5 exams. 5 difficult exams.

Algorithm is one of the hardest course i’ve taken (as said before), mostly not because is hard, but because it’s hard to programm in java (i really hate it. Really. Yes. Because i’m a n00b) and because it’s hard to set up a java environment on my chromebook (i code on my acer c300, a very good choice for the price, but it obviously has some cons). Because of that, i’m sadly thinking on dropping the course to take the introduction to algorithm done by Udacity, in python, which i like more (si dai, è sempre quella la storia eh).

See you soon for the next exam review!! 🙂 🙂

Comments

Post a Comment

Popular posts from this blog

Exam Review – Design and Analysis of Algorithms (Stanford – part 1)

-
Oh oh oh, merry Christmas to everyone! Luckily for me, i’m not Santa, but i want to give you a gift anyway! (obviously, it’s just another review). Today, the topic is design and analysis of algorithms, and i’m reviewing this MOOC built by Stanford The Course First of all, let me say that this course is terrific good and challenging. I spent, somehow, more than 100 hours on this course, counting the weekly programming assignments. The course is 7 weeks long (with the final exam), but it feels endless, for real. The topics covered are a mixture between a design and analysis standard course (which is usually strongly related to mathematic analysis of algorithms, but i can be wrong) and an usual data structure and algorithms course. The topics covered starts from basic sorting operations to hash tables and functions in the sixth week. I found it really useful for a further understanding of ds & a and for a recap too. summarizing, i really liked it The lectures Tim Roughgarden (the lect...
Read more

I'M BACK BITCHEEEESS

-
Hi everyone. Long time no see So, guess what, i'm back, and i've got some really spicy updates. First of all, my disease got better. I'm still sick, but now it's manageable Second, i'm still (obviously) studying comp sci, but, due to my gradutation (yep, i'm now an undergratue in biotechnology) i'm a little bit less consistent (i promise i'll be back on track) What to do right now Well, right now, what i wanna keep on going with my bachelor. Many exams are waiting for me (i'm currently studying stanford design and analysis of algorithms, which is a tough course), like differential equations, statistics, software construction and many others. Right now, i think what i wanna study more is differential equations, due to some strong connections to some biological things and models, so it's really interesting to me. Another thing that's really nice is functional programming, mostly for learning really well programming fundamentals Due...
Read more

Exam Review – MIT’s 6.00.2x (Comp. thinking and data science)

-
Merry christman and happy new year to everyone reading this post!!! (i was a bit late, i know, sorry about that). And today is Saturday. A really meh day. The most mehest day of the week (inb4 sunday). I don’t really want to study (dunno really why, truly) molecular biology, so here i am to review another mooc! Today i’m reviewing the MITX 6.00.2x, also known as Introduction to Computational Thinking and Data Science . The course (as the previous one) has been made by MIT (love you all again guys, keep rocking). As the previous, the course was (imo) HARD, but let’s go to the points. Course Format Let’s start saying that the course was divided in 2 parts: one focused on statistic (with monte carlo simulations, plotting, stocastical thinking, ecc…), and the other part was an introduction in data structure (course that i will take in march), with hash tables, trees, graphs and other structures. The course (as the previous) was divided in week (8), and every week has a specific asignment (...
Read more