/sci/ - Science & Math » Thread #11160960

173KiB, 1199x527, qro3.png

View Same Google iqdb SauceNAO

Am I just retarded (most likely)

Anonymous Tue 19 Nov 19:26:11 2019 No.11160960 View Reply Original Report

Quoted By: >>11160971 >>11161003 >>11162406 >>11162573

Or is this exercise overly complicated for nothing
The solution to this is found by proof by induction wich was too long for a screenshot, but idk, how tf do you have the time for that during an exam, where there are 23 other questions of the sort.

Like, what's the thought process needed in order to solve such exercises (especially the ones where I have to tell what a recursive program will do with what kind of parameters) I really feel like a total retard in this guy's class, everything just seems so complicated for no reason really

Anonymous

Anonymous Tue 19 Nov 2019 19:30:55 No.11160971 Report

Quoted By:

>>11160960
>Or is this exercise overly complicated for nothing

yes, it's very poorly written. they could have asked you to write a recursive function to compute the fibonacci sequence. i hate wordy exam questions like this because people get snagged and waste too much time on them.

Anonymous

Anonymous Tue 19 Nov 2019 19:41:02 No.11161003 Report

Quoted By: >>11162592

>>11160960
It's overly complicated.
If somebody wrote that code to compute Fibonacci numbers, they would be fired.
It would be faster to write a function that you know does the job than to prove any of those options are correct/incorrect.

Anonymous

Anonymous Tue 19 Nov 2019 21:56:10 No.11161428 Report

Quoted By: >>11161438 >>11162366

Yeah thats what I thought, there's no point in doing this, I just cant understand why the guy is entitled to do overly complicated, heavily wordy questions that make no sens and dont teach you anything valuable.
Im literally seething everytime I have to do his assignments.

But I guess thats just one of this school's way of selecting the best students in order to keep it's reputation.

Anonymous

Anonymous Tue 19 Nov 2019 21:59:06 No.11161438 Report

Quoted By: >>11161453

>>11161428
>Im literally seething everytime I have to do his assignments.

usually when someone writes that way it's either because english is not their first language or they're extremely disorganized thinkers.

Anonymous

Anonymous Tue 19 Nov 2019 22:03:06 No.11161453 Report

Quoted By:

>>11161438
not my first language indeed

Anonymous

Anonymous Wed 20 Nov 2019 05:18:13 No.11162366 Report

Quoted By: >>11162398

>>11161428
>But I guess thats just one of this school's way of selecting the best students in order to keep it's reputation.
if this is the only reason you can imagine, you're a brainlet.

this is a class, the point is to teach students an unfamiliar programming method and how to analyze it.
if you can't even handle that for simple shit like "add up a list of numbers", how the fuck are you going to handle it if the program actually has complicated logic?

the fact that you don't find this exercise easy is proof that this is the right exercise for you.

Anonymous

Anonymous Wed 20 Nov 2019 05:50:35 No.11162398 Report

Quoted By:

>>11162366
This.
OP's question isn't even as convoluted as he tries to make it out to be, it's literally
>base case n=0
>base case n=1
>inductive case with strong induction and the definition of the Fibonacci recurrence
It's already a heavily simplified academic exercise, when compared against the logical tangle of frameworks you'll encounter in "real-world" programming.

Anonymous

Anonymous Wed 20 Nov 2019 05:53:56 No.11162406 Report

Quoted By: >>11162414 >>11162416

>>11160960
>The solution to this is found by proof by induction wich was too long for a screenshot
it's like 6 lines m8
show Fib(x,y,z)=f_n for n=0, n=1 (trivial, plug and chug)
inductive hypothesis: Fib=f for all n up to n-1
suppose n=2
then $Fib(f_{i+1}, f_i, 2) = Fib(f_{i+1} + f_i, f_i, 1) = f_{i+1} + f_i$
and $f_{n+i}=f_{2+i}=f_{2+i-2}+f_{2+i-1}=f_{i+1}+f_i$

Anonymous

Anonymous Wed 20 Nov 2019 06:01:28 No.11162414 Report

Quoted By:

>>11162406
n=2 is a base case for this tail-recursive implementation of fib. you need one more step

Anonymous

Anonymous Wed 20 Nov 2019 06:04:08 No.11162416 Report

Quoted By:

>>11162406
Do you know why induction works?

Anonymous

Anonymous Wed 20 Nov 2019 08:11:08 No.11162573 Report

Quoted By:

>>11160960
It's literally multiple choice, wtf, you don't have to write shit
All you need to do is know what the fibbonacci sequence is, and you will instantly get c

Anonymous

Anonymous Wed 20 Nov 2019 08:26:04 No.11162592 Report

Quoted By:

>>11161003
That isn't even the worst way to compute Fibonacci numbers
The exam is fine, it's testing to see if the student knows how to use invariants. The student needs to realize that the sum of n and the index of the Fibonacci number is constant. Based on that, the student realizes which Fibonacci numbers are available at n = 1, and picks the appropriate return option. This problem should not take longer than a minute to do.

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches