COURSE OF STUDY UNIT PLANNING GUIDE FOR: COMPUTER SCIENCE 1 5 CREDITS GRADE LEVEL: 9-12 FULL-YEAR COURSE PREPARED BY: SUSIE EISEN SHANNON WARNOCK, SUPERVISOR OF MATHEMATICS AND SCIENCE JULY 2017 DUMONT HIGH SCHOOL DUMONT, NEW JERSEY
Computer Science 1 Grades 9-12 Full Year 5 Credits (Weighted Course, Prerequisite: Completion of Algebra 1) Students work individually on computers in a laboratory environment on prescribed and projects. Formal instruction is also included during class time. Emphasis is on structured programming and learning the fundamentals of the Java language. Topics covered include working with variables, using string objects, and using selection structures and loops. This course is intended to serve both as an introduction to a more advanced level course and/or for students planning to major in computer science in college. COURSE REQUIREMENTS AND EXPECTATIONS A student will receive 5 credits for successfully completing course work. A grade of D or higher must be achieved in order to pass the course. The following criteria are used to determine the grade for the course: A. - 25% of the grade Tests will be given at the end of each major section. The teacher will use professional judgment to determine when other evaluation procedures will be administered. B. Programs and Exercises - 75% of the grade Computer and exercises are to be completed in time allotted by each student s contract. C. Final Examination The final examinations will count as follows: Full-Year Courses Weighting Semester Courses Weighting Quarter 1 22.5% of final grade Quarter 1 45% of final grade Quarter 2 22.5% of final grade Quarter 2 45% of final grade Quarter 3 22.5% of final grade Final Exam 10% of final grade Quarter 4 22.5% of final grade Final 10% of final grade Any work missed when a student is absent is expected to be made up in a reasonable time. It is the student s responsibility to see the teacher regarding this work. Usually one or two days are allowed for each day absent unless there are unusual circumstances, in which case, the student is to make special arrangements with the teacher. Extra help is available. Ask your teacher where he/she will be when you are planning to come in for extra help.
(NJSLS and Objectives) 1) Provide a basic overview of computer hardware and software 2) Provide a basic overview of the Java programming language 3) Identify basic types of programming errors 4) Write pseudocode for basic 5) Use variables in basic 1) What are the basic components of a computer 2) What is a computer program? 3) What are types of errors encountered while programming? 4) What are algorithms, pseudocode, and flow charts? 5) How can variables be used to create a computer program? 6) What are some types of variables used in programming? UNIT 1: INTRODUCTION CHAPTERS COVERED: CHAPTER 1 & SECTIONS 2.2 & 5.5 NUMBER OF CLASS PERIODS: 19 1) Computer Programs 2) The Anatomy of a Computer 3) The Java Programming Language 4) Becoming Familiar with Your Programming Environment 5) Analyzing Your First Program 6) Errors 7) Problem Solving: Algorithm Design 8) Variables 1) First Attempt Program 2) Basics of Computers PowerPoint 3) Chapter 1 Exercises 4) Lecture and notes on using variables 5) Practice problems involving variables 6) Comprehensive Variable Program 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) Hardware 2) Software 3) Input Device 4) Output Device 5) CPU 6) Motherboard 7) Primary Storage 8) Secondary Storage 9) Computer Program 10) Algorithm 11) High-Level Programming Language 12) Low-Level Programming Language 13) Java 14) Compiler 15) Machine Code 16) Java Virtual Machine 17) Source Code 18) Class File 19) Integrated Development Environment 20) Compile-Time Error 21) Run-Time Error 22) Pseudocode 23) Flow Chart 24) Variable 25) Initialize 2) Graded practice problems 3) Graded comprehensive program 4) Quiz 5) Unit Test
(Standards and Objectives) 1) Choose appropriate types for representing numeric data 2) Write arithmetic expressions in Java 3) Write that read user input and print formatted output 4) Use the if statement to implement a decision 5) Implement comparisons of numbers 6) Implement complex decisions that require multiple if statements 7) Implement decisions whose branches require further decisions 8) Use Boolean data type to store and combine conditions that can be true or false 9) Use a debugger to analyze a program 10) Use constants within 11) Format decimals using a variety of techniques UNIT 2: CONDITIONALS & BASIC DATA TYPES CHAPTERS COVERED: SECTIONS 2.6, 4.1-4.3, 5.1-5.4, 5.7, 6.10 1) What are various types of numbers and what is the difference between them? 2) What are the various ways of performing arithmetic operations on numbers? 3) What is the code for reading user input? 4) What are if statements used for? 5) What is Boolean data type? 6) What is a debugger? 7) What are constants and how when should they be used in? 8) What are techniques that can be used to format decimals? NUMBER OF CLASS PERIODS: 24 1) Numbers a) Number Types b) Constants 2) Arithmetic a) Arithmetic Operations b) Increment/Decrement c) Integer Division and Remainder (Modulus) d) Powers and Roots e) Converting variable types 3) Input and Output a) Reading Input b) Formatted Output 4) The if Statement 5) Comparing Values 6) Multiple Alternatives 7) Nested Branches 8) Boolean Variables and Operators 9) Constants 10) Formatting Decimals 1) Lecture and notes on numbers, arithmetic, reading input and formatting output 2) Practice problems involving various computations of numbers 3) Lecture and notes on if statements & boolean logic 4) Practice problems involving if statements 5) Comprehensive Conditionals and Formatting Program 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) Operators 2) Modulus 3) if Statement 4) Relational Operator 5) else if 6) Debugger 7) Binary 8) Primitive Type 9) Bit 10) Byte 11) short 12) long 13) float 14) char 15) boolean 16) Constant 17) Rounding 18) Formatting 19) Cast Operator 2) Graded practice problems 3) Graded comprehensive program 4) Quiz 5) Unit Test
(Standards and Objectives) 1) Use strings in 2) Use code to determine the length of a string 3) Concatenate strings 4) Read strings as user input 5) Use escape sequences in 6) Explain the difference between strings and characters 7) Extract and use substrings in 8) Use the API documentation for finding method descriptions and packages 9) Incorporate methods in 10) Create methods and use them in 1) How can programmers determine the length of a string? 2) What does it mean to concatenate a string? 3) What is an escape sequence? 4) What is the difference between strings and characters? 5) What is a substring and how can it be used in? 6) What is the API documentation? 7) What is a method? 8) How do programmers create and utilize methods? UNIT 3: Strings & Methods CHAPTERS COVERED: Sections 4.5, 2.3, 2.5, 2.6 NUMBER OF CLASS PERIODS: 20 1) The String Type 2) Concatenation 3) String Input 4) Escape Sequences 5) Strings and Characters 6) Substrings 7) API Documentation 1) Lecture and notes on the string type and reading user input involving strings 2) Lecture and notes on string length and concatenation 3) Lecture and notes on escape sequences 4) Practice problems involving basic string methods 5) Lecture and notes on strings vs. characters 6) Lecture and notes on substrings 7) Practice problems involving additional string methods 8) Comprehensive String Program 9) Lecture and notes on Methods 10) Practice problems involving methods 11) Comprehensive Method Program 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) Characters 2) String 3) String Variable 4) String Literal 5) Concatenate 6) Escape Sequence 7) Unicode 8) Substring 9) Method 10) Argument 11) Parameter 12) Accessor Method 13) Mutator Method 14) API Documentation 2) Graded practice problems 3) Graded comprehensive program 4) Quiz 5) Unit Test
(Standards and Objectives) 1) Explain the flow of execution in a loop 2) Use the technique of hand-tracing to analyze the behavior of a program 3) Use for loops for implementing countcontrolled loops 4) Choose between the while loop and the do loop 5) Implement loops that read sequences of input data 6) Use the most common loop algorithms 7) Use nested loops to implement multiple levels of iteration 8) Use recursion in 1) What is a for loop? 2) What is a while loop? 3) What is a do loop? 4) What is the difference between a while loop and a do loop? 5) When is it best to use one loop over another? 6) What is recursion? UNIT 4: Loops CHAPTERS COVERED: Chapter 6 NUMBER OF CLASS PERIODS: 20 1) The for Loop 2) The while Loop 3) The do Loop 4) Break and Continue 5) Common Loop Algorithms 6) Nested Loops 7) Recursion 1) Lecture and notes on for loops, while loops, and do loops 2) Practice problems involving loops 3) Lecture and notes on recursion 4) Practice problems involving recursion 5) Comprehensive Loops Program 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) for loop 2) while loop 3) do loop 4) Hand-Tracing 5) Break 6) Continue 7) Recursion 2) Graded practice problems 3) Graded comprehensive program 8) 4) Unit Test
(Standards and Objectives) 1) Use arrays for collecting values 2) Know when to use the enhanced for loop 3) Know and use common array algorithms 4) Create and use partially filled arrays 5) Remove elements from arrays 6) Insert elements into arrays 7) Swap elements between arrays 8) Copy arrays 9) Use two-dimensional arrays for data that is arranged in rows and columns 10) Use array lists for managing collections whose size can change 11) Use sets (hashsets, treesets, etc.) in 12) Use hashmaps in 1) How do programmers store and represent data internally beyond a basic data type? 2) What is an array? 3) What is the enhanced for loop? 4) What can the enhanced for loop be incorporated into a program? 5) What are common algorithms that can be done using arrays? 6) How can a programmer account for partially filled arrays? 7) How can array elements be removed, inserted, or swapped? 8) What is a twodimensional array? 9) What is an array list? 10) What is the difference between an array and an array list? 11) What are sets and what are they used for? 12) What are hashmaps and what are they used for? UNIT 5: Data Structures CHAPTERS COVERED: Sections 7.1-7.3, 7.6-7.7, 15.3, 15.4 NUMBER OF CLASS PERIODS: 39 1) Declaring and Using Arrays 2) The Enhanced for Loop 3) Common Array Algorithms a) Filling b) Sum and Average c) Maximum and Minimum d) Element Separators e) Linear Search f) Reading Input g) Partially Filled Arrays (if time) 4) Additional Array Algorithms (if time) a) Removing Elements b) Inserting Elements c) Swapping Elements d) Copying Arrays 5) Two-Dimensional Arrays a) Declaring Two- Dimensional Arrays b) Accessing Elements 6) Array Lists 7) Sets a) Hashset b) Treeset 8) Hashmaps 1) Lecture and notes on declaring and using arrays 2) Basic practice problems involving arrays 3) Lecture and notes on the enhanced for loop 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) Array 2) Array Length 3) Index 4) Element 5) Array Reference 6) Bounds Error 7) Enhanced for Loop 8) Two-Dimensional Array 9) Matrix 10) Row 11) Column 12) Array List 13) Type Parameter 14) Constructor 15) Set 16) Hashset 17) Treeset 18) Hashmap 2) Graded practice problems 3) Quiz (possibly more than one) 4) Graded comprehensive program 5) Unit Test(s)
4) Lecture and notes on common array algorithms 5) Practice problems involving loops and arrays 6) Lecture and notes on array lists 7) Practice problems involving array lists 8) Comprehensive Array/Array List Program 9) Lecture and notes on partially filled arrays (if time) 10) Lecture and notes on additional array algorithms (if time) 11) Practice problems involving additional array algorithms (if time) 12) Lecture and notes on twodimensional arrays 13) Practice problems involving two-dimensional arrays 14) Comprehensive Two- Dimensional Array Program 15) Lecture and notes on sets (hashsets and treesets) 16) Practice problems involving sets 17) Lecture and notes on hashmaps 18) Practice problems involving hashmaps 19) Comprehensive Sets and Hashmaps Program
(Standards and Objectives) 1) Use algorithms for accessing data 2) Use the selection sort algorithm 3) Use the merge sort algorithm 4) Use a linear search 5) Use a binary search 6) Incorporate different algorithms for the same task that differ in performance 1) What are algorithms for accessing data? 2) What is the difference between sorting and searching? 3) What is a selection sort and how can it be implemented in? 4) What is a merge sort and how can it be implemented in? 5) What is a linear search and how can it be implemented in? 6) What is a binary search and how can it be implemented in? UNIT 6: Sorting & Searching CHAPTERS COVERED: Chapter 14 NUMBER OF CLASS PERIODS: 11 1) Sorting a) Selection Sort b) Merge Sort 2) Searching a) Linear Search b) Binary Search 1) Lecture and notes on sorting 2) Practice problems involving sorting 3) Lecture and notes on searching 4) Practice problems involving searching 5) Comprehensive Sorting/Searching Program 1) Lecture and notes 2) Practice Problems 3) More involved Programs 4) Review day before test 1) Selection Sort 2) Merge Sort 3) Linear Search 4) Binary Search 2) Graded practice problems 3) Graded comprehensive program 4) Unit Test
(Standards and Objectives) 1) Use variables in 2) Use if/else statements in 3) Use strings in 4) Use methods in 5) Use loops in 6) Use data structures in UNIT 7: Final Exam CHAPTERS COVERED: All chapters and sections from previous units 1) How do programmers use variables in? 2) How do programmers use if/else statements in? 3) How do programmers use strings in? 4) How do programmers use methods in? 5) How do programmers use loops in? 6) How do programmers use data structures in? NUMBER OF CLASS PERIODS: 3 1) 3 days of final program/exam (last 2 class periods and then the 2- hour final exam period) 1) Review packets 2) Practice Problems/Programs 1) All vocabulary from previous units 2) Graded Final Program/Exam
High School Mathematics Modifications/Strategies for Student Populations *Interdisciplinary **21 st Century Themes and Skills 21 st Century Themes & Skills** Special Education/Gifted ELL At Risk of School Failure Benchmarking Career Skills 1. Multimedia/Videos 2. Public Speaking 3. Career Exploration Communication 1. Presentations w/visuals 2. Think-Pair-Share 3. Student presentations Collaboration 1. Cooperative Projects 2. Project-based Learning 3. Jig Saw 4. Set and Meet goals Creativity 1. Visual Interpretations 2. Brainstorming 3. Problem Solving and Design Critical Thinking 1. Problem-Based Learning 2. Develop effective strategies 3. Problem Solving a. Evaluate b. Compare Special Education 1. Providing Notes/Modified Notes a. PowerPoints b. SMART Board Notes 2. Guided Notes a. Highlighting b. Underlining c. Providing Definitions 3. Modeling 4. Chunking 5. Scaffolding 6. Repeat/Rephrase 7. Manipulatives/Visuals 8. Realia 9. Graphic Organizers 10. Study Guides 11. Portfolios 12. Modified Texts 13. Conferencing a. Student b. Parent c. Guidance d. Administration e. CST 14. Tutoring/Extra Help Gifted 1. Self-Directed Learning Independent Research* 1. Bilingual Math Dictionaries 2. Total Physical Response 3. Native/Non-Native Speaker Groupings 4. Providing Notes/Modified Notes a. PowerPoints b. SMART Board Notes c. Include native language in guided notes 5. Guided Notes a. Highlighting b. Underlining c. Providing Definitions in English and native language 6. Modeling 7. Chunking 8. Scaffolding 9. Repeat/Rephrase 10. Manipulatives/ Visuals 11. Realia 12. Graphic Organizers 1. Providing Notes/ Modified Notes a. PowerPoints b. SMART Board Notes 2. Guided Reading a. Highlighting b. Underlining c. Providing Definitions 3. Modeling 4. Chunking 5. Scaffolding 6. Repeat/Rephrase 7. Manipulatives/Visuals 8. Realia 9. Study Guides 10. Portfolios 11. Modified Texts 12. Priority Seating 13. Checking Assignments Pads 14. Conferencing a. Student b. Parent c. Guidance d. Administration e. CST 15. Tutoring/Extra Help 1. Pre and Post SGO 2. Study Island 3. Post-lesson exit slips 4. Self-assessment
c. Contrast d. Analyze e. Synthesize f. Create Technology 1. PARCC Practice 2. SMART Board 3. Graphing Calculator 4. Other Graphing technologies 5. ipads 6. SMART Response Technology 7. Quizlet 8. Socrative 9. Kahoot 10. Flubaroo 11. Wikis 12. Google Drive 13. Study Island 14. Virtual High School 2. Individualized Pacing 3. Supplemental Challenge Problems 4. Virtual High School 13. Study Guides 14. Portfolios 15. Modified Texts 16. Conferencing a. Student b. Parent c. Guidance d. Administration e. CST 17. Tutoring/Extra Help