'প্রযুক্তিতে নতুনের ছোঁয়া': C plus plus

C++ Programming for the Absolute Beginner pdf free download

<div dir="ltr" style="text-align: left;" trbidi="on">
<div style="text-align: center;">
<h2>
C++ Programming for the Absolute Beginner</h2>
</div>
<div style="text-align: center;">
<br /></div>
<div style="text-align: center;">
<br /></div>
<div style="text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhZVBDKSrWTmKzD6KvwAjg9F5F4NbGp-5IDiyf_mBtaLmHYjxcM-V-ZuwzD1GFFQXDdRgeSogXnIzJhpPQoIZM_0u0lWpZu2FpvMI6Z9CRLU-HcG2BNIYLIL_ZXuqBwQgRxaQ88qHkvtVjA/s1600/Screenshot_2.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="400" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhZVBDKSrWTmKzD6KvwAjg9F5F4NbGp-5IDiyf_mBtaLmHYjxcM-V-ZuwzD1GFFQXDdRgeSogXnIzJhpPQoIZM_0u0lWpZu2FpvMI6Z9CRLU-HcG2BNIYLIL_ZXuqBwQgRxaQ88qHkvtVjA/s400/Screenshot_2.png" width="323" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div style="text-align: center;">
<a href="https://mega.nz/#!1pgWhJAS!ZuyIMDmwMhcjt3umh5M-zkd9dKNloFUxwQqFQFYU7Ks" target="_blank"><span style="color: #351c75; font-family: Helvetica Neue, Arial, Helvetica, sans-serif; font-size: x-large;">Download</span></a></div>
<div style="text-align: center;">
<br /></div>
</div>

C++ Programming for the Absolute Beginner pdf free download

C++ Programming for the Absolute Beginner Download

Binary Search

<div dir="ltr" style="text-align: left;" trbidi="on">
<div dir="ltr" style="text-align: left;" trbidi="on">
<h3 style="text-align: left;">
<span style="font-size: large;">Overview of  Binary Search </span></h3>
The binary search algorithm begins by comparing the target value to the 
value of the middle element of the sorted array. If the target value is 
equal to the middle element's value, then the position is returned and 
the search is finished. If the target value is less than the middle 
element's value, then the search continues on the lower half of the 
array; or if the target value is greater than the middle element's 
value, then the search continues on the upper half of the array. This 
process continues, eliminating half of the elements, and comparing the 
target value to the value of the middle element of the remaining 
elements - until the target value is either found (and its associated 
element position is returned), or until the entire array has been 
searched (and "not found" is returned).<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh8S5WHwTR-ZWlYLou_ibWiDiJeNLDddFCx4J9pz2xD1NIhCZGd1sPpZfOocD2VeXXq6PTjzX4ndlhUDSkp28KcWtRjwTam0VjNzBET0trFCyyT2LrTcKqmv1VaAY9lS-TKqSwYEZfxiPwy/s1600/binary_search.gif" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="342" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh8S5WHwTR-ZWlYLou_ibWiDiJeNLDddFCx4J9pz2xD1NIhCZGd1sPpZfOocD2VeXXq6PTjzX4ndlhUDSkp28KcWtRjwTam0VjNzBET0trFCyyT2LrTcKqmv1VaAY9lS-TKqSwYEZfxiPwy/s400/binary_search.gif" width="400" /></a></div>
<br />
Binary search algorithm in C++ relies on a divide and conquer strategy 
to find a value within an already-sorted collection. Binary search 
locates the position of an item in a sorted array. Binary search compare
 an input search key to the middle element of the array and the 
comparison determines whether the element equals the input, less than 
the input or greater. The return value is the element position in the 
array.<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjH_tQDmSi9oFDJv6HvWd7M8LVCwuIa20_Es9y8dP469CFEMONXGFUq3lwNnPx-nTZat4bdHmZPGXtd1gXxsaehwbqfsz-is0lfEnpl-Q-aefik_oEar0Vj3UqkTRjnFJxl6Lif8xJsWB5M/s1600/9binarysearch.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="330" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjH_tQDmSi9oFDJv6HvWd7M8LVCwuIa20_Es9y8dP469CFEMONXGFUq3lwNnPx-nTZat4bdHmZPGXtd1gXxsaehwbqfsz-is0lfEnpl-Q-aefik_oEar0Vj3UqkTRjnFJxl6Lif8xJsWB5M/s400/9binarysearch.png" width="400" /></a></div>
<br />
<h3>
<span style="font-size: large;">Binary Search Algorithm complexity</span></h3>
<ul>
<li>Worst case performance O(log n)</li>
<li>Best case performance O(1)</li>
<li>Average case performance O(log n)</li>
<li>Worst case space complexity O(1) </li>
</ul>
The idea of binary search is to use the information that the array is 
sorted and reduce the time complexity to O(Logn). We basically ignore 
half of the elements just after one comparison.<br />
<b>1)</b> Compare x with the middle element.<br />
<b>2) </b>If x matches with middle element, we return the mid index.<br />
<b>3)</b> Else If x is greater than the mid element, then x 
can only lie in right half subarray after the mid element.  So we recur 
for right half.<br />
<b>4)</b> Else (x is smaller) recur for the left half.<br />
<br />
<h2 style="text-align: center;">
 
<b>Iterative </b> implementation of Binary Search</h2>
<br />
<pre class="brush:cpp;"> 
#include<iostream>
using namespace std;

// A iterative binary search function. It returns location of x in
// given array arr[l..r] if present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
  while (l <= r)
  {
    int m = l + (r-l)/2;

if (arr[m] == x) return m;  // Check if x is present at mid

if (arr[m] < x) l = m + 1; // If x greater, ignore left half

else r = m - 1; // If x is smaller, ignore right half
  }
  return -1; // if we reach here, then element was not present
}

int main(void)
{
   int arr[] = {2, 3, 4, 10, 40};
   int n = sizeof(arr)/ sizeof(arr[0]);// calculate array size

int x ;
   //print array
   for (int i=0;i<n;i++)
   {
       cout<<arr[i]<<"\t";
   }
   cout<<"\n\nEnter a number to Search: ";
   cin>>x;
   int result = binarySearch(arr, 0, n-1, x);
   if (result==-1)
   {
       cout<<"\nElement is not found in array"<<endl;
   }
   else
   {
       cout<<"\nElement is found at index:==> "<< result<<endl;
   }

return 0;
}

