Source Code 99

How to Build a Chrome Extension (Lifehacker.com)

noreply@blogger.com (Tyanak) — Fri, 27 Jan 2012 01:25:00 +0000

Google Chrome is the best web browser around right now, and part of Chrome's appeal is owed to its excellent extensions. The good news: It's not that hard to get started making your own Chrome extensions. In this guide, we'll take you from the most simple Hello World extension (no HTML or JavaScript knowledge required) to a more complex RSS-fetching extension to get you started down your path as a Chrome-extension-making guru.

Click here to continue reading

Zip2Fix Extracts Files from Damaged Zip Archives by Alan Henry (LifeHacker.com)

noreply@blogger.com (Tyanak) — Fri, 15 Jul 2011 02:32:00 +0000

Windows: Spending a half-hour slowly downloading a huge Zip archive only to discover it's corrupt is a pain. Avoid it with Zip2Fix, a utlity that won't fix corrupt archives, but will extract any and all undamaged files from it. More »

How to Set Up a File-Syncing Dropbox Clone You Control [File Syncing] by Melanie Pinola (LifeHacker.com)

noreply@blogger.com (Tyanak) — Fri, 15 Jul 2011 02:04:00 +0000

File syncing is a godsend when you work on multiple computers or devices and want to make sure you have the most up-to-date files wherever you log in. While online services like Dropbox may be the most convenient options, there are plenty of reasons you may want to "roll your own cloud" and sync your files to your own web server or just on your local network. Below, we'll detail how to set up a Dropbox clone, complete with instantaneous, encrypted syncs, cloud backups, and file versioning, using cross-platform software GoodSync. More »

Introduction to Programming 2 v2.0 - JEDI

noreply@blogger.com (Tyanak) — Thu, 26 Nov 2009 01:58:00 +0000

JEDI is a collaborative project that aims to make high-quality, industry-endorsed IT and Computer Science course material available for free. The course materials are developed with inputs from industry and conforms to international education standards. JEDI materials and resources are developed, used and enhanced in a collaborative environment using java.net.

JEDI is a project of Sun Microsystems, Inc. through the University of the Philippines Java Research and Development Center and in partnership with various groups from the Education and Industry Sectors.

Click here to download Introduction to Programming 2 v2.0 by JEDI

Intorduction to Programming 1 v1.3 - JEDI

noreply@blogger.com (Tyanak) — Thu, 26 Nov 2009 01:56:00 +0000

Click here to download Introduction to Programming 1 v1.3 by JEDI

Data Structures v2.0 - JEDI

noreply@blogger.com (Tyanak) — Thu, 26 Nov 2009 01:44:00 +0000

Click here to download Data Structures v2.0 of JEDI

PHP & MySQL For Dummies 3rd edition

noreply@blogger.com (Tyanak) — Thu, 15 Oct 2009 05:28:00 +0000

Think of this book as your friendly guide to building a Web database application.

This book is designed as a reference, not as a tutorial, so you don’t have

to read it from cover to cover.

Click here to download

[Please inform me if ever there are problems with the link]

PHP and MySQL Web Development ALL-IN-ONE DESK REFERENCE FOR DUMmIES - J Valade

noreply@blogger.com (Tyanak) — Thu, 15 Oct 2009 05:25:00 +0000

This book provides all the information you need to build dynamic Web sites

that are quite complex. The book is intended as a reference, not a tutorial.

Each minibook provides information on a different aspect of building

dynamic Web sites.

Click here to download

[Inform me if ever there are problems with the link]

PHP BY EXAMPLE - T Butzon

noreply@blogger.com (Tyanak) — Thu, 15 Oct 2009 05:21:00 +0000

This book is written to teach Web designers who have never programmed before

or who have little experience programming how to program in PHP. Along the

way, you will pick up important concepts such as object-oriented programming

and the creation of database-driven Web sites. If you are a Web designer and

you want to increase your skills and knowledge of Web programming, this book

is an excellent place to start.

Click here to download

[Inform me if ever there are problems with the link]

PHP and MySQL Everyday Apps FOR DUMmIES - J Valade.pdf

noreply@blogger.com (Tyanak) — Thu, 15 Oct 2009 05:12:00 +0000

