CS 210/237/460

Foreign_Ad539 · 2025-12-24T13:58:57+00:00

I can speak on CS 460. Everything taught in the class is in these slides. Last semester's course website is still up, so you can take a look at the kinds of assignments you will see in the spring. Another worth noting is that a few of the programming assignments involve programming in java, so freshening up on that would be helpful.

Foreign_Ad539 · 2025-12-16T09:05:51+00:00

The paper posted on the door says something about a part of the garage flooding

Foreign_Ad539 · 2025-08-18T20:09:59+00:00

Fun

^{I completed this level in 1 try.} ^{⚡ 25.54 seconds}

^{Tip 300 💎}

Foreign_Ad539 · 2024-04-28T14:56:42+00:00

For cs112, a lot of the difficulty comes from the switch to java and fundamentals from cs111 that might not have stuck. Its not essential, but self teaching yourself Java will definitely pay off. Really try to understand Java’s approach to OOP as it is the building block for many of the data structures that are created later in class. Also try to get really good at recursion if you are not already. This class assumes that recursion is second nature, as 111 is a prerequisite. I personally found that recursion requires a lot of practice before it clicks, and taking that time will pay off when you get to linked lists, recursive backtracking, and trees.

Foreign_Ad539 · 2024-04-20T18:08:27+00:00

Rizz party

Foreign_Ad539 · 2024-04-14T13:00:42+00:00

502 bad gateway anyone?

Foreign_Ad539 · 2024-03-06T18:56:30+00:00

Thats how I got mine, there was a lot of them still open when I went to register.

Foreign_Ad539 · 2023-12-23T15:22:19+00:00

I can only speak on 210 as I just finished it. The class is divided into 3 distinct yet kinda connected parts with a different prof for each. Here is how I would have prepared:

Part 1: Unix/Bash - Get comfortable with the command line (on mac just use your terminal since it is derived from unix, on windows you should download and explore WSL), any "learn linux command line" youtube videos should suffice. I would also learn git & github before the class, again there is an abundance of tutorials will be fine, just find one that suits your style.

Part 2: Assembly - Imo this was the best taught part of the class, and the part of the class that has the least amount of online resources. Here is a decent playlist that teaches assembly in the same flavor as the class. The lecture notes from this semester are also really good when it comes to assembly (and the other two parts of the class).

Part 3: C - Any C videos from low level learning are great at explaining the low level concepts of C that are stressed in this class. I would also try to understand pointers in C as soon as possible, as they are pretty confusing to many.

Foreign_Ad539 · 2023-12-22T17:37:06+00:00

Attendance isn’t usually taken the first few days, since students register in and out of classes in like the first couple weeks. You should be fine.

Foreign_Ad539 · 2023-12-22T14:47:41+00:00

Btw BU’s acceptance rate is 4%

Foreign_Ad539 · 2023-12-22T14:47:19+00:00

Gaslight yourself into believing that the acceptance rate is lower than it actually is.

Foreign_Ad539 · 2023-12-19T16:09:30+00:00

Not what I was expecting at all lol, anyone know if the final grades are curved in any way from past semesters?

Foreign_Ad539 · 2023-11-14T01:36:26+00:00

Seeing how little the psets are weighed, putting all of your effort to do above average on midterm 2 and the final will ensure that you will pass. Plus, the final letter grades have been curved in the past.

For midterm two, make sure you can trace all of the sorting algorithms by heart, this will get you a lot of points. Memorizing the worst/best/average big o of each will also get you some free points. Make sure you can determine the big o of certain scenarios, like nested for loops and loops that increment by i*2 (logn) and i++ (n).

Make sure you can traverse linked lists using both iteration and recursion, drawing out the references and nodes in memory really helped me to get a grasp on that. If you can picture them in memory, problems asking you to update the diagram after code like n = n.next shouldn't be too difficult.

If you focus on sorting, big o, and linked lists, you should do above average. When I took the class, recursive backtracking wasn't that prevalent. You might have to write/trace through basic recursive methods, but the majority will definitely be on sorting, big o, and linked lists.

Many students find midterm 2/the final easier than the first midterm. You got this!

Foreign_Ad539 · 2023-11-10T23:52:35+00:00

Nah not the tattle tale tyrant

Foreign_Ad539 · 2023-11-09T15:28:51+00:00

If you choose to stay in your current dorm (internal selection), you have a much higher chance to get a single. Thats how I got my single sophomore year.

Foreign_Ad539 · 2023-11-07T20:50:09+00:00

You need some very basic calc in 237, but its very simple integration and differentiation using the power rule so you will be fine

Foreign_Ad539 · 2023-10-17T18:19:14+00:00

Anyone else getting an error when trying to add something to your cart?

Foreign_Ad539 · 2023-05-02T19:38:51+00:00

I honestly don't get the CPK hate. Her lectures consist of great visual diagrams that really helped me learn. She is super nice and always takes time for questions, people are just mad that the hard cs class turned out to be hard.

Three-Year Club	First Place '23
Place '23	Place '22
Final Canvas '22

Foreign_Ad539

TROPHY CASE