Develop Android

Download Now

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

Java 2 - The Complete Reference

Download Now

Special Thanks

Zinkal Patel

For Sharing This book

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

HACKING TIPS By-Ankit Fadia

HACKING TIPS

By-Ankit Fadia

Hacking into Linux (NEWBIE SERIES) By Ankit Fadia ankit@bol.net.in

 

Getting geographical Information using an IP Address By Ankit Fadia ankit@bol.net.in

Special Thanks To Ankit Fadia 

From

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

Artificial_Crime_Analysis_Systems

 Artificial Crime Analysis Systems

 

Download Now

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

MCA_SEM - III & SEM - IV Syllabus

G T U

MASTER OF COMPUTER APPLICATION

Proposed Subjects and Teaching Scheme
Semester-III

1. 630001 Structured & Object Oriented Analysis & Design Methodology (SOOADM) 
2.  630002 Fundamentals of Java Programming (Java)
3. 630003 Statistical Methods (SM) 
4. 630004 Operating Systems (OS) 
5. 630005 System Software (SS)
6. 630006 Programming Skills-IV (Java)
7. 630007 Programming Skills-V (OS)

MCA_SEM - III & SEM - IV Syllabus

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

NEW ** FULL DATA STRUCTURES

Note : Due To Some Security Reasons all The Files Are Kept Password Protected So Those Who Want To Download These Files Just Comment (Reply) Ur Email Address With Ur Name and College Name. Ill Be Sending You Password In Mail ASAP!

...::: Binary Trees by Nick Parlante :::...

...::: Link-List Representation :::...

...::: Questions On Tree :::...

...::: Questions On Searching & Sorting :::...

...::: Notes on Searching & Sorting By Manjoor Kapoor :::...

...:::  Correct Expected Solution For D.S Question Set :::.. 

NEW **  FULL DATA STRUCTURES (THANKS TO " http://gtu-mca.blogspot.com " & GOOGLE )

----------------------------
RAJ SOLUTION'S
www.rajsolution.com
www.sahinraj.blogspot.com
www.licamca.blogspot.com

DBMS II

 

[Note ** For Download Password Just Comment on this post or email me : sahinraj87@gmail.com ]

 

Chapter 1 Transaction processing and concurrency control by - Kaustubh Arekar

Chapter 2 Database backup and recovery by - Kaustubh Arekar

Chapter 3 Implementing security in databases by - Kaustubh Arekar

Chapter 4 Introduction to other databases by - Kaustubh Arekar
 
Chapter 5 Relational Algebra by - Kaustubh Arekar


Chapter 6 Query processing and optimization by - Kaustubh Arekar
 

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com

www.licamca.blogspot.com

E-book Prentice.Hall.CPP.Without.Fear.2nd.Edition

Note : Due To Some Security Reasons all The Files Are Kept Password Protected So Those Who Want To Download These Files Just Comment (Reply) Ur Email Address With Ur Name and College Name. Ill Be Sending You Password In Mail ASAP!

..:: NEW ***  E-book Prentice.Hall.CPP.Without.Fear.2nd.Edition by - Dhaval Mehta ::..

..:: Complete Question List 620003-Object Oriented Concepts and Programming (OOCP) ::.

...::: Introduction to OOCP C++ ( 620003 ) by Dhaval Mehta :::...

...::: Chapter 4 Operator Overloading by Dhaval Mehta :::...

...::: Chapter 6 Inheritance by Dhaval Mehta :::...

..:: Short Question list by Dhaval Mehta ::..

..:: 620003: Object Oriented Concepts & Programming (OOCP) Mid Term Paper ::..

..:: OOCP Practical Exam ::..

..:: MCQ With Answers Chapter I: Principles of Object-Oriented Programming by Raj Sahin N. ::..

..:: Complete Reference Material For OOPS 620003 ::..

..:: Complete MCQ Question With Proper Solution's By Raj Sahin N. ( LICA Sem II ) ::.. 

----------------------------
RAJ SOLUTION'S
www.rajsolution.com
www.sahinraj.blogspot.com

Program for perform merge sort using linklist

//program for perform merge sort using linklist
//writter : kartik
//27-4-11

#include<stdio.h>
#include<conio.h>

struct linklist
{
 int info;
 struct linklist *next;
}*start=NULL,*first=NULL,*start2,*temp,*node,*last;
typedef struct linklist lk;

void insert(lk **);
void disp(lk **);
void mergesort();

