Scribd
Upload
3 views3 pages

Algorithm UNIT

This unit focuses on understanding algorithms and data structures, covering fundamental principles, linked lists, stacks, queues, search techniques, and sorting techniques over a duration of 140 hours. Learning outcomes include the ability to define and analyze algorithms, manipulate data structures, and implement various search and sorting algorithms using Java. Suggested assessment methods include written, oral, and practical tests to evaluate comprehension and application of the concepts.

Uploaded by

nakhumichaconcephter
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Algorithm UNIT

This unit focuses on understanding algorithms and data structures, covering fundamental principles, linked lists, stacks, queues, search techniques, and sorting techniques over a duration of 140 hours. Learning outcomes include the ability to define and analyze algorithms, manipulate data structures, and implement various search and sorting algorithms using Java. Suggested assessment methods include written, oral, and practical tests to evaluate comprehension and application of the concepts.

Uploaded by

nakhumichaconcephter
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ALGORITHMS AND DATA STRUCTURES

UNIT CODE:ICT/CU/CS/CR/09/6/A

Relationship to Occupational Standards


This unit addresses the unit of competency: Understand Algorithms and Data Structures

Duration of Unit: 140 hours

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
Summary of Learning Outcomes
1. Understand fundamental principles of algorithms
2. Understand fundamental concepts of data structures
3. Understand linked lists
4. Understand stacks and queues
5. Understand search techniques
6. Understand sorting techniques
Learning Outcomes, Content and Suggested Assessment Methods
Suggested
Learning Outcome Content Assessment
Method
1. Understand  Definition of an Algorithm  Written tests
Fundamental  Characteristics of an Algorithm  Oral tests
principles of  Principles of algorithm writing  Practical tests
algorithms  Algorithm Analysis
 Complexities of algorithms
 Space
 Time
 Greedy algorithms are outlined
 Counting coins
 Divide and conquer algorithms
 Divide /break
 Conquer/solve
 Merge/combine

©2019, TVET CDACC 73


2. Understand  Key concepts in data structures  Written tests
fundamental  Data  Oral tests
concepts of data  Object  Practical tests
structures  Data type
 Explanation of Arrays
 Array insertion operations
 At the beginning
 At the given index
 After the given index
 Before the given index
 Array delete, search and update
 Demonstration of array
operations
3. Understand  Linked lists  Written tests
Linked lists  Linked lists representation  Oral tests
 Types of linked lists  Practical tests
 Doubly linked lists
 Representation
 Basic operations
 Circular linked lists
 Representation
 Basic operations
 Demonstration of basic operations
for the various linked lists using
Java
 Insertion
 Deletion
 Reverse
 Display
4. Understand Stacks  Definition of Stacks  Written tests
and Queues  Representation of stacks  Oral tests
 Basic operations  Practical tests
 Pop
 Push
 Definition of queues
 Representation of queues
 Basic operations
 Enqueue
 Dequeue

©2019, TVET CDACC 74


 Demonstration of stack and
queues using Java
5. Understand Search  Definition of search  Written tests
Techniques  Explanation of Linear Search  Oral tests
 Explanation of Binary Search  Practical tests
 Demonstration of linear search
and binary search using Java
6. Understand  Definition of Sorting  Written tests
Sorting  Categories of sorting  Oral tests
Techniques  Stable and not stable sorting  Practical tests
 Adaptive and Non-Adaptive
Sorting Algorithm
 In place and not in place
 Types of Sorting algorithms
 Bubble sort
 Insertion sort
 Selection sort
 Demonstration of sorting
algorithms using Java

Suggested Methods of Instruction


 Presentations by trainer;
 Guided learner activities and research to develop underpinning knowledge;
 Supervised practical assignments
 Visiting expert from the ICT sector;
 Industrial visits
Recommended Resources
Tools
 JDK
Equipment
 Computers
Materials and supplies
 Instructional materials
 Stationery
Reference materials
 Trainer recommended resources including web resources

©2019, TVET CDACC 75

You might also like