Check string ,if palindrome using Queue

#include<iostream.h>

#include<conio.h>

#include<stdio.h>

#include<string.h>

#define que_size 10

int front=-1;

int rear=-1;

char q[que_size];

void insert(char c)

{

         if(rear==que_size-1)

    {

         printf("\n\nOverflow Occurs!!");

         getch();

         return;

     }

          if(front==-1)

          front=front+1;

          rear =rear+1;

          q[rear]=c;

}

void display()

{

          int i;

          if(front==-1)

     {

          printf("\n\nQueue is empty !!");

     }

         else

     {

         printf("\n\nString is : ");

         for(i=front;i<=rear;i++)

      {

         printf("%c",q[i]);

      }

    }

}

void check()

{

         int f;

         while(front!=rear)

    {

         if(q[front]==q[rear])

      {

         f=1;

         front++;

         rear--;

      }

        else

     {

        f=0;

        break;

     }

  }

        if(f==1)

        printf("\nString is a palindrome !!");

        else

        printf("\nString is not a palindrome!!");

}

void main()

{

       int i;

       char s[10];

        clrscr();

        printf("\nEnter string : ");

        gets(s);

        for(i=0;i<=strlen(s)-1;i++)

    {

        insert(s[i]);

    }

        if(rear!=que_size-1)

   {

       display();

       check();

   }

      getch();

}

Output:

Deleting alternate nodes of linked list

//Program to delete alternate nodes of linked list

#include<stdio.h>

#include<conio.h>

typedef struct node node;

struct node{

                     int data;

                     node *link;

                   };

node *start=NULL;

void insert()

{

        node *ptr=(node*)malloc(sizeof(node));

        int item;

        printf("Enter data : ");

        scanf("%d",&ptr->data);

        ptr->link=start;

        start=ptr;

}

void display()

{

        node *ptr=start;

        printf("\nList is : ");

        while(ptr!=NULL)

   {

        printf("%d  ",ptr->data);

        ptr=ptr->link;

   }

}

void alternate()

{

        node *temp,*ptr,*a,*p;

        temp=start;

        ptr=start->link;

        while(temp!=NULL)

    {

        temp->link=ptr->link;

        a=ptr;

        ptr=ptr->link->link;

        temp=temp->link;

        free(a);

    }

        p=start;

        printf("\nAlternate nodes are : ");

        while(p!=NULL)

   {

       printf("%d  ",p->data);

       p=p->link;

   }

}

void main()

{

      int n,i;

      clrscr();

      printf("\nEnter number of nodes in list : ");

      scanf("%d",&n);

      for(i=0;i<n;i++)

   {

      insert();

   }

      display();

      alternate();

      getch();

}

Output:

Print Middle element of linked list

 //Program to print middle element of linked list without using integer variables. 

#include<stdio.h>

#include<conio.h>

typedef struct node node;

struct node{

                     int data;

                     node *link;

                   };

node *start=NULL;

void insert()

{

       node *ptr=(node*)malloc(sizeof(node));

       int item;

       printf("Enter data : ");

       scanf("%d",&ptr->data);

       ptr->link=start;

       start=ptr;

}

void display()

{

       node *ptr=start;

       printf("\nList is : ");

       while(ptr!=NULL)

   {

       printf("%d  ",ptr->data);

       ptr=ptr->link;

   }

}

void print_middle()

{

       node *ptr,*temp;

       ptr=start;

       temp=start->link;

       while(temp->link!=NULL)

   {

       ptr=ptr->link;

       temp=temp->link->link;

   }

       printf("\nMiddle element is : %d",ptr->data);

}

void main()

{

       int n,i;

       clrscr();

       printf("\nEnter number of nodes in list : ");

       scanf("%d",&n);

       for(i=0;i<n;i++)

   {

       insert();

   }

       display();

       print_middle();

       getch();

}

 Output:

Insert at end of linked list

//Program to insert elements at the end of linked list

#include<stdio.h>

#include<conio.h>

struct node {

                  int data;

                  struct node* link;

                };

struct  node*start=NULL;

void insert()

{

   struct node * ptr=(struct node*)malloc(sizeof(struct node));

   int data;

   struct node * a= start;

   printf("\nEnter data to be inserted : ");

   scanf("%d",&ptr->data);

   if(start==NULL)

   {

     ptr->link=start;

     start=ptr;

   }

   while(a->link!=NULL)

  {

     a=a->link;

  }

   a->link=ptr;

   ptr->link=NULL;

}