void main()
{
int ch;
char con,cn;
clrscr();

     do
     {
     printf("\n***********************************************");
     printf("\n      K@rtik's Merge sort");
     printf("\n***********************************************");
     printf("\n 1. insert sorting data:");
     printf("\n 2. display");
     printf("\n 3. perform mergeing sort");
     printf("\n================================================");
     printf("\nenter ur choice:");
     scanf("%d",&ch);

    switch(ch)
    {
      case 1:
      printf("\n enter data for 1st linklist");
      do
      {
        insert(&start);
        fflush(0);
        printf("\n do u wnt to insert more(y/n):");
        scanf("%c",&cn);
      }while(cn=='y');

      printf("\n enter data for 2nd linklist");

      do
      {
        insert(&first);
        fflush(0);
        printf("\n do u wnt to insert more(y/n):");
        scanf("%c",&cn);
      }while(cn=='y');

      break;

      case 2:
      printf("\n*********>display data of 1st linklist..........");
      disp(&start);
      printf("\n*********>display data of 2nd linklist..........");
      disp(&first);
      break;

      case 3:
      mergesort();
      break;

      default:
           printf("\n==> u must i/p 1 to 3 onlly.....");
      }
      fflush(0);
      printf("\n do u wnt to con(y/n):");
      scanf("%c",&con);
       }while(con=='y');
   getch();
}

void insert(lk **head)
{
lk *node=(lk *)malloc(sizeof(lk));
int item;

printf("\nenter item:");
scanf("%d",&item);

   if((*head)==NULL)
   {
     (*head)=(lk *)malloc(sizeof(lk));
     (*head)->info=item;
     (*head)->next=NULL;
    }
    else
    {
     lk *temp=(*head);
     while(temp->next!=NULL)
          temp=temp->next;

      node->info=item;
      temp->next=node;
      node->next=NULL;
      }
}

void disp(lk **head)
{
lk *temp=(*head);
printf("\n");
   if((*head)==NULL)
    printf("\n linklist is empty");
   else
   {
       while(temp)
       {
     printf("%3d",temp->info);
     temp=temp->next;
     }
    }
}

void mergesort()
{

lk *tmp1;
lk *tmp2;

lk (*start2)=(lk *)malloc(sizeof(lk));

tmp1=start;
tmp2=first;

start2=NULL;
   while((tmp1) && (tmp2))
   {

         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;


          if(tmp1->info < tmp2->info)
           {
         temp->info=tmp1->info;
         tmp1=tmp1->next;
           }
          else if(tmp1->info > tmp2->info)
          {
        temp->info=tmp2->info;
        tmp2=tmp2->next;
        }


          if(start2==NULL)
         {printf("\n NULL");
            start2=temp;
            }
           else
            node->next=temp;
        node=temp;
       last=temp;
             }//end of while loop*/

      while(tmp1!=NULL)
      {
         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;
         temp->info=tmp1->info;
         tmp1=tmp1->next;

        node->next=temp;
        node=temp;
       last=temp;
       }
       while(tmp2!=NULL)
       {
         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;
         temp->info=tmp2->info;
         tmp2=tmp2->next;

        node->next=temp;
        node=temp;
       last=temp;
        }



     printf("\n ***** after merging sort:");
     disp(&start2);
}











----------------------------
RAJ SOLUTION'S
www.rajsolution.com
www.sahinraj.blogspot.com

Program for perfomr arithmetic operation on Two Polynomials using linklist

//program for perfomr arithmetic operation on Two Polynomials using linklist
//writter : K@rtik
//20-03-11  sunday

#include<stdio.h>
#include<conio.h>

struct linklist
{
 int data;
 int power;
 struct linklist *next;
}*fnode=NULL,*start1=NULL,*last,*start2,*start3,*snode=NULL;

typedef struct linklist lk;
int item,i,pow,c;

void insert(lk **);
void add();
void sub();
void mul();
void disp(lk **);


