What is the error of my program?
What's wrong with this program? I use gdb to debug the program. It said that: Program received signal SIGSEGV, Segmentation fault.
0x080491c7 in simplify_polynomial (n=0x804c148) at test7.c:476
476 p=p->head->next;
I don't know what is the problem. Could you help me? Thank you.
[code] #include
#include
#include
#include
#include
typedef struct node /*a node denotes a P_{i,k}^{l}*/
{
int l,i,k;
} node;
typedef struct monomial_node /* a monomial denotes a monomial P_{i,k}^{l} cdots P_{i',k'}^{l'} */
{
node y;
int coeff; /* coeff is the coefficent of the monomial */
struct monomial_node *next;
struct monomial_node *head;
} monomial_node, *monomial;
typedef struct polynomial_node /* a polynomial denotes a sum of some monomials */
{
monomial m;
struct polynomial_node *next;
struct polynomial_node *head;
} polynomial_node, *polynomial;
monomial insert(node a, monomial b) /* insert a factor a to a monomial b such that the first subscripts i's in the new monomial is in increasing order */
{
monomial p;
monomial_node *s;
monomial_node *p1;
p=b;
p1=p->head->next;
if(p1==NULL)
{
s=malloc(sizeof(monomial_node));
s->y=a;
p->head->next=s;
p->head->next->next=NULL;
p->coeff=1;
}
else
{
while((p1->y).i >= a.i) /* find the position */
{
if(p1->next==NULL)
{
break;
}
p1=p1->next;
}
}
s=malloc(sizeof(monomial_node)); /* create new node */
s->y=a;
s->next=p1->next; /* insert the node a */
p1->next=s;
p->coeff=b->coeff;
return p;
}
monomial create_monomial(int number) /* create a monomial */
{
monomial m;
monomial_node *p, *s;
int i;
m=(monomial)malloc(sizeof(monomial_node));
m->head=(monomial)malloc(sizeof(monomial_node));
if(m->head==NULL)
{
printf("No memory.
");
return NULL;
}
m->head->next=NULL;
p=malloc(sizeof(monomial_node));
m->head->next=p;
p->next=NULL;
printf("Please input the parameters of the heighest weight monomial(for example, 2, 2, 3 denotes the monomial Y^{2}_{2,3}). The first subscripts i of Y's should be in increase order.");
scanf("%d", &((p->y).l));
scanf("%d", &((p->y).i));
scanf("%d", &((p->y).k));
if(number > 1)
{
for(i=0;iy).l));
scanf("%d", &((s->y).i));
scanf("%d", &((s->y).k));
m=insert(s->y,m);
}
}
m->coeff=1;
return m;
}
polynomial create_polynomial(monomial n) /* create a polynomial with only one monomial n */
{
polynomial m;
polynomial_node *p;
m=(polynomial)malloc(sizeof(polynomial_node));
p=(polynomial)malloc(sizeof(polynomial_node));
m->head=(polynomial)malloc(sizeof(polynomial_node));
m->head->next=p;
p->m=n;
p->next=NULL;
return m;
}
void print_monomial(monomial m)
{
monomial p;
p=m->head->next;
if(p==NULL)
{
printf("No element.
");
}
if(m->coeff == -1)
{
printf("-");
}
else if(m->coeff != 1)
{
printf("%d", m->coeff);
}
while(p!=NULL)
{
printf("Y^{%d}_{%d,%d}",(p->y).l,(p->y).i,(p->y).k);
p=p->next;
}
}
void print_polynomial(polynomial n)
{
polynomial p;
int i=0;
p=n->head->next;
if(p==NULL)
{
printf("No element.
");
}
while(p!=NULL)
{
if(i !=0)
{
printf("+");
}
i++;
print_monomial(p->m);
p=p->next;
}
printf("
");
}
int length_monomial(monomial a)
{
int len=0;
monomial_node *b;
b=a->head->next;
while(b != NULL)
{
len++;
b=b->next;
}
return len;
}
int length_polynomial(polynomial a)
{
int len=0;
polynomial_node *b;
b=a->head->next;
while(b != NULL)
{
len++;
b=b->next;
}
return len;
}
int compare_nodes(node a, node b)
{
int result;
if(a.l==b.l && a.i==b.i && a.k==b.k)
{
result=1;
}
else
{
result=0;
}
return result;
}
monomial delete_node(monomial a, node b)
{
monomial p;
monomial_node *p1;
p=a;
p1=p->head->next;
p=p->head;
while(p1 != NULL)
{
if(compare_nodes(p1->y, b)==1)
{
p->next = p1->next;
break;
}
p=p->next;
p1=p1->next;
}
return p;
}
monomial simplify_monomial(monomial n)
{
monomial p;
monomial_node *p1, *s;
p=n;
p1=p->head->next;
p=p->head->next;
s=p;
while(p!=NULL) /* merge the terms with the same monomials */
{
while(p1!=NULL)
{
if(p->y.i==p1->y.i && p->y.k==p1->y.k)
{
p->y.l=p1->y.l + p->y.l;
p=delete_node(p, p1->y);
p1=s;
p=s->next;
}
p1=p1->next;
}
p=p->next;
s=p; /* s records the position of p */
p1=p;
}
p1=p->head->next;
while(p1 != NULL)
{
if(p1->y.l==0)
{
p=delete_node(p, p1->y);
}
p1=p1->next;
}
return p;
}
int compare_monomials(monomial m, monomial n) /* do not compare the coefficients of m and n */
{
int result=1;
monomial_node *a;
monomial_node *b;
a=simplify_monomial(m);
b=simplify_monomial(n);
a=a->head->next;
b=b->head->next;
while(a != NULL && b != NULL)
{
if(compare_nodes(a->y, b->y)==0)
{
result=0;
return 0;
break;
}
a=a->next;
b=b->next;
}
if((a==NULL && b != NULL) || (a != NULL && b == NULL))
{
return 0;
}
return result;
}
polynomial delete_monomial(polynomial a, monomial b)
{
polynomial p;
polynomial_node *p1;
p=a;
p1=p->head->next;
p=p->head;
while(p1 != NULL)
{
if(compare_monomials(p1->m, b)==1)
{
p->next = p1->next;
free(b);
break;
}
p=p->next;
p1=p1->next;
}
return p;
}
polynomial simplify_polynomial(polynomial n)
{
polynomial p;
polynomial_node *p1;
polynomial_node *s;
p=n;
p=(n->head)->next;
while(p!=NULL)
{
p->m=simplify_monomial(p->m);
p=p->next;
}
p1=p->head->next;
p=p->head->next;
s=p;
while(p!=NULL) /* merge the terms with the same monomials */
{
while(p1!=NULL)
{
if(compare_monomials(p->m, p1->m)==1)
{
p->m->coeff=p1->m->coeff + p->m->coeff;
p=delete_monomial(p, p1->m);
p1=s;
p=s->next;
}
p1=p1->next;
}
p=p->next;
s=p; /* s records the position of p */
p1=p;
}
p1=p->head->next;
while(p1 != NULL)
{
if(p1->m->coeff==0)
{
p=delete_monomial(p, p1->m);
}
p1=p1->next;
}
return p;
}
int coefficient(polynomial a, monomial b) /* coefficient of a monomial in a polynomial */
{
int coeff=0;
polynomial_node *c;
c=a->head->next;
while(c != NULL)
{
if(compare_monomials(c->m, b)==1)
{
coeff=coeff+(b->coeff);
}
c=c->next;
}
return coeff;
}
int is_dominant(monomial m, int i) /* check that whether a monomial is i-dominat or not*/
{
int result=1;
monomial_node *n;
n=m->head->next;
while(n != NULL)
{
if((n->y).i==i && (n->y).l<0)
{
result=0;
break;
}
n=n->next;
}
return result;
}
monomial reduce(monomial m, int i) /* reduce an i-dominant monomial */
{
monomial n;
monomial_node *a;
a=m->head->next;
n=malloc(sizeof(monomial_node));
n->head=malloc(sizeof(monomial_node));
n->head->next=NULL;
while(a != NULL)
{
if((a->y).i == i)
{
n=insert(a->y, n);
}
a=a->next;
}
return n;
}
monomial minus_monomial(monomial a)
{
monomial b;
b=a;
b->coeff=-(a->coeff);
return b;
}
polynomial minus_polynomial(polynomial a)
{
polynomial b;
b=a;
b=b->head->next;
while(b!=NULL)
{
b->m=minus_monomial(b->m);
b=b->next;
}
return b;
}
polynomial add_polynomials(polynomial a, polynomial b)
{
polynomial c;
c=a;
c=c->head;
while(c->next != NULL)
{
c=c->next;
}
c->next=b->head->next;
c=simplify_polynomial(c);
return c;
}
polynomial subtract_polynomials(polynomial a, polynomial b) /* a-b */
{
polynomial c,d;
c=a;
d=minus_polynomial(b);
c=add_polynomials(c, d);
return c;
}
polynomial subtract_polynomial_monomial(polynomial a, monomial b) /* a-b */
{
polynomial c, d;
c=a;
d=create_polynomial(b);
c=subtract_polynomials(c,d);
return c;
}
monomial multiply_monomials(monomial a, monomial b) /* product of two monomials */
{
monomial n;
monomial_node *c;
n=a;
c=b->head->next;
while(c != NULL)
{
n=insert(c->y, n);
c=c->next;
}
n->coeff = (a->coeff)*(b->coeff);
n=simplify_monomial(n);
return n;
}
polynomial multiply_monomial_polynomial(monomial a, polynomial b) /* product of a monomial a polynomial */
{
polynomial n;
polynomial_node *c;
n=b;
c=n->head->next;
while(c != NULL)
{
c->m=multiply_monomials(a, c->m);
c=c->next;
}
return n;
}
polynomial multiply_polynomials(polynomial a, polynomial b) /* product of two polynomails */
{
polynomial n;
polynomial_node *c;
c=a->head->next;
n=multiply_monomial_polynomial(c->m, b);
c=c->next;
while(c != NULL)
{
n=add_polynomials(n, multiply_monomial_polynomial(c->m, b));
c=c->next;
}
n=simplify_polynomial(n);
return n;
}
int main(int argc, char *argv[])
{
node p;
polynomial FM;
polynomial new_monomials;
polynomial phi[100][1000];
monomial s;
monomial m;
monomial mm[1000];
int type;
int rank;
int l;
int i,j;
int number;
int a;
printf("Please input the number of factors.
");
scanf("%d", &number);
m=create_monomial(number);
printf("m is
");
print_monomial(m);
printf("
");
s=create_monomial(2);
printf("s is
");
print_monomial(s);
printf("
");
FM=create_polynomial(m);
new_monomials=create_polynomial(s);
new_monomials=add_polynomials(new_monomials,FM);
printf("FM is
");
print_polynomial(FM);
printf("
");
printf("new_monomials = s + FM is
");
print_polynomial(new_monomials);
printf("
");
printf("FM - s is
");
print_polynomial(subtract_polynomial_monomial(FM, s));
printf("
");
printf("FM - new_monomials = FM - (s+FM) = s is
");
print_polynomial(subtract_polynomials(FM, new_monomials));
printf("
");
/*
l=0;
while(1)
{
new_monomials=subtract_polynomials(Dm(FM, type, rank, Cartan_matrix),FM);
FM=Dm(FM, type, rank, Cartan_matrix);
while(new_monomials != NULL)
{
for(i=0; i<rank; i++)
{
if(is_dominant(new_monomials, i)==1);
{
l=1;
break;
}
}
if(is_dominant(new_monomials, i)==1);
{
l=1;
break;
}
}
if(l==0);
{
break;
}
}
*/
return 0;
} [/code]
0x080491c7 in simplify_polynomial (n=0x804c148) at test7.c:476
476 p=p->head->next;
I don't know what is the problem. Could you help me? Thank you.
[code] #include
#include
#include
#include
#include
typedef struct node /*a node denotes a P_{i,k}^{l}*/
{
int l,i,k;
} node;
typedef struct monomial_node /* a monomial denotes a monomial P_{i,k}^{l} cdots P_{i',k'}^{l'} */
{
node y;
int coeff; /* coeff is the coefficent of the monomial */
struct monomial_node *next;
struct monomial_node *head;
} monomial_node, *monomial;
typedef struct polynomial_node /* a polynomial denotes a sum of some monomials */
{
monomial m;
struct polynomial_node *next;
struct polynomial_node *head;
} polynomial_node, *polynomial;
monomial insert(node a, monomial b) /* insert a factor a to a monomial b such that the first subscripts i's in the new monomial is in increasing order */
{
monomial p;
monomial_node *s;
monomial_node *p1;
p=b;
p1=p->head->next;
if(p1==NULL)
{
s=malloc(sizeof(monomial_node));
s->y=a;
p->head->next=s;
p->head->next->next=NULL;
p->coeff=1;
}
else
{
while((p1->y).i >= a.i) /* find the position */
{
if(p1->next==NULL)
{
break;
}
p1=p1->next;
}
}
s=malloc(sizeof(monomial_node)); /* create new node */
s->y=a;
s->next=p1->next; /* insert the node a */
p1->next=s;
p->coeff=b->coeff;
return p;
}
monomial create_monomial(int number) /* create a monomial */
{
monomial m;
monomial_node *p, *s;
int i;
m=(monomial)malloc(sizeof(monomial_node));
m->head=(monomial)malloc(sizeof(monomial_node));
if(m->head==NULL)
{
printf("No memory.
");
return NULL;
}
m->head->next=NULL;
p=malloc(sizeof(monomial_node));
m->head->next=p;
p->next=NULL;
printf("Please input the parameters of the heighest weight monomial(for example, 2, 2, 3 denotes the monomial Y^{2}_{2,3}). The first subscripts i of Y's should be in increase order.");
scanf("%d", &((p->y).l));
scanf("%d", &((p->y).i));
scanf("%d", &((p->y).k));
if(number > 1)
{
for(i=0;iy).l));
scanf("%d", &((s->y).i));
scanf("%d", &((s->y).k));
m=insert(s->y,m);
}
}
m->coeff=1;
return m;
}
polynomial create_polynomial(monomial n) /* create a polynomial with only one monomial n */
{
polynomial m;
polynomial_node *p;
m=(polynomial)malloc(sizeof(polynomial_node));
p=(polynomial)malloc(sizeof(polynomial_node));
m->head=(polynomial)malloc(sizeof(polynomial_node));
m->head->next=p;
p->m=n;
p->next=NULL;
return m;
}
void print_monomial(monomial m)
{
monomial p;
p=m->head->next;
if(p==NULL)
{
printf("No element.
");
}
if(m->coeff == -1)
{
printf("-");
}
else if(m->coeff != 1)
{
printf("%d", m->coeff);
}
while(p!=NULL)
{
printf("Y^{%d}_{%d,%d}",(p->y).l,(p->y).i,(p->y).k);
p=p->next;
}
}
void print_polynomial(polynomial n)
{
polynomial p;
int i=0;
p=n->head->next;
if(p==NULL)
{
printf("No element.
");
}
while(p!=NULL)
{
if(i !=0)
{
printf("+");
}
i++;
print_monomial(p->m);
p=p->next;
}
printf("
");
}
int length_monomial(monomial a)
{
int len=0;
monomial_node *b;
b=a->head->next;
while(b != NULL)
{
len++;
b=b->next;
}
return len;
}
int length_polynomial(polynomial a)
{
int len=0;
polynomial_node *b;
b=a->head->next;
while(b != NULL)
{
len++;
b=b->next;
}
return len;
}
int compare_nodes(node a, node b)
{
int result;
if(a.l==b.l && a.i==b.i && a.k==b.k)
{
result=1;
}
else
{
result=0;
}
return result;
}
monomial delete_node(monomial a, node b)
{
monomial p;
monomial_node *p1;
p=a;
p1=p->head->next;
p=p->head;
while(p1 != NULL)
{
if(compare_nodes(p1->y, b)==1)
{
p->next = p1->next;
break;
}
p=p->next;
p1=p1->next;
}
return p;
}
monomial simplify_monomial(monomial n)
{
monomial p;
monomial_node *p1, *s;
p=n;
p1=p->head->next;
p=p->head->next;
s=p;
while(p!=NULL) /* merge the terms with the same monomials */
{
while(p1!=NULL)
{
if(p->y.i==p1->y.i && p->y.k==p1->y.k)
{
p->y.l=p1->y.l + p->y.l;
p=delete_node(p, p1->y);
p1=s;
p=s->next;
}
p1=p1->next;
}
p=p->next;
s=p; /* s records the position of p */
p1=p;
}
p1=p->head->next;
while(p1 != NULL)
{
if(p1->y.l==0)
{
p=delete_node(p, p1->y);
}
p1=p1->next;
}
return p;
}
int compare_monomials(monomial m, monomial n) /* do not compare the coefficients of m and n */
{
int result=1;
monomial_node *a;
monomial_node *b;
a=simplify_monomial(m);
b=simplify_monomial(n);
a=a->head->next;
b=b->head->next;
while(a != NULL && b != NULL)
{
if(compare_nodes(a->y, b->y)==0)
{
result=0;
return 0;
break;
}
a=a->next;
b=b->next;
}
if((a==NULL && b != NULL) || (a != NULL && b == NULL))
{
return 0;
}
return result;
}
polynomial delete_monomial(polynomial a, monomial b)
{
polynomial p;
polynomial_node *p1;
p=a;
p1=p->head->next;
p=p->head;
while(p1 != NULL)
{
if(compare_monomials(p1->m, b)==1)
{
p->next = p1->next;
free(b);
break;
}
p=p->next;
p1=p1->next;
}
return p;
}
polynomial simplify_polynomial(polynomial n)
{
polynomial p;
polynomial_node *p1;
polynomial_node *s;
p=n;
p=(n->head)->next;
while(p!=NULL)
{
p->m=simplify_monomial(p->m);
p=p->next;
}
p1=p->head->next;
p=p->head->next;
s=p;
while(p!=NULL) /* merge the terms with the same monomials */
{
while(p1!=NULL)
{
if(compare_monomials(p->m, p1->m)==1)
{
p->m->coeff=p1->m->coeff + p->m->coeff;
p=delete_monomial(p, p1->m);
p1=s;
p=s->next;
}
p1=p1->next;
}
p=p->next;
s=p; /* s records the position of p */
p1=p;
}
p1=p->head->next;
while(p1 != NULL)
{
if(p1->m->coeff==0)
{
p=delete_monomial(p, p1->m);
}
p1=p1->next;
}
return p;
}
int coefficient(polynomial a, monomial b) /* coefficient of a monomial in a polynomial */
{
int coeff=0;
polynomial_node *c;
c=a->head->next;
while(c != NULL)
{
if(compare_monomials(c->m, b)==1)
{
coeff=coeff+(b->coeff);
}
c=c->next;
}
return coeff;
}
int is_dominant(monomial m, int i) /* check that whether a monomial is i-dominat or not*/
{
int result=1;
monomial_node *n;
n=m->head->next;
while(n != NULL)
{
if((n->y).i==i && (n->y).l<0)
{
result=0;
break;
}
n=n->next;
}
return result;
}
monomial reduce(monomial m, int i) /* reduce an i-dominant monomial */
{
monomial n;
monomial_node *a;
a=m->head->next;
n=malloc(sizeof(monomial_node));
n->head=malloc(sizeof(monomial_node));
n->head->next=NULL;
while(a != NULL)
{
if((a->y).i == i)
{
n=insert(a->y, n);
}
a=a->next;
}
return n;
}
monomial minus_monomial(monomial a)
{
monomial b;
b=a;
b->coeff=-(a->coeff);
return b;
}
polynomial minus_polynomial(polynomial a)
{
polynomial b;
b=a;
b=b->head->next;
while(b!=NULL)
{
b->m=minus_monomial(b->m);
b=b->next;
}
return b;
}
polynomial add_polynomials(polynomial a, polynomial b)
{
polynomial c;
c=a;
c=c->head;
while(c->next != NULL)
{
c=c->next;
}
c->next=b->head->next;
c=simplify_polynomial(c);
return c;
}
polynomial subtract_polynomials(polynomial a, polynomial b) /* a-b */
{
polynomial c,d;
c=a;
d=minus_polynomial(b);
c=add_polynomials(c, d);
return c;
}
polynomial subtract_polynomial_monomial(polynomial a, monomial b) /* a-b */
{
polynomial c, d;
c=a;
d=create_polynomial(b);
c=subtract_polynomials(c,d);
return c;
}
monomial multiply_monomials(monomial a, monomial b) /* product of two monomials */
{
monomial n;
monomial_node *c;
n=a;
c=b->head->next;
while(c != NULL)
{
n=insert(c->y, n);
c=c->next;
}
n->coeff = (a->coeff)*(b->coeff);
n=simplify_monomial(n);
return n;
}
polynomial multiply_monomial_polynomial(monomial a, polynomial b) /* product of a monomial a polynomial */
{
polynomial n;
polynomial_node *c;
n=b;
c=n->head->next;
while(c != NULL)
{
c->m=multiply_monomials(a, c->m);
c=c->next;
}
return n;
}
polynomial multiply_polynomials(polynomial a, polynomial b) /* product of two polynomails */
{
polynomial n;
polynomial_node *c;
c=a->head->next;
n=multiply_monomial_polynomial(c->m, b);
c=c->next;
while(c != NULL)
{
n=add_polynomials(n, multiply_monomial_polynomial(c->m, b));
c=c->next;
}
n=simplify_polynomial(n);
return n;
}
int main(int argc, char *argv[])
{
node p;
polynomial FM;
polynomial new_monomials;
polynomial phi[100][1000];
monomial s;
monomial m;
monomial mm[1000];
int type;
int rank;
int l;
int i,j;
int number;
int a;
printf("Please input the number of factors.
");
scanf("%d", &number);
m=create_monomial(number);
printf("m is
");
print_monomial(m);
printf("
");
s=create_monomial(2);
printf("s is
");
print_monomial(s);
printf("
");
FM=create_polynomial(m);
new_monomials=create_polynomial(s);
new_monomials=add_polynomials(new_monomials,FM);
printf("FM is
");
print_polynomial(FM);
printf("
");
printf("new_monomials = s + FM is
");
print_polynomial(new_monomials);
printf("
");
printf("FM - s is
");
print_polynomial(subtract_polynomial_monomial(FM, s));
printf("
");
printf("FM - new_monomials = FM - (s+FM) = s is
");
print_polynomial(subtract_polynomials(FM, new_monomials));
printf("
");
/*
l=0;
while(1)
{
new_monomials=subtract_polynomials(Dm(FM, type, rank, Cartan_matrix),FM);
FM=Dm(FM, type, rank, Cartan_matrix);
while(new_monomials != NULL)
{
for(i=0; i<rank; i++)
{
if(is_dominant(new_monomials, i)==1);
{
l=1;
break;
}
}
if(is_dominant(new_monomials, i)==1);
{
l=1;
break;
}
}
if(l==0);
{
break;
}
}
*/
return 0;
} [/code]
Howdy, Stranger!
It looks like you're new here. If you want to get involved, click one of these buttons!
Categories
- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 939 Software Development
- 416 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP