Available Balance
December 8, 2017

A keyword is simply a word or phrase that people search for in the search engines. Every time you do a google search you are entering a “keyword” into the search box.
For example, here is an example search I did in Google.
This is a keyword. I searched for something that I was looking for and Google is going to provide me with the most relevant results (see below).
When I click on one of these results, I am taken to a website that has been “ranked” in Google. If I purchase something from that page or click an ad, that website owner will make money as a result.
With your SEO and your keyword research efforts, your goal is going to be to building a list of relevant keywords to your niche, and then working to rank them in Google just like this.
There are literally MILLIONS of keywords in every niche, leading to incredible potential. And by being a member at Wealthy Affiliate and what you are going to learn here about proper “ranking techniques”, you are going to have the competitive edge over your competition.
In this lesson you are going to be tasked to come up with a few “keywords” relevant to your website and your niche.

Each Post You Create Will Be Targeting a Keyword…

Moving forward, you are going to be building content on your website. Each page of content that you create will target a brand new keyword (and we will be showing you how).
This means that every page/post will have the opportunity to rank under that given keyword in Google and lead to you getting traffic.
100 posts = 100 target keywords = 100+ potential Google rankings.
This can and will lead to mass amounts of traffic and those that follow along with this training are going to see their traffic continue to go up with every “keyword targeted” page or post that they create on their website.
Remember, Google and other search engines exist because of CONTENT and if you can deliver quality content (that targets low competition keywords), you will be able to get great rankings!
I have created a video walk-through of this lesson and I suggest you watch on keyword mastery. It is going to increase your comfort level with keywords by 100 fold!

Task 1: Create a FREE Jaaxy Account
To perform keyword research, you need access to a keyword tool. The one that we recommend here is Jaaxy and it is completely free to register your account.
===> Register for a FREE Jaaxy Account!
Simply fill out your First Name, Last Name, Email Address and Password fields and you will gain instant access to 30 free keyword searches using Jaaxy.
Jaaxy.com is the most powerful keyword & research platform online and delivers accurate, real time data that is going to help you come up with SEO ready keywords. Jaaxy is also a company that Carson and I own and founded and was built to fill the many missing gaps of every other keyword tool out there.
Going forward, Jaaxy is going to provide you with sophisticated keyword and research data (and will save you a TON of time).
Again, this gives you access the trial membership, no credit cards required. I know you will LOVE Jaaxy!
Task 2: Perform 5 different searches using Jaaxy.com
Your next task is going to be performing 5 searches relevant to your niche using the Jaaxy.com Keyword tool.
My suggestion is to start broad with a few of your searches (ie. two or three word searches). For example if your niche was “basketball skills & drills”, you might want to start with the search terms:

basketball drills
basketball skills
increase vertical jump
dribbling drills
For example, in the example below I searched for the term: increase vertical jump.
Here are how the search results look.
As you can see there are several columns of “keyword data”. These are all very important when it comes to choosing keywords that are going to be useful to you.
Keyword. This is the search phrase that the data to the right of it is representing.
Avg. This is the overall monthly traffic this search term gets, globally.
Traffic. This is the estimated amount of traffic you will get if you rank on the first page of Google under this term.
QSR. Known as Quoted Search Results, this is the exact number of results in Google that you are competing with under this search phrase. In other words, this is how much competition you have.
KQI (Keyword Quality Indicator)
If you do a search and you don’t see the full data, you simply need to click the “Get QSR” link and it will fetch the data for you. You will see that if that particular keyword has never been searched before.

Rate This Content
Adding Elements to Html5 Documents Using Sublime Text
November 28, 2017

In today’s class we learn how to add HTML5 elements to how app. This is essential as it will enable your app to have more features such as buttons, image, different type of text (emphasized text, italicized text, bolded text, etc.), select menu, etc.

To start with, we should know that all elements should have a tag, some only have a closing tag while others both have an opening tag and a closing tag.


Every opening tag starts with the character <element’s_symbol> – without the apostrophes. Within the brackets is the element’s symbol. you want to use. The following illustrates the idea.

For a paragraph use                        <p>        – note there is no apostrophe.

For a button use                               <button>

For an image use                              <img>



The closing tag of elements that should have a closing tag should be thus </element’s_symbol>.

