首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
辅导Math 252语言、辅导Java、c++程序、讲解Python编程 解析C/C++编程|辅导R语言程序
项目预算:
开发周期:
发布时间:
要求地区:
Math 252: Presentation 2
Instructions:
• Sometime today I’ll release a google poll asking about your preferred time for your
presentation. I’ll schedule students first come, first serve, according to your preferences.
You’ll have 24 hours to respond.
• Your camera should be on, assuming you don’t have technical difficulties that prevent
it. You should log into the zoom office hours link for the course, which is posted at
the top in Coursesite a few minutes before your slot starts and wait in the waiting
room for me to get free. I will record the presentation in case I need to review it when
finalizing grading, but I will not post the video, and I will only keep the recording for
the couple of weeks after you get your grades back in case you have any questions.
• You should have a piece of paper and a dark pen or pencil or some other method to
be able to quickly draw or write something and show it to me if you want to.
• If you have technical difficulties connecting or talking, you should call my office number
at 610-758-4720 to make alternate arrangements.
• If you do not show up at your assigned time, you will lose 5 points on the exam.
Exceptions will definitely be made for unforeseen emergencies (illness or unexpected
Internet outage included) as long as you get in touch as soon as your circumstances
reasonably allow.
• You’ll have 20 minutes to “present” on two of the questions below. You’ll get to pick
one, and I’ll get to choose one. For a penalty of 4 points, you may pass on at most one
of my choices.
• While you can bring a few reminder notes to the exam on one side of half of a sheet
of standard paper, you will not get good marks for reading proofs or other remarks
off of a sheet of paper. You may prepare basic equations (but not text) on a separate
scanned page to share with me, as necessary, in advance by email. You’re encouraged
to do so for the (*)ed problem.
• To prepare for the exam, work through as much of each of the questions as you can
below. I do not expect that every student will be able to answer every question below
fully: if you’re unsure how to work through a problem or a subquestion, make sure
you understand all the definitions and the problem and think about how you might
approach it.
1
• You may ask clarification questions of me before the exam starts: I generally will not
give/hint at solutions the same way I sometimes do with homework when necessary.
You may (although you shouldn’t have to) look for solutions in other sources (text or
online) but note that you are unlikely to get many points for such a solution unless you
fully understand (rather than just reading or memorizing) the solution. You may not
post the questions on the exam on a website (like Chegg or Math Overflow) to ask for
help solving them or otherwise ask another outside person to help you solve the exam.
The basic questions are as follows. You should, as before, expect me to have some follow up
questions as we work through them:
1. Assume there is a small class with 12 students, and six teachers assigned to help the
class.
(a) How many ways are there for six teachers to each choose two students?
(b) How many ways can the 12 students each rate the 6 teachers by preference? (Assume
everyone rates every teacher, and there are no ties.)
(c) Assume the class is made up of 6 pairs of twins. How many ways can two students
be assigned to each teacher, so that at least one of the pairs of twins is separated?
(d) How many ways are there for the teachers to each choose two children, such that
no one gets a pair of twins?
2. Give a combinatorial proof of the following:
3. (*) A tile worker has 3 different styles of 1x1 tiles and 4 different styles of 2x1 tiles to
tile a nx1 accent stripe along a wall. Describe a recursion giving the number of ways, tn,
a worker can tile the stripe. Find the ordinary generating function whose coefficient of
x
n
encodes tn. Use the generating function to find a closed form for the number of such
tilings.
4. A local store sells widgets at a cost of $10 per pound, offering 4 possible widgets to their
customers. A salesman observes the following:
• Widget A is only sold in packs of two, and each widget weighs 4 pounds.
• Every project requires at least one of Widget B, but more than three such widgets
are not useful. Widget B weights one pound.
• There are no restrictions on Widgets C (which each weigh 1 pound) and D (which
each weigh 2 pounds), except that they only are useful if there are two C widgets
for every D widget.
Page 2
Let Sn be the number of ways a customer can spend exactly $n (not buy n items or n
pounds of items!) at this Widget supplier to get a useful number of widgets. Find the
generating function for the sequence
{|Sn| : n ≥ 0}.
5. Let dn denote the number of derangements of length n. Give a combinatorial proof that
for 0 ≤ k ≤ n:
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
urba6006代写、java/c++编程语...
2024-12-26
代做program、代写python编程语...
2024-12-26
代写dts207tc、sql编程语言代做
2024-12-25
cs209a代做、java程序设计代写
2024-12-25
cs305程序代做、代写python程序...
2024-12-25
代写csc1001、代做python设计程...
2024-12-24
代写practice test preparatio...
2024-12-24
代写bre2031 – environmental...
2024-12-24
代写ece5550: applied kalman ...
2024-12-24
代做conmgnt 7049 – measurem...
2024-12-24
代写ece3700j introduction to...
2024-12-24
代做adad9311 designing the e...
2024-12-24
代做comp5618 - applied cyber...
2024-12-24
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!