AngularJS - Extends HTML

56 5/5/2017 7:27:49 AM

AngularJS extends HTML withng-directives. Theng-appdirective Defines an AngularJS application. Theng-modeldirective Binds the value of HTML controls (input, select, text-area) to application data. Theng-binddirective Binds application data to the HTML view. The ng-initdirective Initializes AngularJS application variables. You can usedata-ng-, instead ofng-, if you want to make your page HTML valid. ...

AngularJS - Multiple Views with UI-Router

65 5/5/2017 5:46:51 AM

AngularJS - Multiple Views with UI-Router...

AngularJS - Nested Views with UI-Router

40 5/5/2017 5:46:11 AM

AngularJS - Nested Views with UI-Router...

AngularJS - Using $routeProvider and ng-view

32 5/5/2017 5:42:41 AM

AngularJS - Using $routeProvider and ng-view...

AngularJS - Creating a Custom Controller for A Directive

39 5/5/2017 4:54:07 AM

•Directives can specify a Controller using the “controller” property •Syntax “Controller as “ helps namespace the scope •Syntax “Controller as” injects scope, binding the Controller to the current scope ...

AngularJS - Types of Directives

43 5/5/2017 4:48:40 AM

•Element Directive <product-description></product-description> •Comment Directive <product-description></product-description> •Attribute Directive <H3 product-description></H3>• •Class Directive <div class=“product-description”></div> ​ ...

SQL vs MySQL Database

120 5/4/2017 6:58:31 AM

How SQL and MySQL database works? Difference between MySQL and SQL? SQL -Structured Query Language MySQL - Relational database management system Owner Microsoft Oracle Language Actual Language defined by the ISO and ANSIstandard Specific implementation of ISO and ANSI standard Open-Source Not open-source - uses SQL (Structured Query Language) for database management. MySQL is open source that uses SQL (Structured Query Language) Tool Definition Structured Query Language to work with relational database management Actual Management Systems Structure Language Systems Data Operations Add, remove,...

PHP - Data Types

55 5/2/2017 5:22:54 AM

PHP data types: String ​​Can use single or double quotes​ String functions Integer Non-decimal number between -2,147,483,648 and 2,147,483,647​​​ Must have at least one digit Must not have a decimal point Can be either positive or negative Can be specified in three formats: decimal (10-based), hexadecimal (16-based - prefixed with 0x) or octal (8-based - prefixed with 0) Float (aka double) ​​Number with a decimal point or a number in exponential form​ Boolean TRUE or FALSE​ Array ​​Stores multiple values Object ​​​Stores data and information on how to process that data.​ NULL ​​Has no value as...

PHP - Echo vs Print

56 5/2/2017 5:05:26 AM

