Windows 8 (Next OS from Microsoft)

Windows 8 yang ditampilkan menggunakan interface yang mirip dengan interface Metro milik Windows Phone 7. Dari demo yang ditampilkan, terlihat jelas bahwa Windows 8 ini didesain untuk penggunaan touchscreen. Lebih jelasnya bisa dilihat di video ini.

Perkembangan Teknologi Touchscreen

Touchscreen merupakan sebuah perangkat komputer yang biasanya digunakan untuk menampilkan informasi grafikal dan visual yang merupakan output dari sebuah perangkat komputer. Namun, yang membedakannya dengan monitor atau layar televisi biasa adalah apa yang ditampilkan di dalamnya dapat secara langsung berinteraksi fisik dengan penggunanya.

Perkembangan Jaringan Mobile

 Teknologi komunikasi seakan benda hidup yang selalu tumbuh dan berkembang tiada titik jenuh untuk mengalami peningkatan dari waktu ke waktunya. Dimulai dari alat yang tradisional untuk berkomunikasi seperti surat dan telegram lama-kelamaan beralih ke benda yang dikenal dengan telepon. Sepertinya manusia juga tak pernah puas untuk mengembangkan kemampuannya,

Samsung Galaxy Tab 10.1

Samsung kini memperluas tabletnya ke arena 10 inci. Berkompetisi head-to-head dengan iPad, mereka resmi mengumumkan Galaxy Tab 10.1

Seperti namanya, Galaxy Tab 10.1 memang mengandalkan layar 10,1 inci atau sedikit lebih besar dibanding iPad yang berdimensi 9,7 inci. Kegiatan menonton video atau menjelajah dunia maya pun akan lebih terpuaskan.

Class Inheritance

Using the foo class from the previous tutorial as a base class, we are going to introduce a new class called fooed that inherits from foo. Here are the two classes without any methods.

OOP Recursive Decent Parsing III

we are going to use the Production class as the base class for each one of our productions. Polymorphism with the Production class will come in shortly. Now the most basic production we have here is number. It’s a terminal production and can be implemented quite easily.

OOP Recursive Decent Parsing II

#include <istream>
#include <deque>
#include <locale>

#include "Parser.h"

/**
* static functions
*/

OOP Recursive Decent Parsing I

First off we need to define what our parser is going to do; we need to a construct a set of terminals and non-terminals to work with, in other words a “grammar.” Let’s look at the following grammar.

c++ Combination and Permutation

#include <iostream.h>

#include <stdio.h>

#include <conio.h>

long int fak (long int x);

void main()

