Micro-Credential in Algorithms and Complexity
Programme Overview
The course offered by Lincoln University College (LUC) is focused to have developed the self-reflective mindset, the analytic mindset, the collaborative mindset, the worldly mindset and the action mindset. This course introduces an algorithm is a specific procedure for solving a well-defined computational problem. The development and analysis of algorithms is fundamental to all aspects of computer science: artificial intelligence, databases, graphics, networking, operating systems, security, and so on. Algorithm development is more than just programming. It requires an understanding of the alternatives available for solving a computational problem, including the hardware, networking, programming language, and performance constraints that accompany any particular solution. It also requires understanding what it means for an algorithm to be “correct” in the sense that it fully and efficiently solves the problem at hand.
Learning Outcomes
On completion of the course participants should be able to:
• Comprehend the underlying Algorithm Techniques.
• Synthesize a variety of Algorithmic concepts and solutions of Data flow.
• Formulate Data Manipulation techniques, and innovation
• Undertake the Algorithmic initiatives to effectively respond to of dynamic IT environments.
Course Progression
Credits from this Micro-Credential Programme are transferable to the following full academic programme:
- Master of Computer Science
Assessments
- Test (20%)
- Lab Reports (20%)
- Written Assignment (10%)
- Final Examination (50%)
Study Plan for Micro-Credential in Algorithms and Complexity
Week 1
| STABLE MARRIAGE · Undirected graph traversal · Directed graph traversal GREEDY ALGORITHMS · Kruskal’s MST algorithm · Recurrence relations · Closest pair | Seminar Session Simulations |
Week 2
| DYNAMIC PROGRAMMING · Bellman-Ford shortest paths algorithm · Sequence alignment · Ford-Fulkerson maximum-flow algorithm · Max-flow min-cut theorem · Applications of maximum-flow algorithms | Assignment Practical exercise |
Week 3
| MODELS OF COMPUTATION · Problem Dentitions · Models of Computation · FSM Language Recognition · TM Language Recognition · The Classes P and NP · NP-complete Languages | Practical exercise |
Week 4
| CLASSES P AND NP · The classes P and NP · NP-complete languages · Proof that CIRCUIT SAT is NP- complete | Test |
Week 5
| NP-COMPLETE LANGUAGES (ADDITIONAL NP-COMPLETE LANGUAGES) · NAESAT is NP-complete · 0-1 INTEGER PROGRAMMING is NP-complete · INDEPENDENT SET is NP- complete · CLIQUE is NP-complete | Practical exercise |
Week 6
| GRAPH COLORING · PSPACE and PSPACE- completeness · Undecidability · Halting problem | Practical exercise |
Week 7
| APPROXIMATION ALGORITHMS · Approximation algorithms for vertex cover RANDOMIZED ALGORITHMS · Randomized selection and sorting | Submission of Assignments Submission of Lab Report |
Week 8
| Final Examination | Conclusion Session Awarding of Certificates Presentation by VC or Representative of VC |
Why Micro-Credential in Lincoln University College (LUC), Malaysia?
Micro-credentials in Lincoln University College (LUC), Malaysia offer a flexible, targeted, and accelerated pathway of acquiring industry-relevant skills that meet the demands of today’s evolving job market. Designed for students, professionals, and individuals seeking to upskill or reskill, credentials offer learning experiences and formally recognized certifications, with enhanced employability, and serving as stepping stones to higher qualifications. LUC’s micro-credential programs are supported by strong academic frameworks and offer clear progression pathways into full-fledged degree programs. After completing this Micro-credential course, professionals can use their updated skills to apply for promotions or switch to a different job role.