1.2 - Guest Lecture Mr.Samuel Theodorus - 2101702130 - Andrean

Digital Marketing 

is the marketing of products or services using digital technologies, mainly on the Internet.


Example of Google Adwords :


  • Google Search
  • Google Display Network
  • Youtube Ads
  • Email Ads


Komentar

Posting Komentar

Postingan populer dari blog ini

4 - Introduction to Tree, Binary Tree and Expression Tree - 2101702130 - Andrean

Gambar
Pertemuan ke - 4 20-03-2018 Tree & Binary Tree Tree Concept DEGREE of TREE = 3 DEGREE of C = 2 HEIGHT = 3 PARENT of C = A CHILDREN of  A = B, C, D SIBILING of F = G ANCESTOR of F = A, C DESCENDANT of C = F, G Node at the top is called as root . . Nodes that do not have children are called leaf . Nodes that have the same parent are called sibling . Degree of node is the total sub tree of the node. Height/Depth is the maximum degree of nodes in a tree. If there is a line that connects p to q, then p is called the ancestor of q, and q is a descendant of p. Binary Tree Concept is a rooted tree data structure in which each node has at most two children. •Those two children usually distinguished as left child and right child. •Node which doesn’t have any child is called leaf.  Type of Binary Tree • PERFECT binary tree is a binary tree in which every level are at the same depth. A perfect binary tre...
Baca selengkapnya

1.1 - Pointer, Array and Introduction to Data Structure - 2101702130 - Andrean

Gambar
Pertemuan ke-1 20-02-2018 Array  A collection of  similar data elements These data elements have the  same data type  (homogenous) The elements of the array are  stored in  consecutive memory locations and are referenced by an  Index Array index  starts from   zero  (0) Array Declaration & Accessing Array One Dimensional Array Syntax : type name[size]; Example : Delcaration :   int arr[5]; Accessing:  arr[0] = 2; arr[1] = 5; arr[2] = 1; arr[3] = 3; arr[4] = 4; Two Dimensional Array Syntax : type name[size 1][size 2]; Example : Delcaration :   int arr[5][5]; Accessing: arr[0][2] = 1; arr[2][1] = 1; arr[1][2] = 2; arr[2][2] = 9; Multi Dimension Array Syntax : type name[size 1][size 2][size 3][size...]; Example : Declaration :  ...
Baca selengkapnya

3 - Linked List Implementation II - 2101702130 - Andrean

Gambar
Pertemuan ke - 3 13-03-2018 Stack is an important data structure which stores its elements in an ordered manner. Simplest logic is Last In First Out (LIFO) way.  The elements in a stack are added and removed  only from one end, which is called the top. In a linked stack, every node has two parts: – One that stores data – One that stores the address of the next node Stack Operations push(x)  : add an item x to the top of the stack. pop()  : remove an item from the top of the stack. top()  : reveal/return the top item from the stack. //top is also known as peek Infix, Postfix , and  Prefix Notation Prefix Infix Postfix * 4 10 4 * 10 4 10 * + 5 * 3 4 5 + 3 * 4 5 3 4 * + + 4 / * 6 – 5 2 3 4 + 6 * (5 – 2) / 3 4 6 5 2 – * 3 /  + Prefix: Operator, Left Operand , Right Operand (OLR) Infix : Left Operand , Opera...
Baca selengkapnya