Tutorial of My Programming Experience in College

[Data Structure] Circularly Linked List - Java Programming Language

noreply@blogger.com (7effrey) — Sat, 09 Aug 2008 04:10:00 +0000

Circularly-Linked List

A variant of a linked list in which the first and final nodes are linked together. This can be done for both singly and doubly linked lists. To traverse a circular linked list, you begin at any node and follow the list in either direction until you return to the original node. Viewed another way, circularly-linked lists can be seen as having no beginning or end. This type of list is most useful for managing buffers for data ingest, and in cases where you have one object in a list and wish to see all other objects in the list. The pointer pointing to the whole list may be called the access pointer.

[Data Structure] Doubly Linked List - Java Programming Language

noreply@blogger.com (7effrey) — Fri, 18 Jul 2008 04:40:00 +0000

Doubly-Linked List

A variant of a linked list in which each node has two links : one points to the previous node, or points to a null value or empty list if it is the first node; and one points to the next node, or points to a null value or empty list if it is the final node. This allows easily accessing list items backward as well as forward and deleting any item in constant time.

[Data Structure] Singly Linked List - Java Programming Language

noreply@blogger.com (7effrey) — Thu, 06 Mar 2008 14:42:00 +0000

Singly-Linked List

Each item called Node in the Singly linked list is stored with an indication of where the next item is. To access the data in the middle of the list, head, which is the first node, is used to know where the first item is. Different with array, a linked list allows addition or deletion of items in the middle of collection with only a constant amount of data movement. To conclude, The list will be a chain of objects of type Node that contain the data and a reference to the next Node in the list.

The implementation of class Singly Linked List in Java Programming Language :

class Node{

int data;

Node next;

}

class LinkedList{

Node head; //posisi awal dari linked list

Node tail; //posisi akhir dari linked list

/**

* Fungsi untuk mengecek apakah linked list masih kosong

boolean isEmpty(){

return (head==null);

}

void addFirst(Node input){

if (isEmpty()){ //Jika linked list masih kosong,

head = input; //maka head dan tail sama dengan node input

tail = input;

}

else {

input.next = head; //Jika linked list sudah berisi,

head = input; //maka input akan di depan dan menjadi head

}

void addLast(Node input){

if (isEmpty()){ //Jika linked list masih kosong,

head = input; //maka head dan tail sama dengan node input

tail = input;

}

else {

tail.next = input; //Jika linked list sudah berisi,

tail = input; //maka input akan di belakang dan menjadi tail

}

void insertAfter(int key,Node input){

Node temp = head;

do {

if (temp.data == key){ //Jika data sama dengan key, maka input

input.next = temp.next; //disambung diantara temp dan temp.next

temp.next = input;

System.out.println("Insert data is succeed.");

break; //dari temp --> temp.next menjadi :

} //temp --> input --> temp.next

temp = temp.next;

}

while (temp!=null);

}

void insertBefore(int key,Node input){

Node temp = head;

while (temp != null){

if ((temp.data == key)&&(temp == head)){

this.addFirst(input); /* jika insert pada awal linked list

maka call method addFirst */

System.out.println("Insert data is succeed.");

break;

}

else if (temp.next.data == key){

input.next = temp.next; //dari temp --> temp.next menjadi

temp.next = input; //temp --> input --> temp.next

System.out.println("Insert data is succeed.");

break;

}

temp = temp.next;

}

