DUCK

TERM

CLASS

Mark J. Wierman

     Monday       Tuesday       Wednesday       Thursday       Friday   
11am CSC 321-1
72042 Class
11:00 am-12:15 pm
EPLY 110
DTS 525-1
73848 Class
11:00 am-12:15 pm
HLSB 523
CSC 321-1
72042 Class
11:00 am-12:15 pm
EPLY 110
DTS 525-1
73848 Class
11:00 am-12:15 pm
HLSB 523
 
 
 
 
12pm  
         
Office
x1782
12:30 pm-1:45 pm
CA203B
FSM
73835
12:30 pm-1:45 pm
CH123
Office
x1782
12:30 pm-1:45 pm
CA203B
Office
x1782
12:30 pm-1:45 pm
CA203B
 
 
1pm  
 
 
         
2pm CSC 222-1
72237 Class
2:00 pm-3:15 pm
EPLY 110
CSC 548-1
73252 Class
2:00 pm-3:15 pm
EPLY 110
CSC 222-1
72237 Class
2:00 pm-3:15 pm
EPLY 110
CSC 548-1
73252 Class
2:00 pm-3:15 pm
EPLY 110
 
 
 
 
3pm  
         
         
         

Name Mark J. Wierman
Office CA203B
School Creighton University
Address Omaha, NE 68178-2090
email mwierman@creighton.edu
Phone (402) 280-1782
Fax (402) 280-1494
Semester Fall 2014
DC Sandra Drummond
DC Phone 402-280-2825

Recent Publications

Books

  1. Michael B. Gibilisco, Annie M. Gowen, Karen E. Albert, John N. Mordeson, Mark J. Wierman, Terry D. Clark, and Alex Pham. Fuzzy Social Choice Theory. Springer, Berlin, 2014.
  2. John N. Mordeson, Mark J. Wierman, Terry D. Clark, Alex Pham, and Michael A. Redmond. Linear Models in the Mathematics of Uncertainty. Springer, Berlin, 2013.

 

Chapters

  1. Eric N. Fischer, Ciprianna M. Dudding, Tyler J. Engel, Matthew A. Reynolds, Mark J. Wierman, John N. Mordeson, and Terry D. Clark. Explaining variation in state involvement in cyber attacks: A social network approach. In Witold Pedrycz and Shyi-Ming Chen, editors, Social Networks: A Framework of Computational Intelligence, pages 63—74. Springer, Berlin, 2013.
  2. Morgan L. Eichman, James A. Rolfsen, Mark J. Wierman, John N. Morde- son, and Terry D. Clark. The global spread of islamism: An agent-based computer model. In Witold Pedrycz and Shyi-Ming Chen, editors, Social Networks: A Framework of Computational Intelligence, pages 407—426. Springer, Berlin, 2013.
  3. Mark J. Wierman. Syzygy. In Rudolf Seising, Enric Trillas, Claudio Moraga, and Settimo Termini, editors, On Fuzziness: A Homage to Lotfi A. Zadeh, volume 2, pages 327—334. Springer, Berlin, 2013.

Journal Articles

  1. Peter Colum Casey, Mark J. Wierman, Michael B. Gibilisco, John N. Mordeson, and Terry D. Clark. Assessing policy stability in iraq: a fuzzy approach to modeling preferences. Public Choice, 151:409-423, 2012.
  2. William J. Tastle, J. Russell, and Mark J. Wierman. A new measure to analyze student performance using the likert scale. Information Systems Education Journal, 6(35), 2008.
  3. Terry D. Clark, John N. Mordeson, Adam Karnik, Jacob Moore, and Mark J. Wierman. Determining the causes of democratic consolidation: A consideration of several fuzzy methods. New Mathematics and Natural Computation, 5:353—369, 2009.

Conference Papers

  1. Mark J. Wierman. Psychologists: Are they logically fuzzy? In IFSA/NAFIPS, 2013, pages 854—859, June 2013.
  2. Mark J. Wierman, Terry D. Clark, John N. Mordeson, and William .J. Tastle. A critique of fuzzy rational choice models. In NAFIPS, 2012, pages 1-6, August 2012.
  3. Mark J. Wierman and William J. Tastle. Multidimensional dissention. In NAFIPS 2011, pages 117-122. El Paso, TX, 2011. ISBN 978-1-61284-967-6.
  4. Mark J. Wierman. Cloud sets as a measure theoretic basis for fuzzy set theory. In NAFIPS 2010. Toronto, CA, 2010. ISBN 978-1-4244-7858-3.
  5. Mark J. Wierman and William J. Tastle. Measurement theory and subsethood. In NAFIPS 2010. Toronto, CA, 2010. ISBN 978-1-4244-7858-3.

 

