LMS2

976-587 DCM Digital Content Marketing for Business

Digital Business Student

Relations functions and graphs of relations limits and continuity derivative and applications integrals and applications

Computer components; program analysis and design; data types; operators; condition; repetition; arrays; function and parameter passing process; structuring data; programming practice

web programming

Course: 977-111 Data Structures and Algorithms
Credit: 3 (2-2-5)
Prerequisite: 977-104 Introduction to Computer Programming
Description: Programming paradigms; programming constructs; fundamental concepts of data structures; array; linked lists; stack; queue; trees, binary tree, traversal, B-tree, AVL-tree; complexity analysis; searching and sorting; binary search tree; concepts of recursion; algorithmic strategies; greedy algorithms; divide-and-conquer techniques; dynamic programming; graph problems; shortest path; distributed algorithms; NP-complete problems

The concept of design thinking and the distinctions between design and design thinking; applying design thinking process to solve business problem; developing design thinking skills for individuals and for organizations; practicing design thinking skills; user interface (UI) and user experience (UX) patterns and components; practices for creating UI/UX components within design application; design techniques for digital application such as pixel-perfect design, replication and cross-platform compatibility responsive design

Course: 977-120 Computer Programming Module
Part: 3 - Data Structures and Algorithms
Credit: 9(6-6-15)
Description: computer components; programming paradigms; structure programming; data types; operators; condition; repetition; arrays; function and parameter passing; data structures; linked lists; stack; queue; trees; binary tree; binary search tree (BST); trie; heap; self-balancing BST; complexity analysis; algorithmic strategies; recursion; divide-and-conquer techniques; searching and sorting; greedy algorithms; dynamic programming; graph problems; shortest path; NP-completeness; object-oriented programming; class and object; abstract data type; information hiding; inheritance; polymorphism; event-driven programming; application programming interface (API); programming practice; software project