void removeFirst(){

Node temp = head;

if (!isEmpty()){

if (head == tail){ //jika element linked list hanya 1,

head = tail = null; //maka head dan tail menjadi null

} //sehingga linked list kosong

else {

temp = temp.next; //memajukan temp ke temp.next

head = temp; //kemudian head dipindah ke temp

temp = null; //kemudian temp di-null (optional)

}

else System.out.println("Data is empty!");

}

void removeLast(){

Node temp = head;

if (!isEmpty()){

if (tail == head){ //jika element linked list hanya 1

head = tail = null; //maka head dan tail menjadi null

} //sehingga linked list kosong

else {

while (temp.next != tail){

temp = temp.next; //memajukan temp hingga satu elemen

} //sebelum tail.

temp.next = null; //temp.next di-null,dan jadi akhir LL

tail = temp; //tail dipindah ke temp

temp = null;

}

else System.out.println("Data is empty!");

}

void remove(int key){

Node temp = head;

if (!isEmpty()){

while (temp != null){

if (temp.next.data == key){ //mengganti temp.next dengan

temp.next = temp.next.next; //temp.next.next

break; //dari temp --> temp.next -->temp.next.next

} //menjadi temp --> temp.next.next

else if ((temp.data == key)&&(temp == head)){

this.removeFirst();//jika key berada pada awal linked list,

break; //maka call method removeFirst

}

temp = temp.next;

}

} else System.out.println("Data is empty!");

}

void find (int key){

int i = 0;

boolean found = false;

Node temp = head;

while (temp != null){

if (temp.data == key){

found = true;

break;

}

i++;

temp = temp.next;

}

if (found){

System.out.println(key+" is found at index "+i);

}

else System.out.println("Data isn't found");

}

void printNode(){

Node temp;

temp = head;

while (temp != null){

System.out.println(temp.data);

temp = temp.next;

}

[Java] Linked List - Introduction - Data Structures

noreply@blogger.com (7effrey) — Thu, 06 Mar 2008 12:57:00 +0000

Linked List - Introduction

A Linked List is a concrete data structure consisting of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.

The principal benefit of a linked list over a conventional array is that the order of the linked items may be different from the order that the data items are stored in memory or on disk, allowing the list of items to be traversed in a different order.

A linked list is a self-referential data type because it contains a pointer or link to another node of the same type.

Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access like array.

Several types of linked list :

Singly-Linked List
Doubly-Linked List
Circularly-Linked List

a. Single-Circularly-Linked List

b. Double-Circularly-Linked List

[Java] Array - Java Programming Language

noreply@blogger.com (7effrey) — Thu, 06 Mar 2008 10:07:00 +0000

Array – Java Programming Language

Array Declaration and Initialization :

a) 1 Dimensional Array :

Declaration : |data type|[ ] |variable name|;

|data type||variable name|[ ];

Example : int x[ ]; /* or */ int [ ] x;

Initialize Array / Instansiate Object with constructor :

|variable name|= new |data type|[sum_of_array];

Example : x = new int[10];

We can also write these together :

|data type||variable name|[ ] = new |data type|[sum_of_array];

Example : int x[ ] = new int [10];

b) 2 Dimensional Array :

Declaration : |data type|[ ][ ] |variable name|;

|data type||variable name|[ ][ ];

Example : int x[ ][ ]; /* or */ int [ ][ ] x;

Initialize Array / Instansiate Object with constructor :

|variable name|= new |data type|[sum_of_array][sum_of_array];

Example : x = new int[10][10];

We can also write these together :

|data type||variable name|[ ] = new |data type|[sum_of_array] [sum_of_array];

Example : int x[ ][ ] = new int [10][10];

[Java] Simple Java Coding - Hello World!

noreply@blogger.com (7effrey) — Mon, 03 Mar 2008 16:53:00 +0000

Simple Java Coding – Hello World!

What’s wrong with the program below?

public class Main

{

void show(){

System.out.println("Hello World!");

}

public static void main (String args[])

{

int value;

show();

System.out.println(value);

}

};

The answer :

the value of variable int value isn’t initialized yet
Method which has static access modifier can only call method which type is static

Correction :

public class Main

{

static void show(){

System.out.println("Hello World!");

}

public static void main (String args[])

{

int value = 0;

show();

System.out.println(value);

}

};

This program will run well. Try it to make a simple java program.

[Java] Simple Java Programming Language Keywords

noreply@blogger.com (7effrey) — Mon, 03 Mar 2008 16:14:00 +0000

Simple Java Keywords

a) new : Produce a single instans from a class dan make reference to that object.

Example :

class box {

int w,h,l;

box() {

this.w = 0;

this.h = 0;

this.l = 0;

}

};

public class BoxData {

public static void main(String[] args) {

box k = new box();

//k is a reference to an object of box class

}

b) private: Give a special access to a class so it can only be used by its class.

Example :

class box {

int w,h,l;

box() {

this.w = 0;

this.h = 0;

this.l = 0;

}

};

//w,h,and l variable can only be used by class Box

c) public : Give a special access to a class so it can be used by all classes.

Example :

class box {

int w,h,l;

box() {

this.w = 0;

this.h = 0;

this.l = 0;

}

};

//class box can be accessed by all classes include different package.

d) this : A special referenced symbol used in a method accessed by active object.

Example :

class box {

int w,h,l;

box() {

this.w = 0;

this.h = 0;

this.l = 0;

}

};

e) protected: Give a special access to a class so it can be used by a method which is in that class and subclass elements.

Example :

class box {

protected int w,h,l;

protected getW(){

return this.w;

}

box() {

this.w = 0;

this.h = 0;

this.l = 0;

}

};

[Java] Introduction to Java Programming Language

noreply@blogger.com (7effrey) — Sun, 02 Mar 2008 17:07:00 +0000

Introduction to Java Programming Language

Java is a programming language originally developed by Sun Microsystems and released in 1995 as a core component of Sun's Java platform. The language derives much of its syntax from C and C++ but has a simpler object model and fewer low-level facilities. Java applications are typically compiled to bytecode which can run on any Java virtual machine (JVM) regardless of computer architecture.

The original and reference implementation Java compilers, virtual machines, and class libraries were developed by Sun from 1995. As of May 2007, in compliance with the specifications of the Java Community Process, Sun made available most of their Java technologies as free software under the GNU General Public License. Others have also developed alternative implementations of these Sun technologies, such as the GNU Compiler for Java and GNU Classpath.

HISTORY

The Java language was created by James Gosling in June 1991 for use in a set top box project. The language was initially called Oak, after an oak tree that stood outside Gosling's office - and also went by the name Green - and ended up later being renamed to Java, from a list of random words. Gosling's goals were to implement a virtual machine and a language that had a familiar C/C++ style of notation. The first public implementation was Java 1.0 in 1995. It promised "Write Once, Run Anywhere" (WORA), providing no-cost runtimes on popular platforms. It was fairly secure and its security was configurable, allowing network and file access to be restricted. Major web browsers soon incorporated the ability to run secure Java applets within web pages. Java quickly became popular. With the advent of Java 2, new versions had multiple configurations built for different types of platforms. For example, J2EE was for enterprise applications and the greatly stripped down version J2ME was for mobile applications. J2SE was the designation for the Standard Edition. In 2006, for marketing purposes, new J2 versions were renamed Java EE, Java ME, and Java SE, respectively.

In 1997, Sun Microsystems approached the ISO/IEC JTC1 standards body and later the Ecma International to formalize Java, but it soon withdrew from the process. Java remains a de facto standard that is controlled through the Java Community Process. At one time, Sun made most of its Java implementations available without charge although they were proprietary software. Sun's revenue from Java was generated by the selling of licenses for specialized products such as the Java Enterprise System. Sun distinguishes between its Software Development Kit (SDK) and Runtime Environment (JRE) which is a subset of the SDK, the primary distinction being that in the JRE, the compiler, utility programs, and many necessary header files are not present.

On 13 November 2006, Sun released much of Java as free software under the terms of the GNU General Public License (GPL). On 8 May 2007 Sun finished the process, making all of Java's core code open source, aside from a small portion of code to which Sun did not hold the copyright.

JAVA IDE

