Elizabethtown Area School District

Transcription

1 Computer Programming I Course Number: 270 Grade Level: 9-12 Length of Course: 1 Semester Total Clock Hours: 120 hours Length of Period: 80 minutes Date Written: 8/22/05 Periods per Week/Cycle: 5 Written By: Mark licker Credits (if app.): 1 Weighting 1.0 Prerequisite: Algebra I Course Description: This course introduces students to computer programming in the Pascal language and provides hands-on experience with computers. The Pascal language is used as a tool for solving complex mathematical problems. Some topics include number notation, branches, loops, program analysis, numeric and string variables, and arrays. page 1

2 I. Overall Course/Grade Level s Students will KNOW and be able TO DO the following as a result of taking this course. A. Translate an algorithm into the Pascal language. B. Solve mathematical problems using a computer. C. Use control statements to perform specified tasks within a program. D. Describe the history of the development of the computer.. xplain how a computer operates. F. Describe how to design Pascal programs. G. Describe how to control the execution of a program. H. Distinguish between the various data types. I. Gain a working knowledge of how to input/output data. J. xplain how to modularize programs. page 2

3 II. Content Major Areas of Study List all units of study below: Unit stimated Time Materials 1. Intoduction to Computers and Computer Science 1-2 weeks 2. Introduction to Pascal Programming 1-2 weeks 3. Data Types and Arithmetic 2-3 weeks 4. Input/Ouput 2-3 weeks 5. Selection Statements 2-3 weeks 6. Looping 2-3 weeks 7. Procedures and Functions 1-2 weeks 8. Arrays 2-3 weeks 9. American Computer Science League (ACSL) Topics 2-3 weeks page 3

4 Name of Unit: Introduction to Computers and Computer Science ssential Question for the Unit: What is a computer? A. How do you hook-up the hardware of a computer system? F B. What is computer science? C. What is the function of each part of a computer? F D. How were computers developed?. What are the types of a computer system?, F, G page 4a

5 Name of Unit: Introduction to Pascal Programming ssential Question for the Unit: How is a Pascal program structured? A. How do you write algorithms for a task? A, B B. How do you write a program to output information? C. How do you translate an algorithm into a Pascal program? A A D. What are the most common errors? A. What is an algorithm? G F. What kind of process should you use to develop a program? G G. What are the main components of a program? F, G H. How was the Pascal language developed and what are its uses?, G I. What are reserved words in the Pascal language? G page 4b

6 Name of Unit: Data Types and Arithmetic ssential Question for the Unit: How do you perform arithmetic within a computer program? A. How do you know what data type to use? C B. How do you translate algebraic expressions into Pascal program statements? A C. Can you perform computer arithmetic to determine the results that should be obtained? D. How do you use variables in assignment statements, expressions, and output statements? B B, C. What are the differences between data types? G, K F Which arithmetic operations require integers? G, K G. Which arithmetic operations require real numbers? G, K H. How are the various data types stored in memory? I F I. How are constants used in a program? I G, K page 4c

7 Name of Unit: Input/Output ssential Question for the Unit: How is input and output performed in the Pascal programming language? A. How do you format output in a readable manner? A, J B. How do you write programs that will accept information from the user? A, J C. What are user-friendly programs? A, G, J D. What are the input and output commands? G, J page 4d

8 Name of Unit: Selection Statements ssential Question for the Unit: How do you make decisions in Pascal programs? A. How do you use the Boolean data type? A, D, F, G, H B. What is the correct use of relational operators? A, D, G, H C. How do you use logic to form compound selection statements? D. How do you write programs that will choose the appropriate course of action based on user input?. How do you use the if-then, if-then-else, and case statements appropriately? F. Where should you use comments in your programs? A, D, G, H A, D, G, H A, D, G, H D, G page 4e

9 Name of Unit: Looping ssential Question for the Unit: How do you control the execution of a Pascal program? A. How do you use a for loop in a program? A, B, D, G, H B. How do you use a while/do loop in a program? A, B, D, G, H C. How do you use a repeat/until loop in a program? A, B, D, G, H D. How do you write programs that will handle invalid input?. How do you use selection statements within loop structures? A, D A, B, D F. What is the appropriate style for using loops? A, D G. What is a loop control variable and what are its uses? G, H, I page 4f

10 Name of Unit: Procedures and Functions ssential Question for the Unit: What are procedures and functions and how are they used in a Pascal program? A. How do you use standard procedures? A, G, K B. How do you use standard functions? A, B, G, K C. How do you write your own procedures? A, G, K D. How do you write your own functions? A, B, G, K. Where can variables be used in procedures and functions? F. What is modularity and how do you use it in a program? A, G, I, K A, G, K page 4g

11 Name of Unit: Arrays ssential Question for the Unit: How do you deal with large amounts of data? A. What is an array? C, I B. How do you use an array in a Pascal program? B, C, G C. How do you use loops with arrays to solve programming problems? A, B, C, D D. How do you input and/or output array elements? A, C page 4h

12 Name of Unit: ACSL Topics ssential Question for the Unit: What are the main mathematical concepts underlying computer science? A. How do you express data in different bases, namely binary, octal, and hexadecimal? D B. How do you simplify and solve Boolean expressions? D C. What are stacks, queues, and binary search trees and how are they set-up in computer memory? D D. How do you evaluate a digital electronic circuit? D. What is graph theory and how does it apply to computer programming? D F. What is LISP programming and how is it used? D G. How do you evaluate mathematical expressions in prefix, postfix, and infix notation? D H. How do you evaluate recursive functions? D page 4i

13 III. Course Assessments Check types of assessments to be used in the teaching of the course. (Provide examples of each type.) _X Objective Tests/Quizzes _X Constructed Responses ssays _X Reports _X Projects Portfolios Presentations Performance tasks _X Computer Programs Response Journals Logs _X Computer Simulations X_ Research Papers Class Participation Notetaking Daily Assignments Writing Samples Provide copies of common assessments that will be utilized for all students taking this course. Overall course/grade level standards will be measured by a common course assessment. Unit objectives will be measured on an ongoing basis as needed by the classroom teacher to assess learning and plan for instruction. List common assessements below and recommended date/time frame for administration (at least quarterly). page 5

14 IV. xpected levels of achievement Current grading scale: A: % B: 83-91% C: 74-82% D: 65-73% : 0-64% PA Proficiency Levels Advanced Proficient Basic Below Basic Attach rubrics, checklists, or other documentation noting how levels of proficiency will be determined for common assessments. The following scoring documents have been developed for this course: page 6