COMPUTER SOFTWARE ENGINEERING - NBTE

fffffff
NID in Software Engineering (Draft)
)
Week GENERAL OBJECTIVE 7: KNOW SIMPLE LINKED LISTS.
8 – 9 7.1 Describe different types of
linked list array, double
linked list, queues, stock,
dequeues, trees.
Define linked list and
compare it with linear
list.
Explain types of linked
list.
7.2 Explain the use of
pointers.
7.3 Describe storage mapping
for linked lists.
8.2 State properties of tree
8.3 Describe different types of
tree. (General tree, binary
tree)
8.4 Explain binary tree
representation.
8.5 Define graph, its types
and properties
Discuss different types of
trees.
Be able to write
simple programs to
carry out set
operations
Discuss the use of
pointers
Week GENERAL OBJECTIVE 8: KNOW NON-LINEAR STRUCTURES.
10 – 12 8.1 Define a tree
Discuss tree and its
properties
Explain binary tree
representation
Define graph
State properties of graph:
routes, queued and nondirected
Describe different types
of graphs: circle, loops,
etc.
Be able to write
simple programs to
carry out set
operations
• Apply linked list. Demonstrate the push and
pop operation possibly
with diagram.
• Write simple program to
implement trees
• Write simple program to
implement graphs
Carry out operations on
linked lists e.g push and
pop on stacks and all
operations on over list
Demonstrate how to write
simple program to
illustrate trees
Demonstrate how to write
simple program to
illustrate graphs
Networked PC’s
loaded with relevant
software.
Networked PC’s
loaded with relevant
software.
Describe operations such
as proceeds, less than
etc.
Week GENERAL OBJECTIVE 9: UNDERSTAND DIFFERENT SORTING AND SEARCHING TECHNIQUES
13 – 15 9.1 Define sorting and the Be able to:
Be able to write • Implement different sorting
various sorting techniques Define sorting
simple programs to techniques in program
carry out set
9.2 Explain sorting and the Explain Comparison operations
Guide students on how to
write programs to
implement different
sorting techniques
Networked PC’s
loaded with relevant
software.
62