COMPUTER SOFTWARE ENGINEERING - NBTE

More documents

Recommendations

Info

fffffff NID in Software Engineering (Draft) NATIONAL INNOVATION DIPLOMA (NID) IN COMPUTER SOFTWARE ENGINEERING FIRST YEAR COURSES, SECOND SEMESTER 58
fffffff NID in Software Engineering (Draft) PROGRAMME: NATIONAL INNOVATION DIPLOMA IN COMPUTER SOFTWARE ENGINEERING COURSE: DATA STRUCTURES AND ALGORITHM COURSE CODE: CSE 102 CONTACT HOURS: 1 – 0 – 1 GOAL: TO EQUIP STUDENTS WITH KNOWLEDGE OF WRITING SIMPLE ALGORITHM COURSE SPECIFICATION: THEORETICAL CONTENT PRACTICAL CONTENT GENERAL OBJECTIVE 1: UNDERSTAND CONCEPTS OF DATA STRUCTURE AND TOOLS FOR STUDYING. Week Specific Learning Outcomes Teacher’s activities Resources Specific Learning Outcomes Teacher’s activities Resources 1 1.1 Define data structure Discuss concept of data White Board. • Use Data attributes, fields, Demonstrate using structure sub fields, records and files. relevant examples 1.2 Define data attributes; name, value range, data types. 1.3 Define units for identifying data character, fields, sub fields, records, files. Explain data attributes, name value range and data types Explain concepts of character, fields, sub field, records and files PC loaded with PowerPoint and connected to an OHP Week GENERAL OBJECTIVE 2: KNOW TOOLS FOR STUDYING DATA: SYMBOLS, RELATIONS, AND GRAPH. 2 – 3 2.1 Define symbols, relations and graph. Explain the meaning of data structure. White Board. PC loaded with • Apply the use of symbols, relations and graph. PowerPoint and connected to OHP 2.2 Explain the symbols for expressing relations among data. 2.3 Explain position relation cell contents, record location, transfer key. 2.4 Explain order relation; record rank, cell rank. 2.5 State properties of graph: routes, edge, sequences, directed and non-directed. Discuss symbols, relations and graph Discuss the symbols for expressing relations among data, position relation cell contents, record location, and transfer key. Explain the properties of graph: routes, edge, sequences, directed and non-directed. Concepts of attributes, name, value range and data types. Concept of character, fields, sub field, records and files. Demonstrate using relevant examples on how to use symbols, relations and graph Networked PCs loaded with relevant software Networked PCs loaded with relevant software. 2.6 Describe operations such as proceeds, less than points to, move to, search, change, entry. Describe operations such as precedes, less than points to, move to, search, change, entry. 59
Page 1 and 2:
NID in Software Engineering (Draft)
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
fffffff NID in Software Engineering
Page 15 and 16:
Page 17 and 18:
Page 19 and 20: fffffff NID in Software Engineering
Page 29 and 30: fffffff ASSESSMENT STRUCTURE NID in
Page 69: fffffff ASSESSMENT STRUCTURE NID in
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
fffffff ASSESSMENT STRUCTURE NID in
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

Create successful ePaper yourself

Delete template?

Save as template?