You must obtain the instructor's advance permission to use any recording device, computer, or other electronics during lecture. No phone or network use during class. Pagers, phones, and audio devices must be silenced or turned off in the classroom. No food or tobacco in the classroom.

The course website (https://cs.mtsu.edu/~untch/6020) contains notices and assignment postings. You are responsible for checking the website and monitoring for course e-mail daily (weekdays only). Following MTSU's FERPA-based e-mail policies, all course-related e-mail will be sent to your MTMAIL account; in turn, you are required to use your MTMAIL account when communicating with the instructor.

The grade in the course will be calculated using two methods, X and Y above; the calculation that yields the higher value will be used in assigning the grade. The grading scale is: A (90-100);   B+ (88-89);   B (82-87);   B- (80-81);   C (70-79);   D (60-69);   F (below 60);   averages are rounded to the nearest integer.

Students are expected to complete all projects (defined below); the highest grade attainable if missing three or more projects is C.

• Nell Dale and Chip Weems, Programming and Problem Solving in C++
        (Comprehensive 6th Edition), 2014.
• [A Python Textbook/Reference]: To Be Announced

• Apply functional decomposition in the design of a program.
• Develop an algorithmic solution to solve a problem using sequence, selection, and iteration.
• Demonstrate the use of procedural abstraction through the design and implementation of effective procedures and functions.
• Construct a readable, well documented, and syntactically correct high-level language program.
• Explain the syntax and semantics of a target set of high-level language elements.
• Use tools to edit, compile, link, and execute a program.
• Predict the state changes of a program in execution and trace its execution.
• Explain the concept of abstract data type (ADT).
• Use fundamental data structures (e.g., list, stack, queue, trees) in an algorithmic solution.
• Determine the resource requirements of simple algorithms and fundamental data structures.
• Identify the most appropriate data structures and algorithms for a range of applications.

• EXERCISES: Homework assignments that are classified as exercises are due at the beginning of class of the day due. NO EXERCISE WILL BE ACCEPTED LATE.

• PROJECTS: Homework assignments that are classified as projects are due by midnight (defined to be 11:59pm) of the day due. Late projects will be accepted subject to the following grade reduction schedule: 2^(N+1) percentage points, where N is the number of days late. Only weekdays are counted. For example, an assignment handed in one day late will have 4 (=2²=2¹⁺¹) percentage points taken off; an assignment handed in two days late will have 8 (=2²⁺¹) percentage points taken off; and an assignment handed in one week after it is due will have 64 (=2⁵⁺¹) percentage points taken off. (Percentage points are calculated according to a project's point maximum. Say a project is worth 25 points maximum. Then a penalty of 64 percentage points equals 16 points off.)

               Your Name
               CSCI 6020 (Dr. Untch)
               Exercise #1
               Due: mm/dd/yy