|
|
CLASS NOTES:
SD110 Computer Programming Logic |
|
|
SAMPLE SYLLABUS! (For
reference only - not an official syllabus.)
|
|
OVERVIEW:
|
|
7/1/04 |
|
MINNESOTA SCHOOL OF BUSINESS GLOBE COLLEGE TECHNICAL
COURSE SYLLABUS
|
| COURSE NUMBER: | SD110 | COURSE TITLE: | COMPUTER PROGRAMMING LOGIC |
| COURSE LENGTH: | 12 WEEKS | CREDIT HOURS: | 4 |
| PREREQUISITES: | NONE | CONTACT HOURS: | 40 (LECTURE 40) |
| TEXT: | PROGRAMMING LOGIC & DESIGN, Third Edition, Joyce Farrell. USA: Thompson Course Technology, ISBN: 0-619-21691-3 |
|
COURSE DESCRIPTION: This course w ill teach students the application of logic and structured design to the construction of computer programs. The course is not language specific so that it may be applied across a range of programming languages such as 3rd generation, script, and object-oriented variants. Students w ill learn pseudocode, algorithms, data structures and other tools and skills used to design programs. OBJECTIVES: Upon completion of this course the student will be able to: |
|
1.
|
Identify the logic and design principles underlying programming languages. | ||
|
2.
|
List the operations and terminology involved in the program’s structure. | ||
|
3.
|
Identify the tools available to the programmer to structure the program. | ||
|
4.
|
Apply the use of pseudocode, structured English, flow charts, & data flow diagrams in program design. | ||
|
5.
|
Apply problem-solving skills and use some softw are development tools. | ||
|
6.
|
Generate program designs using algorithms and data structures. | ||
|
7.
|
Create structured programs |
|
COURSE OUTLINE
|
||||
|
Topic(s) and Class Activities
|
Required Reading
|
|
Week #1
|
Introduction to algorithms, data structures, Development of programming languages Introduction to algorithms, basic data structures, and basic design conventions. |
Chapter 1
|
||
|
Week #2
|
Structured program design Use of Structured English and pseudocode |
Chapter 2
|
||
|
Week #3
|
Documentation, modularization, and hierarchies Modules hierarchy charts and documentation |
Chapter 3
|
||
|
Week #4
|
Problem Solving Techniques Procedural language, initialization tasks, main structure, finishing and housekeeping. |
Chapter 4
|
||
|
Week #5
|
Decision structures Making decisions, Boolean AND/OR Logic |
Chapter 5
|
||
|
Week #6
|
Loop structures Loops |
Chapter 6
|
||
|
Week #7
|
Arrays Arrays |
Chapter 7
|
||
|
Week #8
|
Arrays Sorting and Searching |
Chapter 8
|
||
|
Week #9
|
Number systems Number Systems and Number representation |
Chapter 9
|
||
|
Week #10
|
Input and output validation Input and output validation |
Chapter 10
|
||
|
Week #11
|
Program optimization techniques Program optimization techniques |
Chapter 11
|
||
|
Week #12
|
Final Project
|
---
|
| Written projects / reports 300 Classroom exercises 200 Final Project 300 Participation 200 1,000 points The final grade for the course is based on an accumulation of points in each of the above areas and w eighted accordingly. A total of 1000 points are possible. These points are based on the follow ing percentages: 100-90% A 89-80% B 79-70% C 69-60% D 59% and low er N/C |
|
INSTRUCTIONAL METHODS: Students grades depend on participation in classroom discussions. Students must have a satisfactory attendance record, in accordance w ith the school’s attendance policies. All required assignments must be completed to obtain a passing grade in the class. All projects and assignments are due on the date specified. EVALUATION METHODS: Grades are an indicator of overall performance, achievement and participation. Students are responsible for completing all course requirements on time to receive credit. Final projects w ill be presented during finals w eek.
GRADING: The final grade for the course is based on an accumulation of points in each of the above areas and weighted accordingly. A total of 1000 points are possible. Grades are based on the following point breakdown:
|