COMPUTER SOFTWARE ENGINEERING - NBTE

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