</pre>
<br />
<h2 style="text-align: center;">
::Output ::</h2>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhzVfwdtXs0KUsEtgWfF0WeIZIYWeU7LnM7Z6KmAM2BtmYW6IoF8vosllHpvmllHK_XsjQeFW0m_2RkEwg1cRUcvuGvXlHTdVEubHukIDEn5pBM43aNFl1IX05AQwUCrofUOK-GaroODeYM/s1600/Screenshot_3.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="143" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhzVfwdtXs0KUsEtgWfF0WeIZIYWeU7LnM7Z6KmAM2BtmYW6IoF8vosllHpvmllHK_XsjQeFW0m_2RkEwg1cRUcvuGvXlHTdVEubHukIDEn5pBM43aNFl1IX05AQwUCrofUOK-GaroODeYM/s400/Screenshot_3.png" width="400" /></a></div>
<br />
<h2 style="text-align: center;">
<b>Recursive </b> implementation of Binary Search</h2>
<br />
<pre class="brush:cpp;"> 
#include<iostream>
using namespace std;

// A recursive binary search function. It returns location of x in
// given array arr[l..r] is present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
   if (r >= l)
   {
        int mid = l + (r - l)/2;

// If the element is present at the middle itself
        if (arr[mid] == x)  return mid;

// If element is smaller than mid, then it can only be present
        // in left subarray
        if (arr[mid] > x) return binarySearch(arr, l, mid-1, x);

// Else the element can only be present in right subarray
        return binarySearch(arr, mid+1, r, x);
   }

// We reach here when element is not present in array
   return -1;
}

int main(void)
{
   int arr[] = {2, 3, 4, 10, 40};
   int n = sizeof(arr)/ sizeof(arr[0]);// calculate array size

return 0;
} </pre>
</div>
<h2 style="text-align: center;">
::Output ::</h2>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhzVfwdtXs0KUsEtgWfF0WeIZIYWeU7LnM7Z6KmAM2BtmYW6IoF8vosllHpvmllHK_XsjQeFW0m_2RkEwg1cRUcvuGvXlHTdVEubHukIDEn5pBM43aNFl1IX05AQwUCrofUOK-GaroODeYM/s1600/Screenshot_3.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="143" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhzVfwdtXs0KUsEtgWfF0WeIZIYWeU7LnM7Z6KmAM2BtmYW6IoF8vosllHpvmllHK_XsjQeFW0m_2RkEwg1cRUcvuGvXlHTdVEubHukIDEn5pBM43aNFl1IX05AQwUCrofUOK-GaroODeYM/s400/Screenshot_3.png" width="400" /></a></div>
</div>

Binary Search

Overview of Binary Search The binary search algorithm begins by comparing the target value to the value of the middle element of the s...

MergeSort Using Recursion

<div dir="ltr" style="text-align: left;" trbidi="on">
<div dir="ltr" style="text-align: left;" trbidi="on">
<div dir="ltr" style="text-align: left;" trbidi="on">
MergeSort is a <a href="https://en.wikipedia.org/wiki/Divide_and_conquer_algorithms" target="_blank">Divide and Conquer</a> algorithm.  It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. <span id="more-2783"></span> <b>The merg() function</b>
 is used for merging two halves.  The merge(arr, l, m, r) is key process
 that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the 
two sorted sub-arrays into one. See following C implementation for 
details.<br />
<br />
<br />
<table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody>
<tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOa4EntnLBmEFZZgwLv3oSCQpCmxkrmt5e3o3QAfQdlafr159r62cMWCJordmqxm-sCi4gmEhgItut-Z75cdF-Qw01GiSu_M85JKUlZlREbmTbjeth_3qJr-52bzRVX0rDbPNorFJ2voDP/s1600/Merge_sort_algorithm_diagram.svg.png" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img border="0" height="308" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOa4EntnLBmEFZZgwLv3oSCQpCmxkrmt5e3o3QAfQdlafr159r62cMWCJordmqxm-sCi4gmEhgItut-Z75cdF-Qw01GiSu_M85JKUlZlREbmTbjeth_3qJr-52bzRVX0rDbPNorFJ2voDP/s320/Merge_sort_algorithm_diagram.svg.png" width="320" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><div class="firstHeading" id="firstHeading" lang="en">
Merge sort algorithm diagram</div>
</td></tr>
</tbody></table>
</div>
</div>
<br />
<h3 style="text-align: left;">
For  <b>simulation</b> visite <a href="http://www.ee.ryerson.ca/~courses/coe428/sorting/mergesort.html" target="_blank">here</a>

</h3>
<h2 style="text-align: center;">
Implementation in C++</h2>
<pre class="brush:cpp;"> 
#include <iostream>

using namespace std;

void merge(int arr[], int l, int m, int r)
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;

/* create temp arrays */
    int L[n1], R[n2];

/* Copy data to temp arrays L[] and R[] */
    for(i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for(j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];

/* Merge the temp arrays back into arr[l..r]*/
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

/* Copy the remaining elements of L[], if there are any */
    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

/* Copy the remaining elements of R[], if there are any */
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}

/* l is for left index and r is right index of the sub-array
  of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        int m = l+(r-l)/2; //Same as (l+r)/2, but avoids overflow for large l and h
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);
        merge(arr, l, m, r);
    }
}

/* Function to print an array */
void printArray(int A[], int size)
{
    int i;
    for (i=0; i < size; i++)
        cout<< A[i]<<endl;

}/* Driver program to test above functions */
int main()
{
    int arr[] = {12, 11, 13, 5, 6, 7};
    int arr_size = sizeof(arr)/sizeof(arr[0]);

cout<<"Given array is \n";
    printArray(arr, arr_size);

mergeSort(arr, 0, arr_size - 1);

cout<<"\nSorted array is \n"<<endl;
    printArray(arr, arr_size);
    return 0;
}

</pre>
<h2 style="text-align: center;">
::Output ::</h2>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjssPd7EzyxCFHs8HnszpZrbKMC4VVey8XaBsvm-O4g2s6R7K9bn82HqBYPMKTFdRIiJ71_AwjCXn1V1EBMKVQ2xUQ6vSPGy7e4kOkEAuFkuHhdufqwq-3A_zkyG5967Ke2Sf1uN4lmrAzV/s1600/Screenshot_2.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="176" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjssPd7EzyxCFHs8HnszpZrbKMC4VVey8XaBsvm-O4g2s6R7K9bn82HqBYPMKTFdRIiJ71_AwjCXn1V1EBMKVQ2xUQ6vSPGy7e4kOkEAuFkuHhdufqwq-3A_zkyG5967Ke2Sf1uN4lmrAzV/s320/Screenshot_2.png" width="320" /></a></div>
</div>

MergeSort Using Recursion

MergeSort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the ...

Binary tree

