rithish

[CODE] import java.awt.*; import javax.swing.*; import java.awt.event.*; class log extends JFrame { JButton b1=new JButton("ok"); JPanel panel=new JPanel(new GridLayout(2,2)); public log() { panel.add(b1); add(panel,BorderLayout.CENTER); b1.addActionListener(new ActionListener(){ public void actionperformed(ActionEvent ae){ JPanel pan=new JPanel(); JFrame frame1 = new JFrame(); JButton b2=new JButton("ok"); pan.add(b2); frame1.setVisible(true); frame1.add(pan); frame1.setSize(250,100); b2.addActionListener(new ActionListener(){ public void actionperformed(ActionEvent …

#include <stdio.h> #include <stdlib.h> int main() { int i=1,fact=1,n; printf("enter the no of fact: "); scanf("%d",&n); factorial(n,fact,i); return 0; } int factorial(int x,int y,int z) { int r; if(x==1) { r=y*z; printf("the fact is %d",r); } else { factorial(x--,y*z,z++); } } hello iam trying recursion using factorial the complier stops …

<% String name1=(String)name.get(i); %> <input type="hidden" name="inputName" value='<%=name1%> it shows me a error how to put jsp dynamic data in value attribute

hello <input type="date" name="dob" required> this is the html5 date picker String date=request.getParameter("dob").toString() how to get value from tat date picker

in internet explorer check the activex object settings

i want to get text from console screen for example System.out.println("hello"); i want to get that "hello" and store it in string how to do that?????

is form validation impossible using jsp???because i surfed google all are using servlet or javascript none of them is using jsp??? whats the reason???

can some one post a good tutorial link for kendo ui??

#include <stdio.h> #include <stdlib.h> void main() { int a,b; printf("enter two numbers: "); scanf("%d%d",&a,&b); printf("before swapping....\n"); printf("A=%d B=%d",a,b); a=a+b; b=a-b; a=a-b; printf("after swapping...\n"); printf("A=%d B=%d",a,b); } here try this man ull get perfect output

i want to know to know about twitter bootstrapp clearly does any one have good and easily understanding tutorial

#include <stdio.h> int main(void) { int ten = 10; int two = 2; printf("Doing it right: "); printf("%d minus %d is %d\n", ten, 2, ten - two ); printf("Doing it wrong: "); printf("%d minus %d is %d\n", ten ); // forgot 2 arguments return 0; } hello actually i coulnt …

i have a doubt in graphs whelther incident matrix and adjacency matrix r they same?????

actually i tried a program like this #include <stdio.h> #include <stdlib.h> int main() { int a=8,b=3; a|=b; printf("%d",a); return 0; } i dont understand what happens here a|=b; i have used || this which is used for or but i dont understand wat happens above

just tell me will this sorting algorithm work out in linked list for(i=head;i!=null;i=i->next) for(j=i->next;j!=null;j=j->next) if(i->data>j->data) { temp=i->data; i->data=j->data; j->data=temp; }

hii i finished these topics 1.linked list 2.stack and queues.how much time will it take me to finish trees 1.binary tee 2.avl tree 3.b-tree 4.binary search 5.threaded binary tree??? actualy ill try through linked list will it be easy???

hello im trying to delete a middle node in binary tree .but i have tried it in a linked list but here how to do that does any one them has links or video tutorials???????????

hii deceptiokn my question is we know we can implement a bubble sort in an array.Is it possible to implement bubble sort in circular doubly linked list?????

http://publib.boulder.ibm.com/infocenter/comphelp/v8v101/index.jsp?topic=%2Fcom.ibm.xlcpp8a.doc%2Flanguage%2Fref%2Flvalue.htm

actually in infix or prefix expressions how does operators have high precdence than the other. for example + has high precedence than *.do they compare with ascii value of operator

hello iam trying a circular queue in linked list and array there are two questions for me 1.how can circular queue can be implemented in a normal linked list??i think it can be implemented in circular singly linked list right?? 2.if i implement it in array how i will connect …

i dono y ur complicating too much just try this #include <stdio.h> #include <stdlib.h> void main() { char a[50]; int n,i; printf("enter the string : "); gets(a); n=strlen(a); printf("%d",n); for(i=n;i>=0;i--) { printf("%c",a[i]); } }

hello can any one give a easiest and understandble link or video tutorial for cursor implementation of linked list very hard to understand please suggest a good link and understandable

please give me a good link for polynomial manipulation of linked list

#include <stdio.h> #include<conio.h> #include<alloc.h> struct data { int value; struct data *next; }; int main() { int s; struct data *m,*i; printf("enter the data: "); scanf("%d",&s); i=(struct data *)malloc(size of(struct data); i->value=s; i->next=m; m=i; printf("enter the 2nd data: "); scanf("%d",&s); i=(struct data *)malloc(size of (struct data); i->value=s; i->next=m; m=i; printf("\n …

can i know how ur implementing this in c ???r u using graphics.h to draw a line???

if i give input like 08 what will happen????

#include <stdio.h> #include <stdlib.h> int main() { int i,n,a=0,b=0,sum=0; printf("enter the limit of amstrong number: "); scanf("%d",n); for(i=1;i<=n;i++) { a=i; while(a>0) { b=n%10; sum=sum+ b*b*b; a=a/10; } if(sum==i) { printf("%d",sum); } } return 0; } it prints no errors but doest not work properly

#include <stdio.h> #include <stdlib.h> int main() { int a=0,b=1,c=1,d=0,e=0,x,n; printf("enter the limit: "); scanf("%d",&n); while(d<=n) { d=a+b+c; a=b; b=c; c=d; e=a+b+c; for(x=d+1;x<d;x++) { if(x<=n) { printf("the non tribonacci series is: "); printf("\n %d",x); } } } return 0; } actually how to do this it doesnot print the values

struct node { int data; struct node **next; }; can we use like this???

for(i=0;str[i]!='\0';i++) { if(str[i]==32) { i++; printf("%c",str[i]); } } hello u can try like this where ascii value of a space is 32

#include<stdio.h> void quicksort(int [10],int,int); int main(){ int x[20],size,i; printf("Enter size of the array: "); scanf("%d",&size); printf("Enter %d elements: ",size); for(i=0;i<size;i++) scanf("%d",&x[i]); quicksort(x,0,size-1); printf("Sorted elements: "); for(i=0;i<size;i++) printf(" %d",x[i]); return 0; } void quicksort(int x[],int first,int last){ int pivot,j,temp,i; if(first<last){ pivot=first; i=first; j=last; while(i<j){ while(x[i]<=x[pivot]&&i<last) i++; while(x[j]>x[pivot]) j--; if(i<j){ temp=x[i]; x[i]=x[j]; …

#include<stdio.h> int arr[20]; int main() { int n,i; printf("Enter the size of array\n"); scanf("%d",&n); printf("Enter the elements:"); for(i=0; i<n; i++) scanf("%d",&arr[i]); merge_sort(arr,0,n-1); printf("Sorted array:"); for(i=0; i<n; i++) printf(" \n %d",arr[i]); return 0; } int merge_sort(int arr[],int low,int high) { int mid; if(low<high) { mid=(low+high)/2; merge_sort(arr,low,mid); merge_sort(arr,mid+1,high); // Combine merge(arr,low,mid,high); } …

#include <stdio.h> #include <stdlib.h> void main() { int fib[40],i,n; printf("enter the limit of fibonacci series:"); scanf("%d",&n); fib[0]-0; fib[1]=1; for(i=2;i<n;i++) { fib[i]=fib[i-1]+fib[i-2]; } for(i=0;i<n;i++) { printf("\t %d",fib[i]); } } hii rubber man is it like this??

for c++ i think microsoft conducts microsoft visual c++ certification

ok u try to write the code. if u have doubts post it man.first initiate ur assignment

or u can try like for(int i=0;string[i]!='\0';i++) { \\code; } this because string end character will be terminated by null

http://www.daniweb.com/software-development/c/threads/429315/general-

#include <stdio.h> #include <stdlib.h> int fact(int); int main() { int n,total=1,i; printf("enter the series limit: "); scanf("%d",&n); total=total+n; for(i=2;i<=n;i+=2) { total=total+(pow(n,i)\fact(i)); } printf("%d",total); return 0; } int fact(int c) { int j=1; int facto=1; for(j=1;j<=c;j++) { facto=facto*j; } return facto; } my output should be like this 1+n+n*n\2!+n*n*n*n\4! the error …

calculator datbase connectivity

finding a minimum element means finding a smallest number in an array???

can i know wat compiler r u using???

u can use normal insert into table name values(' ');but learn datatypes

for java applications in mobile they will use j2me

background colour textbackground(red); cprintf("hii"); use cprintf("hii");like this textcolor(red+black); cprintf("hii");

hello iam using oracle 10g express edition actually iam not able to connect to sql plus if i enter the commands it shows an error mesaage as "not connected".so i tried another way of opening by connecting in oracle 10g go to database home page and entered my password and …

fibonacci series in matrix means .ur question is very strange can u eloborate what u trying to do.so it may even help me

#include <stdio.h> #include <stdlib.h> #include<string.h> char combine(char [],int k,int n); int main() { char str[10]; int m,n; printf("enter the string: "); fgets(str,sizeof(str),stdin); m=0; n=strlen(str); printf("the combinations are....\n"); combine(str,m,n-1); return 0; } char combine(char a[],int k,int n) { int i; char temp[40],t; strcpy(temp,a); if(k==n) { printf("%s\t",a); } else{ for(i=k;i<=n;i++) { t=a[k]; …

ok shaswath try to write the code and ask the doubt or try googling for logic

#include <stdio.h> #include <stdlib.h> int i=-1; main() { int a[30],n; printf("enter the no of terms: "); scanf("%d",&n); store(a,n); } int store(int a[],int y); { if(i==y) { return \\it should return and terminate exit(0); } i++; printf("enter the number: "); scanf("%d",&a{i]); store(a,y); i know i had made a mistake but where …

can we store array value like this a[-50]; a[-49]=80; a[-2]=90;