Now let’s go forward and see how to add some and more of the elements.

Adding a new paragraph: This is for adding a text paragraph to be seen on any portion of your app.

  1. Open your project using your favourite IDE (In this class the common IDE is sublime text).

we have learnt how to do this so I won’t teach how to do this today

  1. In the order or position, you want to add the paragraph, type the opening tag together with the element symbol. Note: the good thing about sublime text is that once you start typing for new element it pops up suggestion(s) for you to choose. Once you choose the suggestion that you want it automatically closes the tag if the element needs a closing tag or it just leaves it showing that your element needs no closing tag.Use the down arrow key to move to which options of the suggested tag you want and ENTER.For <p + ENTER sublime text automatically gives you this <p></p>. (Still at code line 101)

    Having done that, the cursor is automatically placed in between the closing and opening tag

    (i.e. <p> CURSUR HERE </p). So, start typing what paragraph text you want or add other elements if you wish.


    Adding Buttons: Buttons are usually included for app users to click for app to do something based on user’s choice

    It is done in the same way as described above for adding paragraph. So try it out. The syntax for button is:

    <button> Name of Button/Action Here </button>

    Adding Option Menu: A kind of drop down list for users to choose from.

    Do as above but the element tag should go thus:

    Start typing <sel, choose the <select> and click enter for the below syntax to be generated automatically by sublime text.

    1. <select></select>

    Click ENTER again to make it look thus:




    In between the space between the opening and closing tag where sublime text places the cursor automatically, type and choose <option> for the below syntax to be generated by sublime text automatically.

    1. <option></option>

    Finally type the name of the options in between the opening and closing tag e.g. <option>Subscribe Now</option>

    You can also add more options in the same manner. E.g. for three options. Your syntax should look thus:


    <option>option 1</option>

    <option>Option 2</option>

    <option>Option 3</option>


    You can try to add and test other elements by typing and choosing any suggestion e.g. <b> for bold text, <i> for italicized text etc. When done, go to your browser and refresh to see the effect of each change you have made.


    We have come to the end of this class. Hope it was helpful? See you in the next class. Bye.

Rate This Content
Promote Your Social Media Sites
November 23, 2017

Dosto ap sab sy is link ko open krin aur web site me registor ho jain

Apna account bnain aur is site me apna facebook,twitter,youtube account add krin

ap k samny link show hon gy ap ny woh open kerny hain

facebook ky link facebook main khulin gy

ap ny facebook link ko open ker ky jo page aay usy like kerna hy

ap ko credit mil jay ga.

jab ap ky credit zyda ho jain ap facebook friends aur like khreed sakty hain

aur ap apny credit ko hasil bhi ker sakty hain paypal ky through

Internet se online paise kamany ka asan Tariqa Her man aur Woman search kerte rehte hain.Is Bare me.Main ny apny Blog me different Tariqe Btay hain ky paisy kesy Earn kiay jaty hian.

Aj main ap ko Btaon ga ky fanslave sy kesy Eraning ki jati hy.

Fanslave Actual main aik aise website aur plateform hy jissy bohat sy log earning ker rahy hain.Is Website se ap part time online work ker ke income ker sakty hain.

Fanslave sy online bina paisa lgay paisy kaisy kamay jaty hain?

Is question ka jwab ap ko detail ky sath bata raha hon.

Fanslave sy Earning kerny ky liay ap  ky pass Facebook Account hona Lazmi hy.Is ky Elawa Twitter,Youtube aur Gmail account sy bhi earning hote hy.

Sab sy pehly tu ap ko Fanslave per registor hona parry ga

is link ko open kerin aur registor ho jain.

Link per click kerny ky bad ap ky samny Fanslave ki site open ho jay gi ap ny create account per click kerna hy us ky bad ye fields pur kerni hain.

  • Name
  • Username
  • Password
  • Confirm Password
  • Email
  • Confirm Email

Us ky bad create account per click ker dien ap ka account create ho jay ga.

Pher ap ny Email Verify kerwani hy.Ap ny jo bhi Email account dena hy us ko open kerin aur Verify Fanslave account per Click ker dien ap ka Account verify ho jay ga.

Rate This Content
Complete Small Jobs Earn Instant Cash Now using Easy Paisa and Mobile Load
November 23, 2017

Pakistan main mojod woh User jo Scam Sites use ker ky Thak Gay hain Aj main Un ky liay instant Cash Program Ly Ker Aya hon.

 Ap ko ye small jobs task ky liay di jain ge.


 => Small Jobs


           => Sign Up

           => Mobile Application (Android only)

           => Search & Click

           => Youtube,Facebook,Twitter Promotion


=> Conditions


  • Poyout Ky kiay Ye Chezin Required hon Ge 

                => Name

                => Mobile Number

                => City Name

  • Proof Ky Liay Screen Shot Must ho ga
  • VPN Allowed ni ho ga.
  • Kasi bhi Task ko complete kernay kay laiy.App ko   aik hi Device per Lataddad Accounts Bnany ki Ejazat ni De Jay Ge.
  • Her New Task Isi Post kay End main Dya Jay Ga.

=> Task Rates

 Task                                 Rate       

App Download                                 Rs.8 – 15

Sign up                                 Rs.5 – 10

Note: Apni Payment yahan sy hasil kerin ==>Whats app

  Screen shot aur apni Sari Detail Whatsapp per bejin.Jab Aap Koe Task complete ker lien tu us ka proof bej dien.

App  ko Her Task ky Elahda Paisy bejy Jain gy Bazria Easy Paisa.Ager Ap Mobile Load hasil kerna Chahin tu wo bhi ap ko jab Rs:30 zyada ho ga tu ap ky number per bej dia jay ga.

=> Small Tasks

  • Install app from these links

Oper link per click ker ky sab sy pehly Telegram install kerin us ky bad post main mojod tmam robots links ko open kerin. Jab aap open kerin gy tu woh Telegram main open hon gay.App ny start ker dena hy.Task complete ho jay ga.

Screen Shot Bej dien

Above link sy bulb smash app install ker kay facebook sy sign up kerin.

Screen Shot Bej dien.

Is task ko complete kerny sy pehly aap ko.Sab sy pehly playstore sy Flash vpn install kerna ho ga.

Us ky bad vpn ki location USA select ker ky connect kerny k bad pher is ko open ker ky Pay Your Selfie app install kerna ho ga.Ager pher bhi Play Store main Show na ho tu PlayStore ko Clear Recoed ker ky try kerin ho jay ga.Pher apni Selfie upload kerin aur jab approve ho tu ap ky account main 1$ add ho jay tu Screen Shot lay lien.

Screen shot bej dien.

Is link per click kerny ky bad ye code 801682e1  confirm ker ky app install kerin.Pher app ko do din tak use kerin.

Screen shot bej dien.

Is link sy  app ko install kerin. Us ky bad Facebook sy Log in kerin Pher Is game main mojod aik game open ker ky khailni hy us ky bad Aadmi ky nishan per click ker ky ye code  3BH8Z enter kerin.

Screen shot bej dien.

==>  Sign Up

is link ko open kerny ky bad ap ky samny post show ho gi ap ny nechy banner per click kerna hy ap ky samny site open ho gi us main sign up kerin. 

Screen shot bej dien.

Rate This Content
The most powerful Mobile phones
November 23, 2017


1. Samsung Galaxy S6galaxy s6

Galaxy S6 is the latest and the greatest Galaxy S phone released by Samsung till date. Unlike the previous generation of galaxy series phones, the Galaxy S6 sports glass front and back imparting the handset a premium look and feel. Its 16 MP camera is also equally impressive making it a must buy for photography buffs.

Specifications: Galaxy S6

  • Chipset: Exynos 7420
  • CPU:5 GHz quad-core + 2.1 GHz quad-core
  • GPU: Mali-T760MP8
  • RAM: 3 GB
  • OS: Android 5.1
  • Display:1 inch, 2K, Super AMOLED display, Gorilla Glass 4
  • Camera: Primary- 16 MP laser-AF with LED Flash, OIS; Secondary- 5 MP FF
  • Memory: Internal- 32/64/128 GB ; External- None.
  • Battery: 2550 mAh Li-ion (removable)
  • Connectivity: GPS with A-GPS and GLONASS, NFC, IR port, micro USB with USB Host, Bluetooth 4.1, EDGE, HSPA, WiFi with hotspot and WiFi Direct.

