Musicworld

Registration Source Code  <! doctype html > < html > < head > < title > myevent</ title > </ head > < body > < h2 >  #HOME </ h2 > < h2 >#ABOUT US </ h2 > < h2 >  #EVENT </ h2 > < h2 >  #CONTACT US </ h2 > < h2 >  #BOOK EVENT </ h2 > < h2 > #REGISTER </ h2 > < h2 >  #LOGIN </ h2 > < h1 > *EVENT PROGRAM*</ h1 > < h2 > registration page </ h3 > < form > first name:< input type =" text " placeholder =" enter your 1st name " >< br > last name:< input type =" text " placeholder =" enter your last name ">  < br > password:< input type =" password " placeholder =" enter what you want "> < br > your address:< input type =" text " placeholder =" like... los angeles "> < br > your phone no.:< input type =...

                                         ~~~ STACK~~~  1]  Static implementation of stack:-      #include < stdio.h > #include < stdlib.h >                         //static stack~ #define size 4 int stack [size]; int top = - 1 ; void push () {     int x;     printf (" \n pls enter data item: ");     scanf (" %d ", &x);     if (top == size - 1 )     {         printf (" /n ohhh..stack is overflow ");     }     else     {           top++;         stack [top] = x;             printf (" \n index of top is: %d ",top);         printf (" \n u enter item %d ", x);    ...

  many opearations on link list :-   1] singly link list~ 2] doubly link list~ 3] Singly circular link list~ 4]Doubly Circular link list~  1.create list 2.display 3.search 4.sort 5.insert at first position  6.insert at last position 7.insert at any position 8.delete from any position #include < stdio.h > #include < stdlib.h >     typedef struct node    {         int data ;         struct node * next ;    } NODE ;         int creatlist ( NODE * head )     {         printf (" \n creatlist: \n ");         NODE * newnode ,* last ;         int i , n ;         printf (" how many nodes ur create: ");         scanf (" %d ",& n );         last = head ;         for ( i = 0 ; i < n ; i ++)       ...