{

Sorting Data with Bubble Sort methods

Ordering is one of the basic process that is often discussed in algorithms and data structures. And one of the simplest classical algorithms in terms of sorting (sorting) is the Bubble Sort algorithm. In spite of some deficiencies which make these algorithms are not widely used in the sorting process in the application, but not be denied, this algorithm can be described as the pioneer of the sorting algorithm. Within the courses algorithms and Data structures in various colleges can also be included in the sorting algorithm using the Bubble concept as one of the subject.

Sorting By Insertion

Problem

Given the set of n numbers randomly sort them by the method of insertion.

input and output

N = an integer array of array [1 ...100] of

Integer

K, j, temp = integer

 

Algorithm

 

Calculate Sequebce by Using Iterative Function

Jeliot Program to calculate the Sequence by using the Iterative Function
import jeliot.io.*;

public class hitung {
 
    public void input(){
    System.out.println("tentukan nilai n:");
    n=Input.readInt();
    }

A Comparison of Sorting Algorithms

Recently, I have translated a variety of sorting routines into Visual Basic and compared their performance...  I hope you will find the code for these sorts useful and interesting.

Typical data sequences for testing sorting algorithms

There is not "best sorting algorithm" for all data. Various algorithms have their own strength and weaknesses. For example some "sense" already sorted or "almost sorted" data sequences and perform faster on such sets.  In this sense Knuth math analysis is insufficient althouth "worst time" estimates are useful.

Quicksort Algorithm

Having struggled to follow the recursive calls to quicksort and partition I have modified the code to include the calls to both functions, displaying the order in which the array is in at each stage.

Vector

class template

<vector>

Vector

Vectors are a kind of sequence container. As such, their elements are ordered following a strict linear sequence. Vector containers are implemented as dynamic arrays; Just as regular arrays, vector containers have their elements stored in contiguous storage locations, which means that their elements can be accessed not only using iterators but also using offsets on regular pointers to elements.

Function to reverse an integer array

This function(ReverseArray is used to reverse an integer array. For example, if the

array is {1,2,3,4,5}, these functions will return an array like {5,4,3,2,1}.

The user needs to pass in a pointer to the array and the size of the array,

and the function will return a pointer to an array in the reverse order. 

Array

The array keyword lets you create a dynamic array that is allocated on the common language runtime heap.

[qualifiers] [cli::]array<[qualifiers]type1[, dimension]>^ var = 
gcnew [cli::]array<type2[, dimension]>(val[,val...])

String Contains function

The strContains function returns true or false depending on whether the input string contains the search string. If you have ever used the contains function in C# or VB then you may know how useful it can be.

Power series determinan (jeliot 3)

import jeliot.io.*;

public class calculate {

    public void input(){
    System.out.println("specify the value n:");
    n=Input.readInt();

Program determines the leap year (Jeliot 3)

import jeliot.io.*;

public class leap {
    public static void main() {
 

FOUND GCD WITH JELIOT 3

import jeliot.io.*;

public class MyClass {
    public static void main() {
int a=4,b=3,c=0;

Java programming exercise (Jeliot 3)

Jeliot 3 is a Program Visualization application. It visualizes how a Java program is interpreted. Method calls, variables, operation are displayed on a screen as the animation goes on, allowing the student to follow step by step the execution of a program. Programs can be created from scratch or they can be modifyed from previously stored code examples.

RECCURENCE RELATION

use the iteration scheme for a SERIES of ISSUES the formula can be expressed in relationship/recurring relationship, which concerns the issue of accuracy of the representation of numbers on a computer.

Example :

Recursion

Recursion is a programming technique that allows the programmer to express operations in terms of themselves. In C++, this takes the form of a function that calls itself. A useful way to think of recursive functions is to imagine them as a process being performed where one of the instructions is to "repeat the process". This makes it sound very similar to a loop because it repeats the same code, and in some ways it is similar to looping.

Recursion Shortest Function to Reverse a String

/*
Recursive Reverse String Algorithm

The Shortest function to reverse a string.


*/

Calculator (C++)

This code (program) allows you to choose what calculations you want. Like Addition and Multiplication. It uses the switch statement. this is only a very simple calculator and can only calculate two numbers at a time. Now it uses a loop and quits when you want it to.

Recursive Format numbers with commas

 You may also like to use the enclosed snippet that demo's a way to validate if a C++ string represents an integer.

// validates string 's' passed in and extracts a front sign (if there) into char var 'sign'
bool isInt( string& s, char& sign ); // Note: string without a 'sign' is returned

Calling functions with Inline Assembly

Compiles under Visual C++ 2008 as a console application and should compile with Visual C++ 2005

Recursive Function

A recursive function is a function that calls itself. This function will continue to run until the stop condition is met, therefore in a recursive function needs to be there are 2 important blocks, namely block that became the point stop from a process of recursion and the block that is calling itself.

Algoritma Menentukan Tahun Kabisat

Tahun Kabisat adalah :
- Tahun yang habis dibagi 4
- Jika tahun habis dibagi 100, maka Tahun tersebut juga harus habis dibagi 400

Algoritma dan Class Bilangan Prima

ALGORITMA BILANGAN PRIMA

KAMUS :

i     : integer

bil   : integer

prima : boolean

Class Luas Lingkaran dan Volume Bola With Jeliot

 Class Menghitung Luas Lingkaran dan Volume Bola

Class Bilangan [Bahasa C++]

Class Berikut contoh program C++ tentang class bilangan semoga berguna


#include <iostream.h>

class Bilangan{
friend istream& operator>>(istream&, Bilangan&);
friend ostream& operator<<(ostream&, const Bilangan&);

Struktur Perulangan (Lanjutan)

Dalam bahasa pemograman, proses perulangan ditanganni dengan mekanisme yang dinamakan dengan LOOP. Dengan mekanisme Loop ini, suatu proses yang berulang dapat diimplementasikan dengan pernyataan-pernyataan yang relatif pendek.

Struktur Perulangan

Andaikata kita diminta menjumlahkan 10 buah bilangan yang dimasukan melalui keyboard dan kita menyelesaikan masalah diatas menggunakan struktur sequence atau runtunan, maka algoritmanya berupa pseudocode sebagai berikut :

Input(x1)

Input(x2)

Input(x3)

Input(x4)

Input(x5)

Input(x6)

Input(x7)

Input(x8)

Input(x9)

Input(x10)

Sedikit Tentang Sekuen

Sekuen adalah sederetan pernyataan-pernyataan yang urutan dan pelaksanaan eksekusinya runtut, yang lebih dahulu ditemukan (dibaca) akan dikerjakan (dieksekusi) lebih dulu dan Bila urutan pernyataan dibalik, akan mempunyai makna yang berbeda.

Contoh kasus if dan if-else Serta Penyelesaiannya

1.      Menentukan bilangan genap dan bilangan ganjil

a)      Algoritma dengan pseudocode:

If (x mod 2 = 0) then

Write (“x adalah bilangan genap”)

Else write (“x adalah bilangan ganjil”)

Endif

b)      Implementasi dalam bahas C/C++:

/* program bilangan ganjil genap*/

#include<stdio.h>

Main()

{

Int x;

Printf(“program cek bilangan genap/ganjil\n”);

Printf(“bilangan :”);

Scantf(“%d”,&x);

if(x%2==0)

printf(“%d adalah bilangan genap \n”,x);

else printf(“%d adalah bilangan ganjil \ n”,x);

}

Struktur Pemilihan

Dalam membuat program, pngambilan keputusan sering kali dimanfaatkan. Pemanfaatan ini dapat dijumpai pada saat:

a)      Menentukan besarnya tunjangan yang diterima seseorang pegawai yang disesuaikan dengan jumlah anak yang ditanggung.

b)      Menentukan nilai huruf mahasiswa berdasarkan score yang diperoleh.

c)      Menentukan suatu bilangan merupakan prima atau tidak.

Proses pengambilan keputusan sebenarnya hanya terpaku pada logika benar atau salah, ya atau tidak, memenuhi atau tidak. Oleh karena itu, untuk menentukan suatu kondisi tertentu apakah benar atau salah, ya atau tidak maka diperlukan pemahaman  tentang beberapa struktur yang mendukung pengambilan keputusan. Dalam hal pemograman, kita harus mengenal operator yang dipakai dalam pengambilan keputusan. Selain operator pengambilan keputusan, dalam bahasa C/C++, juga disediakan perintah untuk pengambilan keputusan berupa if dan switch.