This book is a practical introduction to dynamic Web applications. It provides

the code and information needed to build several of the most popular applications

on the Web. The applications in this book allow you to

- Restrict your Web site or part of your Web site to authorized users

- Sell products on your Web site

- Provide a place where users can communicate with each other online

- Allow users to publish and edit their documents on a Web site

- Manage mailing lists

You can use these applications as is, modify them for use on your Web site,

or build your own application by using techniques that I show you in these

applications.

Click here to download

[Please inform me if ever there are problems with the link]

PHP Developer's Dictionary - R A Wyke, M J Walker, R Cox

noreply@blogger.com (Tyanak) — Thu, 15 Oct 2009 04:52:00 +0000

Within the pages of this book you will find a quick introduction to the language and a

complete reference to the PHP4 language. As a developer, you might often find

yourself scrambling for the correct syntax for a function or maybe some clarification

on how something works, and this book intends to fill that void.

Click here to download

[notify me if ever there is a problem with the link]

Developing Games in Java by David Brackeen

noreply@blogger.com (Tyanak) — Fri, 09 Oct 2009 08:25:00 +0000

If you already have experience programming games with Java, this book is for you. David Brackeen, along with co-authors Bret Barker and Lawrence Vanhelsuwe, show you how to make fast, full-screen action games such as side scrollers and 3D shooters. Key features covered in this book include Java 2 game programming techniques, including latest 2D graphics and sound technologies, 3D graphics and scene management, path-finding and artificial intelligence, collision detection, game scripting using BeanShell, and multi-player game engine creation.

Click here to downnload

* Please notify me if the lick is broken.

Object-Oriented Analysis and Design Understanding System Development with UML 2.0 - Mike O’Docherty

noreply@blogger.com (Tyanak) — Wed, 07 Oct 2009 03:33:00 +0000

The aim of this book is to give you a broad understanding of the processes and techniques

used in object-oriented software development, the production of computer programs using

object-oriented techniques. The Unified Modeling Language (UML) comes into play as the

standard notation used in industry for software documentation.

You may be a student at a university or on a commercial training course. Or you may

be an experienced software developer, moving into object orientation for the sake of your

career. In either case, this book is for you. Little prior knowledge is required on your

part and there is no attempt to teach you everything there is to know. Instead, you will

be guided through the essential parts of the process, so that you can do your job more

effectively.

Although this book is broad, it only goes as deep as the point where you would normally

start writing lines of code. Describing how to write code would mean choosing a particular

programming language; the decision about the most appropriate language is for you to

make. You should consider this book as a generic front-end that will work for any pure,

object-oriented programming language.

Click here to download

*If the link is broken, don't hesitate to contact me.

Java EE Tutorial

noreply@blogger.com (Tyanak) — Wed, 07 Oct 2009 03:15:00 +0000

This tutorial is a guide to developing enterprise applications for the JavaTM Platform, Enterprise

Edition 5 (Java EE 5).

Click here to download

*If the download link has been broken. Feel free to contact me.

Add Single Digit Numbers With Filtering

noreply@blogger.com (Tyanak) — Sun, 08 Mar 2009 13:49:00 +0000

This problem is easily solved if we are to use High level programming language, but for assembly language, we need to remember that each entry from the keyboard are accepted as hexadecimal equivalent of characters, even if the entry is a digit, as long as it is from the keyboard. To manipulate these data, we need to be able to work with the registers and the memory allocation since that is the only thing we can work with during processing when.

So here's how we did it:

Since we are just entering a single digit number, we just use the

MOV ah, 01h

INT 21h

to enter a character which will then be stored inside AL

for the first number, we transfered it to CL to not loose the data since we are to use AL again for the second input. We then decrement the inputed characters by 30H to get its equivalent numerical value in hexadecimal.

To determine if the input is valid or not, right after we enter the data, we test it first if the value is between 30h to 39h, since the characters '0' to '9' is only within that range, we use the compare then jump algorithm. JL for Jump if Lesser. JG for Jump if Greater. JE for Jump if Equal.

CMP AL, 30H

The code above compares the AL to 30H, and if it is lesser than the value(which is lesser than the valid range for numerical characters), we let it jump to the label where we want it to go to.

CMP AL, 39H

The code above compares the AL to 39H, and if it is greater than the value(which is higher than the valid range for numerical characters), we let it jump to the label where we want it to go to.

At the second input, we leave the second number to AL since later, we are to use AAA(ASCII Adjust for Addition) in case our result of the addition will exceed 09h. During the AAA, if it exceeds to 09h, the AL will be added by 06H to get the appropriate value then zero out the most significant nibble, then add AH by 1, that is also why we zeroed out first the AH in order for our highest significant digit to start at 0.

After adjustment, we add the two values with 30H to bring it back to its ASCII equivalent(ADD AX, 3030H). We then PUSH the data (which is stored inside AX momentarily) to the stack to be stored in the MM to prevent data loss(PUSH AX).

Then later, when we are ready to print the result, we just simply POP out the result (POP CX) then store it to CX and one by one display the characters starting from the highest significant number.

There is another filtering during the displaying of the result, that is if the most significant number of the result is equal to zero, which means that the result of the addition did not exceed 09h.

CMP AH, 30H

The code above is to let the program skip a printing the the Highest Significant Number if the it is equal to 30H or simply '0' to the specified label for the printing of the Lowest Significant Number.

Click here to download the code.

For the output: I provided 3 situations

1st situation is when we add values where the result is greater than 9.

2nd situation is when we add values within 0 - 9.

3rd situation is when there is an invalid input.

GUI - How to change the background Color of the Panel

noreply@blogger.com (Tyanak) — Wed, 04 Mar 2009 13:33:00 +0000

So in this program, let's try to change the background color of a panel.

Now in this program, we utilize the AWT. It is possible to use the Swing but let's do that on anot

her problem.

Ok so now, we use a Scrollbar for this in order to freely adjust the values of our color using the RGB format(0-255).

Since the there is no ActionListener of Scrollbar, unlike Button, but the Scrollbar is a AdjustmetListener found at java.awt.event package with only one method signature and that is adjustmentValueChanged(AdjustmentEvent e).

We are to use the Scrollbar objects to accommodate the three colors(Red, Green, and Blue. The event for each color sin

ce each change would just read the current value for each Scrollbar and use it as basis for the new color of the Panel.

The Scrollbars are namely, sbRed, sbGreen, and sbBlue. We set the minimum value of the scrollbar to 0 and maximim to 255 since the RGB only accepts 0-255. To set the Scrollbar with the values given, we use its constructor Scrollbar(int orientation, int value, int visible, int minimum, int maximum).

For the orientation, 0 is horizontal and 1 is vertical.

For the value, it is for the initial value the scrollbar.

For the visible, it is for how should the scroller for the Scrollbar should appear on the Scrollbar. If set to 0, it would adjust automatically. It is actually based on the range of the value for minimum to maximum. If it is 255, then it would match the maximum and would cover the all of the Scrollbar. Just be careful since if the value is greater than the maximum range, then it would generate an Error.

For minimum, it is the minimum value and the maximum is for the maximum value.

To get the value of each Scrollbar, which is an integer value, is the getValue() method. Example, sbRed.getValue().

I created one class for the AdjustmentListener to make the event listeners uniform for each scrollbar since named AdjL. But in this implementation, I need to make it an inner class so that I could access the objects. Though it is possible to use an outside class, at least I'll be able to only use only one file.

The layout for the Scrollbars, the top is for the Red, the middle is for the Green, then the bottom bar is for the Blue.

Click here to download the file.

Sample output.

Doubly Linked List Implementation

noreply@blogger.com (Tyanak) — Sat, 28 Feb 2009 02:28:00 +0000

So here is another implementation of another linked list, Doubly-Linked List.

For a doubly-linked list, each node is divided into

three parts: the left pointer field, the data field, and t

he right pointer field.

The left pointer field is used to contain the

address of the preceding node in the list or what is known as the Predecessor

Unlike the sing

ly-linked list counterpart, the doubly-linked list can traverse backwards since there is a pointer to poin

t at the previous node.

The algorithms:

- Inserting a Node into a Doubly-Linked List

o General procedure

1. Create a new node for the element

2. Set the data field of the new node to the value to be inse

rted.

3. Determine the position of the node in the list based on its valu

4. Insert the node

- Inserting a node into the Head of the List

o The algorithm

1. Set the left pointer field of the new node to null

2. Set the right pointer field of the new node to the address contained in the head.

3. Set the left pointer filed of the current head node in the list to the address of the new node.

- Insert a Node at the End of a List

o The algorithm:

1. Set the right pointer field of the new node to null

2. Set the left pointer field of the new node to tail

3. Set the right pointer field of the current tail node in the list to the address of the new node.

4. Set the variable tail to the address of the new node.

- Inserting a node within the list

o The algorithm:

1. Determine the position of the node in the list

2. Set the left pointer field of the new node to the address of the current node.

3. Set the right pointer field of the new node to the address of the current.next node.

4. Set the right pointer field of the current node to the address of the new node

5. Set the left pointer field of the current.next node to the address of the new node.

- Deleting a node from a doubly-linked list

o General procedure

1. Locate the node

2. Delete the node

3. Release the node form memory

- Deleting the node at the Head of the list

o The Algorithm

1. Set the variable head to the address of the second node in the list.

2. Set the left pointer field of the new head node to null

- Deleting the node from within the list

o The Algorithm

1. Set the right pointer field of current.previous node to the address of the current.next node

Set the left pointer field of the current.next node to the address of the current.previous node

The code and the output:

Click here to download the code.

JPanel - Drawing a Star

noreply@blogger.com (Tyanak) — Sat, 28 Feb 2009 02:14:00 +0000

To draw a star inside a panel, we put the code inside the paint method of the Panel class and use the fillPolygon() to draw our star since this method utilizes multiple points to draw a shape. Specifically, based on an array of X's and Y's.

So here's the code and the corresponding output.

Strings - Repeated Word

noreply@blogger.com (Tyanak) — Tue, 24 Feb 2009 09:07:00 +0000

So here is the code requested.

For this function, a word is recognized if the length of its characters is greater than one. So basically, to look for repeated words, first thing to do is know all combination of these words.

To look for these words, what I did was to get the substring of the entered string with 3 in length up to its maximum length. Since in java, the String class doesn't have any methods for substring, we I converted the String class object to a StringBuffer object. The stack is just used to determine if there is a repeated word(if stack is empty, no repeatitions).

After determining the word, we then traverse the string starting from start to the end comparing the newly found word and the substrings of specified index retrieved during the traversing.

The code:

The problem for this code though is that it recognizes spaces as part of the word.

A solution would be to separate all words then put it on a stack then base the searches on these grouped words.

String - Partial Reverse (First Characters - Alphabets)

noreply@blogger.com (Tyanak) — Sun, 22 Feb 2009 01:51:00 +0000

So here is another problem that i just thought of. This problem is best done with stacks. So the problem is basically to let the user enter a string and then the first series of alphabets should be reversed. Here are some examples.

eg1:

Original: Hello World

Result: olleH World

eg2:

Original: text123

Result: txet123

eg3:

Original: -hello

Result: -hello

Meaning, the reverse will only proceed if the first series of characters are alphabets

So the concept for the solution would be,

If recognize a character from the start, push the token to the stack

If not, pop and display everything from the stack and concatinate with the remaining
tokens.

These are the only steps needed.

Introducing, THE CODE:

Pyramid of Letters

noreply@blogger.com (Tyanak) — Tue, 17 Feb 2009 15:03:00 +0000

With this code, based on the number cx, loops would generate a pyramid of letters.

The soluttion is to have multiple loops. Now the problem with this is that the CX is the only register used to count how many loops. Since we have two loops, we need to store first the CX to another register then store it back again to the CX when doing the outer loop since when doing the inner loop we need to be able to have a new value for CX without loosing the old value of CX.

The data segment:

msg1 db 0ah, 0dh, '$'

ctr1 dw 1

ctr2 dw ?

tem db ?

let db 'A'

The code segment:

mov cx, 5 ; assign the first value of CX to

; a specific number to determine

; the level of the pyramid in this

; situation, we give the pyramid

; with level 5

a: mov ctr2, cx ; store cx to a memory

; alocation

mov cx, ctr1 ; give a new value for cx

; for the inner loop

mov bh, let ; assign the letter to be

; displayed starting from 'A'

mov tem, bh

b: mov ah, 02h

int 21h ; print the character inside tem

inc tem ; increment tem to proceed

; to the next letter

loop b

mov ah, 09h

lea dx, msg1 ; print the new line stored at msg1

int 21h

inc ctr1 ; increment the ctr1 to increase

; the next level

mov cx, ctr2 ; give cx its old value to proceed

; with the outer loop.

loop a ; repeat the process with the old counter

Singly Linked List Implementation

noreply@blogger.com (Tyanak) — Mon, 16 Feb 2009 09:06:00 +0000

For this implementation of a linked list in Java, I created my own class for a node called SLNode since a different node is needed for a singly and a doubly.

Here is the SLNode class:

class SLNode

{

public Object data;

public SLNode next;

public SLNode(Object d)

{

data=d;

next=null;

}

The next code is the class for the singly linked list called the SLinkedList

The attributes:

SLNode head;

SLNode tail;

We only need two attribute since a singlylinked list only has a head and a tail

The constructor:

public SLinkedList()

{

head=null;

tail=null;

}

It all attributes are set to null since from the beggining, the list is empty.

3 methods for adding data. Why 3? It is because there are three situations to take note when adding data within a singly linked list namely: when adding at the beginning, at the middle (1<1

public void addFirst(SLNode newNode) //add at the beginning

{

newNode.next=head;

head=newNode;

}

public void addLast(SLNode newNode) //add at the end of the list

{

tail.next=newNode;

tail=newNode;

}

public void add(SLNode newNode, int pos) //add at a specified position

{

SLNode current = head;

SLNode previous = head;

int ctr=0;

if(head!=null && tail!=null) //if list is not empty

{

while(current != null)

{

ctr++;

if(ctr == pos)

{

if(ctr==1)

addFirst(newNode);

else

{

newNode.next=current;

previous.next=newNode;

}

return;

}

previous = current;

current = current.next;

}

else //if list is empty

{

System.out.println("The list is empty. The node was added as the first and the last node.");

addFirst(newNode);

tail=head;

return;

}

addLast(newNode);

if(pos > ctr+1)

System.out.println("The desired position is still unavailable."

+ "\nThe node was inserted at position " + ctr

+ " which is considered as the last position.");

}

When deleting an item within the list, you only need to consider 2 things: if deleting the beginning of deleting the end. In this implementation, I incoporate the two situations into one function. But the 2 situations are still noted. Also, in the codes presented, two functions are presented, first if deleting based on the object you want to delete and the other is based on the what node you want to delete (eg. Node #2 or the 2nd Node)

public SLNode delete(Object data) //delete based on the item you want to delete

{

SLNode current=head;

SLNode previous=head;

int ctr=0;

while(current!=null)

{

ctr++;

if(current.data==data)

{

if(ctr==1)

head=head.next;

else if(ctr==length())

{

previous.next=null;

tail=previous;

}

else

previous.next=current.next;

return current;

}

previous=current;

current=current.next;

}

return null;

}

public SLNode delete(int i) //delete based on what node you want to delete starting at 1

{

SLNode current=head;

SLNode previous=head;

int ctr=0;

while(current!=null)

{

ctr++;

if(ctr==i)

{

if(ctr==1)

head=head.next;

else if(ctr==length())

{

previous.next=null;

tail=previous;

}

else

previous.next=current.next;

return current;

}

previous=current;

current=current.next;

}

return null;

}

The other methods are just accessory for extra functions for the SLinkedList class

public boolean search(Object node) //search a data based on a given key

{ //if found return true, else false

SLNode current=head;

while(current!=null)

if(current==node)

return true;

return false;

}

public SLNode getAt(int i) //this is similary to peek

//returning a value at a given Node number

{

SLNode current=head;

int ctr=0;

while(current!=null)

{

ctr++;

if(ctr==i)

return current;

current=current.next;

}

return null;

}

public int length() //returns the current length/size of the list

{

int ctr=0;

SLNode current=head;

while(current!=null)

{

ctr++;

current=current.next;

}

return ctr;

}

Here are some codes on the implementation of the Singly-Linked List

public static void main(String args[])

{

SLinkedList list=new SLinkedList();

list.add(new SLNode((Object)"Abcd"),2);

list.add(new SLNode((Object)"CDeFG"),2);

list.add(new SLNode("HigjDH"),2);

System.out.println("\nThe list size is now " + list.length());

displayList(list); System.out.println(list.delete(2));

displayList(list);

}

public static void displayNode(SLNode node) // to display the data of a single node

{

System.out.print(node.data);

}

public static void displayList(SLinkedList list) // to display the an entire list

{

SLNode current=list.head;

int ctr=0;

while(current!=null)

{

ctr++;

System.out.print("Node " + ctr + " ");

displayNode(current);

System.out.println();

current = current.next;

}

Stack - Reversing a String

noreply@blogger.com (Tyanak) — Sun, 15 Feb 2009 02:34:00 +0000

The concept for reversing a string using a stack is to remember that the last item to be inserted will always be the first item to be removed (LIFO). We would just simply, push each character of the string into the stack starting from the beginning to the very last of the string then popping it out of the stack starting from the last item inserted then displaying the item.

Here is the sample code:

For the Data Segment:

STR1 DB 30, 31 DUP('$')

STR2 DB 0AH, 0DH, '$'

The pushing of the elements to the stack:

LEA DX, STR1

MOV CL, STR1[1]

MOV SI, DX

ADD SI, 02H

A: MOV DL, [SI]

PUSH DX

INC SI

LOOP A

The popping and displaying of each element from the stack:

MOV CL, STR1[1]

B: MOV AH, 02H

POP DX

INT 21H

LOOP B

String - Inverse Case

noreply@blogger.com (Tyanak) — Fri, 13 Feb 2009 10:45:00 +0000

The concept of doing the Inverse Case on a given string is simply to determine if a found letter is in what case and converting it to its inverse case, leaving the none Alpha characters alone.

In this program, each letter is converted to its ASCII value, determine where it is located, if capital, add 32, if not, subtract 32. It can be considered capital if it is within 65 to 90, since the ascii values of capital letters are within this range. For small letters, 97 to 122 will be the range. So basically, the range between a letter and its opposite case is 32.

Here is the code.

import java.io.*;

public class InverseCase

{

public static void main(String args[]) throws IOException

{

BufferedReader k=new BufferedReader(new InputStreamReader(System.in));

System.out.print("Enter a string : ");

String str=k.readLine();

System.out.print("\nResult : ");

for(int i=0; i

{

int c=str.charAt(i);

if(c>=65 && c<=90)

c+=32;

else if(c>=97 && c<=122)

c-=32;

System.out.print((char)c);

}

System.out.println("");

}

Stack - Converting Infix Notation to Postfix Notation and Vice Versa

noreply@blogger.com (Tyanak) — Wed, 11 Feb 2009 09:23:00 +0000

This code uses its own stack of Strings to proceed with the convertion from Infix/Postfix to Postfix/Infix.

Converting Infix to Postfix Notation Algorithm

1. If recognize an operand, display

2. If recognize a ‘(‘, push it on the stack

3. If recognize a ‘)’

a. Pop and display until encountering the first ‘(’ inside the stack

b. Pop the ‘(’ from the stack

4. If recognize an operator

a. Peek from the stack and compare to the operator

b. If stack is empty, push it on the stack

c. If stack is not empty

i. If top of the stack is ‘(‘, push it on the stack

ii. If top of the stack is operator

1. If top of the stack is of higher precedence, pop and display until encountering the first ‘(’ or if stack is empty

2. If top of the stack is of lower precedence, push it on the stack

3. If top of the stack is of equal precedence, pop and display then push it on the stack.

5. If done reading, pop and display till stack is empty.

Converting Postfix to Infix Notation Algorithm

1. If recognize an operand, push it on the stack

2. If recognize an operator, pop its operands (pop 2 operands), and apply the operator and push the value on the stack.

o If an item popped is already an expression, enclose the expression with ‘(‘ and ‘)’

3. Upon conclusion, the value of the postfix expression is on the top of the stack.

- The algorithm is based on the following assumptions:

1. Each operand is denoted as a single alphabetic character.

2. The expression may only

Click here for the code