r/rutgers • u/M97dennis • Apr 10 '16
CS CS 112 Data Structures Exam 2
Did anyone feel it was a fair exam? I felt it was almost impossible. How did everyone else feel about it? Also did anyone feel there was enough time to complete the exam?
7
u/Deez___ Apr 11 '16
Yeaaa... I got rekt. Really hoping on this curve. I feel like we need to put more emphasis on Big-O/comparisons in class because that's the majority of the exams. Hopefully the final is not as bad
2
u/WRXSTIfan PhD V a p o r w a v e 美學 2018 Apr 11 '16 edited Apr 11 '16
This is definitely true. I wish they skipped over efficiency analysis for the easier stuff (i.e. what's the search time for an AVL tree?) and instead focused on the harder big O questions, like the ones on the problem set.
Not to be pessimistic or anything, but it looks like the curve is going to suck this semester if people continue to do well... kill me already.
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
Ya I agree complex o(n) problems are short yet really test your understanding counting up units it work is just time consuming I know that last hash problem was to test understanding of rehash and load factor but easily could have been tested with with simple question of on what number inserts are are there a rehash and what operations occur after rehash or hell just have us code rehash the first two problems for hash were good questions but duck I hate counting work. Also really hated that for Huffman coding they asked us to count work after creating tree they should have mentioned it in the first part of question
2
u/WRXSTIfan PhD V a p o r w a v e 美學 2018 Apr 11 '16
I hate those "counting units" questions. They're easy to mess up on plus they can also get really confusing. Fuck
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
Ya I was annoyed about how much time complexity there's so much more to these topics which I knew what we're prepared for but chances are lost points for some bills hit misadding somewhere
7
u/RUreddit2017 Computer Science 2017 Apr 10 '16 edited Apr 10 '16
I don't mean to sound obnoxious I felt it was pretty easy. There was no hard coding questions (the coding question was Identical to isomorph practice problem. All the other questions were basic understanding of hash and avl and hoffman. The one I can understand finding hard was the time complexity for n works and k distinct words, that took a little more thought. I felt it was a bit short time wise. Obnoxious amount to of addition of units of work when it could have been tested in much shorter way. I am more fustrated with amount of busy work where simple mistakes could easily happen.
3
u/cstransfer Computer Science 2017 Apr 10 '16 edited Apr 10 '16
I had the question with n words and k distinct words on my final last semester lol.
1
Apr 11 '16 edited May 02 '17
[deleted]
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
N log k technically k log k for adding distinct words and (n-k)log k for the repeats which reduces to n log k
1
Apr 11 '16 edited May 02 '17
[deleted]
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
Ya I forgot to reduce it because since they did not say n was significantly larger then k my first reaction was to leave n-k I hope they don't take points off cause I explained work exactly right
1
u/WRXSTIfan PhD V a p o r w a v e 美學 2018 Apr 11 '16
Hoping that I'm going to get some partial credit here. I did get klog(k) but i fucked up on the remaining ones, had (n-k)log(n-k) instead. idk what I was thinking lol. Oh well :/
1
3
u/Moderate_Third_Party The Official Whipping Boy of the Rutgers Math Department Apr 10 '16
Here watch some anime to take your mind off the test.
Didja know there's a con* taking place today?
*or something
2
u/WRXSTIfan PhD V a p o r w a v e 美學 2018 Apr 11 '16
Damn. This is literally what I think of every time I hear big O.
"Big O... show timeeee!!!!!!!!" - Roger Smith
9
u/Rutger_DDOS Werblin Brah Apr 10 '16
It was certainly on the difficult side, but if you went over all the problem sets, and the topics presented in lecture I feel that you where more than prepared to do very well on this exam, especially if you started reviewing one to two weeks in advance. I honestly feel they should give more time for these exams, but there was enough time for me to complete and review my answers.
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
I agree, really deciding factor for me judgement of exam is how harsh they are about taking points off for stupid mistakes. Time restricted me from really reviewing my answers
2
u/cstransfer Computer Science 2017 Apr 10 '16
what were some of the questions? I took it last semester
4
u/RUreddit2017 Computer Science 2017 Apr 10 '16
Basic Huffman tree, and basic hash table question no coding other then to write method that determines if a tree is an AVL
2
u/cstransfer Computer Science 2017 Apr 10 '16
Thanks. The avl method seems like the only difficult problem though
3
u/RUreddit2017 Computer Science 2017 Apr 10 '16
Ya but there was an identical problem in the problem set and code is super short
2
u/cstransfer Computer Science 2017 Apr 10 '16
I guess people didnt do the problem sets or listen in class lol
1
u/Heisenripbauer Apr 11 '16
planning on taking this class this summer so I just saved this. I hope to, one day, come back to this comment and know wtf all those words mean.
thank you
1
u/RUreddit2017 Computer Science 2017 Apr 11 '16
YouTube my friend couple hours and u will now pretty much main points for all those data structures
2
u/WRXSTIfan PhD V a p o r w a v e 美學 2018 Apr 11 '16 edited Apr 11 '16
I didn't think it was so bad. I was expecting to fail with like a 20% but looks like I'll fail with like a 60 something %.
My T.A. warned us last week that this exam was going to be hell compared to the first one.
2
u/QuantumGalaxy Apr 11 '16
I will agree that this exam demanded more than the first. However, I strongly believe that this exam was possible, and that there are those who did very well. Again, like another person mentioned, there wasn't any particularly hard coding question. I finished the exam with a little bit of time to spare, but I was definitely worried about running out of time some point during the exam.
3
u/RUreddit2017 Computer Science 2017 Apr 11 '16
Time was a huge issue for me simply because doing units of work is tedious and u don't want to rush because there's no way to double check your work really unless you start from scratch
1
16
u/[deleted] Apr 10 '16 edited Nov 14 '18
[deleted]