<div dir="ltr" style="text-align: left;" trbidi="on">
<div dir="ltr" style="text-align: left;" trbidi="on">
<div style="text-align: center;">
<h2 style="text-align: center;">
Binary tree</h2>
</div>
</div>
<span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">In </span><a href="http://en.wikipedia.org/wiki/Computer_science" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Computer science">computer science</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">, a </span><b style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px;">binary tree</b><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> is a </span><a href="http://en.wikipedia.org/wiki/Tree_structure" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Tree structure">tree</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> </span><a href="http://en.wikipedia.org/wiki/Data_structure" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Data structure">data structure</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> in which each node has at most two </span><a class="mw-redirect" href="http://en.wikipedia.org/wiki/Child_node" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Child node">children</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">, which are referred to as the </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">left</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> child and the </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">right</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> child. A </span><a href="http://en.wikipedia.org/wiki/Recursive_definition" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Recursive definition">recursive definition</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> using just </span><a href="http://en.wikipedia.org/wiki/Set_theory" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Set theory">set theory</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> notions is that a (non-empty) binary tree is a </span><a href="http://en.wikipedia.org/wiki/Tuple" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Tuple">triple</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> (</span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">L</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">, </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">S</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">,</span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">R</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">), where </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">L</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> and </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">R</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> are binary trees or the </span><a href="http://en.wikipedia.org/wiki/Empty_set" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Empty set">empty set</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> and </span><i style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">S</i><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;"> is a </span><a class="mw-redirect" href="http://en.wikipedia.org/wiki/Singleton_set" style="background: none rgb(255, 255, 255); color: #0b0080; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-decoration: none;" title="Singleton set">singleton set</a><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">.</span><span style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px;">Some authors allow the binary tree to be the empty set as well.       </span>
<br />
<div>
<span style="background-color: white;"><span style="color: #252525; font-family: sans-serif;"><span style="font-size: 14px; line-height: 22.3999996185303px;">   </span></span></span><br />
<div class="separator" style="clear: both; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-align: center;">
<span style="background-color: white;"><a href="http://upload.wikimedia.org/wikipedia/commons/thumb/f/f7/Binary_tree.svg/300px-Binary_tree.svg.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="http://upload.wikimedia.org/wikipedia/commons/thumb/f/f7/Binary_tree.svg/300px-Binary_tree.svg.png" /></a></span></div>
<span style="background-color: white;">
</span>
<br />
<div class="separator" style="clear: both; color: #252525; font-family: sans-serif; font-size: 14px; font-weight: normal; line-height: 22.3999996185303px; text-align: left;">
<span style="background-color: white;">For more understanding visit this <a href="http://algs4.cs.princeton.edu/32bst/" target="_blank">link</a> </span></div>
<span style="background-color: white;">
</span><span style="background-color: white;"></span>
<div class="separator" style="clear: both; text-align: left;">
<span style="background-color: white;"><span style="color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px;">For </span><span style="color: #252525; font-family: sans-serif;"><span style="font-size: 14px; line-height: 22.3999996185303px;">visualization </span></span><span style="color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px;">visit this</span><span style="color: #252525; font-family: sans-serif; line-height: 22.3999996185303px;"> </span><a href="https://www.cs.usfca.edu/~galles/visualization/BST.html" target="_blank">link</a></span></div>
<div class="separator" style="clear: both; text-align: left;">
<br /></div>
<span style="background-color: white;">
<div class="separator" style="clear: both; text-align: center;">
<a href="http://upload.wikimedia.org/wikipedia/en/thumb/4/4d/BinarySearchTreeDeletionExamples.svg/800px-BinarySearchTreeDeletionExamples.svg.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="387" src="http://upload.wikimedia.org/wikipedia/en/thumb/4/4d/BinarySearchTreeDeletionExamples.svg/800px-BinarySearchTreeDeletionExamples.svg.png" width="640" /></a></div>
<div class="separator" style="clear: both; text-align: left;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: left;">
<br /></div>
</span></div>
<h2 style="text-align: center;">
Node.h</h2>
<pre class="brush:cpp;">#include <iostream>

using namespace std;

class Node {
public:
 Node ();
 Node (int a);
 ~Node ();
 void SetValue (int a);
 int GetValue ();
 void SetLeft (Node* L);
 Node* GetLeft ();
 void SetRight (Node* R);
 Node* GetRight ();
private:
 int Value;
 Node* Left;
 Node* Right;
};

Node :: Node () {
 Value = 0;
 Left = NULL;
 Right = NULL;
}

Node :: Node (int a) {
 Value = a;
 Left = NULL;
 Right = NULL;

}

Node :: ~Node () {
 delete Left;
 delete Right;
}

void Node :: SetValue (int a) {
 Value = a;
}

int Node :: GetValue () {
 return Value;
}

void Node :: SetLeft (Node* L) {
 Left = L;
}

Node* Node :: GetLeft () {
 return Left;
}

void Node :: SetRight (Node* R) {
 Right = R;
}

Node* Node :: GetRight () {
 return Right;
}

</pre>
<h2 style="text-align: center;">
BT.h</h2>
<pre class="brush:cpp;">#include "Node.h"

class BT {
public:
 BT ();
 ~BT ();
 void SetRoot(Node* R);
 Node* GetRoot ();
 void Insert (int a);
 void PreOrder (Node* N);
 Node* FindMin (Node* N);
 Node* Delete (Node* N, int a);
private:
 Node* Root;
};

BT :: BT () {
 Root = NULL;
}

BT :: ~BT () {
 delete Root;
}

void BT :: SetRoot(Node* R) {
 Root = R;
}

Node* BT :: GetRoot () {
 return Root;
}

void BT :: Insert (int a) {
 if (GetRoot () == NULL) {
  Node* NN = new Node (a);
  SetRoot (NN);
 }
 else {
  Node *p, *q;
  p = q = GetRoot();
  while (p->GetValue() != a && q != NULL ) {
   p = q;
   if (p->GetValue() < a)
    q = p->GetRight();
   else
    q = p->GetLeft();
  }

if (p->GetValue() == a)
   cout << "Duplicate Value" << endl;
  else if (p->GetValue() < a) {
   Node* NN = new Node(a);
   p->SetRight(NN);
  }
  else {
   Node* NN = new Node(a);
   p->SetLeft(NN);
  }
 }
}

void BT :: PreOrder (Node* N) {
 if (N != NULL) {
  cout << N->GetValue() << endl;
  PreOrder(N->GetLeft());
  PreOrder (N->GetRight());
 }
}

Node* BT :: FindMin (Node* N) {
 if (N == NULL) return N;
 else if (N->GetLeft() == NULL) return N;
 else FindMin (N->GetLeft());
}

Node* BT :: Delete (Node* N, int a) {
 Node *NN;
 if (a < N->GetValue()) {
  NN = Delete(N->GetLeft(), a);
  N->SetLeft(NN);
 }
 else if (a > N->GetValue()) {
  NN = Delete(N->GetRight(), a);
  N->SetRight(NN);
 }
 else if (N->GetLeft() != NULL && N->GetRight() != NULL) {
  Node* MN = FindMin (N->GetRight());
  N->SetValue (MN->GetValue());
  NN = Delete (N->GetRight(), MN->GetValue());
  N->SetRight(NN);
 }
 else {
  if (N->GetRight() == NULL) {
   N = N->GetLeft();
  }
  else if (N->GetLeft() == NULL) {
   N = N->GetRight();
  }
  else N = NULL;
 }
 return N;
}

