- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 8
- Posts with Upvotes
- 7
- Upvoting Members
- 4
- Downvotes Received
- 19
- Posts with Downvotes
- 15
- Downvoting Members
- 8
- Interests
- programming,programming,programming
|
[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 
|
|
|
Hello All I am trying to just test a simple javascript code. Following Code is working very fine in FF-14, Google Chrome - 21, Safari - 3.2 <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Untitled Document</title> <script type="text/javascript" src="sha512.js"></script> <script type="text/javascript"> function formhash(form, password) { // Create a new element input, … 
|
|
|
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???
|
|
|
|
|
|
/* EXCHANGE THE INTEGER VALUE WITHOUT USING THE THIRD VARIABLE */ #include<stdio.h> void main() { int a,b; printf("enter the two integer variabe \n"); scanf("%d,%d",&a,&b); //exchange the value of a to b ,b to a without using third variable a=a+b; b=a-b; a=a-b; printf("%d%d",a,b); getch(); } /*EXAMPLE: A=3,B=10 A=A+B; // A=3+10=13 B=A-B; …
|
|
|
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????? 
|
|
|
what is lvalue and rvalue? please explain with simple example.
|
|
|
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 am attempting to reverse a string for a homework assignment and then reverse each word in the string. The trick is we are suppose to code it without using functions. Like "I like cats" should be 1st "stac ekil I" and then "cats like I". Here is what 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 …
|
|
hey, i want to do a question in which i am given n line segments and i want to find the number of intersection of them. Can anyone tell me the most efficient way i can do it ? I have got some links on google and also from books …
|
|
|
|
|
|
#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???
|
|
|
Hi.I have written this code which capitalizes 1st character of each word in the string.All other letters of the word has to be in small letter.But i am not getting desired output.Plz tell me where i am going wrong.. #include<stdio.h> int main(void) { char string[]="hI i aM sOujanYa"; char string2[20]=""; …
|
