Proposed Reorganization: Proposed Calendar Description for Both Courses
Total Page:16
File Type:pdf, Size:1020Kb
Proposed reorganization: We would like to replace CSC 220 described above, with the two courses listed below: 1. CSC 115: Discrete Computational Mathematicsl 2. CSC 215: Discrete Computational Mathematics II Proposed calendar description for both courses: CSC 115 Discrete Computational Mathematics I This course introduces the student to the mathematical models and formalisms that are of genuine use in Computer Science and Mathematics. The topics covered include set theory, principles of counting, logic, mathematical induction, relations and functions, ?nite—state machines, and the principle of inclusion and exclusion. Prerequisite: Math 12 or Math 050 or Math 100 3 CR / (3, 0) CSC 215 Discrete Computational Mathematics II This course is a continuation of CSC 115. Topics covered include generating functions, recurrence relations, graph theory, trees, optimization and matching, rings and modular arithmetic, Boolean algebra and switching functions, coding theory, ?nite ?elds, and combinatorial designs. Prerequisite.‘ CSC 115 and Math 101 3CR/(3,0) Proposed calendar changes to the Career Path Index: The current career path index for computer science is the 2D package. After consulting with the Counselling and Academic Advising Department, it was determined that, the best package for computer science majors will be 2C if a minor change is made to the 2C package. The Computer Science Department does endorse the change recommended. Below is the current listing of the 2C package in the calendar: Package Semester I Semester II Notes CHEM 113 CHEM 114 1. Prerequisites: ENGL 101 or 103 ENGL 102 or 104 M311112 or MATH 100 2C MATH 101 MATH 102 01- MATH 050, CSC 109 CSC 110 Chemistry 11 or PHYS 105 PHYS 106 CHEM 045) Physics 11 or PHYS 045. The proposed calendar listing of the 2C package is given next: Package Semester I Semester II Notes CHEM 113 CHEM 114 1. Prerequisites: ENGL 101 or 103 ENGL 102 or 104 Mat}, 12 or MATH 100 2C MATH 101 MATH 102 or MATH 050) CSC 109 CSC 110 Chemist,-y 11 or PHYS 105 or PHYS 106 CHEM 0457 CSC 115 Physics 11 or PHYS 045. The changed 2C package is most appropriate for students wishing to major in computer science. Also, there will no effect on the other disciplines for which 2C serves as the preferred package since PHYS 105 is not a prerequisite for PHYS 106. Rationale for proposed changes: In attempt was made to cover all the introductory and intermeateantopics in Discrete Mathematics in one semester. This did not give students adequate time to master the fundamental concepts before dealing with more advanced ones, i.e., both were dealt with in a single semester. Hence, an otherwise important and interesting Computer Science course became too challenging for the average student. Consequently, enrollments in CSC 220 and the computer science courses for which it serves as a prerequisite have suffered. The Department of Computer Science is con?dent that the reorganization of CSC 220 to CSC 115 and CSC2l5, will rectify this problem. With two courses in Discrete Mathematics, students would focus on introductory concepts in one semester, thereby, being able to master them without plunging into more dif?cult or intermediate concepts. The intermediate concepts become relatively easy for the students to handle since they are better prepared for them. Also, the focus of the students is restricted to just one class of concepts. Finally, this approach has been adopted by most major universities on the continent for the very reasons stated earlier. COLLEGE OF NEW CALEDONIA DEPARTMENT OF COMPUTER SCIENCE CSC I15: Discrete Computational Mathematics I INSTRUCTORS: OFFICE: PHONE: Jacob Madjitey 2-33 5 213 George Kaweesi 2-3 36 5 18 'O'B:TE‘CTI'V‘ES~:“x ‘:’\"t* %\)"~.f>§‘"\'i"*”7‘ This course provides the basic mathematical concepts needed by every computer science student. It examines some important areas of mathematics that are frequently applicable to problems in computer science because they provide systematic techniques for addressing problems associated with counting and representation. While some examples are provided that illustrate such applications, the primary goal of this course is to develop a good understanding and a working knowledge of the basic mathematical concepts of each topic so that the student will be able to understand how these concepts can be applied when the opportunity arises. PREREQUISITES: Math 12 or Math 050 or Math 100 TEXTBOOK: Discrete and CombinatorialMathematics, 3”’edition, by Grimaldi, R.P., Addison-Wesley. EVALUATION SCHEME: 1. Assignments 40% 2. Two Tests 20% 3. Final Examination 40% A letter grade will be assigned, using the above weighted average, according to the following conversion scheme: Letter Grade Scale Grade Point A+ 90—l00% 4.33 A 85—89.9% 4.00 A- 80—84.9% 3.67 B+ 76—79.9% 3.33 B 72—75.9% 3.00 B- 68-71.9% 2.67 C+ 64-67.9% 2.33 C 60-63.9% 2.00 C- 55-59.9% 1.67 D 50-54.9% 1.00 F 0—49.9% 0.00 SCHEDULE OF TOPICS: This schedule is intended as a rough guide and may be altered as the course progresses: Set Theory Principles of Counting Logic and Formal Reasoning Mathematical Induction Relations and Functions Finite—StateMachines Principle of Inclusion and Exclusion .\‘S7‘E":‘>E*’!".*‘ COLLEGE OF NEW CALEDONIA DEPARTMENT OF COMPUTER SCIENCE CSC 215: Discrete Computational Mathematics II INSTRUCTORS: OFFICE: PHONE: Jacob Madjitey 2-335 213 George Kaweesi 2-336 518 . Y A : *“w:. <)x»'=r?:i~x.?<g>.*.*.~s< This course is a continuation of CSC 115. It introduces the student to some intermediate mathematical tools that are frequently applicable to problems in computer science. These concepts provide the mathematical foundations for many computer science courses including data structures, algorithms, database theory, automata theory, formal languages, compiler theory, computer security, operating systems, and computer architecture and hardware. While some examples are provided that illustrate such applications, the primary goal of this course is to develop a good understanding and a working knowledge of the mathematical concepts of each topic so that the student will be able to understand how these concepts can be applied when the opportunity arises. PREREQUISITES: CSC 115 and Math 101 TEXTBOOK: Discrete and Combinatorial Mathematics, 3'“edition, by Grimaldi, R.P., Addison—Wesley. EVALUATION SCHEME: 1. Assignments 40% 2. Two Tests 20% 3. Final Examination 40% A letter grade will be assigned, using the above weighted average, according to the following conversion scheme: Letter Grade Scale Grade Point A+ 90-100% 4.33 A 85-89.9% 4.00 A- 80—84.9% 3.67 B+ 76—79.9% 3.33 B 72—75.9% 3.00 B- 68-71 .9% 2.67 C+ 64-67.9% 2.33 C 60-63.9% 2.00 C— 55—59.9% 1.67 D 50-54.9% 1.00 F 0-49.9% 0.00 SCHEDULE OF TOPICS: This schedule is intended as a rough guide and may be altered as the course progresses: Generating Functions Recurrence Relations Graph Theory Trees Optimization and Matching Rings and Modular Arithmetic Boolean Algebra and Switching Functions Coding Theory . Finite Fields 10. Combinatorial Designs ‘°.°°>‘.°“.~"."‘.“’!":“ inter-office MEMORANDUM I02 John Ibberson, Chair, EducationCouncil from: Paul Seens, Chair, AdmissionsCommittee Sublelifl Admissions Committee Recommendations date: October 2, 1997 The AdmissionsCommittee met on September 29, 1997 and is prepared to make the following recommendationsto Education Council: 1. CSC220 split into CSC115 and CSC2l5 The following recommendationsare dependant upon EducationCouncil approval of the new course structure that has been proposed. a. That the prerequisite of CSC1 15 be Math 12 or Math 050 or Math 100 with a minimum grade of “C”. b. That the prerequisitefor CSC 215 be CSC 115 and Math 101 with a minimum grade of “c". c. As CSC220 is currently the prerequisitefor CSC 224, that if the new structure is approved that the new prerequisite for CSC 224 be CSC 215. Paul Seens Chair Admissions Committee PS/hw c Admissions Committee Jenny Somero Jacob Madjitey George Kaweesi APPENDIX A CONSULTATIONWITH PROGRAMMECOMMITTEES Committee T0: Counselling Programme Committee Admissions Programme Committee Burns Lake Programme Committee Vanderhoof Programme Mackenzie Prograrume Committee QuesnelProgramme Committee and: SCIENC.é (’.<zoc..<A:m€ cmrc-Tva.= S(.l8NL</ DATE; 2 witn- FROM, CoHPu1-e~L “D591”. 26 RE: as e 11° Kcoizc./ww.A«n.~ IVIESSAGE: respond by: Jclosures: Please auiuuccoutA-xxsuuctnuuAcauiuuntunotAc-n<=n*u<aao<-am:-arauc-H-atn:-uuukxnunakunnxA=u==r>u=n<=n- Axaknuauunnca--x¢n==i< RESPONSE SECTION Fauzmus crrzé mm: If)«[99. mom: sueme y . we have the following response: After consideration by our Programme Committee of your proposal, We have no input to offer on this proposal. I/ We fully endorse this proposalwith no input or comment. regarding this proposal: (attached) __ the W ollo ut E ~ Lacrk K Name of Programme Committee Rep.) Signature (Programme Committee Representative) (Print Revired by Ed. Council: June 11/96 66 nu: FAXNU. WI 561 cum npv-03-97non14:47 ONOHHILROOH J‘ MimnsamnsPxvgnnlme Oonzmmu: Counsqlhng Pmgnn-am: Commune Carmine T0: Cannmme VnnduhoofPmgnmm: r Buxgj Pxvgzunmz Program: Ccnxmmee Pmgtaune Cmnnlncc Qucsnel and: ewe DATE: FROM:/’ I ‘ / RB: / MEQSAGB mg... ,3-1,.“ by: Endnwns: ascauuaounnnnnuusean-on-nusonn.-u-¢¢y...»..............,.,,,_,,."””. RESPONSESECTION /7? mom-.&mséé.~.Q~<, mm Mg 5 nspum; Counnimeof yourpmpoenl.wehive the fulkwling Mia: uonxidcnzinnby our Pmgrmm _—Wefullyundonethbpwposnlwulnolmuzmoounnsuu. ZIeuvenolnpInKoo?' uundshpmposa1.Rniselby?. Covwa‘l:.llne1I/96 66 COLLEGE OF NEW CALEDONIA MEMORANDUM TO: Education Council FROM: Roland Green Chair, Business Program Committee RE: Calendar Change — English190 DATE: November 5, 1997 The Business Program Committe has approved the inclusion of English 190 as an elective for the Business Administration Certi?cate and Management Studies Certi?cate. (see copy of page 43 attached) The inclusion of English 190 will ensure that all Business courses are a part of the certi?cate programs.