</pre>
<h2 style="text-align: center;">
main.cpp</h2>
<pre class="brush:cpp;">#include "BT.h"

int main () {
 BT ob;
 ob.Insert(25);
 ob.Insert(86);
 ob.Insert(69);
 ob.Insert(25);
 ob.PreOrder(ob.GetRoot());
 cout << (ob.FindMin(ob.GetRoot()))->GetValue() << endl;
 cout << (ob.FindPreviousNode(69))->GetValue() << endl;
 ob.delete(ob.GetRoot(),86);
 return 0;
}

</pre>
<br /></div>

Binary tree

Binary tree In computer science , a binary tree is a tree data structure in which each node has at most two children , which ...

Tower of Hanoi

<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: center;">
::Tower of Hanoi ::</h2>
<div style="text-align: center;">
<div style="text-align: left;">
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower,[1] and sometimes pluralized) is amathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape</div>
</div>
<div style="text-align: center;">
. </div>
<div style="text-align: center;">
<img border="0" height="175" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgBg-fJU4k1Ymag-1XXiOBqWCuXfLJv1eziu_z30ddH-EwbnfxO_cb-9zUBltWEps0CZOLNV51dg7TDJhxeioHcoPhvGPnm-aD9E7Q58YGCvEup6El7_bclH8cnUroHKyNOAuQhoeubvY4g/s1600/Tower_of_Hanoi.jpeg" width="400" />

</div>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:</div>
<ol style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; list-style-image: none; margin: 0.3em 0px 0px 3.2em; padding: 0px;">
<li style="margin-bottom: 0.1em;">Only one disk can be moved at a time.</li>
<li style="margin-bottom: 0.1em;">Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.</li>
<li style="margin-bottom: 0.1em;">No disk may be placed on top of a smaller disk.</li>
</ol>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2<sup style="font-size: 11.1999998092651px; line-height: 1;"><i>n</i></sup> - 1, where <i>n</i> is the number of disks.</div>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
<br /></div>
<br />
<div style="text-align: center;">
<img border="0" height="155" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjqshUUkCwTImb-YMwKx4BMlc_lKXy5KWFt-yS8Tw4s2851AUTB4brJmYs6FaU6mJYzIAQzJSS-UosSR7A-54e-h19bKN0l5xStWpIu3uXJZEx2vHzh2wNgFNT-SpUAuQZVih0rf7Z0Rt8w/s1600/300px-Tower_of_Hanoi_4.gif" width="400" />
</div>
<pre class="brush:cpp;"> 
#include <iostream>
 using namespace std;
void towers(int, char, char, char);

int main()
{
    int num;

cout<<"Enter the number of disks : "<<endl;
    cin>>num;
    cout<<"The sequence of moves of the Tower of Hanoi are :\n"<<endl;
    towers(num, 'A', 'C', 'B');
    return 0;
}
void towers(int num, char A, char B, char C)
{
    if (num == 1)
    {
        cout<<"\nMove disk "<<num<<" from peg "<< A<<" to peg "<< B<<endl;
        return ;
    }
    towers(num - 1, A, C, B);

cout<<"Move disk "<< num <<" from peg "<< A<<" to peg "<<B;
    towers(num - 1, C, B, A);
}

</pre>
<h2 style="text-align: center;">
::Output ::</h2>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi-rmgQBwiw0QNRhEWkJCuEoWtW7Gymuu7LEiv-S86nFQSZ3HlbuSwFHsdQypHsm4YAPOrLLQPJqBRiZhc9pDCLOJwTiBOT9vkAQm2WQn6W35AftuNP-QDv7YlwX0AtCtOP_DQ7klfBN5_9/s1600/Screenshot_4.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="295" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi-rmgQBwiw0QNRhEWkJCuEoWtW7Gymuu7LEiv-S86nFQSZ3HlbuSwFHsdQypHsm4YAPOrLLQPJqBRiZhc9pDCLOJwTiBOT9vkAQm2WQn6W35AftuNP-QDv7YlwX0AtCtOP_DQ7klfBN5_9/s1600/Screenshot_4.png" width="400" /></a></div>
<div>
<br /></div>
</div>

Tower of Hanoi

::Tower of Hanoi :: The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower,[1] and sometimes pluralized) is amathemati...

পর্যায় সারণি [PL-2 LAB PROJECT]

