idrakimuhamad

BEGIN:VCARD
VERSION:2.1
N:Ronan;Dick;;;
FN:Dick Ronan
TEL;type=HOME:880-(235)587-5296
END:VCARD
BEGIN:VCARD
VERSION:2.1
N:Ferrucci;Dori;;;
FN:Dori Ferrucci

idrakimuhamad

Find Sum Pair from given array and target

A Pen by idrakimuhamad on CodePen.

License.

idrakimuhamad

Introduction to React

ReactDOM.render(
  <h1>Hello, world!</h1>,
  document.getElementById('root')
);

• Declarative
• Component-Based
• Learn Once, Write Anywhere

idrakimuhamad

idrakimuhamad

AngularJS

Introduction

AngularJS is a structural framework for dynamic web apps. It lets you use HTML as your template language and lets you extend HTML's syntax to express your application's components clearly and succinctly. AngularJS's data binding and dependency injection eliminate much of the code you would otherwise have to write. And it all happens within the browser, making it an ideal partner with any server technology.

idrakimuhamad

PROPOSED CMS

Wordpress

Among the famous CMS around.

• Written in PHP, with MySQL for DB
• Free
• Used by thousands established and reputable brand
• Lots of plugin to be leverage
• Features

idrakimuhamad

yOZdzK

A Pen by idrakimuhamad on CodePen.

License.

idrakimuhamad

var indexDBSupport = window.indexedDB ? true : false, bookingDB;

if (indexDBSupport) {
    // open the db
    var open = indexedDB.open('weirdstuff',1);

    // fired when the user hit the site first time
    open.onupgradeneeded = function(e) {
        console.log('Upgrading');
        var upgradeDb = e.target.result;

idrakimuhamad

#!/bin/bash

checkExisting(){

echo "Checking if already existing device on file..."

while read fileLine; do
    
    if [ "$line" = "$fileLine" ]; then
    	echo "[WARNING] Device already initialized on this system. Nothing to do here"

idrakimuhamad

This example builds a random tree using the Reingold-Tilford "tidy" algorithm, as described in "Tidier Drawings of Trees" and implemented by d3.layout.tree. As each node is added to the graph, it enters from the previous position of the parent node. Thus, the existing nodes and the new node transition smoothly to their new positions. The animation stops when 500 nodes have been added to the tree.