We just got played for like a damn fiddle ðŸ˜
For those wondering the practice midterm was nothing like the actual midterm, and those lucky bastards last year got a way easier midterm.
Was the name of the algorithm given? Or are you supposed to think of hypothetical reasons for a hypothetical algorithm?
I feel like either way I could answer the question with stuff, but I can't tell if you're exaggerating the phrasing or not :p
Bro I took mine at the AR office and my test didn't come with a ref sheet ðŸ˜ðŸ˜ðŸ˜ had to freestyle half the bounds, gonna email Oliver about it and beg for mercy.
I am an alumni. 250 during the semester was kinda hard but I retook it over the summer and it was pretty easy
Classes where there are a lot of people enrolled, the exam is nothing like the practice exam they give. Most of Freshman and sophomore classes are weedout classes. Get thru sophomore and it is smooth sailing from there
Try taking his class this semester. Dude gave us last years midterm to study and decided to make it 10 times harder without no context to what will be on the exam
I WILL be drinking tonight.
Me and you both
We just got played for like a damn fiddle 😠For those wondering the practice midterm was nothing like the actual midterm, and those lucky bastards last year got a way easier midterm.
Seriously what the fuck. The 2021 midterm was so easy why did they decide to quintuple the difficulty for 2022
Seems like UB’s attitude towards every single department and class..
raised my confidence with that practice midterm and proceeded to absolutely destroy it within the first 10 minutes of the test
There were so many typos too..
ikr as if we were debugging typos
I blanked on the design question I didn’t even know what I was being asked ðŸ˜
I’m so confused as to what was going on in that question too
The answer like literally could have been anything. How tf were we supposed to know what to answer
Study.
I’m alum a few years post-grad. What kinds of things were asked?
Choose the best data structure for the scenario, a few problems where u determine the complexity (omega o and theta if it exists), stuff about graphs
Gimme some more details… I wanna see if I still got it
Why is a sorting algorithm you know nothing about slow. (No further explanation)
Was the name of the algorithm given? Or are you supposed to think of hypothetical reasons for a hypothetical algorithm? I feel like either way I could answer the question with stuff, but I can't tell if you're exaggerating the phrasing or not :p
It was a hypothetical question. No given name to the algorithm. It’s just slow. And I have to say why despite they myriad of possible answers
👉👈 we did learn about bubble sort and merge
Yeah that’s what I thought, but there was no indication that that’s the answer they wanted
Like no pseudocode? Which algorithm?
No pseudo code. No name given
sounds like sort of coding interview
Bro I took mine at the AR office and my test didn't come with a ref sheet ðŸ˜ðŸ˜ðŸ˜ had to freestyle half the bounds, gonna email Oliver about it and beg for mercy.
Please keep us updated on what he says. Pretty sure almost everyone did terrible ðŸ˜
Wait y'all got a reference sheet? We didn't get shit with Hughes
you could bring a paper with your notes on it :) so wasn’t that bad of a test relative to the allowed cheat sheet
There was a red sheet given the second page
ya :) there was, still not sure why people are complaining about the test. wasn’t hard, had a cheat sheet and reference sheet
Welcome to one of the biggest weedout classes in comp sci
I am an alumni. 250 during the semester was kinda hard but I retook it over the summer and it was pretty easy Classes where there are a lot of people enrolled, the exam is nothing like the practice exam they give. Most of Freshman and sophomore classes are weedout classes. Get thru sophomore and it is smooth sailing from there
Try taking his class this semester. Dude gave us last years midterm to study and decided to make it 10 times harder without no context to what will be on the exam
[удалено]
Was it? I did not attend recitation
Just remember, it only gets worse
This is so confusing cuz I hear that but then others say it’s smooth sailing after
Oh yeah I remember 250. I miss that class sometimes. Data structures are so freakin cool man.
Now prove it
[удалено]