UNITAR International University : MQA-02 Bachelor of Information Technology (Hons) Attachment C

Summary of information on each course / module

1. Name of Course/Module ALGORITHM AND DATA STRUCTURES
2. Course Code ITWB2043
3. Name(s) of academic staff Hanizan Shaker Hussain
4. Rationale for the inclusion of the course/ Algorithm & Data Structures always known for their importance in Information
module in the programme Technology related studies. This course provides a structured working
knowledge of the programming applications most often used in any system
programming and broad knowledge of Algorithm & Data Structures
techniques will provide the luxury for the students to excel in computing
related industry. Algorithm & Data Structures has its own importance and role
in designing secure system.
5. Semester and Year offered TBD (Elective Course)
6. Total Student Learning Time (SLT) Face to Face Online Total Guided and Independent Learning
Facilitation
T/S = Tutorial/Seminar T/S P F O
F= Forum 14 14 6 86 120
P = Practical
O= Others
7. Credit Value 3
8. Prerequisite (if any) ITWB2033 Programming Principles and Techniques
9. Objectives The objectives of this course are to:
1. Allow the student to understand the main data structures and various
algorithms that are used to manipulate them.
2. Equip the student with the skills necessary to use data structures to
solve programming problems.
3. Equip the student with technical skills to evaluate different approaches
and algorithms on data structures.
4. Enable the student to be able to choose appropriate data structures and
algorithms in solving problems.
10. Learning outcomes:
At the end of the course, students are able to:
LO1:Use data structures to solve programming problems.
LO2:Write programs using data structures to solve real problems.
LO3:Choose the right data structures and algorithms.
LO4:Evaluate algorithms that use data structures
11. Transferable Skills:

TRANSFERABLE SKILLS Yes No

Knowledge √
Argument
Practical √
Research
Creativity √
Self-Appraisal
Management of Learning
Communication and Presentation
Problem Solving and Contribution √
Interactive and Group Skills √
UNITAR International University : MQA-02 Bachelor of Information Technology (Hons) Attachment C

12. Teaching-learning and assessment strategy:

TEACHING-LEARNING LO1 LO2 LO3 LO4

Face-to-face learning (lecture, tutorial, discussion) √

Problem/action-based learning (assignment, exercises, lab work, programming, cases, √

design, cooking)
√
Cooperative learning (group discussions/activities/ resentations)
Technology-based learning (Internet search, games, mobile systems) √
Experiential-based learning (field work, project paper, on-site visits) √

Work-based learning (Internship, Practicum, Cooking, Work attachments) √

Assessment strategy
Formative assessment (Online Forum Participation / TMA / Project / Presentation) - 50%
Summative assessment (Final Examination) - 50%

13. Synopsis:
As students work their way through this course, they will learn how to program in C++/JAVA, including how to evaluate,
select, and use libraries that implement a variety of algorithms and data structures as well as familiarize themselves with
some of the key principles for designing algorithms and data structures. They will know how to write programs using binary
search trees, and pointer and array representations of graphs. They will also learn about the time and space requirements of
various algorithms and data structures, which will help them, make sound

14. Mode of Delivery: Tutorial, Seminar, Forum, Discussion

15.
Assessment Methods and Types
Continuous assessment:
50%
Online Forum Participation / TMA / Project / Presentation
Term end assessment:
50%
Final Examination
TOTAL 100%
16. Mapping of the Course/Module to the Programme Educational Objectives (PEO):
Refer to MQA-02 Area 1 : Item No 1.2.2 Table 2
UNITAR International University : MQA-02 Bachelor of Information Technology (Hons) Attachment C

17. Mapping of the Course Learning Outcomes (CLO) to the Programme Learning Outcomes (PLO)

Programme Learning Outcomes:

PLO1: Students are able to apply knowledge and skills in the field of information technology.
PLO2: Students are able to solve real world problem using information technology solution.
PLO3: Students are able to express ideas and opinions effectively in writing and oral presentation.
PLO4: Students are able to recognize and formulate new approach or method in providing IT solutions.
PLO5: Students are able to produce and deliver ideas and solution with entrepreneurial and managerial qualities.
PLO6: Students are able to participate in a project-based assignment at individual or team level.
PLO7: Students are able to complete assigned task while maintaining good professional ethics and social value.
PLO8: Students are able to discover new knowledge through informal sources and training.
PLO9: Students are able to relate the knowledge and skills of information technology to benefit the society.

Programme Learning Outcomes (PLO)

PLO9
PLO1
PLO2
PLO3
PLO4
PLO5
PLO6
PLO7
PLO8
Course Learning Outcomes (CLO)
Students are able to use data structures to solve programming problems. √
Students are able to write programs using data structures to solve real √
problems
Students are able to choose the right data structures and algorithms √
Students are able to evaluate algorithms that use data structures √ √
UNITAR International University : MQA-02 Bachelor of Information Technology (Hons) Attachment C

18. Content outline of the course/module and the SLT per topic:

Total SLT (Hours)

Tutorial\Seminar

Library Search

Assignment
Course Contents

Self-study
Practical

Forum

Exam
1.Programming Principles & Techniques
-Introduction to Algorithm 1 1 1 5
-Data Types & Data Structures
2.Algorithm Analysis
-Mathematical Understanding 1 1 1 5
-Algorithm Analysis
3.Linear Lists
-Static & Dynamic Data Structures
-Array Implementation 1 1 6
-Linked List Implementation
4.Stacks
-Array Implementation
-Linked List Implementation 1 1 6
-Stack Application
5.Queue
-Array Implementation
1 1 1 6
-Linked List Implementation
-Queue Application 3 25 120
6.Tree
-Binary Tree 1 1 1 6
-AVL Tree
7.Heaps
-Binary Heap 2 2 6
-Application of Heaps
8.Sorting & Searching
-Sorting & Searching Concept
2 2 1 6
-Methods of Sorting & Searching
-Comparison of various methods in terms of efficiency
9.Hashing
-Basic Concepts of Hashing 2 2 6
-Collision and Resolution
10.Graph
-Terminology & Representation
2 2 1 6
-Application of Graphs

TOTAL HOURS 14 14 6 58 3 25 120

UNITAR International University : MQA-02 Bachelor of Information Technology (Hons) Attachment C

19. Main references supporting the course

1. Weiss, M. A. (2012), Data Structures and Algorithm Analysis in Java, Addison-Wesley

Additional references supporting the course

1. Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser. (2014). Data Structures and Algorithms in Java. 6th
Edition, Wiley.
2. Drozdek, A. (2013), Data Structures and Algorithms in C++ 4th Edition, Cengage Learning.
3. Choudhary, H.H. (2014). Data Structures And Algorithms : Made Easy. CreateSpace Independent Publishing Platform.

20. Other additional information: None