2. Xiaomi Mi 5

The Mi5 is the latest from Xiaomi and runs on Android Marshmallow OS. The phone packs a fingerprint in the home button which looks similar to the setup found in Samsung Galaxy S6 and above. It packs Snapdragon 820 chip along with 3 GB RAM. The phone will be launched in India next month bearing a price tag of Rs. 25,000 approximately

Specifications: Xiaomi Mi 5

  • Chipset: Snapdragon 820
  • CPU: 2.15 GHz dual-core + 1.6 GHz dual-core
  • GPU: Adreno 530
  • RAM: 3 GB / 4 GB
  • OS: Android Marshmallow 6.0
  • Display: 5.15 inch, IPS FHD Display
  • Camera: Primary- 16 MP PF-AF with dual-tone dual-LED Flash, OIS; Secondary- 4 MP
  • Memory: Internal- 32/64/128 GB; External- None.
  • Battery: 3000 mAh Li-Po (non-removable)
  • Connectivity: GPS with A-GPS, 4G, NFC, IR Port, Typce C USB with USB Host, fingerprint, Bluetooth 4.2, EDGE, HSPA, WiFi with hotspot and WiFi Direct

3. Lenovo Vibe P1 Turbo

Lenovo Vibe P1 Turbo is priced at Rs. 17,999 and is available at offline stores in India. The phone runs on Snapdragon 615 chip and boasts a big 5000 mAh battery. Specifications: Lenovo Vibe P1 Turbo

  • Chipset: Snapdragon 615
  • CPU: 1.5 GHz quad-core + 1.1 GHz quad-core
  • GPU: Adreno 405
  • RAM: 3 GB
  • OS: Android 5.1 Lollipop
  • Display: 5.5 inch, IPS FHD display, Gorilla Glass 3
  • Camera: Primary- 13 MP AF with dual-LED dual-tone Flash; Secondary- 5 MP FF
  • Memory: Internal- 32GB; External- Up to 128 GB via microSD card slot
  • Battery: 5000 mAh Li-Po (non-removable)
  • Connectivity: GPS with A-GPS and GLONASS, 4G LTE, fingerprint scanner, FM Radio, NFC, micro USB with USB host, Bluetooth 4.1, EDGE, HSPA, WiFi with hotspot.
Rate This Content
How to Maximize Your Earnings Using AppLike
November 23, 2017

If you have read my blog about AppLike, you will know that I am quite fond of it. So far, I have spent around one and a half months using it, and have earned nearly 35 dollars. So, to help you cash out sooner, I have compiled a small list of my best tips and tricks to maximize your earning!

  1. Switch your apps often- AppLike will always give you new apps under the proposed section, so you will always have new apps to download. The reason this is important is because eventually, the earning times for the apps get extremely large. For example, when you first download an app, it will say “in 1:00 you will earn 250 coins”. Then, after that interval, it will move to a longer time with a higher number of coins. From my experience, the cap is 673 coins after 8 hours of playing. That can be a little unreasonable. After you earn about 15,000 coins from an app, I would recommend deleting it and replacing it with a new one.
  2. Run the Apps Constantly- The best way to rack up earnings with this app is to let your phone run the apps as much as possible. When you’re doing homework, run the apps. When you’re eating dinner, run the apps. Also, download an app that prevents your screen from auto-sleeping so that you don’t have to constantly turn it back on. By doing this, you will significantly increase your earnings.
  3. Try to only use “extremely many” and “plenty” of coin apps- These apps are your best bet for earning a lot of coins. They offer the highest number of coins per period, and it is much more worth your time than the other options. Avoid the “some” and “many mCoins”. These apps pay out very small rewards in the same amount of time as the others and are not worth your time. Stay away from them.
  4. Use This Code to Download- If you use that code to download the app, you will receive 4,444 as an initial credit, and you will have an excellent head start in being able to cash out!

There you have it! Download the app and try out these tips for yourself! You’ll be cashing out and earning real money in no time!

Rate This Content
November 23, 2017
What is Bitcoin and How Does it Work?

HOW TO BEGIN: =>   $$$    <=