Academic Honesty

We are all expected to uphold all the standards and ethics of Creighton University.

The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Object-Oriented Programming

Date Subject Book Work Due
Aug 27, 2014 Introduction, overview.    
Sep 01, 2014 Python to Java    
Sep 03, 2014 BlueJ    
Sep 08, 2014 Types 2  
Sep 10, 2014 Classes 5.1-4  
Sep 15, 2014 Branching 3 HW1
Sep 17, 2014 Loops 3  
Sep 22, 2014 Methods 4 Quiz1
Sep 24, 2014 Simulation    
Sep 29, 2014 Inheritance 5.5-7 HW2
Oct 01, 2014 Polymorphism 5.5-7  
Oct 06, 2014 CandleMas   Quiz2
Oct 08, 2014 Strings 2  
Oct 13, 2014 Review   HW3
Oct 15, 2014 MidTerm    
Oct 20, 2014 FALL    
Oct 22, 2014 BREAK    
Oct 27, 2014 Array 7  
Oct 29, 2014 ArrayList 7.3  
Nov 03, 2014 Try 8  
Nov 05, 2014 Files 11 Quiz3
Nov 10, 2014 Recursion    
Nov 12, 2014 Searching 7 HW4
Nov 17, 2014 Sorting 7  
Nov 19, 2014 GUI 6  
Nov 24, 2014 MVC    
Nov 26, 2014 Calculator  
Dec 01, 2014 Model&Controller    
Dec 03, 2014 Thanks 12  
Dec 08, 2014 Review    
Dec 10, 2014 Eval    
CourseCSC222CallNumber72237
TermFall 2014Section1
Time14:00-15:15DaysM W
Final2014-12-18At08:00

Description

This course, together with CSC 221, forms an introduction to problem-solving and programming. Building upon CSC 221, this course focuses on the design and analysis of larger, more complex programs. The process of breaking down a complex problem into manageable pieces and building a working system will be stressed throughout. Since part of this process is choosing the appropriate algorithm to solve the problem at hand, we will investigate the design and analysis of some standard and useful algorithms. Similarly, we will consider various ways of structuring and transforming information so as to make it efficiently accessible and manageable.

Specific topics covered in the course will include: GUI programming and data structures (e.g., vectors, pointers, classes), defining and using abstract data types (e.g., lists, stacks, queues), static vs. dynamic implementations of data structures, and recursion as an alternative to iteration. The structures and concepts covered in this class will be a starting point for further development in subsequent computer science courses.

The specific goals of this course are:

  • To know and be able to use basic programming tools for object-oriented problem solving (e.g., classes, encapsulation, data hiding, and templates).
  • To appreciate the role of algorithms and data structures in problem solving and software design, recognizing that a given problem might be solved with a variety of algorithms and structures (e.g., object-oriented design, searching and sorting, recursion, stacks, queues, and linked lists).
  • To be able to design and implement a program to model a real-world system, and subsequently analyze its behavior.
  • To develop programming skills that can serve as a foundation for further study in computer science.

 

Course Organization:

Required Work

Learning to program requires a consistent time commitment, as each new concept and programming technique builds on those that came before. There will be four quizzes and six programs. There will also be one midterm and one final. To allow for unavoidable absences, the lowest quiz grade will be dropped. Periodically, there will be in-class exercises that will be collected and graded.

To demonstrate problem solving and programming skills, students will complete 5-6 programs throughout the semester. Each assignment will involve the design and implementation of a Java program, and may also include a written component in which the behavior of the program is analyzed. Late assignments will be accepted up to 14 days after their due date, with a 1pt a day penalty for the first week, and a 2pt a day penalty for the second week.

Grades based on
Four quizzes 20 %
In class projects 10 %
Six programming assignments 30 %
Midterm 75-minute tests 20 %
One 100-minute final exam 20 %

 

Grading
A 92-100%
B+ 87-91%
B 82-86%
C+ 77-81%
C 71-76%
D 60-70%
F 0-59%

Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and assignments will not be rescheduled except in extreme circumstances.

×

Academic Honesty

  • We are all expected to uphold all the standards and ethics of Creighton University.
  • The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Academic Honesty

We are all expected to uphold all the standards and ethics of Creighton University.

The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Objects First

JavaNotes, 7th edition

David J. Eck

Note the pdf download links at the bottom.

Local JavaNotes7

Sometimes you have to edit the latest setting list on the mac to make things work right. The file I edited was "/Library/Java/JavaVirtualMachines/jdk1.8.0_25.jdk/Contents/Info.plist" but you version may differ. The relevant section is


<key>JVMCapabilities</key>
<array>
<string>JNI</string>
<string>BundledApp</string>
<string>WebStart</string>
<string>Applets</string>
<string>CommandLine</string>
</array>

Data Structures


Date Topic Readings Hand-in
Aug 27
Course overview. (ppt/pdf)   HW1: due 9/10
Sep 1
3
LABOR DAY - NO CLASS
Java Review. (ppt/pdf)
222 material
S:1
 
8
10

Lists, Stacks & Queues: (ppt/pdf)
S:4  
 
15
17
   run-time stack, simulation queues.
Algorithm Analysis: (ppt/pdf)
 
S:2.3-2.4, 3
HW2: due 9/24
 
22
24
   searching & sorting, big-Oh,
   HW1 review (ppt/pdf),
LLM:9.6-9.7
 
 
29
Oct 1
   specialized sorts, analysis.
Linked Structures: (ppt/pdf)
 
S:4.1-4.3
 
HW3: due 10/8
6
8
   nodes, single vs. double links,
   dummy nodes, iterators.
 
 
 
 
13
15
Counting/analysis techniques. (ppt/pdf)
MIDTERM EXAM
LLM:11
 
 
 
20
22
FALL BREAK - NO CLASS
27
29
midterm review
Proofs & trees: (ppt/pdf)
 
S:2.6, LLM:2

 
Nov 3
5
   proof techniques, trees,
   tree recursion, BinaryTree class.
S:5.1-5.3
LLM:3
 
 
10
12
Binary search trees: (ppt/pdf)
   balanced trees, TreeSets & TreeMaps,
S:5.4-5.7 HW5: due 11/19
 
17
19
   heaps, priority queues, heapsort.
Hash tables: (ppt/pdf)
 
S:9
 
 
24
26
   collisions, probing, chaining.
THANKSGIVING - NO CLASS
 
S:11
 
HW6: due 12/10
Dec 1
3
  Graphs: (ppt/pdf) simple vs. directed,
adj. matrix vs. list,
LLM:5
 
 
 
8
10
   finite automata.
course overview
   
 
Dec 19
FINAL EXAM    Fri, 10:00-11:40

Sample code from class

CourseCSC321CallNumber72042
TermFall 2014Section1
Time11:00-12:15Days T H
Final2014-12-20At10:00

Description

This course builds upon the fundamental programming concepts from CSC 221: Introduction to Programming and CSC 222: Object-Oriented Programming. It provides an introduction to fundamental data structures used in solving problems, including the programming and mathematical concepts required to implement and analyze data structures. Specific data structures include lists, stacks, queues, and linked structures. Supporting concepts include logic, proof techniques, and basic graph theory.

The specific goals of this course are:

  • To understand fundamental data structures (lists, stacks, queues, sets, maps, and linked structures) and be able to implement software solutions to problems using these data structures.
  • To achieve a working knowledge of various mathematical structures essential for the field of computer science, including graphs, trees, and networks.
  • To develop analytical techniques for evaluating the efficiency of data structures and programs, including counting, asymptotics, and recurrence relations.
  • To be able to design and implement a program to model a real-world system, selecting and implementing appropriate data structures.

Students will complete 6-8 assignments throughout the semester. Most assignments will involve the design and implementation of Java programs that appropriately utilize data structures. Assignments may also contain written components, for example, justifying data structure choices or analyzing program behavior. Late assignments will be accepted up to 7 days after their due date, with a 25% penalty. Beyond 7 days, late submissions will not be accepted. There will be weekly quizzes, one 75-minute midterm exam, and a cumulative final exam.

There is no specific attendance policy for the course, although it is expected that absences will leave the student unprepared for tests and assignments. Quizzes and tests will not be rescheduled except in extreme circumstances. However, the lowest quiz grade will be dropped. The final grade for the course will be based on the following weightings:

 

