CONFIGURATION USING THE ACCESS POINT D-LINK

CONFIGURATION USING THE ACCESS POINT D-LINK

Creating a hotspot or access point did not really make a difference denganm make the router, but on the plus to enable wireless and DHCP server on our router. But of course the equipment and complete facilities on the router to support the access point. So this means access point router to function as a server router, DHCP server and the wireless transmitter.

A. The first step is to install 2 dilakuakan yitu the first cable from the cable ISP WAN coming into the area and the cable leading to the client is installed on the LAN area (usually more than one for the LAN port)

2. Once the cable is then plugged into the new setting process is to open the internet browser on a client PC. Then to type defaults to IP 192.168.0.1 so there is no user name and password. The contents of the admin user name and password then leave blank and enter

Recursion

Recursion is a programming technique that causes a function / procedure calls itself.Calling yourself this continues until the smallest limit value of the function is explicitly mentioned.
example:



#include <iostream>
#include <string>


using namespace std;




class pangkat{
      friend ostream& operator<<(ostream&, pangkat&);
      friend istream& operator>>(istream&, pangkat&);
      public:
             pangkat(){};
             void hasil(int b);
             int hasil1();
      private:
              float a,h;
              int p,i;
};

example program sorting

# Include <iostream># Include <conio.h>
int data [100], data2 [100];int n;
void exchange (int a, int b){int t;t = data [b];data [b] = data [a];data [a] = t;}
bubble_sort void (){for (int i = 1; i <n; i + +){for (int j = n-1; j> = i; j -){if (data [j] <data [j-1]) exchange (j, j-1);}}cout << "bubble sort is complete!" << endl;}
exchange_sort void (){for (int i = 0; i <n-1; i + +){for (int j = (i +1); j <n; j + +){if (data [i]> data [j]) Swap (i, j);}}cout << "exchange sort is complete!" << endl;}
selection_sort void (){int pos, i, j;for (i = 0; i <n-1; i + +){pos = i;for (j = i +1; j <n; j + +){if (data [j] <data [post]) pos = j;}if (post! = i) exchange (post, i);}cout << "selection sort is complete!" << endl;}
insertion_sort void (){int temp, i, j;for (i = 1; i <n; i + +){temp = data [i];j = i -1;while (data [j]> temp && j> = 0){data [j +1] = data [j];j -;}data [j +1] = temp;}cout << "insertion sort is complete!" << endl;}
void QuickSort (int L, int R) / / sort the best I've ever had :){int i, j;int mid;
i = L;j = R;mid = data [(L + R) / 2];
do{while (data [i] <mid) i + +;while (data [j]> mid) j -;
if (i <= j){exchange (i, j);i + +;j -;};} While (i <j);
if (l <j) QuickSort (L, j);if (i <R) QuickSort (i, R);}

void Input (){cout << "Enter the number of data ="; cin >> n;for (int i = 0; i <n; i + +){cout << "Enter data into the" << (i +1) << "="; cin >> data [i];data2 [i] = data [i];}}
void Show (){cout << "Data:" << endl;for (int i = 0; i <n; i + +){cout << data [i] << "";}cout << endl;}
AcakLagi void (){for (int i = 0; i <n; i + +){data [i] = data2 [i];}cout << "The data is scrambled!" << endl;}
void main (){int a pill;clrscr ();do{clrscr ();cout << "Sorting Program!" << endl;cout << "*********************************************" << endl;cout << "1. Input Data" << endl;cout << "2. Bubble Sort" << endl;cout << "3. Exchange Sort" << endl;cout << "4. Selection Sort" << endl;cout << "5. Insertion Sort" << endl;cout << "6. Quick Sort" << endl;cout << "7. Show Data" << endl;cout << "8. Random Data" << endl;cout << "9. Exit" << endl;cout << "Your choice:"; cin >> pill;switch (pill){case 1: Input (); break;case 2: bubble_sort (); break;case 3: exchange_sort (); break;case 4: selection_sort (); break;case 5: insertion_sort (); break;case 6: QuickSort (0, n-1);cout << "quick sort is complete!" << endl;break;case 7: Display (); break;case 8: AcakLagi (); break;}getch ();} While (pil! = 9);}

