CRN 21256 Course Administration - UCO Department of Computer

Programming II
CMSC 2613
Document:
Revised:
Course Title:
Course Number:
Section:
Instructor:
Office Hours:
Text:
References:
Prerequisites:
Programming
Projects:
Course Scoring:
Grading:
Notice:
Caveat:
Class Web Page:
Course Directory
Student Disabilities:
CRN 21256
Course Administration
Spring 2015
Programming II Course Administration
April 22, 2015
Programming II
CMSC 2613
CRN 21256 Monday, Wednesday, and Friday, 10:00 – 10:50 a.m. MCS
113
Dr. Thomas R. Turner; Office: MCS 134; Work Phone: 974-5383, e-mail:
[email protected]
Time
Monday
Wednesday
Friday
9:00 – 9:50 a.m.
MCS 134
MCS 134
MCS 134
Time
Tuesday
Thursday
5:30 – 6:30 p.m.
MCS 134
MCS 134
Please make an appointment to visit me during my office hours.
Kruse, R. L. and Ryba, A. J. Data Structures and Program Design in C++,
Prentice-Hall, Inc. 1999 ISBN 0-13-768995-0
1. Horstman, Cay and Budd, Timothy Big C++ 2nd Ed. Wiley 2009 ISBN
978-0-470-38328-5
2. Stroustrup, B. The C++ Programming Language 3rd Ed.; AddisonWesley 1997 ISBN 0-201-88954-4
1. CMSC 1613, Programming I
Ten programming projects and two reports are assigned. Projects and
reports are due at the beginning of class on the date given in this
document unless otherwise specified. Exams that are administered in
class are due at the end of the class period.
Task
Date
Value
Test 1
2-16
150
Test 2
4-6
150
Final Test
5-8
300
Programming Projects
Table 2
250
Reports
Table 3
50
Total
900
A: 90% (810-900); B: 80-89% (720-809); C: 70-79% (630-719); D: 60-69%
(540-629); F: 59% (0-539) and below.
Beepers and cellular phones are prohibited in class.
This lecture schedule, programming projects and due dates, number
and dates of tests are all subject to change. Changes are presented in
class You are responsible for the material presented in class.
The course administration and assignments can be found on URL
http://www.comsc.uco.edu/~trt/cs2613.html
The course directory is on the department computer (cs.uco.edu). You
can find project test data files in the course directory. ~tt/cs2613/
Students with disabilities who require accommodations may contact
Disability Support Services. http://bronze.uco.edu/disability_support/
1
Programming II
CMSC 2613
CRN 21256
Absences:
Course Administration
Spring 2015
1. A 45-point bonus is awarded to any student having no recorded
absences. The attendance bonus will be denied to any student who
is absent for any reason. The attendance bonus will not be granted
to any student having an excused absence.
2. A student may be absent for up to three (3) classes without penalty:
these three classes are counted as excused absences. No
notification or documentation is required except when a test is
given.
3. Fifteen (15) points will be deducted from the student’s final score
for the fourth and every subsequent class for which the student is
recorded absent.
4. A student will receive a zero on an examination unless written
justification is presented to the instructor. Acceptable justification
includes university sanctioned travel, military obligation, serious
illness or injury, or death or serious illness in the immediate family.
Work-related conflicts are not acceptable excuses.
Academic
Honesty Students are encouraged to collaborate. However, each student must
and Collaboration:
make a unique contribution to any joint effort and that unique
contribution must be visible in the work submitted by the student.
Partially or completely copied assignments shall be considered a prima
facie case for academic dishonesty. Every student can make a unique
contribution by commenting their code.
2
Programming II
CMSC 2613
Lecture
1
Date
1-12
2
3
1-14
1-16
4
1-21
5
1-23
6
1-26
7
1-28
8
1-30
9
10
11
2-2
2-4
2-6
12
13
2-9
2-11
14
2-13
15
16
17
2-16
2-18
2-20
18
2-23
19
2-25
20
2-27
21
22
3-2
3-4
23
24
3-6
3-9
CRN 21256
Table 1. Lecture Schedule
Topic
Course administration
Command line arguments
Command line arguments demonstration
Structures and classes
Formatted output
References
Dynamic memory allocation
Program structure and makefiles
Selection Sort
Project p01 reprise
Turn in p01: Mean, Median and Mode
Stacks and Palindromes
class Stack (array implementation)
template class Stack (array implementation)
Postfix evaluation
Postfix evaluation
Turn in p02: Bracket Matching
class Stack (element implementation)
template class Stack (element implementation)
p03 in-class demonstration
Turn in r01: Library research
Simulation
Simulation Mechanics
Turn in p03: Postfix evaluation
class Queue (array implementation)
template class Queue (array implementation)
Ice – Class cancelled
Test 1
Test 1 Reprise
Turn in p04: Simple Simulation
Intermediate Simulation
Intermediate Simulation Mechanics
Intermediate Simulation Mechanics
class Queue (element implementation)
class Queue (element implementation)
template class Queue (element implementation)
class List (element implementation)
Weather – Class cancelled
Turn in p05: Checkout line simulation
List iterators (element implementation)
template class List (element implementation)
3
Course Administration
Spring 2015
Reference
Lecture notes
Lecture 1
Lecture 1
Lecture 2
Lecture 3
Lecture 4
Lecture 5
Lecture 6
Lecture 7
Lecture 8
Lecture 9
Lecture 10
Lecture 11
Lecture 11
Lecture 12
Lecture 13
Lecture 14
Lecture 15
Lecture 16
Lecture 17
Lecture 18
Lecture 19
Lecture 19
Lecture 20
Lecture 20
Lecture 21
Lecture 22
Lecture 23
Lecture 24
Programming II
CMSC 2613
Lecture
25
26
27
Date
3-11
3-13
3-23
28
29
3-25
3-27
30
31
32
3-30
4-1
4-3
33
34
35
4-6
4-8
4-10
36
37
4-13
4-15
38
39
40
4-17
4-20
4-22
41
4-24
42
4-27
43
44
4-29
5-1
45
5-8
CRN 21256
Table 1. Lecture Schedule (continued)
Topic
class Set (element implementation)
template class Set (element implementation)
class List (array implementation)
Turn in p06: Integer set 1
Binary Search
List iterators (array implementation)
Turn in r02: Postfix evaluation
Operator Overloading
template class Set (array implementation)
Trees
Turn in p07: Integer set 2 and operator
overloading
Test 2
Test 2 Reprise
class Tree (element implementation)
template class Tree (element implementation)
class Tree (element implementation)
Time Complexity Examples
Turn in p08: Binary tree traversal
No Class
Binary Search Time Complexity
Priority Queue (Heap)
class Heap
Turn in p09: Time complexity
Priority Queue (Heap)
class Heap
Turn in p10: Heap sort
Last day to resubmit projects p01 – p07
Margin
Distribute summary score sheets.
Student Perception on Instructor Effectiveness
(Teacher Evaluations)
Final Exam Friday, May 8, 2015 at 9:00 – 10:50
a.m.
4
Course Administration
Spring 2015
Reference
Lecture 25
Lecture 26
Lecture 27
Lecture 28
Lecture 29
Lecture 32
Lecture 33
Lecture 34
Lecture 35
Lecture 36
Lecture 36
Lecture 38
Lecture 39
Lecture 40
Lecture 41
Lecture 40
Lecture 41
Comprehensive
Programming II
CMSC 2613
Project
1
2
3
4
5
6
7
8
9
10
Total
Due
1-23
1-30
2-11
2-20
3-4
3-23
4-3
4-15
4-22
4-27
Report
1
2
Total
Due
2-6
3-27
CRN 21256
Value
25
25
25
25
25
25
25
25
25
25
250
Value
25
25
50
Course Administration
Spring 2015
Table 2. Programming Projects
Description
p01: Selection sort
p02: Palindromes
p03: Postfix evaluation
p04: Simple simulation
p05: Checkout line simulation
p06: Integer set 1
p07: Integer set 2 and operator overloading
p08: Binary tree traversal
p09: Time complexity
p10: Heap sort
Table 3. Reports
Description
r01: Library research
r02: Postfix evaluation
5