Data Structures & Algorithms (DSA010)
STATEMENT ABOUT ACADEMIC HONESTY AND INTEGRITY
GSEI defines academic integrity as the pursuit of scholarly activity in an open, honest
and responsible manner. All students should act with personal integrity, respect other
students’ dignity, rights and property, and help create and maintain an environment in
which all can succeed through the fruits of their efforts.
Dishonesty of any kind will not be tolerated in this course. Dishonesty includes, but is not
limited to:
cheating,
plagiarizing,
fabricating information or citations,
facilitating acts of academic dishonesty by others,
having unauthorized possession of examinations,
submitting work of another person or work previously used without informing the
instructor,
or tampering with the academic work of other students,
Students who are found to be dishonest will receive academic sanctions and
will be reported to the Head of Department’s office for possible further
disciplinary sanction.
Module name Data Structures And Algorithms
Course Name Diploma in Software Engineering
Course Code DSA010
Course Length 1 Semester
Aims
This course aims to introduce fundamental techniques for problem solving that are relevant to
most areas of computer science, both theoretical and applied. The course introduces the basic
algorithms and data structures for basic program design. This course is a pre-requisite for
students taking Data structures and Algorithms II in order to develop programming skills for
solving common computational problems.
Module Instructors Mr. Blasius K Pinias
Credits 14
Pre-requisites None
NQF Level 5
Notional Hours 144
Method of delivery
The student will learn a number of algorithms and how to analyze them during class, practice
analyzing and using them in homework, projects, and assignments, and demonstrate his/her
abilities in the final exam.
Lectures - 4 hours/week for 16 weeks
Tutorials - 2 hours/week for 16 weeks
Labs - 2 hours/week for 16 weeks
Assignments - Total 16 hours of assignments (average 1 hour/week for 16 weeks)
Self-Study - 4 hours/ week for 16 weeks
Objectives
To give an introduction to the design and analysis of a wide variety of fundamental
algorithms;
To teach the implementation of algorithms, relevant data and program structures, and
principles of program design;
To foster an understanding of how to distinguish and evaluate if algorithms are correct in
terms of structure and logic; and
To introduce and demonstrate the basic algorithms used in the Computer Science field.
Learning Outcomes
Construct and interpret basic algorithms in pseudo code syntax using control structures;
Identify basic concepts behind the use of algorithms;
Distinguish between basic algorithms;
Evaluate the correctness of basic algorithms;
Apply control structures in the development of basic algorithms using pseudo code;
Evaluate basic algorithms using desk checking techniques;
Illustrate basic algorithms using flow charts and Nassi-Schneidermann diagrams; and
Identify a range of basic algorithms and how to implement them;
Assessment
Assessment will be based on a continuous assessment contributing 40% and the final
examination contributing 60%. Continuous assessment will be comprised of:
2 Tests each contributing 10%
2 Major assignment contributing 10%
The final examination will be done at the end of the subject teaching. Only candidates
with 40% and above in the continuous assessment will be allowed to write the
examination. Candidates obtaining a combined mark between 45% - 49% will be
eligible to sit for a second opportunity supplementary examination in which a mark of
less than 50% will be deemed as fail. Supplementary examination candidates who pass
the examination will be awarded a mark of 50% for the subject, regardless their
performance in the examination. The following is the subject grading:
Grading:
Below 45% - Fail
Below 45% to 49% - Fail (supplementary examination allowed)
50% to 59% - Pass
60% to 69% - Credit
70% to 74% - Merit
75% and above - Distinction
Moderation
All tests and assignments will be internally moderated by a second internal examiner
from the National Software Engineering Academy other than the lecturers teaching the
subject. The final examination will be moderated by an external examiner, who shall be
appointed by the National Software Engineering Academy as a recognized
practitioner or expert in the subject/course, following the college guidelines for the
appointment of external examinations.
Course Content
1. Understanding Algorithms and Programs
Define an algorithm and give practical, real-life examples (e.g., making tea, ATM
withdrawal).
Define a program and explain the relationship between algorithms and
programs.
Introduction to pseudo-code and how it's used to plan and write logic before
coding.
2. Working with Data Types and Data Structures
Understand basic and user-defined data types: variables, constants, literals,
strings, files, arrays.
Explore how data is stored in computer memory.
Use cases: e.g., storing student records using arrays or structures.
3. Problem Solving & Algorithm Design Techniques
Follow steps for developing an algorithm: problem definition, designing,
checking, and refining.
Apply practical tasks: design an algorithm to calculate student grades or process
payroll.
Tools: write and debug pseudo-code to simulate real problems.
4. Control Structures in Action
Apply control structures: sequence (step-by-step), selection (if/else), and
repetition (loops).
Use structured programming principles in mini-projects like a login system or
menu-based app.
Practice: write control structures to process a shopping cart or user input.
Draw flowcharts and Nassi-Schneiderman diagrams to plan logic.
5. Arrays, Searching Techniques, and Linked Lists
Initialize, populate, and print array elements in practical programs.
Implement linear (sequential) search in arrays (e.g., search student names or
IDs).
Introduction to linked lists: create, insert, delete nodes.
Use case: implement a to-do list or student queue using linked lists.
Study Materials
Required Textbook:
Robertson, L. (2006). Simple program design. Southbank, Vic.: Thomson.
Recommended Textbook:
Knuth, D. (1998). ˜ Theœart of computer programming, Volume 3, Sorting and
searching. Upper Saddle River, NJ: Addison-Wesley.
Breutmann, B. (2001). Data and algorithms. Leipzig: Fachbuchverl. Leipzig im Carl-
Hanser-Verl.
Web Sites:
Quora.com,. (2015). Where can I find difficult algorithm/data structure problems? - Quora. Retrieved 5
October 2015, from https://www.quora.com/Where-can-I-find-difficult-algorithm-data-structure-
problems
Date Activity Contribution to CA Time
11 August 2025 Releasing of Assignment 1 – –
29 August 2025 Due Date of Assignment 1 10% –
31 August 2025 Releasing of Assignment 2 – –
29 August 2025 Test 1 10% 12:30 – 14:00
19 September 2025 Due Date of Assignment 2 10% –
24 September 2025 Test 2 10% 12:30 – 14:00
31 October 2025 Supplementary Test – 12:30 – 14:00
Note:
All tests will be conducted in the Conference venue.
All assignments must be submitted via the student portal.
Continuous Assessment (CA) contributes 40% to the final course mark, with each
assignment and test contributing 10%.
Authorisation:
This course is authorized for use by:
___________________________________ __________________________
Head of Department Date
ACKNOWLEDGEMENT BY STUDENT
(To be completed by all students doing the course, detached from the course outline
and kept for record purposes in the department)
I, ___________________________________________________________________________,
with student number____________________________________________, hereby
acknowledge that I have received this course outline for Data Structures & Algorithms I
in semester 1 (2015), and that I have acquainted myself with its content, in particular the
statement about academic honesty and integrity. I agree to abide by the Policies and
arrangements spelt out in this course outline.
_____________________________________ _____________
Student Signature Date