Java IDE makes us easier to make a program because we don’t need to remember the syntax and we can compile just with one click. For Java Programming Language, I suggest you to use NetBeans 6.0 and install Java Development Kit (1.6) which are free licensed. JCreator also can be used, but you must purchase a licensed. So, I suggest to use NetBeans 6.0 for learning.

You can download it here :
http://java.sun.com/javase/downloads/index.jsp

Source : en.wikipedia.org/wiki

[WISE WORD] A Story About Frog

noreply@blogger.com (7effrey) — Fri, 22 Feb 2008 16:04:00 +0000

A Story About FROG

One day there was a competition. That was a race competition and the participants were frogs. The first frog who can climb and reach the top of the tower would be the winner. Then the competition was begun. Frogs were trying hard to climb that tower, many audiences screamed "It's impossible to reach the top of the tower because it's too high". What have the audiences said became true, many frogs were falling down. Finally just one frog left, and that frog can reach the top. He was a winner. He was succeeded lose his frightened. The audiences were confused why it could be happened. In fact the frog who was the winner was deaf so he couldn't hear what the audiences have screamed.

WHAT YOU THINK IT'S BECOME TRUE SO ALWAYS POSITIVE THINKING and WHAT YOU HEAR IS INFLUENTED YOUR MIND N POWER SO BECOME A "DEAF" IS THE BEST WAY, NEVER HEAR WORDS THAT IS NEGATIVE. BECAUSE THE NEGATIVE WORD CAN DROP OUR WISHED N OUR EFFORT...ALWAYS BELIEVES YOURSELF N NEVER SAY NEVER N IMPOSSIBLE!

[C Programming Language] Repetition/Looping in C Programming Language

noreply@blogger.com (7effrey) — Sat, 16 Feb 2008 13:39:00 +0000

REPETITION / LOOPING IN C PROGRAMMING LANGUAGE

Repetiton / Looping :

- A process which is done contionusly until particular value. If the limit isn’t typed, then syntax will be error because that process will be an infinite loop.

Looping which is usually used is Counting Loops. Why is it called conting loops? Because its repetition is managed by a loop control variable whose value represents a count. It is used when we can determine how many loops will be needed exactly.

The pseudocode of Counting Loops :

Set loop control variable to an initial value of 0

While loop control variable <>

... //Do something multiple times

Increase loop control variable by 1.

Three types of Counting Loops in C Programming Language :

a. FOR

Syntax :

for(initialize; test; update)

{

//Steps to perform each iteration

}

Initialize - - > initial condition of control variable

Test - - > relational expression which is a condition

Update - - > change the value of control variable

For Example :

int p = 0;

int i;

for (i=0;i<10;i++)

{

p=p+i;

}

Note :

p = p + 1 is equal with p++ and p += 1.

Flowchart :

b. WHILE (Pre Tested Loop) :

Syntax :

While(condition)

{

//Steps to perform. These should eventually

// result in condition being false

}

For Example :

int p=0;

int i=0; //initialization

while (i<10) //testing

{

p=p+i;

i++; //updating

}

Note :

If any of initialization, testing and updating are skipped, it may produce an infinite loop.

Flowchart :

c. DO-WHILE (Post Tested Loop) :

Syntax :

{

//Steps to perform. These should eventually

// result in condition being false

}

While (condition);

For Example :

int i=0 //initialization

int p=0;

{

p=p+1;

i++; //updating

}

while (i<10); //testing

Flowchart :

Debug and Test Looping Programs :

1. Using debugger programs.

2. Use several printf statement to output the value of variables.

3. Testing the programs with try and error.

[C Programming Language] Standard Function in C Programming Language

noreply@blogger.com (7effrey) — Sat, 16 Feb 2008 13:36:00 +0000

C Programming Language Standard Function

Functions which is often used in C Programming Language :

a. printf

a function in stdio.h library which is used to show string and also placeholders to screen.

b. puts

a function used to show a string to screen when the placeholders isn’t used.

c. scanf

a function which is used to store data whose type is represented by a placeholder in string format to variable memory address which has been decided.

d. getch

a function which is used to read data whose type is character without key ENTER pressed and it won’t be showed. This function is usually used to show output on the screen until key ENTER pressed.

e. getche

a function which is used to read data whose type is character without key ENTER pressed and the character will be showed on the screen.

f. getchar

a function which is used to read data whose type is character, the character will be showed on screen and must be finished with key ENTER pressed.

g. clrscr

a function which is used to clear screen and move the cursor back to the upper left corner.

h. %3d dan %-3d

int x=1;

%3d will show : _ _ 1 - - > it still give 2 space

%-3d will show : 1 - - > empty space will be deleted.

Function Random and Randomize in Dev C++ :

1. Randomize :

To make randomize in order to produce a different random number every time the program running.

Syntax : srand ((unsigned)time(NULL));

2. Random(int num) :

To get a random number between 0 – (num – 1).

Syntax : int x = rand( )% (int num);

For example :

#include

#include //definition of srand, rand

#include //definition of time

int main

{

int n,

printf(“Enter the value of maximum random number : “);

scanf(“%d”,&n);

srand((unsigned)time(NULL));

x = rand()%100;

printf(“Random Number : %d\n”,x);

getch();

}

[C Programming Language] C Programming Language Main Structure

noreply@blogger.com (7effrey) — Sat, 16 Feb 2008 13:21:00 +0000

C Programming Language Main Structures

C Programming Language Elements :

1. Preprocessor directives

Command line which is given instruction to preprocessor.

There are two types of preprocessor : #include and #define.

#include library.h tell preprocessor the library to find the meaning of standard identifier.

#define NAME value tell preprocessor to change every identifier NAME with value before the program was compiled.

Example :

#include stdio.h

#define PI 3.14

2. Comment

Texts which is started with /* or // and finished with */, and contains information about program in order to make the program is understood easily by other programmer. Compiler will ignore comments.

3. Main Function

Syntax :

int main(void)

{

/* main function */

}

Main function is made up from 2 parts :

1. Declaration

2. Executeable Statement

4. Reserved Word and Identifier

Reserved Word :

- word which has special meaning in C and can’t be used again for other.

Example : int, void, double, return, etc.

Identifier :

a. Standard Identifier :

A word which has special meaning in C but it can’t be redefined by user(not recommended).

Example : printf, scanf, etc.

b. User Defined Identifier :

A word which is choosed by user to rename memory cell and user defined operation.

Example : miles, name, x, PI, etc

Expression Evaluation Rule :

1. Parentheses Rule

2. Operator Presedence Rule

From High to Low :

Function calls

!, +, -, & (operator unary)

*, /, %

+, -

<, <=, >=, >

==, !=

3. Associative Rule

Unary - - > evaluate from Right to Left

Binary - - > evaluate from Left to Right

[C Programming Language] Branching (IF ELSE / SWITCH CASE) in C Programming Language

noreply@blogger.com (7effrey) — Fri, 15 Feb 2008 15:51:00 +0000

BRANCHING/ DECISION
(IF ELSE / SWITCH CASE)

Three Main Construction of Programming :

1. Sequential

2. Branching / Decision

3. Looping / Repetition

Branching :

- A process to make a decision based on the condition which has been evaluated before.

There are two types of branching :

1. IF – ELSE

Syntax : if (condition){

statement – 1;

statement – n;

}

else if (condition){

statement – 1;

statement – n;

}

Flowchart :

Example :

#include

int main()

{

int T;

printf("Enter temperature (Celcius) : ");

scanf("%d",&T);

if (T>30)

{

printf("Arghhhhhhh, Hot!");

}

else if (T<0)

{

printf("Ouchhhhh, Cold !");

}

else printf("Yummy! Cool.");

getch();

return(0);

}

2. SWITCH – CASE

Syntax : switch (kondisi) {

case 1 : pernyataan-1;

break;

case 2 : pernyataan-2;

break;

.....

case n : pernyataan-n;

break;

default : pernyataan-m

}

Flowchart :

Example :

#include

int main()

{

char IP;

printf("Enter your result in alphabet : ");

scanf("%c",&IP);

switch (IP)

{

case 'A' : printf("4");

break;

case 'B' : printf("3");

break;

case 'C' : printf("2");

break;

case 'D' : printf("1");

break;

case 'E' : printf("0");

break;

default : printf("The input isn’t valid.");

}

getch();

return(0);

}

The difference between IF-ELSE and SWITCH-CASE :

IF ELSE :

To make a decision between 2 choices. For example :

If the value is greater than 70 (seventy) then the student passes the exam.

Else, the student doesn’t pass the exam.

SWITCH CASE :

To make a decision which has more than 2 choices. For example :

A is converted to 4.

B is converted to 3.

C is converted to 2.

D is converted to 1.

E is converted to 0.

[C Programming Language] C Simple Data Types

noreply@blogger.com (7effrey) — Thu, 14 Feb 2008 15:41:00 +0000

Primitive Data Types

C has five primitive data types :

int : used to define integer numbers

char : contains ASCII Code character (128 characters)

float : used to define floating point numbers

double : used to define big floating point numbers

bool : used to define two conditions --> true or false / 1 or 0

Example Variable Initialisation:

1. int
int tes;
tes = 5;

2. char
char answer = 'x';

3. float
float score = 85.3;

4. double
double height = 1,6782992;

5. bool
bool check = true;

Modifiers

The three data types above have the following modifiers.

short

long

signed

unsigned

The modifiers define the amount of storage allocated to the variable. ANSI has the following rules :

short int <= int <= long int
float <= double <= long double

Implicit specifier(s)	Explicit specifier	Bits	Bytes	Minimum value	Maximum value
`signed char`	same	8	1	−128	+127
`unsigned char`	same	8	1	0	255
`char`	one of the above	8	1	−128 or 0	+127 or 255
`short`	`signed short int`	16	2	−32,768	+32,767
`unsigned short`	`unsigned short int`	16	2	0	65,535
`int`	`signed int`	16 or 32	2 or 4	−32,768 or −2,147,483,648	+32,767 or +2,147,483,647
`unsigned`	`unsigned int`	16 or 32	2 or 4	0	65,535 or 4,294,967,295
`long`	`signed long int`	32	4	−2,147,483,648	+2,147,483,647
`unsigned long`	`unsigned long int`	32	4	0	4,294,967,295
`long long`	`signed long long int`	64	8	−9,223,372,036,854,775,808	+9,223,372,036,854,775,807
`unsigned long long`	`unsigned long long int`	64	8	0	18,446,744,073,709,551,615

Qualifier

1. Const

The const qualifier is used to tell C that the variable value can not change after initialisation.

For example, const float pi=3.14159;

So, the value of pi cannot be changed at a later time within the program.

Another way to define constants is with the #define preprocessor which has the advantage that it does not use any storage.

For example, #define PI 3.14159

2 . Volatile

volatile means the storage is likely to change at anytime and be changed but something outside the control of the user program. This means that if you reference the variable, the program should always check the physical address (ie a mapped input fifo), and not use it in a cashed way.

(www.space.unibe.ch)

[C Programming Language] Introduction to C Programming Language

noreply@blogger.com (7effrey) — Thu, 14 Feb 2008 15:34:00 +0000

Introduction

C is a general-purpose, block structured, procedural, imperative computer programming language developed in 1972 by Dennis Ritchie at the Bell Telephone Laboratories for use with the Unix operating system. It has since spread to many other platforms. Although predominantly used for system software, C is used not only for system but also for applications widely. C has also greatly influenced many other popular languages, especially C++, which was designed as an enhancement to C.

Philosophy

C is an imperative (procedural) systems implementation language. Its design goals were for it to be compiled using a relatively straightforward compiler, provide low-level access to memory, provide language constructs that map efficiently to machine instructions, and require minimal run-time support. C was therefore useful for many applications that had formerly been coded in assembly language.

Despite its low-level capabilities, the language was designed to encourage machine-independent programming. A standards-compliant and portably written C program can be compiled for a very wide variety of computer platforms and operating systems with minimal change to its source code. The language has become available on a very wide range of platforms, from embedded microcontrollers to supercomputers.

Characteristics

As most imperative languages in the ALGOL tradition, C has facilities for structured programming and allows lexical variable scope and recursion, while a static type system prevents many unintended operations. Parameters of C functions are always passed by value. Pass-by-reference is achieved in C by explicitly passing pointer values. Heterogeneous aggregate data types (the struct in C) allow related data elements to be combined and manipulated as a unit. C has around 30 reserved keywords and the source text is free-format, using semicolon as a statement terminator (not a delimiter).

C also exhibits the following more specific characteristics:

Non-nestable function definitions, although variables may be hidden in blocks to any level of depth

Partially weak typing, for instance, characters can be used as integers in a way similar to assembly

Low-level access to computer memory via machine addresses and typed pointers

Function pointers allowing for a rudimentary form of closures and runtime polymorphism

Array indexing as a secondary notion, defined in terms of pointer arithmetic

A standardized C preprocessor for macro definition, source code file inclusion, conditional compilation, etc.

Complex functionality such as I/O and mathematical functions consistently delegated to library routines

Syntax divergent from ALGOL, often following the lead of C's predecessor B, for example using
- { ... } rather than ALGOL's begin ... end
- the equal-sign for assignment (copying), much like Fortran
- two consecutive equal-signs to test for equality (compare to .EQ. in Fortran or the equal-sign in BASIC)
- && and || in place of ALGOL's and and or, which
  - are syntactically distinct from the bit-wise operators & and | (B used & and | in both meanings)
  - never evaluate the right operand if the result can be determined from the left alone (short-circuit evaluation)
- a large number of compound operators, such as +=, ++, etc.

Uses

C's primary use is for "system programming", including implementing operating systems and embedded system applications, due to a combination of desirable characteristics such as code portability and efficiency, ability to access specific hardware addresses, ability to "pun" types to match externally imposed data access requirements, and low runtime demand on system resources.

C has also been widely used to implement end-user applications, although as applications became larger much of that development shifted to other, higher-level languages.

One consequence of C's wide acceptance and efficiency is that the compilers, libraries, and interpreters of other higher-level languages are often implemented in C.

C is used as an intermediate language by some higher-level languages. This is implemented in one of two ways, as languages which:

Emit C source code, and one or more other representations: machine code, object code, and/or bytecodes. Examples: some dialects of Lisp (Lush, Gambit), Haskell (Glasgow Haskell Compiler); Squeak's C-subset Slang.

Emit C source code only, and no other representation. Examples: Eiffel, Sather; Esterel.

C source code is then input to a C compiler, which then outputs finished machine or object code. This is done to gain portability (C compilers exist for nearly all platforms) and to avoid having to develop machine-specific code generators.

Unfortunately, C was designed as a programming language, not as a compiler target language, and is thus less than ideal for use as an intermediate language. This has led to development of C-based intermediate languages such as C--.

Libraries

The C programming language uses libraries as its primary method of extension. In C, a library is a set of functions contained within a single "archive" file. Each library typically has a header file, which contains the prototypes of the functions contained within the library that may be used by a program, and declarations of special data types and macro symbols used with these functions. In order for a program to use a library, it must include the library's header file, and the library must be linked with the program, which in many cases requires compiler flags (e.g., -lm, shorthand for "math library").

The most common C library is the C standard library, which is specified by the ISO and ANSI C standards and comes with every C implementation. ("Freestanding" [embedded] C implementations may provide only a subset of the standard library.) This library supports stream input and output, memory allocation, mathematics, character strings, and time values.

Another common set of C library functions are those used by applications specifically targeted for Unix and Unix-like systems, especially functions which provide an interface to the kernel. These functions are detailed in various standards such as POSIX and the Single UNIX Specification.

Since many programs have been written in C, there are a wide variety of other libraries available. Libraries are often written in C because C compilers generate efficient object code; programmers then create interfaces to the library so that the routines can be used from higher-level languages like Java, Perl, and Python.

Related languages

C has directly or indirectly influenced many later languages such as Java, C#, Perl, PHP, JavaScript, and Unix's C Shell. The most pervasive influence has been syntactical: all of the languages mentioned combine the statement and (more or less recognizably) expression syntax of C with type systems, data models and/or large-scale program structures that differ from those of C, sometimes radically.

C Compiler

Dev-C++ is a free integrated development environment (IDE) distributed under the GNU General Public License for programming in C/C++. It is bundled with the open source MinGW compiler. The IDE is written in Delphi. The latest release of Dev-C++ version is 4.9.9.2 which is launched in February 22, 2005.

The project is hosted by SourceForge. Dev-C++ was originally developed by programmer Colin Laplace. Dev-C++ runs exclusively on Microsoft Windows.

The program itself has a look-and-feel similar to that of the more widely-used Microsoft Visual Studio. One additional aspect of Dev-C++ is its use of DevPaks, packaged extensions on the programming environment with additional libraries, templates, and utilities. DevPaks often contain, but are not limited to, GUI utilities, including popular toolkits such as GTK+, wxWidgets, and FLTK. Other DevPaks include libraries for more advanced function use.

Dev-C++ can be downloaded from : http://sourceforge.net/projects/dev-cpp/

Source : en.wikipedia.org/wiki
programmingtutorial.wordpress.com

[EVENT] Happy Valentines Day!!

noreply@blogger.com (7effrey) — Thu, 14 Feb 2008 14:50:00 +0000

About 7effrey

noreply@blogger.com (7effrey) — Sun, 10 Feb 2008 09:39:00 +0000

7effrey

nothing special about me..
i'm just an ordinary man..
i look like in this picture..
wkwkwkw..
i will try to do my best in this blog..
i hope this blog can be useful for others..
so, please check this out everyday!!
Maybe, sometimes I give you a surprise..
Hahaha..

Hmm, I think my blog isn't perfect..
I hope you can give me any suggestion to make my blog better..
i'm very appreciate your comment..
At the end, thank you for visiting my blog..
I hope to seeing you again..

see ya!!

Tutorial of My Programming Experience in College

[Data Structure] Circularly Linked List - Java Programming Language

[Data Structure] Doubly Linked List - Java Programming Language

[Data Structure] Singly Linked List - Java Programming Language

Singly-Linked List

[Java] Linked List - Introduction - Data Structures

Linked List - Introduction

[Java] Array - Java Programming Language

Array – Java Programming Language

[Java] Simple Java Coding - Hello World!

Simple Java Coding – Hello World!

[Java] Simple Java Programming Language Keywords

Simple Java Keywords

[Java] Introduction to Java Programming Language

Introduction to Java Programming Language

HISTORY

JAVA IDE

[WISE WORD] A Story About Frog

A Story About FROG

[C Programming Language] Repetition/Looping in C Programming Language

[C Programming Language] Standard Function in C Programming Language

[C Programming Language] C Programming Language Main Structure

[C Programming Language] Branching (IF ELSE / SWITCH CASE) in C Programming Language

BRANCHING/ DECISION(IF ELSE / SWITCH CASE)

[C Programming Language] C Simple Data Types

Primitive Data Types

Modifiers

Qualifier

[C Programming Language] Introduction to C Programming Language

Introduction

Philosophy

Characteristics

Uses

Libraries

Related languages

C Compiler

[EVENT] Happy Valentines Day!!

About 7effrey

7effrey

BRANCHING/ DECISION
(IF ELSE / SWITCH CASE)