UNDERSTAND ALGORITHMS AND DATA STRUCTURES
UNIT CODE: ICT/OS/CS/CR/08/6/A
UNIT DESCRIPTION
This unit covers the competencies required to understand algorithms and data
structure. It involves Understand fundamental principles of algorithms understanding
fundamental concepts of data structures, linked lists, stacks and queues, search
techniques and sorting techniques
ELEMENT PERFORMANCE CRITERIA
These are assessable statements which specify the
These describe the key
required level of performance for each of the elements.
outcomes which make
up workplace function. (Bold and italicized terms are elaborated in the range.)
1.1 Algorithm is defined
1. Understand
1.2 Characteristics of an Algorithm are explained
fundamental principles
1.3 Algorithm writing is demonstrated
of algorithms
1.4 Algorithm Analysis is explained
1.5 Complexities of algorithms are explained
1.6 Greedy algorithms are outlined
1.7 Divide and conquer is demonstrated
2.1 Key concepts in data structures are explained
2. Understand
2.2 Arrays are explained
fundamental
2.3 Array insertion operations are explained
concepts of data
2.4 Array delete, search and update are explained
structures
2.5 Array operations are demonstrated using C++
3.1 Linked lists are explained
3. Understand Linked
lists 3.2 Doubly linked lists are explained.
3.3 Circular linked lists are explained.
3.4 Basic operations for the various linked lists are
demonstrated using C++
4.1 Stacks and queues are defined
4. Understand Stacks
4.2 Stack and queue representation are outlined
and Queues
4.3 Basic operations in stacks are explained
4.4 Basic operations in Queue are explained
4.5 Basic operations in stacks and queue are
demonstrated using C++
5.1 Search is defined
5. Understand Search
5.2 Linear Search is explained
Techniques
5.3 Binary Search is explained
5.4 Search techniques are demonstrated using C++
©2019, TVET CDACC 83
6.1 Sorting is defined
6. Understand Sorting
6.2 Categories of sorting techniques are outlined
Techniques
6.3 Types of Sorting algorithms are explained
6.4 Sorting algorithms are demonstrated using C++
RANGE
This section provides work conditions to which the performance criteria apply. It
allows for different work environments and situations that will affect performance.
Variable Range
1. Complexities may Space
include but is not Time
limited to:
2. Greedy algorithms Counting coins
may include but is
not limited to:
3. Key concepts in Data
data structures may Object
include but is not Type
limited to:
4. Basic operations Insertion
for various linked Deletion
lists may include Reverse
but is not limited Display
to:
5. Basic operations in Push
stacks may include Pop
but is not limited
to:
6. Basic operations in Enqueue
queues may Dequeue
include but is not
limited to:
7. Categories of In place
sorting techniques Not in place
may include but is Stable
not limited to: Not stable
Adaptive
Non-adaptive
©2019, TVET CDACC 84
Variable Range
9. Types of Sorting Bubble sort
algorithms may Insertion sort
include but is not Selection sort
limited to:
REQUIRED SKILLS AND KNOWLEDGE
This section describes the skills and knowledge required for this unit of competency.
Required skills
The individual needs to demonstrate the following skills:
Communications (verbal and written);
Time management;
Problem solving;
Planning;
Decision Making;
Research;
Required knowledge
The individual needs to demonstrate knowledge of:
Fundamental principles of algorithms
Fundamental concepts of data structures
Linked lists
Stacks and queues
Search techniques
Sorting techniques
EVIDENCE GUIDE
This provides advice on assessment and must be read in conjunction with the
performance criteria, required skills and understanding and range.
1. Critical Aspects Assessment requires evidence that the candidate:
of Competency
1.1 Wrote an algorithm
1.2 Demonstrated array operations
1.3 Demonstrated basic operations for the various linked
lists
1.4 Demonstrated basic operations in stacks and queues
1.5 Demonstrated search techniques
©2019, TVET CDACC 85
1.6 Demonstrated sorting algorithms
The following resources should be provided:
2. Resource
2.1 Access to relevant workplace where assessment
Implications
can take place
2.2 Appropriately simulated environment where
assessment can take place
3. Methods of Competency may be assessed through:
Assessment 3.1 Oral questioning
3.2 Practical tests
3.3 Observation
3.4 Written tests
Competency may be assessed
4. Context of
4.1 Off the job
Assessment 4.2 on the job
4.3 During industrial attachment
5. Guidance Holistic assessment with other units relevant to the
information for industry sector, workplace and job role is recommended.
assessment
©2019, TVET CDACC 86
