He-Ne Laser
About points...
We associate a certain number of points with each exercise.
When you click an exercise into a collection, this number will be taken as points for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit the number of points for the exercise in the collection independently, without any effect on "points by default" as represented by the number here.
That being said... How many "default points" should you associate with an exercise upon creation?
As with difficulty, there is no straight forward and generally accepted way.
But as a guideline, we tend to give as many points by default as there are mathematical steps to do in the exercise.
Again, very vague... But the number should kind of represent the "work" required.
When you click an exercise into a collection, this number will be taken as points for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit the number of points for the exercise in the collection independently, without any effect on "points by default" as represented by the number here.
That being said... How many "default points" should you associate with an exercise upon creation?
As with difficulty, there is no straight forward and generally accepted way.
But as a guideline, we tend to give as many points by default as there are mathematical steps to do in the exercise.
Again, very vague... But the number should kind of represent the "work" required.
About difficulty...
We associate a certain difficulty with each exercise.
When you click an exercise into a collection, this number will be taken as difficulty for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit its difficulty in the collection independently, without any effect on the "difficulty by default" here.
Why we use chess pieces? Well... we like chess, we like playing around with \(\LaTeX\)-fonts, we wanted symbols that need less space than six stars in a table-column... But in your layouts, you are of course free to indicate the difficulty of the exercise the way you want.
That being said... How "difficult" is an exercise? It depends on many factors, like what was being taught etc.
In physics exercises, we try to follow this pattern:
Level 1 - One formula (one you would find in a reference book) is enough to solve the exercise. Example exercise
Level 2 - Two formulas are needed, it's possible to compute an "in-between" solution, i.e. no algebraic equation needed. Example exercise
Level 3 - "Chain-computations" like on level 2, but 3+ calculations. Still, no equations, i.e. you are not forced to solve it in an algebraic manner. Example exercise
Level 4 - Exercise needs to be solved by algebraic equations, not possible to calculate numerical "in-between" results. Example exercise
Level 5 -
Level 6 -
When you click an exercise into a collection, this number will be taken as difficulty for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit its difficulty in the collection independently, without any effect on the "difficulty by default" here.
Why we use chess pieces? Well... we like chess, we like playing around with \(\LaTeX\)-fonts, we wanted symbols that need less space than six stars in a table-column... But in your layouts, you are of course free to indicate the difficulty of the exercise the way you want.
That being said... How "difficult" is an exercise? It depends on many factors, like what was being taught etc.
In physics exercises, we try to follow this pattern:
Level 1 - One formula (one you would find in a reference book) is enough to solve the exercise. Example exercise
Level 2 - Two formulas are needed, it's possible to compute an "in-between" solution, i.e. no algebraic equation needed. Example exercise
Level 3 - "Chain-computations" like on level 2, but 3+ calculations. Still, no equations, i.e. you are not forced to solve it in an algebraic manner. Example exercise
Level 4 - Exercise needs to be solved by algebraic equations, not possible to calculate numerical "in-between" results. Example exercise
Level 5 -
Level 6 -
Question
Solution
Short
Video
\(\LaTeX\)
No explanation / solution video to this exercise has yet been created.
Visit our YouTube-Channel to see solutions to other exercises.
Don't forget to subscribe to our channel, like the videos and leave comments!
Visit our YouTube-Channel to see solutions to other exercises.
Don't forget to subscribe to our channel, like the videos and leave comments!
Exercise:
The light of a HNe laser laO is diffracted on a grating with a grating constant of NO. The erference pattern is observed on a screen lO away from the grating. Calculate the position of the first three maxima with and without the small-angle approximation.
Solution:
The slit separation is given by the grating constant d dF The condition for maxima is sinalpha_m mfraclambdad mlambda N The position on the screen is a_m elltanalpha_m aF labeleq_full For m we find a_ ltimestanarcsinmtimeslatimes N a approx resultaP- For m and m the values are a_resultabP- and a_resultacP- With the small-angle approximation sinalphaapproxtanalpha refeq_full can be written as a_m &approx aapproxF For m we find a_ &approx ltimesmtimeslatimesN aapprox approx resultaapproxP- For m and m the results are a_approxresultabapproxP- and a_approxresultacapproxP-. For the first two maxima the approximated results agree with the results of the full solution within the given accuracy.
The light of a HNe laser laO is diffracted on a grating with a grating constant of NO. The erference pattern is observed on a screen lO away from the grating. Calculate the position of the first three maxima with and without the small-angle approximation.
Solution:
The slit separation is given by the grating constant d dF The condition for maxima is sinalpha_m mfraclambdad mlambda N The position on the screen is a_m elltanalpha_m aF labeleq_full For m we find a_ ltimestanarcsinmtimeslatimes N a approx resultaP- For m and m the values are a_resultabP- and a_resultacP- With the small-angle approximation sinalphaapproxtanalpha refeq_full can be written as a_m &approx aapproxF For m we find a_ &approx ltimesmtimeslatimesN aapprox approx resultaapproxP- For m and m the results are a_approxresultabapproxP- and a_approxresultacapproxP-. For the first two maxima the approximated results agree with the results of the full solution within the given accuracy.
Meta Information
Exercise:
The light of a HNe laser laO is diffracted on a grating with a grating constant of NO. The erference pattern is observed on a screen lO away from the grating. Calculate the position of the first three maxima with and without the small-angle approximation.
Solution:
The slit separation is given by the grating constant d dF The condition for maxima is sinalpha_m mfraclambdad mlambda N The position on the screen is a_m elltanalpha_m aF labeleq_full For m we find a_ ltimestanarcsinmtimeslatimes N a approx resultaP- For m and m the values are a_resultabP- and a_resultacP- With the small-angle approximation sinalphaapproxtanalpha refeq_full can be written as a_m &approx aapproxF For m we find a_ &approx ltimesmtimeslatimesN aapprox approx resultaapproxP- For m and m the results are a_approxresultabapproxP- and a_approxresultacapproxP-. For the first two maxima the approximated results agree with the results of the full solution within the given accuracy.
The light of a HNe laser laO is diffracted on a grating with a grating constant of NO. The erference pattern is observed on a screen lO away from the grating. Calculate the position of the first three maxima with and without the small-angle approximation.
Solution:
The slit separation is given by the grating constant d dF The condition for maxima is sinalpha_m mfraclambdad mlambda N The position on the screen is a_m elltanalpha_m aF labeleq_full For m we find a_ ltimestanarcsinmtimeslatimes N a approx resultaP- For m and m the values are a_resultabP- and a_resultacP- With the small-angle approximation sinalphaapproxtanalpha refeq_full can be written as a_m &approx aapproxF For m we find a_ &approx ltimesmtimeslatimesN aapprox approx resultaapproxP- For m and m the results are a_approxresultabapproxP- and a_approxresultacapproxP-. For the first two maxima the approximated results agree with the results of the full solution within the given accuracy.
Contained in these collections: