COMPUTER SOFTWARE ENGINEERING - NBTE

More documents

Recommendations

Info

fffffff NID in Software Engineering (Draft) ) PROGRAMME: NATIONAL INNOVATION DIPLOMA IN COMPUTER SOFTWARE ENGINEERING COURSE: LOGIC AND LINEAR ALGEBRA COURSE CODE: MTH 101 CONTACT HOURS: 2 – 1 – 0 GOAL: TO STIMULATE AND LOGICAL REASONING OF THE STUDENTS COURSE SPECIFICATION: THEORETICAL CONTENT Practical Content GENERAL OBJECTIVE 1: UNDERSTAND THE CONCEPT OF LOGIC AND ABSTRACT THINKING Week Specific Learning Outcomes Teacher’s activities Resources Specific Learning Outcomes Teacher’s activities Resources 1 1.1 Define the essential connectives, negation, conjunction, disjunction, implication and biimplication. Explain and discuss the concepts covered Textbooks Lecture Notes • Demonstrate understanding of the concepts covered by solving examples Explain and supervise student exercises and assess student work Textbooks Lecture Notes 1.2 Illustrate the essential connectives define in 1.1 above 1.3 Describe grouping and parenthesis in logic 1.4 Explain Truth tables. 1.5 Define tautology. 2 1.6 Illustrate types of tautology. 1.7 Define universal quantifier and existential quantifier 3 1.8 Translate sentences into symbolic form using quantifiers. E.g. “some freshmen are intelligent can be stated as “for some x,x is a freshman and x is intelligent” can be translated in symbols as (ix) (f x & ix) Explain and discuss the concepts covered Explain and discuss the concepts covered Textbooks Lecture Notes Textbooks Lecture Notes • Demonstrate understanding of the concepts covered by solving examples • Demonstrate understanding of the concepts covered by solving examples Explain and supervise student exercises and assess student work Explain and supervise student exercises and assess student work Textbooks Lecture Notes Textbooks Lecture Notes 1.9 Define the scope of a quantifier. Eg R=Gauss was 40
fffffff NID in Software Engineering (Draft) ) a contemporary of Napoleon S=Napoleon was a contemporary of Julius Caesar (Thus P, Q and R are true, and S is false Then find the truth value of sentences: (a) (P and Q) = R (b) (P – Q) (c) PAND Q = R - S 1.8 Define bond and “free” variables 4 1.11 Define term and formula. Week Explain and discuss the concepts covered Textbooks • Demonstrate understanding of the 1.12 Explain the validity of formulae Lecture Notes concepts covered by solving examples GENERAL OBJECTIVE 2 : UNDERSTAND THE CONCEPT OF PERMUTATIONS AND COMBINATIONS Textbooks 5 2.1 Define permutation’s and Combination 2.2 Give illustrative examples of each of 2.1 above 2.3 State and prove the fundamental principle of permutations. 2.4 Give illustrative examples of the fundamental principles of permutations. Explain and discuss the concepts covered Lecture Notes • Demonstrate understanding of the concepts covered by solving examples Explain and supervise student exercises and assess student work Explain and supervise student exercises and assess student work Textbooks Lecture Notes Textbooks Lecture Notes 2.5 Establish the formula nPr = n ! (n-r)! 6 2.6 Prove that nPr= (n-r+1) *nP r-1 2.7 Solve problems of permutations with Explain and discuss the concepts covered Textbooks Lecture Notes • Demonstrate understanding of the concepts covered by solving examples Explain and supervise student exercises and assess student work Textbooks Lecture Notes 41
Page 1 and 2: NID in Software Engineering (Draft)
Page 13 and 14: fffffff NID in Software Engineering
Page 29 and 30: fffffff ASSESSMENT STRUCTURE NID in
Page 51: fffffff ASSESSMENT STRUCTURE NID in
Page 103 and 104:
fffffff ASSESSMENT STRUCTURE NID in
Page 105 and 106:
fffffff NID in Software Engineering
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
show all

COMPUTER SOFTWARE ENGINEERING - NBTE

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?