looping statement

The loop is a statement in programming where the program will repeat a statement or group for the condition is true. The first iteration statement is a statement of the WHILEloop. This statement is useful for processing of a statement or a statement several timesduring the expression is true, the statement will be obtaining work.

while (expression)
statement

description;
• The first part will be executed during unkapan in a while is true.
• Penujian to unkapan in place before the while statement.
• The possibility of the while statement is not executed at all if it met the first condition is false.

FUNCTION AND FEATURE ACCESS POINT

FUNCTION.
Access Point serves as a regulator of the data traffic, allowing many clients to connect over a network (network).
as a Hub / Switch that acts to connect the local network with a wireless network / wireless, the access point is a data connection / internet emitted or transmitted via radio waves, measure the signal strength also affect the coverage area will be reached, the greater the signal strength (in units of measure dBm or mW) the more far-reaching.

FEATURE ACCESS POINT
 A. Multifunction Modes
A good wireless access point is able to work or operate in different operating modes: as an Access Point, Repeater, Bridge and Wireless Client. As a wireless access point (WAP), this device could allow the network LAN cable developed a wireless network by connecting to an AP is one of your LAN network port Ethernet Switch kesebuah eg to a modem or router directly.
The following figure is an example diagram of several operating modes AP

As the wireless bridge or wireless client, enabling the device with an Ethernet port to connect to your wireless network. With a wireless bridge you can connect a LAN to another LAN network through wireless connections between buildings for example. Or some network devices such as desktop computers, printers, notebooks, which are connected to a switch and connect the wireless bridge to connect to your wireless network.
While the wireless repeater, you can add AP to expand your wireless network without having to connect to the wired backbone network.

converter decimal, biner, oktal

Exercise 1

A.      Convert into decimal

1.       (110010101) = (1x2⁵)+

(1x2⁸)+(1x2⁷)+(0x2⁶)+(0x2⁵)+(1x2⁴)+(0x2³)+(1x2²)+(0x2¹ )+(1x2⁰)= (256) + (128) + (0) +(0) + (16) + (0) + (4) + (0) + (10) =(405)₁₀

2.       (001000100)₂=(0x2⁸)+

(0x2⁸)+(0x2⁷)+(1x2⁶)+(0+2⁵)+(0+2⁴)+(0x2³)+(1x2²)+(0x2¹)+(0x2⁰) = (0) + (0) + (64) + (0) + (0) + (0) + (4)  + (0) + (0) = (68)₁₀

3.       (4562)₈=(4x8³)+(5x8²)+(6x8¹)+(2x8⁰) = (2048) + (320) + (48) + (2) = (2418)₁₀

4.       (361)₈=(3x8²)+(6x8¹)+(1x8⁰) =  (192) + (48) + (1) = (241)₁₀

5.       (34510)₁₆=(3x16⁴)x(4x16³)+(5x16²)+(1x16¹)+(0x16⁰) = (196608) + (16384) + (1280) + (16) + (0) = (214288)₁₀

6.       (A134)₁₆=(10x16³)+(1x16²)+(3x16¹)+(4x16⁰) = (40960) + (256) + (48) + (4) = (41264)₁₀

Java programming language

The first Java programming language was born from the Green Project, which runs for 18 months, from early 1991 until the summer of 1992. The project is not using a version called Oak. The project was initiated by Patrick Naughton, Mike Sheridan, James Gosling and Bill Joy, along with nine other programmers from Sun Microsystems. One result of this project is the Duke mascot created by Joe Palrang. Project meeting took place in an office building on Sand Hill Road Menlo Park. Around the summer of 1992 the project was closed by generating a Java program's first Oak, which is intended as a hardware controller with touch screen technology (touch screen), such as the PDA is today. This new technology called "* 7" (Seven Star).