<%
       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

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 it impossible to validate using jsp????

can u pass the links?????

in telerik website u can see some limited tutorials??????????

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

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???

<div class="navbar-fixed-top">
<div class="nav-header" style="background-COLOR: Maroon;">
<b>HII GANESH</b>
<center><h1>L k & ASSOCIATES COMPANY SECREATARIES</h1></center>

</div>

<div class="navbar">
<div class="row" style="background-color:Orange;">
<div class="span3"><a href="HOME.HTML">HOME</a></div>
<div class="span3"><a href="SERVICE.HTML">AUDIT</a></div>
<div class="span3"><a href="HOME.HTML">MASTER</a></div>
<div class="span3"><a href="HOME.HTML">SEARCH</a></div>
</div>
</div>
</div>

In this which makes top panel fixed and cannot scroll is it possible to make left-panel fixed?????

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 understand the lines here 

  printf("%d minus %d is %d\n", ten );  // forgot 2 arguments

they do not define arguments over here

can we implement these concepts in c using linkedlist and array????

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

why will time complexity go too much????

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;
}

ok gonbe u deleted the element 3 and replaced the last left leaf node in tree am i right?????if u delete right subtree??

ok but how does a pointer know that the node has been visited tats my doubt here while using recursion?????

ok my question if i implement a bubble sort will it be a worst case time complexity????????

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???????????

ok gonbe u may leave this topic jus explain or give me link to understand these kind of recursions

void inorder(struct tree *p)
{
if(p!=NULL)
{
inorder(p->lchild);
printf("%d ",p->data);
inorder(p->rchild);
}
}
void inorder(struct tree *p)
{
if(p!=NULL)
{
inorder(p->lchild);
printf("%d ",p->data);
inorder(p->rchild);
}
}

for example over here inorder traversal step by step ill say wat ever i understand
1.initially it will be in d root node it keeps on traversing
2.the function inorder(p->lchild); executes and confusion is over here it will be keep on executing at a stage p will be null and print the data.
3.how can this inorder(p->rchild); execute bcoz now pointer will be last left node and how it will point to right node tats my problem

but recursion using stack i understand but i dont understand these kind of recursions like tis

    insert(int key, struct node **leaf)
    {
    if( *leaf == 0 )
    {
    *leaf = (struct node*) malloc( sizeof( struct node ) );
    (*leaf)->key_value = key;
    /* initialize the children to null */
    (*leaf)->left = 0;
    (*leaf)->right = 0;
    }
    else if(key < (*leaf)->key_value)
    {
    insert( key, &(*leaf)->left );
    }
    else if(key > (*leaf)->key_value)
    {
    insert( key, &(*leaf)->right );
    }
    }

ok i udentified wer my problem is and wer i got struck.actually i didnt understand full concepts of recursion please some one explain or give me a link for easy understanding.ok ill illustrate where my problem is now.have a look at towers of hanoi problem

    #include<stdio.h>
    #include<conio.h>
    #include<math.h>
    void hanoi(int x, char from,char to,char aux)
    {
    if(x==1)
    {
    printf("Move Disk From %c to %c\n",from,to);
    }
    else
    {
    hanoi(x-1,from,aux,to);
    printf("Move Disk From %c to %c\n",from,to);
    hanoi(x-1,aux,to,from);
    }
    }
    void main()
    {
    int disk;
    int moves;
    clrscr();
    printf("Enter the number of disks you want to play with:");
    scanf("%d",&disk);
    moves=pow(2,disk)-1;
    printf("\nThe No of moves required is=%d \n",moves);
    hanoi(disk,'A','C','B');
    getch();
    }

here my problem is over here

hanoi(x-1,from,aux,to);
printf("Move Disk From %c to %c\n",from,to);
hanoi(x-1,aux,to,from);

the recursion i dont understand please give me a link to understand or explain

my question is how the key value gets inserted in node?????????????please some one help i understand the concept but difficult to implement it through linked list couldn't understand properly

insert(int key, struct node **leaf)
{
    if( *leaf == 0 )
    {
        *leaf = (struct node*) malloc( sizeof( struct node ) );
        (*leaf)->key_value = key;
        /* initialize the children to null */
        (*leaf)->left = 0;    
        (*leaf)->right = 0;  
    }
    else if(key < (*leaf)->key_value)
        {
            insert( key, &(*leaf)->left );
        }

    else if(key > (*leaf)->key_value)
    {
        insert( key, &(*leaf)->right );
    }
}

this is a insertion coding for binary trees. i have a confusion in insertion where

else if(key < (*leaf)->key_value)
            {
                insert( key, &(*leaf)->left );
            }

        else if(key > (*leaf)->key_value)
        {
            insert( key, &(*leaf)->right );
        }
    }

where if a element is less than root value is kept in left node and greater is kept in right side.but code confuses me bcoz in linked list if we insert a new node it will b like this

*last;
newnode=malloc(size of(struct node);
last->link=newnode;
last=last->link;

but this code i dont understand wats happening