Show all work for full credit!



Download 1,15 Mb.
Page1/13
Date conversion23.11.2017
Size1,15 Mb.
  1   2   3   4   5   6   7   8   9   ...   13

PHYS 317 Name _________________________


Final Exam

Due by 11 am

Thursday, December 15, 2005

By signing, I certify that the only materials I used to complete this exam (besides paper, writing implement, and hand-held calculator) were my course text book, my course notes, my homework and homework assignments, my in-class exercises and my computer exercises. I also certify that the only internet resource I used for this exam was our course web-site. I finally certify that the only person I consulted in any way on this exam was the instructor of record for this course, Krishna Chowdary. I also agree not to discuss this exam in any way with any person until after the exam due date.

____________________________________ _______________

signature date

Show all work for full credit!


Question

1

2

3

4

5

6

7

8

9

10

11




Total

Points

Possible


7

8

10

10

10

12

14

12

20

12

25




140

Points

Earned









































1. (7 points) Please choose ONE of the following questions to answer. Please indicate clearly which question you are answering.
(i) You flip a coin 1000 times. Determine the probability of getting 600 heads and 400 tails. Express your answer in the form , where is some number and is some integer. You will likely need to use Stirling’s approximation, but you’ll need to use your best judgment as to which version is most appropriate. (Note that the math here is the same as the math we would do for a two-state system).



(ii) A sandwich aficionado (let’s call him Joey) walks to his favorite deli everyday. He begins at his coffee shop, at location C, and walks m blocks east and n blocks north to the deli, at location D. (The sketch to the right shows a possible path Joey can take in the case and ; note that he always stays “on the grid”, and can’t take any diagonal shortcuts). Since Joey is eager to get his sandwich, he always approaches the deli from the coffee shop (in other words he never doubles back). If the deli is actually 10 blocks east and 15 blocks north of the coffee shop, how many different ways are there for Joey to walk from the coffee shop to the deli (assuming he always stays on the grid and never doubles back)? (Note we could use the idea of this problem to model the motion of molecules from one location to another.)

  1   2   3   4   5   6   7   8   9   ...   13


The database is protected by copyright ©sckool.org 2016
send message

    Main page