<div dir="ltr" style="text-align: left;" trbidi="on">
আসসালামু আলাইকুম সবাই কেমন আছেন ?? আশা করি আল্লাহর অশেষ রহমতে ভাই আছেন।<br />
আজ আমি আপনাদের সাথে যেটা শেয়ার  করব সেটা হলো আমার 2nd সেমিষ্টার  Pl-2(C++ programming language) এর একটি প্রোজেক্ট ছিল । <a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjWqW_-DqjifBcaR20DbfhrrvRGy8k_30GlYvbIJff-39xfKYlvF2OgDxRhHalH00kV_e3SQZ84uHw6B7azsw8K7KL67PZtgfidmQwzjLZT4Uxq0M75xwY2tx6otVUpmPuyzPGhI5avataP/s1600/cpp-mini-logo.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em; text-align: center;"><img border="0" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjWqW_-DqjifBcaR20DbfhrrvRGy8k_30GlYvbIJff-39xfKYlvF2OgDxRhHalH00kV_e3SQZ84uHw6B7azsw8K7KL67PZtgfidmQwzjLZT4Uxq0M75xwY2tx6otVUpmPuyzPGhI5avataP/s1600/cpp-mini-logo.png" /></a><br />
এটা মূলত একটা ডেটা স্টোরেজ টাইপের প্রোগ্রাম।  আমি প্রোগ্রামটি মূলত  পর্যায় সারণি হিসেবে ব্যবহার করেছি।<br />
আপনি ইচ্ছা করলে এ  প্রোগ্রামটি ব্যবহার করে ডিকশনারী, পারসোনাল ডাইরি,পারসোনাল কন্টাক ডাইরি সহ নানান ধরনের কাজে ব্যবহার করতে পারবেন।<br />
<div style="text-align: center;">
<span style="background-color: orange; color: #674ea7;"> Source File:</span></div>
<div style="text-align: center;">
<span style="color: red;"><br /></span></div>
<div style="text-align: left;">
<span style="color: blue;"><b>formula.h </b></span></div>
<div style="text-align: center;">
<span style="color: red;"><br /></span></div>
<b><span style="color: red;">Header Part:</span></b><br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg-uHGrxPW43-DT47QqH98Dv7seSoqQbUmwJJgck2393O4vDxxoItllyGdpx9TOmuAYm2v3Z6KoDVegdXh3DPpqb__1h2uavYqIeZgyWqMA7rZjZ9W-KcgTOdZNA_QlIj7IpmwSDUSPJcSF/s1600/header.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="156" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg-uHGrxPW43-DT47QqH98Dv7seSoqQbUmwJJgck2393O4vDxxoItllyGdpx9TOmuAYm2v3Z6KoDVegdXh3DPpqb__1h2uavYqIeZgyWqMA7rZjZ9W-KcgTOdZNA_QlIj7IpmwSDUSPJcSF/s1600/header.png" width="320" /></a></div>
<br />
<br />
<br />
<b><span style="color: red;">Class Part:</span></b><br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgeZew-LFC2kF7pGujk_VM2rGLD8X2Bgzf4gYqIFzPSx53OUwS9UgFYzSnKc-UGHw7llVa-TUkkwC45TGx98G_nzACiIdjASnbjwzCqcMgii1mW3FbZszNzMnhxBnjj8fI9l4FZqRccshpf/s1600/class.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="265" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgeZew-LFC2kF7pGujk_VM2rGLD8X2Bgzf4gYqIFzPSx53OUwS9UgFYzSnKc-UGHw7llVa-TUkkwC45TGx98G_nzACiIdjASnbjwzCqcMgii1mW3FbZszNzMnhxBnjj8fI9l4FZqRccshpf/s1600/class.png" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: left;">
<span style="color: blue;"><b>formula.cpp</b></span><b><span style="color: blue;">:</span></b></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIfWRhu6Ro7_qooLgmHkbgK1RL-wCvqp6AC0YWNs2_CLs_VPkJzVByW-hMOREMp9Vyz8nY13l0MjAk53wLjqg0tr4xG2mMytDv2BbqJCBTyoQ1KUUQOLPdcW8tkgz6XoUe_L-UcmIaJ65h/s1600/cpp1.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="255" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIfWRhu6Ro7_qooLgmHkbgK1RL-wCvqp6AC0YWNs2_CLs_VPkJzVByW-hMOREMp9Vyz8nY13l0MjAk53wLjqg0tr4xG2mMytDv2BbqJCBTyoQ1KUUQOLPdcW8tkgz6XoUe_L-UcmIaJ65h/s1600/cpp1.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOsf0c31h_5PipJl361SMIhh899-DlUuor58XHhmShkEYXsIjJfiDdiC2vphfF97X0bKzIic5gg6g0I5Zu5gAh8K43dNyupJXY5Df1WH2rlgS116viZf9PCLp9jbBtUkmwAbtKHxQVI1wP/s1600/cpp2.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="158" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOsf0c31h_5PipJl361SMIhh899-DlUuor58XHhmShkEYXsIjJfiDdiC2vphfF97X0bKzIic5gg6g0I5Zu5gAh8K43dNyupJXY5Df1WH2rlgS116viZf9PCLp9jbBtUkmwAbtKHxQVI1wP/s1600/cpp2.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhbCxUnSiTfaxvFNFrhJxRUL9DtdAW-cSq8o68bJA-XQ16HGAU8DZXcjofvAolYChCcH7BvSfDPhntO0ZpA-bhvyR9UgIdRs0zLDQSgFtNqfZqh80T4iLxbaOU-wh4oFauvp8PdynI4594q/s1600/cpp3.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="66" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhbCxUnSiTfaxvFNFrhJxRUL9DtdAW-cSq8o68bJA-XQ16HGAU8DZXcjofvAolYChCcH7BvSfDPhntO0ZpA-bhvyR9UgIdRs0zLDQSgFtNqfZqh80T4iLxbaOU-wh4oFauvp8PdynI4594q/s1600/cpp3.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgR4q4Ba3nxTaZz6fRq1THND1l4JXCEMalSqhO07esoMhQgKG63HamfNZD3Mqc5pc5OzfMq2OyhkXMv4gT7P65AtxFjHOqN1fL8FAO3NDTpZKOavS1Uu0UOKrznLw8RsHPmValZ4dxYn4ST/s1600/cpp4.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="78" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgR4q4Ba3nxTaZz6fRq1THND1l4JXCEMalSqhO07esoMhQgKG63HamfNZD3Mqc5pc5OzfMq2OyhkXMv4gT7P65AtxFjHOqN1fL8FAO3NDTpZKOavS1Uu0UOKrznLw8RsHPmValZ4dxYn4ST/s1600/cpp4.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgZLZZ2YruWYFmMboXuR8kCH_W0ik8b50ZTdHc2mga1xfAsl-XFqQuuJjhY_Jwi3lAJ8qv2od5nk0CoW6G1UCn7FAmiYto-zilY2aRHgiHCzsjbfF5hD0pFGEDZD6oHz8IfghyphenhyphenE79hjlV-q/s1600/cpp5.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="85" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgZLZZ2YruWYFmMboXuR8kCH_W0ik8b50ZTdHc2mga1xfAsl-XFqQuuJjhY_Jwi3lAJ8qv2od5nk0CoW6G1UCn7FAmiYto-zilY2aRHgiHCzsjbfF5hD0pFGEDZD6oHz8IfghyphenhyphenE79hjlV-q/s1600/cpp5.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEifgkLQ38UpNl0s8UdlDiByDrBhtezs0NKhw-IW4MwZmvuUIUDih_Ti83w6gnNt3QVTaNlMQN7seIdKdwYqKKZS0ErfgYOPbBI9fUFNObW6mG_sNAELLLCKEzNvNUkg6jT1osQ0EqQMXio8/s1600/cpp6.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="173" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEifgkLQ38UpNl0s8UdlDiByDrBhtezs0NKhw-IW4MwZmvuUIUDih_Ti83w6gnNt3QVTaNlMQN7seIdKdwYqKKZS0ErfgYOPbBI9fUFNObW6mG_sNAELLLCKEzNvNUkg6jT1osQ0EqQMXio8/s1600/cpp6.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjHIkwlNQK3_ZwXWF4FST71Ob51phtXVDC59yWTnfBTD4For4GerkvKOZSKJ9KvNUUDsunvGgtM39nwJBaRwW4NzzNjm6u9sTg_uEGCswrkKoT1JnBGgKhe4HvKQ-2S6qWvQPv4SldBDlUP/s1600/cpp7.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="243" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjHIkwlNQK3_ZwXWF4FST71Ob51phtXVDC59yWTnfBTD4For4GerkvKOZSKJ9KvNUUDsunvGgtM39nwJBaRwW4NzzNjm6u9sTg_uEGCswrkKoT1JnBGgKhe4HvKQ-2S6qWvQPv4SldBDlUP/s1600/cpp7.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh-CNyHPsiXSB6wtK2ZYeMgoaNAmTT6DbRmECq33p4DfakINFQoxQnqYaax9vjurH3HlZ6FmbEX2yVoW8wtr14s4fdRAyk_DbESKSyFSWSeqvZPdii_7mtEpl_IF_z5SuB8C2IbeMZeDvGT/s1600/cpp8.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="265" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEh-CNyHPsiXSB6wtK2ZYeMgoaNAmTT6DbRmECq33p4DfakINFQoxQnqYaax9vjurH3HlZ6FmbEX2yVoW8wtr14s4fdRAyk_DbESKSyFSWSeqvZPdii_7mtEpl_IF_z5SuB8C2IbeMZeDvGT/s1600/cpp8.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgstHJ7qJsYgGdbVBCFrA6Y8fXfW5YZS_ROwVIv2PbmmbhfhMro2CPT4wW5wghTGsVRD4_2SgfXFXavZEoAL7L4wveh2lspDpOKRyfvgPI1pcxBOgxTChZwSFJxr5BkQVP_y3wFrUbOahzJ/s1600/cpp9.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="264" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgstHJ7qJsYgGdbVBCFrA6Y8fXfW5YZS_ROwVIv2PbmmbhfhMro2CPT4wW5wghTGsVRD4_2SgfXFXavZEoAL7L4wveh2lspDpOKRyfvgPI1pcxBOgxTChZwSFJxr5BkQVP_y3wFrUbOahzJ/s1600/cpp9.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiL99GyK9Y2krgB2gIIUwDn7NAwMoqnwV_L5gdNpFNB77FEw_6TN6I_oh3zGivZevNS_EIllKiRcQb2Xen6895IRlaKF8xxUOYzQdOAb8wIIGnT04NIWnvmBkR0cQ7zq8cpPT3ptd-8gmEw/s1600/cpp10.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="305" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiL99GyK9Y2krgB2gIIUwDn7NAwMoqnwV_L5gdNpFNB77FEw_6TN6I_oh3zGivZevNS_EIllKiRcQb2Xen6895IRlaKF8xxUOYzQdOAb8wIIGnT04NIWnvmBkR0cQ7zq8cpPT3ptd-8gmEw/s1600/cpp10.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhbqER76qPZscVHg9mPPTGoPzsQSrIKHpf3SMF2SNlbDBCYtq54JrO5-11CHAmA1F4Z_VzZlnVdemRa2UyiwaVK-_y3t5AYZSv6VZhpdK7XxBqatDjcc7h8zyYSWqg8XeAr6prug9lJ1AAB/s1600/cpp11.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="316" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhbqER76qPZscVHg9mPPTGoPzsQSrIKHpf3SMF2SNlbDBCYtq54JrO5-11CHAmA1F4Z_VzZlnVdemRa2UyiwaVK-_y3t5AYZSv6VZhpdK7XxBqatDjcc7h8zyYSWqg8XeAr6prug9lJ1AAB/s1600/cpp11.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjWbxhct1JFJRkO5zFHRSpwctrAEluxeflLaJy2uY5AqPCIOjbW2EReGyDKtQhKqSE1FBQpiV9EcSrN896aFqTzfZV6KP_88Svz4QgSw6GTcgZ0BkrHlX5fSWg1MV2dxo2tlomnazlidMp0/s1600/cpp12.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="153" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjWbxhct1JFJRkO5zFHRSpwctrAEluxeflLaJy2uY5AqPCIOjbW2EReGyDKtQhKqSE1FBQpiV9EcSrN896aFqTzfZV6KP_88Svz4QgSw6GTcgZ0BkrHlX5fSWg1MV2dxo2tlomnazlidMp0/s1600/cpp12.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhBDvTKuAq62H73BRqC5cYoFj44_uDjlprKjSFOpj6a4oiiNKDRkm7hf4Qi3Td1pVdEk7SU7px87emfUaMqwwbK5ugnv_qAaVM61_yZiUOhxHXKx80ZSocNRc1C-pMG9RwJ9LIDwDRty1dl/s1600/cpp13.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhBDvTKuAq62H73BRqC5cYoFj44_uDjlprKjSFOpj6a4oiiNKDRkm7hf4Qi3Td1pVdEk7SU7px87emfUaMqwwbK5ugnv_qAaVM61_yZiUOhxHXKx80ZSocNRc1C-pMG9RwJ9LIDwDRty1dl/s1600/cpp13.png" width="296" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhp2usRwbXLYAFOFSODTwr8CLyh9-l5N9hxBEAdqEulJIy7OvFLzZeBRHiaAl5XtOdzDziJP4NxCMBnq-CA2ag2dn3XJk1fTRukYQlmu940pjkAIqTeEDf6BG0EURR_UoqWBmC5ULH_jd0O/s1600/cpp14.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhp2usRwbXLYAFOFSODTwr8CLyh9-l5N9hxBEAdqEulJIy7OvFLzZeBRHiaAl5XtOdzDziJP4NxCMBnq-CA2ag2dn3XJk1fTRukYQlmu940pjkAIqTeEDf6BG0EURR_UoqWBmC5ULH_jd0O/s1600/cpp14.png" width="261" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjGNNROgL_-Yfs-zU19Io8cn8rSC-d8IeGox332eFnddYq_XHoYUVBNrbHssNFcw713IcUcT_jq93MNl2xz3M4qydtoz9fWf6iWAfSMnGMxls5O4PDIAJK-4q3ALpa0pDoLT7fJ5Vf1FTcY/s1600/cpp15.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjGNNROgL_-Yfs-zU19Io8cn8rSC-d8IeGox332eFnddYq_XHoYUVBNrbHssNFcw713IcUcT_jq93MNl2xz3M4qydtoz9fWf6iWAfSMnGMxls5O4PDIAJK-4q3ALpa0pDoLT7fJ5Vf1FTcY/s1600/cpp15.png" width="232" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjdZKW1b1Xw_VRrhQRymiQbIhibfMmCDLZM4eLkuwIbFKeQakVx-9RihFIy8BmjhlfKgskWdxEfMez3cLSSsyuE5uNzw6s-XP9EStNtlYnr3vZkaZnAo-fY-mf9JyfsWGxG4GdQG0-BjspF/s1600/cpp16.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjdZKW1b1Xw_VRrhQRymiQbIhibfMmCDLZM4eLkuwIbFKeQakVx-9RihFIy8BmjhlfKgskWdxEfMez3cLSSsyuE5uNzw6s-XP9EStNtlYnr3vZkaZnAo-fY-mf9JyfsWGxG4GdQG0-BjspF/s1600/cpp16.png" width="211" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgvQznfSsIbMlVtL18HTfq2VCVxiZK4rdBiw275hI7qUgXbjtoHGUO1TL1m1mgZG-PXwnnHb_Q35ErHE65F1BDobinalQ3ULgntU-2rm-HdfSPpin5dQpJXFr2vMPuuFVnrjGPmbJMa7cYK/s1600/cpp17.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="292" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgvQznfSsIbMlVtL18HTfq2VCVxiZK4rdBiw275hI7qUgXbjtoHGUO1TL1m1mgZG-PXwnnHb_Q35ErHE65F1BDobinalQ3ULgntU-2rm-HdfSPpin5dQpJXFr2vMPuuFVnrjGPmbJMa7cYK/s1600/cpp17.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIAoQcPsvm2f2_fQZXR6j2FWgHH2WYwO0H-r2YQaN_TQu6iGg2z5nqSInVjwUaJ6CuiQqK0lbPNiELZA3YaIBUyM9dwdWLz3X_jFdgK3jfBEQ-WH5qd2_hBsoIkkBIeMALtFlQl4_gw5KX/s1600/cpp18.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="295" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIAoQcPsvm2f2_fQZXR6j2FWgHH2WYwO0H-r2YQaN_TQu6iGg2z5nqSInVjwUaJ6CuiQqK0lbPNiELZA3YaIBUyM9dwdWLz3X_jFdgK3jfBEQ-WH5qd2_hBsoIkkBIeMALtFlQl4_gw5KX/s1600/cpp18.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOI2VTxFB-MrY8NT-w9uW-NBdQspJHE-OFh91KGNF31z39k3TzMQS2CPzLypnyXiZ20DXYzxway69cIflO4kvcr_sDra_5e881Kmns2ArXfdttnxPb6C8S3mAZXCslHF3bTV5x1ahLJ3rI/s1600/cpp19.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="76" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOI2VTxFB-MrY8NT-w9uW-NBdQspJHE-OFh91KGNF31z39k3TzMQS2CPzLypnyXiZ20DXYzxway69cIflO4kvcr_sDra_5e881Kmns2ArXfdttnxPb6C8S3mAZXCslHF3bTV5x1ahLJ3rI/s1600/cpp19.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjdvjZDNZQT0fmf9MMkkqRi_P5-CDIcagn_wzZcnLvWpbcu6U69MxgFsA3o8Mbmrd4O95z0xOR4vLUDJx1XSM6QZ2CoNJcVxZzsfb2RuXJUysfs7pyBTPD1dN9693dKkzU_8n4HHwAUKx5M/s1600/cpp20.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="83" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjdvjZDNZQT0fmf9MMkkqRi_P5-CDIcagn_wzZcnLvWpbcu6U69MxgFsA3o8Mbmrd4O95z0xOR4vLUDJx1XSM6QZ2CoNJcVxZzsfb2RuXJUysfs7pyBTPD1dN9693dKkzU_8n4HHwAUKx5M/s1600/cpp20.png" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: left;">
<span style="color: blue;"><b><br /></b></span></div>
<div class="separator" style="clear: both; text-align: left;">
<span style="color: blue;"><b>Main.cpp</b></span></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgGnKBbFtbabvYP79HtCmT4A4AJKEqaMJPkowk8hIKbQxWZlbrmW-5Qew9TCtTIurWe6SQkqhLCzdgn3z3fq-ae4vWJ8sNVPEEKXhWWAMxpjsW0xjqA7VOuz5DAaTLD7LSjwJZn2AhGNdkb/s1600/main.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="129" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgGnKBbFtbabvYP79HtCmT4A4AJKEqaMJPkowk8hIKbQxWZlbrmW-5Qew9TCtTIurWe6SQkqhLCzdgn3z3fq-ae4vWJ8sNVPEEKXhWWAMxpjsW0xjqA7VOuz5DAaTLD7LSjwJZn2AhGNdkb/s1600/main.png" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<span style="background-color: orange;"><b><span style="color: blue;">Output:</span><span style="color: orange;">t:</span></b></span></div>
<div class="separator" style="clear: both; text-align: center;">
<span style="background-color: orange;"><b><span style="color: orange;"><br /></span></b></span></div>
<div class="separator" style="clear: both; text-align: center;">
<span style="background-color: orange;"><b><span style="color: orange;"><br /></span></b></span></div>
<div class="separator" style="clear: both; text-align: center;">
</div>
<br />
<div class="separator" style="clear: both; text-align: center;">
</div>
<br />
<div class="separator" style="clear: both; text-align: center;">
</div>
<div style="text-align: center;">
 <a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEihNGewlq8d0nkGleFEttRgx7tjNVznyLVzx2qh2nwGvcqTf4B9UCnOA4mE5pixdLvZgsOIeivEZeax-K0CFq2mfHjVh00ShvfohUe1-c98CWa6Uo0QG2LC54ut0DYTUlDmOvGteVcrWJuy/s1600/splash+screen.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em; text-align: center;"><img border="0" height="215" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEihNGewlq8d0nkGleFEttRgx7tjNVznyLVzx2qh2nwGvcqTf4B9UCnOA4mE5pixdLvZgsOIeivEZeax-K0CFq2mfHjVh00ShvfohUe1-c98CWa6Uo0QG2LC54ut0DYTUlDmOvGteVcrWJuy/s1600/splash+screen.png" width="320" /></a></div>
<div style="text-align: center;">
<br /></div>
<div style="text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiCT3DuPNeqJ2o_3sYxQQybWFHiz4-AcC-TkEz6yZRYzAGT7-XKK2SQBj1cpXO-qhAAbKmgmMoOopl6umICeSg9F0LoZVnWAQlRqmcjQ3MBvkhCXnM4dRidsGM4QohCdH75bHvk3BeAHzRH/s1600/main+menu.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="212" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiCT3DuPNeqJ2o_3sYxQQybWFHiz4-AcC-TkEz6yZRYzAGT7-XKK2SQBj1cpXO-qhAAbKmgmMoOopl6umICeSg9F0LoZVnWAQlRqmcjQ3MBvkhCXnM4dRidsGM4QohCdH75bHvk3BeAHzRH/s1600/main+menu.png" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
</div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjOQw551sK8UHnMxEfH6fJtU_qms-wN_qfOBIr0wOPfAyQMXStTJIStxkpD2tn9L98eDf-J6MBq_7Y3BbQgqI9sdZCJMm4KCm1pT_5SvLteyU8qB6uhw2AvlOxNzLt0TRVpG3Vjrkjl6sRe/s1600/about.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="193" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjOQw551sK8UHnMxEfH6fJtU_qms-wN_qfOBIr0wOPfAyQMXStTJIStxkpD2tn9L98eDf-J6MBq_7Y3BbQgqI9sdZCJMm4KCm1pT_5SvLteyU8qB6uhw2AvlOxNzLt0TRVpG3Vjrkjl6sRe/s1600/about.png" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiQqw1oRqi1Q2jItKW39agaaJjTiPkWNdL31ZgIXqE1ogE1HT-wo4HazE-KPlNyAihFzgOZrn2uIJTcCvG4WUsDiGZ1nhbpYKazLo4t-cIyWXEmC6hNPITILcatvms3SqeR_0WKhx4S-AjI/s1600/admin+menu.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="176" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiQqw1oRqi1Q2jItKW39agaaJjTiPkWNdL31ZgIXqE1ogE1HT-wo4HazE-KPlNyAihFzgOZrn2uIJTcCvG4WUsDiGZ1nhbpYKazLo4t-cIyWXEmC6hNPITILcatvms3SqeR_0WKhx4S-AjI/s1600/admin+menu.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjb7Mu8gT3nfjrN91r9DiGXQv8SkxJXCVnFCGKXbBnRMOFNJDUPiFqb_osiyltZSb9po-CaIHFK9qTxtntKG8Lh62yvBlwyW8TEe0cd2P02Mda-m_vxL6JFe1s5I_5Gv2nTxqcLEaX13e3J/s1600/admin+menu2.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="176" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjb7Mu8gT3nfjrN91r9DiGXQv8SkxJXCVnFCGKXbBnRMOFNJDUPiFqb_osiyltZSb9po-CaIHFK9qTxtntKG8Lh62yvBlwyW8TEe0cd2P02Mda-m_vxL6JFe1s5I_5Gv2nTxqcLEaX13e3J/s1600/admin+menu2.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg4TT9d3qJgPPbBJgyJs5OOGuOs2uqK7nuJzvDW8wBIQ1Klh_8MT1_gBV8AG_T1GfL_AiaclspuWtJlwlGnSPgZ60GHimRjZGsYln__tl5iqynf2NBjDhItHFbLBq0VweTothRsh-dcqiMl/s1600/search+menu.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em; text-align: center;"><img border="0" height="204" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg4TT9d3qJgPPbBJgyJs5OOGuOs2uqK7nuJzvDW8wBIQ1Klh_8MT1_gBV8AG_T1GfL_AiaclspuWtJlwlGnSPgZ60GHimRjZGsYln__tl5iqynf2NBjDhItHFbLBq0VweTothRsh-dcqiMl/s1600/search+menu.png" width="320" /></a></div>
<br />
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgeTzKus4cNSGft10d1j_32CL3aIO4BastqHNJdJEi2M0VQL8hcyt6Ts3293XyOWBnLAdBxDmkUKJECGxocUIQtVEVkF1K-fGuEH2wUgl6n2RC5vs5di8_CWJ4ghXoH7eU9QoeyM5D5akkQ/s1600/all+dara+show.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="231" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgeTzKus4cNSGft10d1j_32CL3aIO4BastqHNJdJEi2M0VQL8hcyt6Ts3293XyOWBnLAdBxDmkUKJECGxocUIQtVEVkF1K-fGuEH2wUgl6n2RC5vs5di8_CWJ4ghXoH7eU9QoeyM5D5akkQ/s1600/all+dara+show.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjXakCyGEYArw8IsBPJz0nfqVE8ROE6ADCKxYfTl6tBo5-wKeCDb5eSIEzE_I612cRE1NBGPcyINBvRGuUCsBOLGdnZnd96IsxYQAwZmR7LepZWLdMoXgAFidicmUtM203OlCAHtDJw-dn5/s1600/search+by+atomic+number.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="239" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjXakCyGEYArw8IsBPJz0nfqVE8ROE6ADCKxYfTl6tBo5-wKeCDb5eSIEzE_I612cRE1NBGPcyINBvRGuUCsBOLGdnZnd96IsxYQAwZmR7LepZWLdMoXgAFidicmUtM203OlCAHtDJw-dn5/s1600/search+by+atomic+number.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgM_e0C21BgaOOIOAW9qmbU3NMugNHjLuXEmIwiQZ-EuNx54cUA7S5f64XfpNwHeNn7lcOQ8xxh6e3-JR5rLMtG1w3PlF_JdCcoV4TDynIFF246L0adV8tSIqUoIO_s6Xw4XrVKiH7sqfLx/s1600/search+by+name.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="210" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgM_e0C21BgaOOIOAW9qmbU3NMugNHjLuXEmIwiQZ-EuNx54cUA7S5f64XfpNwHeNn7lcOQ8xxh6e3-JR5rLMtG1w3PlF_JdCcoV4TDynIFF246L0adV8tSIqUoIO_s6Xw4XrVKiH7sqfLx/s1600/search+by+name.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjT4IJq89Eyotd_dDH0vdY2Plu2gnlIz0OyddDB5tA6tmzyyQsZoo7eLFtD4ptWFcuH3KGfdS2ThzsaBJ7Gn5N7Y3Wm0VImi4j2xNFKH7eEzi1m3dja9E9KtODZMyGynk6FBexoOci-siWN/s1600/show+data+table.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="148" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjT4IJq89Eyotd_dDH0vdY2Plu2gnlIz0OyddDB5tA6tmzyyQsZoo7eLFtD4ptWFcuH3KGfdS2ThzsaBJ7Gn5N7Y3Wm0VImi4j2xNFKH7eEzi1m3dja9E9KtODZMyGynk6FBexoOci-siWN/s1600/show+data+table.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi6xRwMIWeUEoLdtbgeNlhMYH0-DnLPdvZi3MhWvFzIODEdsPsBtggS4WC7YwHnWEx-BZzzB1enXRQ4F7oYRp7-kl_XpDeNTsATAtRw4bpL6jT9xXiwKKMpjP1zqLHrG5HkV9ulidE2VhQx/s1600/exit.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em; text-align: center;"><img border="0" height="180" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi6xRwMIWeUEoLdtbgeNlhMYH0-DnLPdvZi3MhWvFzIODEdsPsBtggS4WC7YwHnWEx-BZzzB1enXRQ4F7oYRp7-kl_XpDeNTsATAtRw4bpL6jT9xXiwKKMpjP1zqLHrG5HkV9ulidE2VhQx/s1600/exit.png" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<span style="color: blue;">Download Source Code</span></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://www.dropbox.com/s/tort5lltqerpxyh/Pl2%20Project.rar?dl=0" target="_blank"><img alt=" Download source code" border="0" height="90" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg1gI1UJprd0zRIOG7-2ykd8mcV2_hnkYm7dvdrbos5YYE_HEiPKsKntHgZDAchKCXBMTCuWSw40kLwZa0Rd_iAcd_GG8d0vc3RqDsETAjOywpYQh-b3gZfFnGgkjSfsWJu4rbd-6F37VMj/s1600/download.png" width="200" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<iframe allowfullscreen="" frameborder="0" height="315" src="//www.youtube.com/embed/84_IqX2YwU0" width="420"></iframe>
</div>
<div class="separator" style="clear: both; text-align: center;">
সর্বশেষে আপনাদের দোয়া কামনা করে আজকের মতো বিদায় নিচ্ছি ও আর একটা কথা কেমন হয়েছে তা কিন্তু অবশ্যই কমেন্টের মাধ্যমে জানাবেন... আল্লাহ হাফেজ ।।।</div>
<div class="separator" style="clear: both; text-align: center;">
<span style="background-color: orange;"><b><span style="color: orange;"><br /></span></b></span></div>
<div class="separator" style="clear: both; text-align: center;">
<span style="background-color: orange;"><b><span style="color: orange;"><br /></span></b></span></div>
<div>
<br /></div>
</div>