Echo Print Return value Has no return value Has a return value of 1 Parameters / Argumnets Can take multiple parameters (although such usage is rare Can take one argument Speed Echo is marginally faster than print. <?php echo"<h2>PHP is Fun!</h2>"; echo"Hello world!<br>"; echo"I'm about to learn PHP!<br>"; echo"This ","string ","was ","made ","with multiple parameters."; ?> <?php print"<h2>PHP is Fun!</h2>"; print"Hello world!<br>"; print&qu...


PHP - Variables

58 5/2/2017 4:24:31 AM

PHP variables: A variable starts with the $ sign, followed by the name of the variable A variable name must start with a letter or the underscore character A variable name cannot start with a number A variable name can only contain alpha-numeric characters and underscores (A-z, 0-9, and _ ) Variable names are case-sensitive ($age and $AGE are two different variables) Automatically converts the variable to the correct data type, depending on its value. Example: <!DOCTYPEhtml> <html> <body> <?php $txt ="Hello World!"; $x =5; $y =10.5; echo$txt; echo"<br>...

PHP - Basic Syntax

53 5/2/2017 1:43:07 AM

PHP syntax basics: All keywords (e.g. if, else, while, echo, etc.), classes, functions, and user-defined functions are NOT case-sensitive. All variable names are case-sensitive. Example: <!DOCTYPEhtml> <html> <body> <h1>My first PHP page</h1> <?php // single-line comment​ 1 # single-line comment 2 /* Multiple-lines comment - Line 1 Multiple-lines comment - Line 2 Multiple-lines comment - Line 3 */​ echo"Hello World!"; ?> <?php ECHO"Hello World!<br>"; echo"Hello World!<br>"; EcHo"Hello World!<br>"; ...

PHP - Installation

66 5/2/2017 12:32:31 AM

PHP Setup:http://php.net/manual/en/install.php Typically Installation: install a web server install PHP install a database, such as MySQL ...

PHP - Introduction

56 5/2/2017 12:28:49 AM

"PHP: Hypertext Preprocessor" PHP is a server scripting language Used to make dynamic and interactive Web pages ...

PHP - As I Learned

145 5/2/2017 12:18:23 AM

PHP - As I Learned...

Adobe CMS - Editing a Page

48 5/1/2017 8:19:54 PM

Content Finder Sidekick Drop Zones Text Componet Hyperlinks Format Text Adding Images Column Control ...

Adobe CMS - DAM (Digital Assets Management)

51 5/1/2017 8:19:07 PM

DAM - Digital Assets Management system Adding a folder Uploading Images Asset Meta-Data Tab Replace Original Image/Rendition Change Asset File Name Adding Documents Activating Assets ...

Adobe CMS - Website Overview

46 5/1/2017 8:18:25 PM

Web Content Manager Interface Parent Child Relationship Creating Pages Toolbar Page Properties Moving/ Renaming Pages ...

Adobe CMS - Introduction

67 5/1/2017 8:12:46 PM

Responsive Design Higher Graphical Standards Freedom to Edit Anywhere ...

Adobe CMS - As I Learned

51 5/1/2017 8:07:59 PM

Adobe CMS - As I Learned...

Merge Sort vs Quick Sort

197 4/24/2017 12:53:10 AM

Merge Sort Quick Sort Implementation void MeargeSort(int[] arr) { int[] helper = new int[arr.Length]; MergeSort(arr, helper, 0, arr.Length); } void MergeSort(int[] arr, int[] helper, int low, int high) { if (low < high) { int middle = (low + high) / 2; MergeSort(arr, helper, low, middle); MergeSort(arr, helper, low, middle); Merge(arr, helper, low, middle, high); } } void Merge(int[] arr, int[] helper, int low, int middle, int high) { //Copy both halves into a helper array for (int i=low; i<=high; i++) { helper[i] = arr[i]; } int helperLeft = low; int helperRight = middle + 1; int curren...

BFS vs DFS (Breadth First Search vs Depth First Search)

231 4/21/2017 6:55:34 AM

Breadth First Search (BFS) Depth First Search (DFS) Data Structure Used Queue Stack Traversal Level order Traversal Inorder Traversal (Left-Root-Right) Preorder Traversal (Root-Left-Right) Postorder Traversal (Left-Right-Root) Starts visiting nodes from root or leaves Root Leaves When to use If our problem is to search something that is more likely to closer to root. If the target node is close to a leaf, we would prefer DFS Approach Iterative Reccursive Shortes Path Problem BFS is more efficient than DFS. DFS is not recommendedas it will start traversing from a leaf node. Implementation //Sea...

Algorithms - Interview Questions With Answers

112 4/21/2017 6:38:15 AM

Algorithms - Interview Questions With Answers...

ASP.NET MVC - Types of Action Filters

72 4/20/2017 10:31:52 PM

Types of Filters in ASP.NET MVC: Action Filters− Action filters are used to implement logic that gets executed before and after a controller action executes. We will look at Action Filters in detail in this chapter. ASP.NET MVC provides the following action filters − Output Cache− This action filter caches the output of a controller action for a specified amount of time. [OutputCache(Duration = 10)] Handle Error− This action filter handles errors raised when a controller action executes. [HandleError] Authorize− This action filter enables you to restrict access to...

How to achieve multiple inheritances in C#?

90 4/20/2017 5:39:05 AM

You cannot inherit frommultiple classesin c# by default. But you may use interfaces or a combination ofone class and interface(s), where interface(s) should be followed by class name in the signature. Example: interface A { } interface B { } Class BaseClass {} class DerivedClass : A, B { } // from multiple Interface(s) class DerivedClass : Base, B { } // from one Class and Interfacce(s)​ ...

Time Complexity of Algorithms

164 4/12/2017 12:54:46 AM

S.No Term Called As Definition 1 O(1) Constant Time Time taken for an operation, fixed number of steps E.g. Push and Pop operations for the stack. Enqueue and Deque operations for Queue. 2 O(log n) Logarithmic Time Time was taken will double with each additional element in the input data set E.g. Binary Search Insert and Find operations in a Binary Search tree. Insert and Remove operations for a heap 3 O(n) Linear Time A number of steps proportional to the size of the tasks. (If the size of the task increases then no of steps increases) E.g. Finding Max/Min element in a list. Sequential search...

Tree vs Graph Data structure

271 3/17/2017 3:47:33 AM

Tree Graph Type Tree is type of graph Root Node Tree has root node Graph may or may not have root node Cycles Tree does not contain cycles Graph contains cycles Direction Trees have parent/child relationships Graph may or may not have parent/child relationships e.g. ...

Relational vs Non-Relational Database

283 3/15/2017 9:17:59 PM

How relational and non-relational database works? Relational Database (e.g. SQL) Non-Relational Database (e.g. DynamoDB) Performance Databases are optimized for storage. Performance generally depends on the disk subsystem. Developers must know databaseimplementation details. Developers and database administrators must optimize queries, indexes, and table structures in order to achieve peak performance. DynamoDB is optimized for computing. Performance mainly depends on underlying hardware and network latency. As a managed service, DynamoDB insulates you and your applications from these implemen...

Levenshtein Distance

96 2/13/2017 8:35:58 AM

Levenshtein Distance is a canonical method where it takes two strings, and returns a number representing the minimum number of insertions, deletions and replacements required to translate one string into the other. Distances Example : LevenshteinDistance(cook, book) -> 1 LevenshteinDistance(cook, books) -> 2 LevenshteinDistance(what, water) -> 3 Usage: BK-trees can be used for approximate string matching in a dictionary. Levenshtein distance – the distance metric commonly used when building a BK-tree ...

BK - Tree (Burkhard-Keller Trees)

126 2/13/2017 8:09:35 AM

BK-Tree is a data structure used for spell checking based on the Levenshtein Distance between two words, which is basically the number of changes you need to make to a word to turn it into another word. BK-Trees, or Burkhard-Keller Trees are a tree-based data structure engineered for quickly finding near-matches to a string, for example, as used by a spelling checker, or when doing a 'fuzzy' search for a term. The aim is to return, for example, "seek" and "peek" if I search for "aeek". What makes BK-Trees so cool is that they take a problem which has no ob...

Spell Checker Using BK - Tree

222 2/13/2017 6:57:17 AM

BK- Tree(Burkhard-Keller Trees) Time Complexity O(log n) ...