void  display()

{

   struct node*temp=start;

   printf("\nList is : ");

   while(temp!=NULL)

  {

    printf("%d  ",temp->data );

    temp=temp->link;

  }

}

void main()

{

   int n,i;

   clrscr();

   do

  {

   insert();

   printf("\nPress 1 to insert more else press 0 :  " );

   scanf("%d",&n);

  }while(n==1);

   display();

   getch();

}

Output:

MSA

How Microsoft has impacted my life and how I plan to bring a change to the society being a Microsoft Student Associate

My life with Microsoft

Hello everyone!!

I am  Shruti  Sethia ,

At  present, I am doing B.Tech in information technology from Indira Gandhi Delhi Technical University for Women (IGDTUW).

To begin with ,I would like to extend my gratitude towards MICROSOFT for providing me such a platform wherein I could express my passion for technology and utilize my innovative mind for the betterment of the society. 

 Impact of Microsoft in my life.

Technology without accessibility is of no use and  Microsoft  is that powerful and wonderful platform which has made computing accessible to all.

MICROSOFT has been a part and parcel of my life since my early school days.At that time,just like every other students , I found schooling to be a bit boring but when MS paint was introduced to us, there was a wave of craze among all of us.As my studies advanced the all new MS office was introduced which further added to my knowledge and showed me my innovative side. The surprise package was MS PowerPoint wherein I could make Informative,vibrant and appealing presentations that could speak for me. Then I continued various academic activities with MS excel and MS word.

                                                      "Well !! This was not the end, it was just a trailer."

MS  product SKYPE enables me to stay connected with my friends and family all over the world .Its Cloud Services through onedrive is one of the most amazing product that helps me to keep my documents intact and to access them anywhere at anytime.

Various other products like Visual studio ,Movie Maker,Windows Media Center etc, not only aims at refreshing and entertaining people but  also helped us to experience technology in better way.

MICROSOFT has extended it's wings in almost every domain be it  Gaming , Education , Commercial sector , User interface or office usage . Microsoft has become an indispensable part of the society without which people could not experience technologies to its fullest.

So I would just say that MICROSOFT is that "Fruit full tree",which is growing day by day and catering all the necessities and demands of the society.

My aim as an MSA.

Being  a  Microsoft  Student Associate my first and  foremost  aim is to serve Tech giant MICROSOFT to my fullest by helping them organizing various workshops and seminar in my campus thus making students inquisitive about technologies . Moreover I would like to spread awareness about the great contribution of MICROSOFT for easy and satisfactory accessibility of various technological advancements that has proved as a boon for the society. I am a quick learner ,team leader and an enthusiastic person and would love to utilize my interpersonal skills for betterment of the society via Microsoft.  

Looking forward for a positive response!!

THANK YOU EVERYONE FOR READING MY BLOG. PLEASE LIKE, COMMENT AND SHARE THE FACEBOOK POST FOR YOUR SUPPORT.

Linked list

//Menu driven program to perform various operations in linked list

#include<iostream.h>
#include<conio.h>
#include<process.h>
struct node{
    int data;
    node *link;
  };
class linked{
     node * start;
     public:
     linked()
     {
     start=NULL;
     }
     void insert();
     void display();
     void Delete();
     void count();
     ~linked()
     {}
   };
void linked::insert()
{
   char ch;
   node* ptr=new node;
   if(ptr==NULL)
  {
    cout<<"Overflow occurs !!";
    getch();
    return;
  }
   do
  {
    node* ptr =new node;
    cout<<"\nEnter item to be inserted : ";
    cin>>ptr->data;
    ptr->link=start;
    start=ptr;
    cout<<"\nDo you wish to insert more (y/n)? : ";
    cin>>ch;
  }while(ch=='y'||ch=='Y');
}

void linked::Delete()
{
    if(start==NULL)
  {
    cout<<"Underflow ";
    getch();
    return;
  }
    node *ptr=start;
    start=ptr->link;
    delete ptr;
    cout<<"\nElement Deleted!! " ;
}

void linked::display()
{
    node *ptr=start;
    if(ptr!=NULL)
   {
     cout<<"\nList is : ";
     while(ptr!=NULL)
   {
     cout<<ptr->data<<"  ";
     ptr=ptr->link;
   }
}
    else
    cout<<"\nFirst insert some elements!!";
}

void linked::count()
{
    node *ptr= start;
    int c=0;
    while(ptr!=NULL)
   {
     c++;
     ptr=ptr->link;
   }
    cout<<"\nNumber of nodes in linked list is : "<<c;
}

void menu()
{
   cout<<"\n\t\tMain Menu\n\n"
       <<"\tPress 1 : To Insert element "
       <<"\n\tPress 2 : To Delete element "
       <<"\n\tPress 3 : To display list"
       <<"\n\tPress 4 : To count nodes"
       <<"\n\tPress 5 : To Exit";
}
void main()
{
    int n,i,opt,f=0;
    char ch;
    linked l;
    do
   {
    clrscr();
    menu();
    cout<<"\n\n\tEnter your option : ";
    cin>>opt;
    switch(opt)
   {
     case 1: clrscr();
        l.insert();
        f++;
        break;
     case 2: clrscr();
         l.Delete();
         break;
     case 3: clrscr();
         l.display();
         getch();
         break;
     case 4: clrscr();
         l.count();
         break;
     case 5: cout<<"\n\tProgram Terminating...";
        getch();
        exit(0);
        break;
     default : cout<<"\n\tInvalid option!!";
          getch();
   }
       cout<<"\n\n\tDo you wish to try more options(n/y)? ";
       cin>>ch;
  }   while(ch=='y'||ch=='Y');
       getch();
}

Print in spiral order!!

//Program to print 2-D array in spiral order.

#include<iostream.h>
#include<conio.h>
void main()
{
    clrscr();
     int a[10][10];
     int m,n,t=0,b,l=0,r,dir=0,i,j;
     cout<<"\nEnter order of matrix \n";
     cout<<"\nNo. of rows =  ";
     cin>>m;
     cout<<"\nNo. of columns = ";
     cin>>n;
     cout<<"\nEnter matrix\n\n";
     for(i=0;i<m;i++)
  {
     for(j=0;j<n;j++)
        cin>>a[i][j];
  }
     b=m-1;
     r=n-1;
     cout<<"\nArray Elements in spiral order is\n\n";
     while(t<=b &&l<=r)
 {
      if(dir==0)
   {
     for(i=l;i<=r;i++)
    cout<<"  "<<a[t][i];
     t++;
     dir=1;
   }
 else
      if(dir==1)
   {
      for(i=t;i<=b;i++)
      cout<<"  "<<a[i][r];
       r--;
      dir=2;
   }
 else
      if(dir==2)
   {
      for(i=r;i>=l;i--)
      cout<<"  "<<a[b][i];
      b--;
      dir=3;
   }
 else
      if(dir==3)
   {
      for(i=b;i>=t;i--)
      cout<<"  "<<a[i][l];
       l++;
      dir=0;
   }
 }
getch();
}

Output:

First and last occurence of element

/*Program to find first and last  occurence  of an element  and to find number of times it occurs in a sorted array using binary search.*/

#include<iostream.h>
#include<conio.h>
int binary(int a[10],int n,int x,int first_search )
{
  int beg=0,end=n-1,mid,result=-1;
  while(beg<=end)
 {
   mid=(beg+end)/2;
   if(a[mid]==x)
   {
     result=mid;
     if(first_search==1)
     end=mid-1;
     else
     beg=mid+1;
   }
   else if(a[mid]<x)
   beg=mid+1;
   else
   end=mid-1;
 }
   return result;
}
void main()
{
   clrscr();
   int A[10],N,i,s;
   cout<<"\nEnter size of array : ";
   cin>>N;
   cout<<"\nEnter sorted array : ";
   for(i=0;i<N;i++)
   {
     cin>>A[i];
   }
   cout<<"\nEnter number : ";
   cin>>s;
   int first_occ=binary(A,N,s,1);
   int last_occ=binary(A,N,s,0);
   if( first_occ==-1||last_occ==-1)
   cout<<"\nNumber does not exist !!";
   else
   {
     cout<<"\nFirst occurence of "<<s<<" is at index "<<first_occ;
     cout<<"\n\nLast occurence of "<<s<<" is at index "<<last_occ;
   }
   getch();
}

Output: