New Posts  All Forums:Forum Nav:

help with C program

post #1 of 11
Thread Starter 
i needed some help with this program
Assignment (Click to show)
Quote:
Problem Statement
Data Structures – write a C program that creates, manages and traverses a binary tree. The tree is not required to be balanced. As
the interface is alphanumeric use the following:
n – create a new binary tree (if one already exists, make sure the user means this)
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
Sample Session
Commands for managing a binary tree
n – create a new binary tree
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
q - quit
Enter: n
Enter: a
Value to add: 17
17 added
Enter: a
Value to add: 10
10 added
Enter: a
Value to add: 30
30 added
Enter: a
Value to add: 12
12 added
Enter: t
Pick type of traverse: 1
17 10 12 30
Enter: t
Pick type of traverse: 3
12 10 30 17
Enter: q

This is what i have so far Warning: Spoiler! (Click to show)
Code:
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

//self-referential structure
struct treeNode {
        struct treeNode *leftPtr; //points to left sub tree
        int d;
        struct treeNode *rightPtr; //points to right sub tree
};

typedef struct treeNode TreeNode; 
typedef TreeNode *TreeNodePtr;

void insertNode(TreeNodePtr *treePtr, int value);
void inOrder(TreeNodePtr treePtr);
void preOrder(TreeNodePtr treePtr);
void postOrder(TreeNodePtr treePtr);

int main(void)
{
        unsigned int i;//counter for the loop
        int item; //variable to hold the random numbers
        TreeNodePtr reetPtr = NULL;//The tree is empty to start

        srand( time (NULL));
        puts("Commands for managing a binary tree");
        puts("N - create a new binary tree");
        puts("A - add a node to the tree");
        puts("R - remove a node");
        puts("T - travers a tree");
        puts("   1 - pre-order");
        puts("   2 - in-order");
        puts("   3 - post-order");
        puts("Q - quit");
        puts("enter:");



}
any help would be appreciated
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
post #2 of 11
Well the first change that needs to happen involves the root that every tree has. Then you need a pointer to the root. You then need to work on functionality. So the best start would be to simply create a node and point the root to it. Then, work on the traversing of the tree through the root and to that one node. Something you will eventually learn is iterative development which basically has you build one thing, test it, then add on, test it, etc etc. The trick is to make code that doesn't require things to be too specific.

It doesn't sound like you were suppose to have it class based, but creating a tree class and adding member variables and functionality to it could be very beneficial. It also works well with iterative development since you can separate things out and work on them one at a time.

EDIT: Just saw your reetptr, I guess that was suppose to be rootptr.

Well actually, you need to instantiate the root(with it being null like you have) and then a ptr to the root. You always need to know how to get to the root, so you will actually be working with two pointers. One to the root, and one that you use to traverse around the tree.
Edited by Thereoncewasamaninparis - 10/29/12 at 7:33pm
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
post #3 of 11
Thread Starter 
ok thanks...i think lol...im just so lost lol i was absent from class for about a week so is there anyway you could show me what you mean???
i would greatly appreciate it
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
post #4 of 11
you might try here for some good info
http://cslibrary.stanford.edu/110/BinaryTrees.html
ShadowForge
(12 items)
 
Defiant
(14 items)
 
CarbonCat
(13 items)
 
CPUMotherboardGraphicsRAM
Phenom II x6 1405T (unlocked Athlon II X4 640T) ASUS M5A99X EVO AM3+ Asus ENGTX470/2DI/1280MD5/V2 16 GB (4x4GB) G.Skill DDR3 1600 CAS9 1.35v 
Hard DriveHard DriveOptical DriveCooling
WD Caviar Blue 250 2.5" Laptop Drive WD Caviar Black 1TB 3.5" Pioneer BDR-203 BluRay Burner Corsair H60 push 
OSOSMonitorPower
Windows 7 Pro x64 Ubuntu 11.10 Samsung 40" 60hz  ANTEC NEO ECO 520W 
CaseMouse
NZXT Gamma Microsoft Bluetooth Notebook Mouse 5000 
CPUMotherboardGraphicsRAM
i7 - 2600k [5.0 1.42v] ASUS P8Z68 Deluxe Sapphire HD6950 2gb Dirt 3 Edition 8GB G.Skill DDR3 2133 CAS11 
Hard DriveOSMonitorKeyboard
60GB G.Skill Sniper + 2x1TB Spinpoint F3 Raid0 Win 7 Pro x64 ASUS VW266H Razer Blackwidow 
PowerCaseMouse
Seasonic X750 Gold Corsair Carbide 500R White G9 
  hide details  
Reply
ShadowForge
(12 items)
 
Defiant
(14 items)
 
CarbonCat
(13 items)
 
CPUMotherboardGraphicsRAM
Phenom II x6 1405T (unlocked Athlon II X4 640T) ASUS M5A99X EVO AM3+ Asus ENGTX470/2DI/1280MD5/V2 16 GB (4x4GB) G.Skill DDR3 1600 CAS9 1.35v 
Hard DriveHard DriveOptical DriveCooling
WD Caviar Blue 250 2.5" Laptop Drive WD Caviar Black 1TB 3.5" Pioneer BDR-203 BluRay Burner Corsair H60 push 
OSOSMonitorPower
Windows 7 Pro x64 Ubuntu 11.10 Samsung 40" 60hz  ANTEC NEO ECO 520W 
CaseMouse
NZXT Gamma Microsoft Bluetooth Notebook Mouse 5000 
CPUMotherboardGraphicsRAM
i7 - 2600k [5.0 1.42v] ASUS P8Z68 Deluxe Sapphire HD6950 2gb Dirt 3 Edition 8GB G.Skill DDR3 2133 CAS11 
Hard DriveOSMonitorKeyboard
60GB G.Skill Sniper + 2x1TB Spinpoint F3 Raid0 Win 7 Pro x64 ASUS VW266H Razer Blackwidow 
PowerCaseMouse
Seasonic X750 Gold Corsair Carbide 500R White G9 
  hide details  
Reply
post #5 of 11
So I haven't worked with C in awhile so my brain may automatically revert to C++, but they should have all the same pointer functionality.