1. Download “Telegram”(a messenger app) in Google Playstore or Desktop version in web.telegram.org. Login your contact number to register.

2. You can find Robots link here Start Robots Earning.

3. Click START

Cash Robot

Try this bot in Telegram called the CashRobot. Once you signed in me you get FREE 300 gems which equivalent to 0.00030000 BTC, plus free up to 100 gems daily bonus.

Those gems can be used as in-game money to hire different robots. Every robot obtain the energy which you can sell or exchange on real money! Every robot type has individual characteristics and gets different amount of energy. You can hire as much units, as you wish! Your robots don’t getting tired and they will obtain the energy 24 hours!

Game Currency Rate


1000 gems = 0.001 BTC

The minimum payout is 0.001 btc.

So just a few clicks you’ll have been earning and it’s getting easier and growing your earnings .

            HOW TO EARN GEMS:


You can obtain the gem bonus every 24 hours. This will be added to your available balance. Bonus will be generated randomly from 10 to 100 gems. To claim your daily bonus, click the Bonus button on your menu.


1. Hire the robots, they will obtain the energy!

2. Energy will be collected, absorb it!

3. Sell the energy and earn GEMs. You can sell your energy from hangar and obtain gems, and exchange it on real money. Obtained gems distributes between two accounts ( Available balance and Payout balance) in next proportion: 70% to Available balance and 30% to Payout balance. With the available balance you can buy robots and with the payout balance you can request payment.

4. Exchange gems for real money or hire more robots to raise income


To earn faster is to Invest(buy gems) and you can also gain additional robot bonus for doing that.


Invite your friends and get 50 gems as a bonus and 30% from every balance replenishment by invited person. You income has no limits! Even few people can raise your income to 100,000 gems. Minimum payout is 0.001 BTC (1000 gems).


Try your luck to gain double or to multiply your gems.


Participating in events can also earn gems. Try it!

Contact : [email protected]

Facebook: [email protected]

Rate This Content
Binary Search Tree – Searching, Deletion

Searching a BST is even simpler than insertion. The pseudocode is self-explanatory but we will look brie°y at the premise of the algorithm nonetheless.
We have talked previously about insertion, we go either left or right with the right subtree containing values that are ¸ x where x is the value of the node
we are inserting. When searching the rules are made a little more atomic and at any one time we have four cases to consider:

1. the root = ; in which case value is not in the BST; or
2. root.Value = value in which case value is in the BST; or
3. value < root.Value, we must inspect the left subtree of root for value; or
4. value > root.Value, we must inspect the right subtree of root for value.
1) algorithm Contains(root, value)
2) Pre: root is the root node of the tree, value is what we would like to locate
3) Post: value is either located or not
4) if root = ; 5) return false
6) end if
7) if root.Value = value
8) return true
9) else if value < root.Value
10) return Contains(root.Left, value)
11) else
12) return Contains(root.Right, value)
13) end if
14) end Contains


Removing a node from a BST is fairly straightforward, with four cases to consider:

1. the value to remove is a leaf node; or
2. the value to remove has a right subtree, but no left subtree; or
3. the value to remove has a left subtree, but no right subtree; or
4. the value to remove has both a left and right subtree in which case we

promote the largest value in the left subtree.
There is also an implicit ¯fth case whereby the node to be removed is the only node in the tree. This case is already covered by the ¯rst, but should be
noted as a possibility nonetheless. Of course in a BST a value may occur more than once. In such case the ¯rst occurrence of that value in the BST will be removed.

The Remove algorithm given below relies on two further helper algorithms named FindP arent, and FindNode which are described in x3.4 and x3.5 re-

Rate This Content
Binary Search Tree – Insertion, Introduction

Binary search trees (BSTs) are very simple to understand. We start with a root node with value x, where the left subtree of x contains nodes with values < x
and the right subtree contains nodes whose values are ¸ x. Each node follows the same rules with respect to nodes in their left and right subtrees. BSTs are of interest because they have operations which are favourably fast: insertion, look up, and deletion can all be done in O(log n) time. It is important to note that the O(log n) times for these operations can only be attained if the BST is reasonably balanced; for a tree data structure with self balancing properties see AVL tree de¯ned in x7).