void main()
{
char con;
int ch;
fnode=(lk *)malloc(sizeof(lk));
snode=(lk *)malloc(sizeof(lk));
fnode=NULL;
snode=NULL;

clrscr();

do
{
printf("\n\n ********************************************************");
printf("\n             K@rtik's LINKLIST OPERATION");
printf("\n\n -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
printf("\n *----->  1.Add Polynomial  equation                   *");
printf("\n *----->  2.Adddition of Two Polynomial                *");
printf("\n *----->  3.Subtraction of Two Polynomial              *");
printf("\n *----->  4.Multiplication of Two Polynomial           *");
printf("\n\n -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");

printf("\n\n=> enter ur choice:");
scanf("%d",&ch);

       switch(ch)
       {
     case 1:
     printf("\n Enter 1st Equation\n");
     insert(&fnode);
     printf("\n enter 2nd Equation\n");
     insert(&snode);
     printf("\n 1st Polynomial equation is====>");
     disp(&fnode);
     printf("\n 2nd Polynomial equation is====>");
     disp(&snode);
     break;

     case 2:
     add();
     break;

     case 3:
     sub();
     break;

     case 4:
     mul();
     break;

     default:
     printf("\n u must enter any number from 1 to 5");
     }
 fflush(0);
 printf("\n\n==> do u want to con...(Y/N)?");
 scanf("%c",&con);
 }while (con!='n');
getch();
}
//user define code for add item at last
void insert(lk **start)
{
   lk *node,*temp,*first;
   while(1)
   {
   if((*start)==NULL)
    {
    printf("\n enter an item:");
    scanf("%d",&item);
    printf("\n enter power:");
    scanf("%d",&pow);

      (*start)=(lk *)malloc(sizeof(lk));
      (*start)->data=item;
      (*start)->power=pow;
      (*start)->next=NULL;
     }
   else
   {

    node=(lk *)malloc(sizeof(lk));
    printf("\n enter an item:");
    scanf("%d",&item);
   l: printf("\n enter power:");
    scanf("%d",&pow);

     temp=(*start);
     while(temp->next!=NULL)
     {
       if(pow >= temp->power)
       {
      printf("\n ==> u must i/p power value less then %d ",temp->power);
      goto l;
      }
      temp=temp->next;
      }

    node->data=item;
    node->power=pow;
    node->next=NULL;
    temp->next=node;

    } //end of else
     if(pow==0)
       break;
     }
}

//Udf for display Polynomial
void disp(lk **head)
{
   lk *node,*node1;
   node=(lk *)malloc(sizeof(lk));

   node=(*head);
   printf("%d",node->data);
   printf("x^%d",node->power);
   node=node->next;
      while(node!=NULL)
       {
       if(node->data > 0)
        printf("+%d",node->data);
       else
        printf("%d",node->data);

    if (node->power==0)
         goto l1;
    else
         printf("x");

       printf("^%d",node->power);
      l1:
       node=node->next;
    }

}

//udf for addition of two polynomial
void add()
{
 lk *temp1,*temp2,*temp,*node;
    temp1=fnode;
    temp2=snode;

    while(temp1 || temp2)
    {
         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;
           if(temp1->power==temp2->power)
           {
         temp->power=temp1->power;
         temp->data=temp1->data + temp2->data;
         temp1=temp1->next;
         temp2=temp2->next;
           }
           else if(temp1->power>temp2->power)
           {
         temp->power=temp1->power;
         temp->data=temp1->data;
         temp1=temp1->next;
        }
           else
           {
         temp->power=temp2->power;
         temp->data=temp2->data;
         temp2=temp2->next;
           }
          if(start2==NULL)
            start2=temp;
           else
            node->next=temp;
         node=temp;
         last=temp;
         }//end of while loop
         printf("\n 1st Polynomial equation is====>");
         disp(&fnode);
         printf("\n\n 2nd Polynomial equation is====>");
         disp(&snode);
         printf("\n\n After addition the equation is ====>");
         disp(&start2);

 }

//udf for addition of two polynomial
void sub()
{
 lk *temp1,*temp2,*temp,*node,*start5=NULL;
    temp1=fnode;
    temp2=snode;
    while(temp1 || temp2)
    {
         temp=(lk *)malloc(sizeof(lk ));
         temp->next=NULL;

           if(temp1->power==temp2->power)
           {
         temp->power=temp1->power;
         temp->data=temp1->data - temp2->data;
         temp1=temp1->next;
         temp2=temp2->next;
           }
           else if(temp1->power>temp2->power)
           {
         temp->power=temp1->power;
         temp->data=temp1->data;
         temp1=temp1->next;
        }
           else
           {
         temp->power=temp2->power;
         temp->data=temp2->data;
         temp2=temp2->next;
           }
          if(start5==NULL)
            start5=temp;
           else
            node->next=temp;
         node=temp;
         last=temp;
        }//end of while loop
     printf("\n 1st Polynomial equation is====>");
     disp(&fnode);
     printf("\n\n 2nd Polynomial equation is====>");
     disp(&snode);
     printf("\n\n After Subtraction the equation is ====>");
     disp(&start5);

}

//mul

void mul()
{
 int max=0,c=0;
 lk *temp1,*temp2,*temp,*node,*start3=NULL,*start4=NULL;
 lk *tmp1,*tmp2;
    temp1=fnode;

    while(temp1)
    {
        temp2=snode;
        while(temp2)
        {
         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;
         temp->data=temp1->data * temp2->data;
         temp->power=temp1->power+temp2->power;
             temp2=temp2->next;

         if(max < temp->power)
             max=temp->power;

         if(start3==NULL)
            start3=temp;
         else
            node->next=temp;

         node=temp;
         last=temp;
           }

       temp1=temp1->next;
      }
    tmp1=start3;
    while(tmp1)
    {
      c=0;
      tmp2=tmp1;
         temp=(lk *)malloc(sizeof(lk));
         temp->next=NULL;
         temp->data=0;

         while(tmp2)
         {
          if(max==tmp2->power)
           {
           c=1;
         temp->power=tmp2->power;
         temp->data =temp->data+ tmp2->data;
        }
         tmp2=tmp2->next;

          }//end of inner loop

           if(c==0)
           {
            temp->power=tmp1->power;
            temp->data=tmp1->data;
            }
           if(start4==NULL)
            start4=temp;
           else
            node->next=temp;
         node=temp;
         last=temp;

         max--;
           if (max<0)
          break;

          tmp1=tmp1->next;
        }//end of while loop
    printf("\n 1st Polynomial equation is====>");
    disp(&fnode);
    printf("\n\n 2nd Polynomial equation is====>");
    disp(&snode);
    printf("\n\n After Multiplication the equation is ====>");
    disp(&start4);
}

----------------------------

RAJ SOLUTION'S

www.rajsolution.com

www.sahinraj.blogspot.com