So before we can do anything we need a root, which will involve the node itself as well as where it points( so maybe we don't need a ptr to the root, someone else will chime in), this will look like.

node *root;
root = NULL:

So we have our root, which is a pointer to a node and currently, it is pointing to nothing. More specifically, it is not pointing to a particular place in memory.

So now that we are there we can work on the next piece of functionality, say adding a node. So just do some psuedocode prototyping.

Function AddNewNode(What arguments do we need?);

//Probably need to pass the current ptr, root.
//create a new node
//point the root ptr at the new node
//probably need to store a value in that node
//return from the function.

Now the trick is to not have it be too specific, you want your code to be general purpose. You want to write code that works with an empty, or maybe even non-existent tree, or even a tree that has been filled with over a 1000 nodes.
Edited by Thereoncewasamaninparis - 10/29/12 at 7:48pm
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
post #6 of 11
Thread Starter 
Quote:
Originally Posted by Thereoncewasamaninparis View Post

So I haven't worked with C in awhile so my brain may automatically revert to C++, but they should have all the same pointer functionality.
So before we can do anything we need a root, which will involve the node itself as well as where it points( so maybe we don't need a ptr to the root, someone else will chime in), this will look like.
node *root;
root = NULL:
So we have our root, which is a pointer to a node and currently, it is pointing to nothing. More specifically, it is not pointing to a particular place in memory.
ok thank you


ok so my buddy in the class said he came up with this but i cant get it to work...i want to tweak it a little bit to make the output slightly different
Warning: Spoiler! (Click to show)
Code:
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
typedef struct tree*node;
node insert(int,node T);
void inorder(node T);
void preorder(node T);
void postorder(node T);
struct tree
{
        int data;
        struct tree*right,*left;
}*root;

void main()
{
        node T= NULL;
        int data,ch,i=0,n;
        clrscr();
        printf("\nEnter the number of elements in the Tree:");
        scanf("%d",&n);
        printf("\n The elements are :\n");
        whil(i<n);
        {
                scanf("%d",&data);
                T=insert(data,T);
                i++;
        }
        printf("1. INORDER\t2.PREORDER\t3.POSTOTRDER\t4.EXIT");
        do
        {
                printf("\nEnter your choide:");
                scanf("%d",&ch);
                switch (ch)
                {
                        case1: printf ("Inorder traversal of the given Tree\n");
                        inorder(T);
                        break;
                        case2: printf("Preoroder traversal of the given Tree\n");
                        preorder(T);
                        break;
                        case3: printf("Postorder traversal of the given Tree\n");
                        posotorder(T);
                        break;
                        default:printf("Exit");
                        exit(0);
                }

}
while(ch<4);
getch();
node insert(intX, node T)
{
        struct tree*newnode;
        newnode=malloc(sizeof(struct tree));
        if(newnode==NULL)
        printf("Out of space\n");
        else
        {
                if(T==NULL)
                {
                        newnode->data=X;
                        newnode->left=NULL;
                        newnode->right=NULL;
                        T=newnode;
                }
                else
                {
                        if(X<T->data)
                        T->left=insert(X,T->left);
                        else
                        T->right=insert(X,T->right);
                }
        }
        return T;
}
void inorder(node T)
{
        if(T!=NULL)
        {
                inorder(T->left);
                printf("%d\t",T->ddata);
                inorder(T->right);
        }
}
void preorder(node T)
{
        if(T!=NULL)
        {
                printf("%d\t",T->data);
                preorder(T->left);
                preorder(T->right);
        }
}
void postoroder(node T)
{
        if(T!=NULL);
        {
                postorder(T->left);
                postorder(T->right);
                printf("%d\t",T->data);
        }
}

The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
post #7 of 11
Quote:
Originally Posted by Hartk1213 View Post

ok thank you
ok so my buddy in the class said he came up with this but i cant get it to work...i want to tweak it a little bit to make the output slightly different Warning: Spoiler! (Click to show)
Code:
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
typedef struct tree*node;
node insert(int,node T);
void inorder(node T);
void preorder(node T);
void postorder(node T);
struct tree
{
        int data;
        struct tree*right,*left;
}*root;
void main()
{
        node T= NULL;
        int data,ch,i=0,n;
        clrscr();
        printf("\nEnter the number of elements in the Tree:");
        scanf("%d",&n);
        printf("\n The elements are :\n");
        whil(i<n);
        {
                scanf("%d",&data);
                T=insert(data,T);
                i++;
        }
        printf("1. INORDER\t2.PREORDER\t3.POSTOTRDER\t4.EXIT");
        do
        {
                printf("\nEnter your choide:");
                scanf("%d",&ch);
                switch (ch)
                {
                        case1: printf ("Inorder traversal of the given Tree\n");
                        inorder(T);
                        break;
                        case2: printf("Preoroder traversal of the given Tree\n");
                        preorder(T);
                        break;
                        case3: printf("Postorder traversal of the given Tree\n");
                        posotorder(T);
                        break;
                        default:printf("Exit");
                        exit(0);
                }
}
while(ch<4);
getch();
node insert(intX, node T)
{
        struct tree*newnode;
        newnode=malloc(sizeof(struct tree));
        if(newnode==NULL)
        printf("Out of space\n");
        else
        {
                if(T==NULL)
                {
                        newnode->data=X;
                        newnode->left=NULL;
                        newnode->right=NULL;
                        T=newnode;
                }
                else
                {
                        if(X<T->data)
                        T->left=insert(X,T->left);
                        else
                        T->right=insert(X,T->right);
                }
        }
        return T;
}
void inorder(node T)
{
        if(T!=NULL)
        {
                inorder(T->left);
                printf("%d\t",T->ddata);
                inorder(T->right);
        }
}
void preorder(node T)
{
        if(T!=NULL)
        {
                printf("%d\t",T->data);
                preorder(T->left);
                preorder(T->right);
        }
}
void postoroder(node T)
{
        if(T!=NULL);
        {
                postorder(T->left);
                postorder(T->right);
                printf("%d\t",T->data);
        }
}

Sorry. I currently go through the whole program. This will give you a very nice idea.

http://en.wikipedia.org/wiki/Tree_traversal

Other than I would say to read linked list again as this entire thing is an extended part of the concept and then you can easily apply the algorithm from the above link.

v This guy is right.
Edited by Makyl - 10/29/12 at 7:52pm
post #8 of 11
Just delete it and work with people on the forum to figure it out. Data structures is probably the most important thing to learn considering they are suppose to be the most frequently asked interview questions. You're not going to learn that way.
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
Croissant
(15 items)
 
  
CPUMotherboardGraphicsRAM
2600k Asus Sabertooth Z77 GTX 680 2x4 gigs G-SKill 
Hard DriveOptical DriveCoolingOS
Crucial C300 2x Asus DVD-RW Silver Arrow Win 7 
MonitorPowerCaseAudio
Dual ASUS 24" Rosewill 750 Capstone Corsair Carbide Air 540 The Basic sound blaster Z-Series 
  hide details  
Reply
post #9 of 11
Thread Starter 
Quote:
Originally Posted by Thereoncewasamaninparis View Post

Just delete it and work with people on the forum to figure it out. Data structures is probably the most important thing to learn considering they are suppose to be the most frequently asked interview questions. You're not going to learn that way.
okay will do thanks for the help man smile.gif +rep
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
The Prodigy
(16 items)
 
 
Dream Rig Contest
(11 items)
 
CPUMotherboardGraphicsRAM
[AMD] Athlon II x2 255 [Gigabyte] GA-78LMT-SP2 [Onboard] ATI Radeon 3000 [Crucial] Ballistix 8GB (2x4GB) 
Hard DriveHard DriveHard DriveOptical Drive
[Western Digital] Blue 320GB [Maxtor] 320GB soon to be adding 4TB from WD Red [Lite-On] DVD Player/Burner 
CoolingOS
[Stock] [Mircrosoft] Windows 7/ Home server 2011 
  hide details  
Reply
post #10 of 11
Quote:
Originally Posted by Hartk1213 View Post

Quote:
Originally Posted by Thereoncewasamaninparis View Post

So I haven't worked with C in awhile so my brain may automatically revert to C++, but they should have all the same pointer functionality.
So before we can do anything we need a root, which will involve the node itself as well as where it points( so maybe we don't need a ptr to the root, someone else will chime in), this will look like.
node *root;
root = NULL:
So we have our root, which is a pointer to a node and currently, it is pointing to nothing. More specifically, it is not pointing to a particular place in memory.
ok thank you


ok so my buddy in the class said he came up with this but i cant get it to work...i want to tweak it a little bit to make the output slightly different
Warning: Spoiler! (Click to show)
Code:
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
typedef struct tree*node;
node insert(int,node T);
void inorder(node T);
void preorder(node T);
void postorder(node T);
struct tree
{
        int data;
        struct tree*right,*left;
}*root;

void main()
{
        node T= NULL;
        int data,ch,i=0,n;
        clrscr();
        printf("\nEnter the number of elements in the Tree:");
        scanf("%d",&n);
        printf("\n The elements are :\n");
        whil(i<n);
        {
                scanf("%d",&data);
                T=insert(data,T);
                i++;
        }
        printf("1. INORDER\t2.PREORDER\t3.POSTOTRDER\t4.EXIT");
        do
        {
                printf("\nEnter your choide:");
                scanf("%d",&ch);
                switch (ch)
                {
                        case1: printf ("Inorder traversal of the given Tree\n");
                        inorder(T);
                        break;
                        case2: printf("Preoroder traversal of the given Tree\n");
                        preorder(T);
                        break;
                        case3: printf("Postorder traversal of the given Tree\n");
                        posotorder(T);
                        break;
                        default:printf("Exit");
                        exit(0);
                }

}
while(ch<4);
getch();
node insert(intX, node T)
{
        struct tree*newnode;
        newnode=malloc(sizeof(struct tree));
        if(newnode==NULL)
        printf("Out of space\n");
        else
        {
                if(T==NULL)
                {
                        newnode->data=X;
                        newnode->left=NULL;
                        newnode->right=NULL;
                        T=newnode;
                }
                else
                {
                        if(X<T->data)
                        T->left=insert(X,T->left);
                        else
                        T->right=insert(X,T->right);
                }
        }
        return T;
}
void inorder(node T)
{
        if(T!=NULL)
        {
                inorder(T->left);
                printf("%d\t",T->ddata);
                inorder(T->right);
        }
}
void preorder(node T)
{
        if(T!=NULL)
        {
                printf("%d\t",T->data);
                preorder(T->left);
                preorder(T->right);
        }
}
void postoroder(node T)
{
        if(T!=NULL);
        {
                postorder(T->left);
                postorder(T->right);
                printf("%d\t",T->data);
        }
}


Tree traversals look fine. His main function is a disaster however. Firstly it needs to be of type int, not void. Secondly the curly brackets do not match up so it will not compile.
ShadowForge
(12 items)
 
Defiant
(14 items)
 
CarbonCat
(13 items)
 
CPUMotherboardGraphicsRAM
Phenom II x6 1405T (unlocked Athlon II X4 640T) ASUS M5A99X EVO AM3+ Asus ENGTX470/2DI/1280MD5/V2 16 GB (4x4GB) G.Skill DDR3 1600 CAS9 1.35v 
Hard DriveHard DriveOptical DriveCooling
WD Caviar Blue 250 2.5" Laptop Drive WD Caviar Black 1TB 3.5" Pioneer BDR-203 BluRay Burner Corsair H60 push 
OSOSMonitorPower
Windows 7 Pro x64 Ubuntu 11.10 Samsung 40" 60hz  ANTEC NEO ECO 520W 
CaseMouse
NZXT Gamma Microsoft Bluetooth Notebook Mouse 5000 
CPUMotherboardGraphicsRAM
i7 - 2600k [5.0 1.42v] ASUS P8Z68 Deluxe Sapphire HD6950 2gb Dirt 3 Edition 8GB G.Skill DDR3 2133 CAS11 
Hard DriveOSMonitorKeyboard
60GB G.Skill Sniper + 2x1TB Spinpoint F3 Raid0 Win 7 Pro x64 ASUS VW266H Razer Blackwidow 
PowerCaseMouse
Seasonic X750 Gold Corsair Carbide 500R White G9 
  hide details  
Reply
ShadowForge
(12 items)
 
Defiant
(14 items)
 
CarbonCat
(13 items)
 
CPUMotherboardGraphicsRAM
Phenom II x6 1405T (unlocked Athlon II X4 640T) ASUS M5A99X EVO AM3+ Asus ENGTX470/2DI/1280MD5/V2 16 GB (4x4GB) G.Skill DDR3 1600 CAS9 1.35v 
Hard DriveHard DriveOptical DriveCooling
WD Caviar Blue 250 2.5" Laptop Drive WD Caviar Black 1TB 3.5" Pioneer BDR-203 BluRay Burner Corsair H60 push 
OSOSMonitorPower
Windows 7 Pro x64 Ubuntu 11.10 Samsung 40" 60hz  ANTEC NEO ECO 520W 
CaseMouse
NZXT Gamma Microsoft Bluetooth Notebook Mouse 5000 
CPUMotherboardGraphicsRAM
i7 - 2600k [5.0 1.42v] ASUS P8Z68 Deluxe Sapphire HD6950 2gb Dirt 3 Edition 8GB G.Skill DDR3 2133 CAS11 
Hard DriveOSMonitorKeyboard
60GB G.Skill Sniper + 2x1TB Spinpoint F3 Raid0 Win 7 Pro x64 ASUS VW266H Razer Blackwidow 
PowerCaseMouse
Seasonic X750 Gold Corsair Carbide 500R White G9 
  hide details  
Reply
New Posts  All Forums:Forum Nav:
  Return Home
  Back to Forum: Coding and Programming