weekly quizzes/exercises 05 %
6-8 programming assignments 45 %
75-minute midterm exam 20 %
100-minute final exam 30 %

At the minimum, traditional grading cutoffs for the final average will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.

Policy on Collaboration

Creighton's policy on cheating and plagiarism is spelled out in the the Student Handbook, with college procedures available online. In addition to this, the following guidelines hold pertaining to programs. Unless the assignment explicitly states otherwise, programs are to be the sole work of the student -- collaboration on the design or coding of a program is not allowed. Questions regarding homework assignments should be directed at the instructor only. Students may seek debugging assistance or clarifications on assignments using the class mailing list. Repeat: All student interactions regarding homework assignments must take place via the class mailing list!

Violations of this collaboration policy will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

 

Academic Honesty

We are all expected to uphold all the standards and ethics of Creighton University.

The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Free Online Texts:
Data Structures and Algorithm Analysis, Edition 3.2 (Java Version), Clifford A. Shaffer, 2012.
Mathematics for Computer Science, Eric Lehman, F Thomas Leighton and Albert R Meyer, 2010.

Prerequisite: CSC 222.

Software Engineering

WEEK OF MATERIAL BOOK HOMEWORK
Aug 27, 2014 Introduction    
Sep 03, 2014 Java    
Sep 10, 2014 Finding Objects   Quiz 1 (Java)
Sep 17, 2014 Classes   Requirements 1
Sep 24, 2014 GAs   Use case
Oct 01, 2014 Identifying Responsibilities   Class Diagram 1
Oct 08, 2014 Specifying Static Behavior   Class Digram 2&3
Oct 15, 2014 Dynamic Behavior    
Oct 22, 2014 FALL BREAK   FALL BREAK
Oct 29, 2014 Testing    
Nov 05, 2014 Identifying Relationships   TTT Diagrams
Nov 12, 2014 The Model   BS Diagrams
Nov 19, 2014 Design    
Nov 26, 2014 Presentations    
Dec 03, 2014 Implementing Class    
Dec 10, 2014 Implementing Class    
Dec 17, 2014 Final & Projects Due   Finals Week
CourseCSC548CallNumber73252
TermFall 2014Section1
Time11:00-12:15DaysM W
Final2014-12-20At08:00

Description

CSC 548 is concerned with modern software design. Large projects require a coordinated effort from multiple programmers. To successfully complete a large scale project using an Obeject-Oriented programming language the student needs to understand the subjects in the following outline

Requirement Analysis

  • Actors
  • Use case

Static Model

  • Object
  • Class
  • Information hiding
  • Encapsulation
  • Inheritance
  • Polymorphism
  • Late binding
  • Method overriding

Dynamic Model

  • State
  • Transition
  • Event
  • Action
  • Activity
  • Mealy machine
  • Moore machine

Course Organization:

Required Work

Learning to program large projects require cooperation and planning. Developing a software plan is one of the main goals of this class, as is the ability to coordinate and work with others.

Modern software is most often designed using an object oriented paradigm. We will delve into Object Oriented Design, OOD, its Java imlementation, and the use of the version cntrol system GIT.

Grades based on
One Test 20 %
Midterm 75-minute test 20 %
In class projects 20 %
Three-Four programming assignments 20 %
Final Project 20 %

Grading
A 92-100%
B+ 87-91%
B 82-86%
C+ 77-81%
C 71-76%
D 60-70%
F 0-59%

Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and assignments will not be rescheduled except in extreme circumstances.

Academic Honesty

We are all expected to uphold all the standards and ethics of Creighton University.

The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

You should be able to download this for free from the Creighton Library.

Object-Oriented Analysis, Design and Implementation
An Integrated Approach
Second Edition

  • Author: Brahma Dathan ● Sarnath Ramnath
  • ISBN-13 eBook: 978-3-319-24280-4
O-O ADI

Computer Applications

Date R Book Code LyX Homework Due
Aug 28, 2014 Intro UsingR.Ch1    
Sep 02, 2014 Univariate UsingR.Ch2 Intro  
Sep 09, 2014 Univariate     HW.Ch1
Sep 16, 2014 Bivariate UsingR.Ch3 Documents HW.Ch2
Sep 23, 2014 LyX & Bivariate      
Sep 30, 2014 Mulivariate - df UsingR.Ch4   HW.Ch3
Oct 07, 2014 Multivariate - Plots      
Oct 14, 2014 Bbiliography      
Oct 21, 2014 FALL BREAK     HW.Ch4A
Oct 28, 2014 Distributions UsingR.Ch5    
Nov 04, 2014 Simulations UsingR.Ch6 FSRFA13 Test
Nov 11, 2014 Confidence Intervals Queue    
Nov 18, 2014 Hypothesis Testing SQL.R images.SQL  
Nov 25, 2014 Thanksgiving     HW.Ch5
Dec 02, 2014 Regression UsingR.Ch7 Red.zip  
Dec 09, 2014 Sweave UsingR.Ch8   Research Prop
Dec 16, 2014 Final is YOUR Presentations   TBA  
CourseRDA525CallNumber73848
TermFall 2014Section1
Time11:00-12:15Days H
Final2014-12-16At13:00

Description

RDA525 comprises an introduction to two open source technologies often used in producing scholarly publications.

The first is LyX, a multi-platform document processor. LyX software can be used to write complicated documents. LyX is a front end to TeX, a typesetting system that produces superior output. LyXis based on a "What You See Is What You Mean" paradigm rather than a "What You See Is What You Get" (MSWord) paradigm. LyX also allows for the inclusion of complex mathematical formulas and elegantly formatted tables.

R is a computer language dedicaded to statistical computing and graphics. R is in wide use in the field of data analysis. Many packages are written for R to perform sophisticated procedures, such as the text mining. It is widely used by researchers in political science.

Organization

There will be a homework assignment every week. There will be a midterm and a final paper.

ASSIGNMENT NUMBER PERCENT
Midterm 1 20%
Final Presentation 1 10%
Quizes 2 10%
Paper 1 10%
Homework 10 50%

Class Cancellation Policy:

I will email you, the Admin almost always knows what is going on. I may even update the website.

Grading
A 92-100%
B+ 87-91%
B 82-86%
C+ 77-81%
C 71-76%
D 60-70%
F 0-59%

Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and assignments will not be rescheduled except in extreme circumstances.

×

Academic Honesty

  • We are all expected to uphold all the standards and ethics of Creighton University.
  • The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Academic Honesty

We are all expected to uphold all the standards and ethics of Creighton University.

The policy on academic honesty is set forth in the University bulletin.

Cheating

In particular, students caught cheating on a homework, program, quiz, or test will (at the minimum) be given a zero for that exam and will be referred to the Dean and/or Student Services for counseling and further disciplinary action. At the instructors discretion any student may be assigned an F as their class grade for any violation of the academic honesty policy of Creighton University.

Collaboration

  • Unless otherwise noted, all quizzes and tests are closed book, with no collaboration between students allowed.
  • Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!
  • Working together on homework assignments can be a positive experience and is not prohibited as long as the work you turn in is your best attempt at the assigned problem (i.e., no copying someone else's answers and turning it in as your own).

Violations of the above collaboration will be dealt with severely, with possible outcomes including a zero or negative grade, immediate failure of the course, and expulsion from the university. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Verzani

Using R for Introductory Statistics by John Verzani
Publisher: Chapman and Hall/CRC; 1 edition (November 29, 2004)
ISBN-13: 978-1584884507

R

LyX

  • LyX | LyX – The Document Processor
    An open source document processor running on many Unix platforms (including MacOS X), OS/2, and under Windows/Cygwin. LyX produces output using LaTeX in the ...
    www.lyx.org
  • JabREF Download Help
  • Mac Templates Plus

LaTeX

  • MacTeX - TeX Users Group
    Apr 6, 2009 ... An easy-to-install open source TeX distribution for MacOSX. It is essentially gwTeX plus XeTeX, with a simple GUI installer and a few extra ...
    www.tug.org/mactex
  • TeX Live - TeX Users Group
    Apr 21, 2009 ... A TeX CD compiled by the TeX Users Groups. Contains ready-to-run TeX systems for most types of Unix, Mac OSX, and Windows, ...
    www.tug.org/texlive/
  • JabREF A java GUI for BIBTEX
  •  
  • Install

    TeX first!

  • Change A4 to Letter!
    texlive
  • LyX Next

  • Don't Install MikTeX! My guess TexLive is at C:\texlive\2012\bin\win32.
  • LyX

JM&C

Mark J. Wierman | mwierman@creighton.edu
Journalism Media & Computing | Creighton University
2500 California Plaza | Omaha NE | 68178 | 402.280.1782
Copyright © 2015 Creighton University JM&C