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();