ࡱ> EGDg  bjbj** <3HibHib ***8b$D*P.r-------$/x2-- .!!!-!-!!c,h-0OJkap,- .0P.,433 --3#-Z@!?4sl--P.3 B :  GROSSMONT COLLEGE Official Course Outline MATHEMATICS 150 INTRODUCTION TO COMPUTER PROGRAMMING APPLICATIONS 1. Course Number Course Title Semester Units Hours MATH 150 Introduction to Computer 3 3 hours lecture 48-54 hours Programming Applications 96-108 outside-of-class hours In Mathematics 144-162 total hours 2. Course Prerequisites A "C" grade or higher or Pass in Math 110 or equivalent. Corequisite None. Recommended Preparation None. 3. Catalog Description Use of computers to analyze mathematical application problems and their solutions from statistics, engineering and the physical sciences. Fundamentals of structured technical programming including language commands and computational algorithms. 4. Course Objectives The student will: a. Use a computer to design structured programs to solve problems in applied mathematics including statistics, engineering, and physical sciences. b. Format problems for easy computer implementation. c. Distinguish problems which suggest computer solutions. d. Write programs that are user oriented. e. Write programs which read data, process the data using arithmetic and logical operations, loops, arrays, and subprograms, and output the results. 5. Instructional Facilities a. A standard classroom with abundance of writing space. b. Computer laboratory with access to the network and appropriate software for integrated computer instruction. 6. Special Materials Required of Student Electronic storage media. 7. Course Content a. Basics of strategies in engineering and mathematical problem solving using a computer, program design and development using flowchart and pseudocode, and structured programming. b. Basics of programming arithmetic operations using constants and variable names, truncation and mixed-mode operations, etc. c. Intrinsic functions. MATHEMATICS 150 INTRODUCTION TO COMPUTER PROGRAMMING APPLICATIONS page 2 7. Course Content continued d. Displaying output data using different display formats and generating formatted outputs using different literal specifications. e. Algorithm control structures of sequence, selection and repetition. f. Applying if/switch and nested if/switch structures for logical expressions used in the selection structures. g. Applying the while/do/for loop and nested while/do/for loop structures for the repetitive control structure. h. Input/output functions and statements. Techniques for reading and generating data files. i. One- and two-dimensional array processing. j. Function subprograms, user-defined. k. Subroutine subprograms, user-defined. l. Additional data types: character, double-precision, complex data. m. Formatted READ statements, internal files and sequential files. 8. Method of Instruction Lecture. b. Teamwork. 9. Methods of Evaluating Student Performance A grading system will be established by the instructor and implemented uniformly. Grades will be based on demonstrated proficiency in subject matter determined by multiple measurements for evaluation, one of which must be essay exams, skills demonstration, or where appropriate, the symbol system. Written exams including a final. Laboratory assignments. Solving applied mathematical problems using computer programming. 10. Outside Class Assignments a. Homework. b. Special take-home tests. c. Laboratory assignments, or d. Problem sets. 11. Texts a. Required Text(s): Nyhoff, Larry R. and Leestma, Sanford. Introduction to FORTRAN 90. Upper Saddle River, NJ: Prentice Hall, 1st edition, 1999. b. Supplementary texts and workbooks: None. Addendum: Student Learning Outcomes Upon completion of this course, our students will be able to do the following: Analyze problems in applied mathematics including statistics, engineering, and the physical sciences and devise computer-based solutions for them. Design algorithms and develop structured and user-oriented computer programs using the fundamental programming concepts and constructs they learn in class. Date approved by the Governing Board: April 2009   ,.frsx ' ( * 8 O T h j l o p 󨛿󿑿wjwhFhBOJQJ^JhFhpOJQJ^JhFh,WOJQJ^JhBOJQJ^JhFhzSOJQJ^JhFhW@OJQJ^JhxdOJQJ^Jh\}OJQJ^JhFhp>*OJQJ^JhFhC5>*OJQJ^JhFhF>*OJQJ^JhFhC5OJQJ^J%-./st( P i j  d*$^ d*$  dd*$gd\}  dd*$gd\}  `x$d*$ 'd*$ d*$ d*$  B a QR?Cfgk¹¡ϡϔϔϡϡϡϡϔϡyyyyhFh-OJQJ^JhFhzS>*OJQJ^JhFhP.OJQJ^JhFhC5>*OJQJ^JhFhW@>*^JhFhW@^JhFhW@OJQJ^JhFhC5OJQJ^JhFhpOJQJ^JhFh,WOJQJ^JhFOJQJ^J/     0|d*$^`| Dd*$^`D d*$ d*$^gdW@ h^gdW@ 0hd*$gdW@  E 4  0 d*$^ ` *T*d*$^*` T|d*$^`| 0|d*$^`|8QR@d 0d*$^`gd- T|d*$^`| 'd*$ 0d*$ 0d*$ 0d*$^` 0d*$^` @hCh T|d*$^`|gd- 0d*$gd- & F 0d*$^ 0d*$^gd- 0>d*$^`>gd- 0d*$gdW@ kxCF-W\v$%&'K󾰢󘋀tg]hFOJQJ^JhwhROJQJ^JhwhR>*OJQJhwhROJQJhFhROJQJ^JhC5OJQJ^JhBhp6OJQJ^JhBh`6OJQJ^JhFh`OJQJ^JhFhC5>*OJQJ^JhFh-OJQJ^JhFhP.OJQJ^JhFhC5OJQJ^J$./Z{!@R & F d*$   !@&(d*$^ & F " @ !@&(d*$ T|d*$^`|RS]^t%&KL. & F >1$^`>gdR `gdRgdR T|d*$^`|gdR T|d*$^`|gd- T|d*$^`|    h8 CJjh8 Uh8 jh8 CJUhFhC5OJQJ^JhBOJQJ     d T|d*$^`|gdR :....()()))()00P8$BP/ =!8"8#$@%88 Dp"s2 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@_HmH nH sH tH D`D Normal1$OJQJ_HmH sH tH ` @` W@ Heading 9' $ 0hhd*$@&^h >*OJQJDA D Default Paragraph FontViV  Table Normal :V 44 la (k (No List 8+8  Endnote TextCJ>* > Endnote ReferenceH*::  Footnote TextCJ@& !@ Footnote ReferenceH*NN TOC 1) $ 0*$]^`0JJ TOC 2% $ 0*$]^`0JJ TOC 3% $ p0*$]^p`0JJ TOC 4% $ @ 0*$]^@ `0JJ TOC 5% $ 0*$]^`0BB TOC 6 $0*$^`0:: TOC 70*$^`0BB TOC 8 $0*$^`0BB TOC 9 $ 0*$^`0N N Index 1% $ `*$]^``N N Index 2% $ 0*$]^`0>.>  TOA Heading *$ $.". CaptionCJ:/: _Equation CaptionHH  Balloon Text!CJOJQJ^JaJPK![Content_Types].xmlN0EH-J@%ǎǢ|ș$زULTB l,3;rØJB+$G]7O٭Vc:E3v@P~Ds |w< 82  k   @R 8@0(  B S  ?>>>>>>   9*urn:schemas-microsoft-com:office:smarttagsState8*urn:schemas-microsoft-com:office:smarttagsCity9*urn:schemas-microsoft-com:office:smarttagsplace=*urn:schemas-microsoft-com:office:smarttags PlaceName=*urn:schemas-microsoft-com:office:smarttags PlaceType  v |  O]h x @  33333333'(OPPpp / { $  '(OPPllpp??ACg g h k   C F $%& )sJU{L!Dqh1),A4ȵ_&:hK /^`/o(.^`.L^`L.  ^ `.jj^j`.:L:^:`L.  ^ `.^`.L^`L.0^`0o(.^`.L^`L.  ^ `.[[^[`.+L+^+`L.^`.^`.L^`L.0^`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h ^`hH.h ^`hH.h pL^p`LhH.h @ ^@ `hH.h ^`hH.h L^`LhH.h ^`hH.h ^`hH.h PL^P`LhH.^`o(.^`.L^`L.  ^ `.[[^[`.+L+^+`L.^`.^`.L^`L.){L!qh1)&:A4         [c i.Xu8 ![JR9#P.P2025?5C52A?W@Qbp}~pc0Bh\}xd,WzS`F-@   @UnknownG.[x Times New Roman5Symbol?. .Cx ArialArial71 Courier5. .[`)TahomaA$BCambria Math"9)ZFC'*& Hb b )P482q)PHP?P.2!xxIt !A Course Outline Template [blank]GCCCDBarbara Prilaman      Oh+'0 0< \ h t $A Course Outline Template [blank]GCCCD Normal.dotmBarbara Prilaman11Microsoft Office Word@ @a@ g@T kb  ՜.+,0 px  GCCCDA "A Course Outline Template [blank] Title  !"#$%&'()*+,-./012356789:;=>?@ABCFRoot Entry F kH1Table.3WordDocument<3SummaryInformation(4DocumentSummaryInformation8<CompObjr  F Microsoft Word 97-2003 Document MSWordDocWord.Document.89q