> c Ibjbj .vx[\x[\A% 8XlL g^n"kkktgvgvgvgvgvgvg$k=ngkkkkkggY Y Y ktgY ktgY Y _4b AICA2Ba>`gg0gansvn|bbJnbkkY kkkkkggpkkkgkkkknkkkkkkkkk>: Fall 2017 Syllabus
COSC 2375
Discrete Structures
Description
Where & When
Time: This is a hybrid course. It meets at 12:45 p.m. to 2:05 p.m. on Tuesdays in Maes 103. Students must take all exams on campus. The course does not have online examinations. Students are expected to be in class during all scheduled meeting times.
Instructor: Dr. Lawrence Osborne, Professor Use Blackboard email for COSC 2375 when writing to the Instructor.
Office Hours: in Maes 98 at 3:00 p.m to 4:00 p.m. Tuesday and Thursday and by appointment.
Grader: TBA
Required Textbooks: Discrete Structures, Logic, and Computability James L. Hein (JLH) , Fourth Edition, Jones & Bartlett, 2017. ISBN: 978-1-284-07040-8.
Textbook website: HYPERLINK "http://go.jblearning.com/Hein4e" http://go.jblearning.com/Hein4e.
The best advice I can give a student is to solve as many of the exercises in the textbook as possible. Try to solve other problems besides those assigned at the end of each chapter. The answers to many of the exercises are provided at the end of the textbook although some may not be full solutions.
Recommended Resources:
Discrete Mathematics and its Applications, Kenneth Rosen, Seventh Edition, McGraw-Hill, 2012.
Discrete Structures with Contemporary Applications,
Alexander Stanoyevitch, CRC Press, 2011.
Discrete Mathematics, Elementary and Beyond, Lovasz, L, Pelikan, J., and
Vesztergombi, K., Springer, 2003.
Mathematical Structures for Computer Science, Third Edition, Judith L. Gersting,
Computer Science Press, 1993.
Discrete Mathematics for Computer Science, Bogart, Kenneth, Stein, Clifford,
and Drysdale, Robert, Key College Publishing, 2006.
Prerequisites
The official prerequisites are COSC 1337 (Computer Fundamentals II or the equivalent in C++ or Python) and PreCalculus II.
(Consult the instructor if you are unsure of your background.)
Course Learning Outcomes:
Upon completion of this course, students will be able to:
1. Explain with examples the basic terminology of functions, relations, and sets.
[Familiarity]
2. Perform the operations associated with sets, functions, and relations. [Usage]
3. Relate practical examples to the appropriate set, function, or relation model, and
interpret the associated operations and terminology in context. [Assessment]
4. Convert logical statements from informal language to propositional and predicate logic
expressions. [Usage]
5. Apply formal methods of symbolic propositional and predicate logic, such as
calculating validity of formulae and computing normal forms. [Usage]
6. Use the rules of inference to construct proofs in propositional and predicate logic.
[Usage]
7. Describe how symbolic logic can be used to model real-life situations or applications,
including those arising in computing contexts such as software analysis (e.g.,
program correctness), database queries, and algorithms. [Usage]
8. Apply formal logic proofs and/or informal, but rigorous, logical reasoning to real
problems, such as predicting the behavior of software or solving problems such
as puzzles. [Usage]
9. Describe the strengths and limitations of propositional and predicate logic.
[Familiarity]
10. Identify the proof technique used in a given proof. [Familiarity]
11. Outline the basic structure of each proof technique (direct proof, proof by
contradiction, and induction) described in this unit. [Usage]
12. Apply each of the proof techniques (direct proof, proof by contradiction, and
induction) correctly in the construction of a sound argument. [Usage]
13. Determine which type of proof is best for a given problem. [Assessment]
14. Explain the parallels between ideas of mathematical and/or structural induction to
recursion and recursively defined structures. [Assessment]
15. Explain the relationship between weak and strong induction and give examples of the
appropriate use of each. [Assessment]
16. State the well-ordering principle and its relationship to mathematical induction.
[Familiarity]
17. Apply counting arguments, including sum and product rules, inclusion-exclusion
Principle and arithmetic/geometric progressions. [Usage]
18. Apply the pigeonhole principle in the context of a formal proof. [Usage]
19. Compute permutations and combinations of a set, and interpret the meaning in the
context of the particular application. [Usage]
20. Map real-world applications to appropriate counting formalisms, such as determining
the number of ways to arrange people around a table, subject to constraints on the
seating arrangement, or the number of ways to determine certain hands in cards
(e.g., a full house). [Usage]
21. Solve a variety of basic recurrence relations. [Usage]
22. Analyze a problem to determine underlying recurrence relations. [Usage]
23. Perform computations involving modular arithmetic. [Usage]
24. Illustrate by example the basic terminology of graph theory, as well as some of the
properties and special cases of each type of graph/tree. [Familiarity]
25. Demonstrate different traversal methods for trees and graphs, including pre-, post-,
and in-order traversal of trees. [Usage]
26. Model a variety of real-world problems in computer science using appropriate forms
of graphs and trees, such as representing a network topology or the organization of
a hierarchical file system. [Usage]
27. Show how concepts from graphs and trees appear in data structures, algorithms, proof
techniques structural induction), and counting. [Usage] [Core-Tier2]
28. Explain how to construct a spanning tree of a graph. [Usage]
29. Determine if two graphs are isomorphic. [Usage]
30. Calculate probabilities of events and expectations of random variables for elementary
problems such as games of chance. [Usage]
31. Differentiate between dependent and independent events. [Usage]
32. Identify a case of the binomial distribution and compute a probability using that
distribution. [Usage]
33. Apply predicate logic to computer science problems
34. Define an algebra, simplify Boolean expressions, and digital circuits
35. Discuss isomorphism in graphs
36. Explain the notation of algorithmic complexity
37. Explain the algebra of regular expressions
38. Define regular expressions, deterministic and nondeterministic finite automata
39. Discuss DFAs, NFAs, context-free languages, pushdown automata, and Turing machines.
40. Describe the Halting Problem, the Chruch-Turing Thesis, Recursive and partial recursive functions.
We will be using the Blackboard course management system this semester. So,
your assignments, the PowerPoint Slides, and the Discussions will be online.
Also, all assignments should be uploaded on the date of submission to
Blackboard. Late submissions will earn a grade of zero unless the student has a documented medical or family emergency.
Assignments
All assignments should be submitted electronically, via Blackboard. Do not use Email.
Collaboration and Written Work
You are welcome to work with other students on homework, but your write-up must be entirely your own. Please do not refer to course materials from previous terms. When you submit an assignment, you should attach a Collaboration Statement such as the one found on the Blackboard Syllabus page for the class. On the Collaboration statement, include a list of the following items.
all collaborators, other than course staff
all written sources that you consulted, other than the text and course handouts from this term
If you had no collaborators and consulted no written sources, then write, "I worked alone." Homework without a collaboration statement will not be graded.
Collaboration on exams is not allowed. A grade of zero will be given on any exam in which there is collaboration. All parties in the collaboration will receive a zero grade regardless of who copied from whom. It is your responsibility to protect your work from those who cannot do their own work.
Essays and answers to discussion questions on assignments must be in coherent, succinct, readable, and grammatically correct English prose. Part of the grading for such questions reflects this. All work must be done electronically. Problems done on paper will not be accepted. Illegible or poorly formatted work receives no credit. We reserve the right to define what is or is not legible or easily read. In general, use LATEX, pdf, or WORD files for essays or mathematical problems. Turn in work in .pdf, .doc, or .ps files. Use 7-zip to zip any assignments with multiple files into a single file for submission. Make sure you check that any zipped files can be unzipped before you send them. It is not the responsibility of the Grader or Instructor to grade assignments that cannot be unzipped. Check before you Submit any zipped file. Do not expect credit for files that cannot be opened.
Typically, a problem set is due a week after it is assigned. There are three exams: two class midterms, and a 2.5-hour final during finals week.
Grading
A percentage score is calculated based on your coursework, and then a letter grade is assigned as follows:
A: 85.0 100%B: 70.0 84.9%C: 55.0 69.9.9%D: 45.0 54.9%F: below 45%
Your course percentage score is the weighted average of your scores in four areas: classwork and homework, midterm 1, midterm 2, and the final exam. Scores in the four individual areas are weighted as follows:
In-Class Assignments, quizzes, and homework (30%)
First Midterm (15 %)
Second Midterm (15 %)
Final (40%)
Academic Integrity Policies:
1. Late assignments are only accepted if there is a documented medical or family emergency.
2. There are no make-up exams, class work or quizzes unless the student has a documented family or medical emergency. There are no incompletes in this class unless you have a DOCUMENTED medical or family emergency within the last three weeks of the semester stating that you were unable to study for the final examination.
3. All work in this course is to be your own. Anyone caught copying, plagiarizing or otherwise cheating on a homework assignment will get a 0 on that assignment. Anyone caught copying, plagiarizing or otherwise cheating on any test or exam will earn an F in the course. The same applies to those who allow their materials to be copied. Do not leave your work on any of the department lab computers. Personal files are not protected from access by other students. Do not show source code to other students. If they are caught using it, you will be subject to the same penalties as are those who copied your work.
4.An A student must read and submit assignments for all classes in time and actively provide thoughtful, relevant comments in the class discussion boards on Blackboard.
5. Collaboration is not the same as plagiarizing. You are welcome to collaborate with other students on homework, but your write-up must be entirely your own. Please do not consult course materials from previous terms. On the top of your homework, list:
all collaborators, other than course staff, including other students or former students of the course, all websites, written, and video sources that you consulted, other than the textbook and course handouts from this term
if you had no collaborators and consulted no websites, written or video sources, then write, "I worked alone."
homework without a collaboration statement will result in a zero grade.
Collaboration on exams is not allowed. A grade of zero will be given on any exam in which there is collaboration. All parties in the collaboration will receive a zero grade regardless of who copied from whom. It is your responsibility to protect your work from those who cannot do their own work. Dishonesty during the final exam will result in an F for the course.
Collaboration on team projects means students may work in teams on the projects. Both of the members of a team must work as a team, which means they must not only have individual tasks, but they must know how their individual work fits into the design of the entire project. Separate teams may not collaborate if they are working on the same problem. It is highly unlikely that two teams working separately on the same project solve the project in the same way without improper sharing of project implementations. Projects will be checked for plagiarism among projects with the same requirements and for source code copied without citations from Internet websites.
Student Information Guides
Policies on cheating, plagiarism, incomplete grades, attendance, discrimination, sexual harassment, and student grievances are described in the Student Handbook and in the Departmental Honesty Policy which is on HYPERLINK "http://cs.lamar.edu" http://cs.lamar.edu. Students are responsible for all the information in these documents.
Important Dates
Monday, August 28: Fall semester begins. Late registration with fee begins for Fall 2017.
Wednesday, August 30: Last day to register for Fall 2017 with late fee
Monday, September 4: Labor Day
Wednesday, September 13: Last day for full refund on dropped courses
Monday, September 25: 20th Class Day, Final Fall 2017 non-payment purge after 5 p.m.
Tuesday, October 31: Course schedules available for Spring 2018
Thursday, November 2: Advisement begins for Spring 2018
Friday, November 3: Last day to drop or withdraw with academic penalty
Thursday-Friday, November 23-24: Thanksgiving Holiday
Monday, December 4: Last MWF class day for Fall 2017 (no exams or assignments)
Tuesday, December 5: Last TTH class day for Fall 2017 (no exams or assignments). Final exams begin at 5:00 p.m.
Wednesday, December 6: Final exams from December 6-12.
Thursday, December 14: All final grades due by 1:00 p.m.
Students with Disabilities
Reasonable accommodations are available for students who have a documented disability. Please notify the Professor during the first week of class regarding accommodations needed for the course. Late notification may cause the requested accommodations to be unavailable. Students needing accommodations must first have them approved through the Disability Resource Center, P.O. Box 10087, Beaumont, Texas 77710. It is located in Room 105 Communication Building. The phone number for the Disability Resource Center is 409-880-8347.
Campus Closure Policy:
In the event of an announced campus closure in excess of four days due to a hurricane or other disaster, students are expected to login to Lamar University websites homepage ( HYPERLINK "http://www.lamar.edu" www.lamar.edu) for instructions about continuing courses remotely.
Emergency Procedures:
Many types of emergencies can occur on campus; instructions for severe weather or violence/active shooter, fire, or chemical release can be found at HYPERLINK "http://www.lamar.edu/about-lu/adminstration/risk-management/index.html" http://www.lamar.edu/about-lu/adminstration/risk-management/index.html. Following are procedures for the first two:
Severe Weather:
Follow the directions of the instructor or emergency personnel.
Seek shelter in an interior room or hallway on the lowest floor, putting as many walls as possible between you and the outside.
If you are in a multi-story building, and you cannot get to the lowest floor, pick a hallway in the center of the building.
Stay in the center of the room, away from exterior walls, windows, and doors.
Violence/Active Shooter (CADD):
Call 8311 from a campus phone or (880-8311) from a cell phone. Note: Calling 911 from either a cam;pus phone or cell phone will contact Beaumont City Police rather than University Police.
Avoidif possible, self-evacuate to a safe area outside the building. Follow directions of police officers.
Deny---Barricade the door with desks, chairs, bookcases or any other items. Move to a place inside the room where you are not visible. Turn off the lights and remain quiet. Remain there until told by police it is safe.
Defend Use chairs, desks, cell phones or whatever is immediately available to distract and/or defend yourself and others from attack.
Drop Dates: See the Academic Calendar at HYPERLINK "http://events.lamar.edu/index.html" http://events.lamar.edu/index.html. Do not remain in a course unless you have the time and resources to complete it successfully. Poor grades may effect adversely both the length of time until graduation and your prospects for employment after graduation.
PAGE
PAGE 8
12>KRJ K W v |
4
6
=
?
C
F
O
W
X
Z
[
௫yrnh"zh"z5>*hh h5 hA5 hz5huHhQh0p.5h0p.h_fh,h5Sh]!h'4h'45h<h3hHhRh<h<5 h<5h<h<5h<h'4hwhNhD5h2hhDhLs*12>KK 5
6
C
F
GHuv%
gdg$h^h`a$gdZgd"gd'4gd'4gdwgdN$a$gdD
$%DEHtuv!
#
&
;
=
F
H
M
O
{
}}sishz0PJnH tH h:PJnH tH hZhZPJnH tH hZPJnH tH hZ5>*PJnH tH hZhZ5>*PJnH tH h6_hghg5>*h=!hch"hch"5hzh5ShESWh3h"z0Jjh"zUhh"zh"zh"z)%
N
O
-.|?b|gdh^gd'4gd'4gd'4gd$h^h`a$gdZ
,-.WX().<>?@~
`n}Ÿի{w{pia]Y]R]Rhhhhh
hhjh'4Uh'46]h'45\h6_h"hz]hYJh'4jh'4UhAh"hchch=!PJnH tH h[/h[/PJnH tH h[/5>*PJnH tH h[/h[/5>*PJnH tH h[/PJnH tH h:PJnH tH hz05>*PJnH tH hz0PJnH tH }$2~JZhuhu7DRV37&*}(MNOS'(Wh7h7h7hhQ0hvhhhh7h7hhh%^hhhhh7M&Nii8R3&~Ogd7gdhW5Jw=Cw.\H| R gdgd7W[59IVlow{=ABN[\wz{-8\`
HL{ S T U V !!"""#ɾh\h7hc@h7hc@hhh7h76hT9zh\h5k"hVl?hih7h7hJ !M!o!!!$"|""""5###\$h$i$$$$gd'4[$gd2F[$\$gd2F[$^gdZ[$\$gdF[$\$gd\\$gd\gd7########[$\$g$h$i$$$$$$$$$%&%'%C%%X&&Ĵug\guRuh!^PJnH tH hUnv5PJnH tH h h45PJnH tH h4h4PJnH tH h"h'45h"CJaJh CJaJhIN6>*PJnH tH h`6>*PJnH tH h2Fh2F6>*PJnH tH h){h]CJaJh2FCJaJh){h'4CJaJhZhyAhFh\h\ h;R5 h\5$Y&&&'(.,,,3--T......:/}023$a$gd=dgd=gdd[$gd
dd@&[$\$gd4gd'4gd4
&Fdd[$\$gd4dd[$\$gd4&|'~'''''R((((()))))@*Q*V*]********++l++++{wwswswibi^h9h!^56h8h856h!^h8h`
hLsh`
h'45h`
h*PJnH tH hZPJnH tH h4h4PJnH tH h4h45PJnH tH !+-,.,/,W,,,,,,,,,,,,---'-3-4-U-e-g-u-w---------.&.G.T.շ˷գՙՙՙՏՅwmcmՅhvPJnH tH hhxPJnH tH hLsh4>*PJnH tH hJPJnH tH hLQPJnH tH h=FPJnH tH &h4h45CJ$PJ\aJ$nH tH hPJnH tH h!^PJnH tH h"bPJnH tH h4h4PJnH tH hUnvPJnH tH h9h'456h9h956&T.h.r.w.x..................//n/ɼ楘ɼsi_RBRh=h=5>*PJnH tH h=h=PJnH tH hPJnH tH h=PJnH tH h=h=5PJnH tH h4PJnH tH h!^5PJ\nH tH hd5PJ\nH tH h"b5PJ\nH tH hdPJnH tH h4h4PJnH tH h4h45PJ\nH tH h7a5PJ\nH tH h|5PJ\nH tH h!n5PJ\nH tH n//V1w122T33333333j4%6K6N677774:5:P::$;%;F;G;Z;镱ppZ*h=h=5>*B*PJ\nH phtH )jh=h=PJUmH @nH sH @tH h=h=56PJnH tH h=h=5PJnH tH h=h=PJ\nH tH h=h=5PJ\nH tH h=h=PJmH @nH sH @tH h=huPJnH tH h=PJnH tH h=h=PJnH tH huPJnH tH 334l55%6&6774:5:P:;;;<Z<z<<=W===>_>>
?gd=$
&Fa$gd=$a$gd=Z;[;^;;;;;;;<<<<_>>>E?F?G?H?c?d?shhZIB;h)9h)9h'45\ h=hFCJPJaJnH tH h{zhD+6PJnH tH hDS6PJnH tH hD+hD+6H*PJnH tH h{z6PJnH tH hD+6PJnH tH h{zh{z6PJnH tH h=5PJnH tH h=h=5PJnH tH h=h=PJmH @nH sH @tH h=h=5PJ\nH tH h=h=PJnH tH !jh=h=PJUnH tH
?E?F?G?H?d?{AABBB%D&D6DvDDrEEEEFGG
&Fdgdgc
&Fdgdgcgdgc $a$gd'4$a$gdFgdFgd=d?@@3ANAyAzA{AABBCBeBfBsBtBBBYCZCCCCC&D6DEEEFFGGôÝqq^qqq^qPPhgchgc>*PJnH tH $hgchgc>*B*PJnH phtH !jhgchgcPJUnH tH hgchgcPJnH tH hgchgc5PJnH tH ,h?uCh'45B*CJOJQJ^JaJphhDS5CJOJQJ^JaJh'45CJOJQJ^JaJhDSCJOJQJ^JaJ#hDShDS5CJOJQJ^JaJh'4CJOJQJ^JaJGGGsH}HHHHHHHsItIIIIIIIIIIIIIIIIIIIIIIII~jh10JU*hDS0JmHnHu*h1
h10Jjh10JUh+Q jh+Q UhzPJnH tH $hgchgc>*B*PJnH phtH !jhgchgcPJUnH tH hgchgc5PJnH tH hgchgcPJnH tH #GrHsHIIIIIIIIIIIIIIIIIIh]hgd1&`#$gdvTgdgc
&Fdgdgc,1h/ =!"#$%DdP
33"88DdP
33"88 s2 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@PJ_HmH nH sH tH D`DNormalCJ_HaJmH nHsH tH``4 Heading 2$<@&$56CJOJPJQJ\]^JaJN@2Nw Heading 3dd@&[$\$5CJ\aJF@BFw Heading 4dd@&[$\$5\DA`DDefault Paragraph FontRiRTable Normal4
l4a(k (No List4U`4w Hyperlink >*phNg NwHTML TypewriterCJOJPJQJ^JaJB^@BwNormal (Web)dd[$\$0a !0w HTML Cite6]<O<F_CM4d1$7$8$H$OJ QJ 6O6F_CM51$7$8$H$OJ QJ 4 @R41Footer
!.)@a.1Page NumberDZrD$
Plain TextCJOJQJ^JaJJ/J'4Heading 3 Char5CJ\aJnHtHJ/J'4Heading 4 Char5CJ\aJnHtHJ/J'4Plain Text CharOJQJ^JnHtH44+JHeader
H$>/>+JHeader CharCJaJnHtH`/`4Heading 2 Char,56CJOJPJQJ\]^JaJnHtHHH9B)Balloon TextCJOJ
QJ
^J
aJV/V9B)Balloon Text CharCJOJ
QJ
^J
aJnHtHPK![Content_Types].xmlN0EH-J@%ǎǢ|ș$زULTB l,3;rØJB+$G]7O٭VvnB`2ǃ,!"E3p#9GQd; H
xuv 0F[,F᚜KsO'3w#vfSVbsؠyX p5veuw 1z@ l,i!b
IjZ2|9L$Z15xl.(zm${d:\@'23ln$^-@^i?D&|#td!6lġB"&63yy@t!HjpU*yeXry3~{s:FXI
O5Y[Y!}S˪.7bd|n]671.
tn/w/+[t6}PsںsL.J;̊iN $AI)t2Lmx:(}\-i*xQCJuWl'QyI@ھ
m2DBAR4 w¢naQ`ԲɁ
W=0#xBdT/.3-F>bYL%˓KK6HhfPQ=h)GBms]_Ԡ'CZѨys
v@c])h7Jهic?FS.NP$
e&\Ӏ+I "'%QÕ@c![paAV.9Hd<ӮHVX*%A{YrAբpxSL9":3U5U
NC(p%u@;[d`4)]t#9M4W=P5*f̰lk<_X-CwT%Ժ}B% Y,]
A̠&oʰŨ;\lc`|,bUvPK!
ѐ'theme/theme/_rels/themeManager.xml.relsM
0wooӺ&݈Э5
6?$Q
,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧60_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!R%theme/theme/theme1.xmlPK-!
ѐ' theme/theme/_rels/themeManager.xml.relsPK]
A)v $$$'
}W#&+T.n/Z;d?GI%')*-/1234689%
$3
?GI&(+,.057:$D$3F3Z3B:e:s:Y;;;@@@AXX4XXX '!!8@0(
B
S ?/;}.9""B>I>AAAAAAAAAAA
z|2 ; Z
e
u~u}
(3
NQ89AE["`"##$$**l-n---2244B4F4K5Q555;6?666E>I>AAAAAAAAAAA33333333333333333333333333333333333333333839N9h9t9y9AAAAAAAAAAAAA839N9h9t9y9AAAAAAAAAAAAtBX
!Vb
0i#>f K.Su Vg"V1"w7d<8|8DÄh9.TwK
J0yN
8|O|#}dR `l&T+fr0j(mxiy=
`
3Pw[w93hU
+}=Fu:GRvcj\[/6vT6#B3u\-
+Q =!N!]!"5k"z%9B)RQ+^B-0p.vJ/I0Q0&V0z012Bw2w3'4h79Ng:[j:; <==Vl?O@\@c@uIuUnvxvw[>w|xhx4xhx0yT9z){5{5}MDSA3^U!^[]v78Hc}2Gc6Bdd Y7$v
)9Ky^($A&24"QGZF|1u)JyAFrH`b#JAB%^:Wa&|uxG+J <"R)7 =]W;g7op9Vn%6('[8Oc"<{zhN`w82W8[Dc:f,wNFXmqz0nJVv#ol,
,ysz`"Mf`]h"blQ\8;;?iv5bZAA@3333AH@Unknown
G*Ax Times New Roman5Symbol3.*Cx ArialG=
jMS Mincho-3 fg7.@Calibri{Times New Roman PSMTTimes New Roman PSMT;|i0Batang7@Cambria?= *Cx Courier NewsTimes New Roman PSTimes New Roman PS9.")Segoe UI;WingdingsA$BCambria Math"1htXgXgHG 8!w 8!w!4AA2qHP ?w2!xxDescriptionLawrence OsborneLawrence J. Osborne|
Oh+'0
<HT
`lt|DescriptionLawrence OsborneNormal.dotmLawrence J. Osborne4Microsoft Office Word@_@p*B@@@(#C 8՜.+,D՜.+,Hhp
Lamar Universityw!ADescriptionTitle 8@_PID_HLINKSAxq)#http://events.lamar.edu/index.html"> Ghttp://www.lamar.edu/about-lu/adminstration/risk-management/index.htmlHhttp://www.lamar.edu/http://cs.lamar.edu/d" http://go.jblearning.com/Hein4e
!"#$%&'()*+,-./0123456789:;=>?@ABCEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{}~Root Entry FEICData
<1TableD?oWordDocument
.vSummaryInformation(|DocumentSummaryInformation8MsoDataStore<%IC AICFZB4LZOUUXQ==2<%IC AICItem
PropertiesUCompObj
r
F Microsoft Word 97-2003 Document
MSWordDocWord.Document.89q