In the following examples you can assume, unless used as a parameter alias that root is a reference to the root node of the tree.


As mentioned previously insertion is an O(log n) operation provided that the tree is moderately balanced.
1) algorithm Insert(value)
2) Pre: value has passed custom type checks for type T
3) Post: value has been placed in the correct location in the tree
4) if root = ; 5) root à node(value)
6) else
7) InsertNode(root, value)
8) end if
9) end Insert

1) algorithm InsertNode(current, value)
2) Pre: current is the node to start from
3) Post: value has been placed in the correct location in the tree
4) if value < current.Value
5) if current.Left = ; 6) current.Left à node(value)
7) else
8) InsertNode(current.Left, value)
9) end if
10) else
11) if current.Right = ; 12) current.Right à node(value)
13) else
14) InsertNode(current.Right, value)
15) end if
16) end if
17) end InsertNode

The insertion algorithm is split for a good reason. The ¯rst algorithm (non- recursive) checks a very core base case – whether or not the tree is empty. If
the tree is empty then we simply create our root node and ¯nish. In all other cases we invoke the recursive InsertNode algorithm which simply guides us to
the ¯rst appropriate place in the tree to put value. Note that at each stage we perform a binary chop: we either choose to recurse into the left subtree or the
right by comparing the new value with that of the current node. For any totally ordered type, no value can simultaneously satisfy the conditions to place it in
both subtrees.

Rate This Content
Linked Lists – Deletion, Reverse Traversal

As you may of guessed the cases that we use for deletion in a doubly linked list are exactly the same as those de¯ned in x2.1.3. Like insertion we have the added task of binding an additional reference (Previous) to the correct value.

1) algorithm Remove(head, value)
2) Pre: head is the head node in the list
3) value is the value to remove from the list
4) Post: value is removed from the list, true; otherwise false
5) if head = ; 6) return false
7) end if
8) if value = head.Value
9) if head = tail
10) head à ; 11) tail à ; 12) else
13) head à head.Next
14) head.Previous à ; 15) end if
16) return true
17) end if
18) n à head.Next
19) while n 6= ; and value 6= n.Value
20) n à n.Next
21) end while
22) if n = tail
23) tail à tail.Previous
24) tail.Next à ; 25) return true
26) else if n 6= ; 27) n.Previous.Next à n.Next
28) n.Next.Previous à n.Previous
29) return true
30) end if
31) return false
32) end Remove

Singly linked lists have a forward only design, which is why the reverse traversal algorithm de¯ned in x2.1.5 required some creative invention. Doubly linked lists make reverse traversal as simple as forward traversal (de¯ned in x2.1.4) except that we start at the tail node and update the pointers in the opposite direction. Figure 2.6 shows the reverse traversal algorithm in action.

1) algorithm ReverseTraversal(tail)
2) Pre: tail is the tail node of the list to traverse
3) Post: the list has been traversed in reverse order
4) n à tail
5) while n 6= ; 6) yield n.Value
7) n à n.Previous
8) end while
9) end ReverseTraversal

Linked lists are good to use when you have an unknown number of items to store. Using a data structure like an array would require you to specify the size
up front; exceeding that size involves invoking a resizing algorithm which has a linear run time. You should also use linked lists when you will only remove
nodes at either the head or tail of the list to maintain a constant run time. This requires maintaining pointers to the nodes at the head and tail of the list
but the memory overhead will pay for itself if this is an operation you will be performing many times. What linked lists are not very good for is random insertion, accessing nodes by index, and searching. At the expense of a little memory (in most cases 4 bytes would su±ce), and a few more read/writes you could maintain a count variable that tracks how many items are contained in the list so that accessing such a primitive property is a constant operation – you just need to update count during the insertion and deletion algorithms. Singly linked lists should be used when you are only performing basic in- sertions. In general doubly linked lists are more accommodating for non-trivial operations on a linked list. We recommend the use of a doubly linked list when you require forwards and backwards traversal. For the most cases this requirement is present. For example, consider a token stream that you want to parse in a recursive descent fashion. Sometimes you will have to backtrack in order to create the correct parse tree. In this scenario a doubly linked list is best as its design makes
bi-directional traversal much simpler and quicker than that of a singly linked

Rate This Content