Posts
All the articles I've posted.
CS3016/01. Implement divide-and-conquer algorithms for binary search, merge sort, and quick sort.
Published: 4 hours readTo understand and implement divide-and-conquer algorithms - Binary Search, Merge Sort, and Quick Sort, and analyze their time and space complexities.
CS3016/02. Program graph theory reductions among clique, vertex cover, and independent set problems.
Published: 4 hours readTo understand and implement polynomial-time reductions among the Clique, Vertex Cover, and Independent Set problems, which are fundamental in computational complexity and NP-completeness.
Mapping of GECA's academic resources
Updated: 5 hours readThis post mean't to index all the links, resources, labs, and notes made for GECA's academics. Here are all the links, categorized subject wise.
CS3014/01. Introduction to ASP.NET Web Framework
Updated: 2 hours readIntroduction to ASP.NET Web Framework, a web framework for building modern web apps and services with .NET.
CSPCC5002. Notes - Machine learning
Updated: 4 hours readThese notes provide a detailed yet concise overview of the topics in Machine Learning as per the syllabus
CSPC2006/02. Creating Wireframes and Prototypes
Published: 2 hours readTo Understand what wireframes and prototypes are in UI/UX design. To Learn how to create wireframes and prototypes using popular tools. To Gain experience in translating ideas into visual layouts.
CSPC2005/01. Construct and Execute a C Program Showing the Use of Pointer to Structure
Updated: 2 hours readTo understand and demonstrate the use of pointers to structures in C programming by constructing and executing a simple C program. This lab will help students grasp how pointers can be used to reference and manipulate data within structures.
CSPC2006/01. Creating User Research and User Profiles
Updated: 2 hours readTo Learn the fundamentals of user research. To Collect and analyze data to understand user needs. To Create detailed **User Profiles (Personas)** based on your research findings.
CSPCC5001. Binary Search Tree
Updated: 25 min readBinary search trees are data structure that can be used to store data more efficiently - such that it can be searched and retrieved.
CSPCC5002. Machine learning paradigms
Updated: 25 min readLearning Scenarios in Machine Learning - Various approaches to how models learn and are evaluated based on the availability, type, and sequence of training data.