TecGlance

C program for Hash Table

2018-02-11T05:25:00.000-08:00

#include <stdio.h>
#include <stdlib.h>
int search_index(int a[],int index,int size)
{
   int i,j,flag=0;
   for(i=index;i<=size;i++)
   {
      if(a[i]==0)
      {
         flag=1;
         return i;            
      }                     
   }
   if(flag==0)
   {
      for(j=0;j<index;j++)
      {
         if(a[j]==0)
         {
            flag=1;
            return j;           
         }            
      }
   }
}
int main()
{
   int k[100],index,i,j,in[100],size,size2,h,flag=0,item;
   printf("\nEnter the size of the array: ");
   scanf("%d",&size);
   printf("\nEnter the value of 'h': ");
   scanf("%d",&h);
   for(i=0;i<size;i++)
   {
      printf("\nEnter the element: ");
      scanf("%d",&k[i]);
      index=(k[i]%h);
      in[i]=index;                  
   }
/*   for(i=0;i<size;i++)
   {
      printf("\nKey: %d,  Index: %d",k[i],in[i]);                   
   }   */
   size2=0;
   for(i=0;i<size;i++)
   {
      if(in[i]>size2)
      {
         size2=in[i];               
      }
   }
   int hash[size2];
   for(i=0;i<=size2;i++)
   {
      hash[i]=0;                   
   }
   for(i=0;i<size;i++)
   {
      index=in[i];
      if(k[i]==hash[index])
      {
         printf("\nItem already exist! ");
         break;                  
      }    
      if(hash[index]==0)
      {
         hash[index]=k[i];
      }      
      else
      {
         int inde;
         inde=search_index(hash,index,size2);  
        // printf("\nReturned value if index, ie, index of %d is %d: ",k[i],inde); 
         hash[inde]=k[i];
      }
   }
   printf("\nHash table is: ");
   for(i=0;i<=size2;i++)
   {
      if(hash[i]!=0)
      {
         printf("%d:%d ",hash[i],i);                    
   
      }
   }
   getch();
}

Make an awesome eternal terrarium at your home

2017-05-17T08:52:00.000-07:00

Make A Plastic 3D Hologram in your home

2017-05-17T08:44:00.000-07:00

India to make every single car electric by 2030

2017-05-15T10:19:00.000-07:00

Every car sold in India will be powered by electricity by the year 2030, according to plans unveiled by the country’s energy minister.

The move is intended to lower the cost of importing fuel and lower costs for running vehicles.

“We are going to introduce electric vehicles in a very big way," coal and mines minister Piyush Goyal said at the Confederation of Indian Industry Annual Session 2017 in New Delhi.

Comparing the drive to a 2015 initiative in the country to reduce energy bills by promoting LED lightbulbs, he told reporters: "We are going to make electric vehicles self-sufficient... The idea is that by 2030, not a single petrol or diesel car should be sold in the country.”

Mr Goyal said the electric car industry would need between two and three years of government assistance, but added that he expected the production of the vehicles to be “driven by demand and not subsidy” after that.

"The cost of electric vehicles will start to pay for itself for consumers," he said according to the International Business Times. “We would love to see the electric vehicle industry run on its own," he added.

An investigation by Greenpeace this year found that as many as 2.3 million deaths occur every year due to air pollution in the country. The report, entitled 'Airpocalypse', claimed air pollution had become a “public health and economic crisis” for Indians.

It said the number of deaths caused by air pollution was only "a fraction less" than the number of deaths from tobacco use, adding that 3 per cent of the country's Gross Domestic Product (GDP) was lost to the levels of toxic smog.

“India's pollution trends have been steadily increasing, with India overtaking China in number of deaths due to outdoor air pollution in 2015," the report said, saying a "robust monitoring system” was urgently needed.

Delhi was India's most polluted city, the report found, with concentrations of particulate matter 13 times the annual limit set by the World Health Organisation.

Mr Goyal said the electric car scheme would first target "larger consumer centres, where pollution is at an all-time high", such as Delhi.

Canon EOS 1300D 18MP Digital SLR Camera 30% off Grab it NOW!!

2017-05-14T09:20:00.000-07:00

The EOS 1300D packs in all the fun of photography, which is why we recommend it to users looking for their very first EOS DSLR camera. It uses an 18-megapixel APS-C size sensor and the DIGIC 4+ image processor—which even professional photographers recognize as high performance core features. It also has abundant auto shooting features and is compatible with over 70 EF/EF-S lenses, allowing you to take beautiful photos like a pro regardless of subject and genre. Wi-Fi and NFC compatibility allows easy file transfer to other devices. All the more convenient for sharing those wonderful photos on social media!

18 megapixel APS-C CMOS sensor & DIGIC 4+
9-point AF with 1 centre cross-type AF point
Standard ISO 100 – 6400 (expandable to 12800)
Wi-Fi and NFC supported

18-megapixel APS-C CMOS sensor & DIGIC 4+

The APS-C CMOS sensor, which is approx. 25 times bigger than the 1/3.2-inch type sensor used in many smartphones results in photos with more clarity than before. Capture the lovely colour gradations in sunset and intricate details in clouds in true-to-life detail. Clear photos with little noise is possible even in indoor and low-light environments thanks to the DIGIC 4+ image processor, which allows you to experience the joys of the high image quality with ISO speed up to a maximum of 12,800.

Wide range of lens options for greater versatility

The EOS 1300D can be used with over 70 EF/EF-S lenses. Within this range, you will find zoom lenses convenient for travel, macro lenses that allow close-ups of tiny insects and lenses equipped with the image stabilizer (IS), among others. There are also wide-angle lenses that enable you to capture a wide expanse of landscape within one shot, mid-telephotos that are ideal for human portraits, and telephotos that allow you to capture the expressions of wild animals far away. High quality, beautiful shots—regardless of subject. With the EOS 1300D, you can make your imagination come to life.

Wi-Fi / NFC—Capture images remotely and share them on social media!

The EOS 1300D is both Wi-Fi and NFC-ready. You can connect it to other NFC-ready devices just by putting them close together—perfectly convenient for uploading quality images for sharing on social media. With the Camera Connect app, adjusting of camera settings and capturing images remotely is now possible. EOS 1300D is also compatible with the Connect Station CS100 photo storage device, allowing you to view those photos together with your family and friends on a TV screen at your next gathering!

Specifications for EOS 1300D Kit (EF S18-55 IS II)

Type
Type	Digital, single-lens reflex, AF/AE camera with built-in flash
Recording media	SD memory card, SDHC memory card, SDXC memory card
Image sensor size	Approx. 22.3 x 14.9mm
Compatible lenses	Canon EF lenses (including EF-S lenses) * Excluding EF-M lenses(35mm-equivalent angle of view is that of a lens with approx. 1.6x the focal length indicated.)
Lens mount	Canon EF mount
Image Sensor
Type	CMOS sensor
Effective pixels	Approx. 18.0 megapixels
Aspect ratio	3:2
Dust delete feature	Dust Delete Data appending, Clean manually
Recording System
Recording format	Design rule for Camera File System (DCF) 2.0
Image type	JPEG, RAW (14-bit Canon original) RAW+JPEG Large simultaneous recording possible
Pixels recorded	L (Large):	Approx. 17.9 megapixels (5184 x 3456)
	M (Medium):	Approx. 8.0 megapixels (3456 x 2304)
	S1 (Small 1):	Approx. 4.5 megapixels (2592 x 1728)
	S2 (Small 2):	Approx. 2.5 megapixels (1920 x 1280)
	S3 (Small 3):	Approx. 350,000 pixels (720 x 480)
	RAW:	Approx. 17.9 megapixels (5184 x 3456)
Create/select a folder	Possible
File numbering	Continuous, Auto reset, Manual reset
Image Processing During Shooting
Picture Style	Auto, Standard, Portrait, Landscape, Neutral, Faithful, Monochrome, User Def. 1 - 3
Basic+	Ambience-based shots, Light/scene-based shots
White balance	Auto (Ambience priority), Auto (White priority), Preset (Daylight, Shade, Cloudy, Tungsten light, White fluorescent light, Flash), Custom White balance correction, and White balance bracketing provided * Flash color temperature information transmission enabled
Noise reduction	Applicable to long exposures and high ISO speed shots
Automatic imagebrightness correction	Auto Lighting Optimizer
Highlight tone priority	Provided
Lens peripheral illumination correction	Provided
Viewfinder
Type	Eye-level pentamirror
Coverage	Vertical/Horizontal approx. 95% (with eyepoint approx. 21mm)
Magnification	Approx. 0.8x (-1m^-1 with 50mm lens at infinity)
Eye point	Approx. 21mm (from eyepiece lens center at -1m^-1)
Diopric adjustment range	Approx. -2.5 - +0.5m^-1 (dpt)
Focusing screen	Fixed, Precision Matte
Mirror	Quick-return type
Depth-of-field preview	Enabled with Custom Function setting
Autofocus (for viewfinder shooting)
Type	TTL secondary image-registration, phase-difference detection
AF points	9-point (Cross-type AF sensitive to f/5.6 with center AF point)
Focusing brightness range	EV 0 - 18 (Center AF point) EV 1 - 18 (Other AF points) (With One-Shot AF, at room temperature, ISO 100)
AF operation	One-Shot AF, AI Servo AF, AI Focus AF
AF-assist beam	Small series of flashes fired by built-in flash
Exposure Control
Metering modes	63-zone TTL open-aperture metering Evaluative metering (linked to all AF points) Partial metering (approx. 10% of viewfinder at center) Center-weighted average metering
Metering brightness range	EV 1 - 20 (at room temperature, ISO 100)
Shooting mode	Basic Zone modes:	Scene Intelligent Auto, Flash Off, Creative Auto, Portrait, Landscape, Close-up, Sports, Food, Night Portrait
	Creative Zone modes:	Program AE, Shutter-priority AE, Aperture-priority AE, Manual exposure
ISO speed (Recommended exposure index)	Basic Zone modes*:	ISO 100 - ISO 3200 set automatically * Portrait: ISO 100
	Creative Zone modes:	ISO 100 - ISO 6400 set manually (whole-stop increments), ISO 100 - ISO 6400 set automatically, maximum ISO speed settable for ISO Auto, or ISO expansion to "H" (equivalent to ISO 12800)
Exposure compensation	Manual:	±5 stops in 1/3- or 1/2-stop increments
	AEB:	±2 stops in 1/3- or 1/2-stop increments (can be combined with manual exposure compensation)
AE lock	Auto:	Applied in One-Shot AF with evaluative metering when focus is achieved
	Manual:	With AE lock button
Shutter
Type	Electronically-controlled, focal-plane shutter
Shutter speed	1/4000sec. to 30sec. (Total shutter speed range. Available range varies by shooting mode.), Bulb, X-sync at 1/200sec.
Flash
Built-in flash	Retractable, auto pop-up flash
	Guide No.:	Approx. 9.2 / 30.2 (ISO 100, in meters / feet) or approx. 13 / 42.7 (ISO 200, in meters / feet)
	Flash coverage:	Approx. 17mm lens angle of view
	Recharge time:	Approx. 2sec.
External flash	EX-series Speedlite
Flash metering	E-TTL II autoflash
Flash exposure compensation	±2 stops in 1/3- or 1/2-stop increments
FE lock	Provided
PC terminal	None
Drive System
Drive modes	Single shooting, Continuous shooting, Self-timer with 10-sec. or 2-sec. delay and 10-sec. delay with continuous shooting
Continuous shooting speed	Max. approx. 3.0 shots/sec.
Max. burst (Approx.)	JPEG Large / Fine:	1110 shots
	RAW:	6 shots
	RAW+JPEG Large / Fine:	5 shots
	* Figures are based on Canon’s testing standards (ISO 100 and Standard Picture Style) using an 8GB card.
Live View Shooting
Aspect ratio	3:2, 4:3, 16:9, 1:1
Focus methods	Contrast detection (FlexiZone-Single, Face detection Live mode), Phase-difference detection (Quick mode) Manual focus (approx. 5x / 10x magnification possible)
Focusing brightness range	EV 1 - 18 (at room temperature, ISO 100)
Metering mode	Real-time metering with image sensor
Metering brightness range	EV 0 - 20 (at room temperature, ISO 100)
Grid display	Two types
Movie Shooting
Recording format	MOV
Movie	MPEG-4 AVC/H.264 Variable (average) bit rate
Audio	Linear PCM
Recording size and frame rate	1920 x 1080 (Full HD):	30p / 25p / 24p
	1280 x 720 (HD):	60p / 50p
	640 x 480 (SD):	30p/25p
	* 30p: 29.97 fps, 25p: 25.00 fps, 24p: 23.98 fps, 60p: 59.94 fps, 50p: 50.00 fps
Bit rate	1920 x 1080 (30p / 25p / 24p):	Approx. 46Mbps
	1280 x 720 (60p / 50p):	Approx. 46Mbps
	640 x 480 (30p / 25p):	Approx. 11Mbps
Focus method	Same as focusing with Live View shooting
Focusing brightness range	EV 1 - 18 (at room temperature, ISO 100)
Metering mode	Center-weighted average and evaluative metering with the image sensor * Automatically set by the focus method.
Metering brightness range	EV 0 - 20 (at room temperature, ISO 100)
Exposure control	Autoexposure and manual exposure
Exposure compensation	±3 stops in 1/3-stop increments
ISO speed (Recommended exposure index)	With autoexposure shooting:	ISO 100 - ISO 6400 set automatically
	With manual exposure:	ISO 100 - ISO 6400 set automatically/manually
Video snapshots	Settable to 2sec. / 4sec. / 8sec.
Sound recording	Built-in monaural microphone Sound-recording level adjustable, wind filter provided
Grid display	Two types
Still photo shooting	Not possible during movie shooting
LCD Monitor
Type	TFT color liquid-crystal monitor
Monitor size and dots	Approx. 7.5cm (3.0in.) (4:3) with approx. 920,000 dots
Brightness adjustment	Manual (7 levels)
Interface languages	25
Feature guide	Displayable
Playback
Image display format	Basic info, basic info + image quality/playback number, shooting info. display, histogram, index display (4/9)
Zoom magnification	Approx. 1.5x - 10x
Highlight alert	Overexposed highlights blink
Image browsing method	Single image, jump by 10 or 100 images, by shooting date, by folder, by movies, by stills, by rating
Image rotation	Possible
Ratings	Provided
Movie playback	Enabled (LCD monitor, HDMI) Built-in speaker
Image protect	Possible
Slide show	All images, by date, by folder, by movies, by stills, by rating Five transition effects selectable
Background music	Selectable for slide shows and movie playback
Post-Processing of Images
Creative filters	Grainy B/W, Soft focus, Fish-eye effect, Toy camera effect, Miniature effect
Resize	Possible
Direct Printing
Compatible printers	PictBridge-compatible printers
Printable images	JPEG and RAW images
Print ordering	DPOF Version 1.1 compatible
Customization Features
Custom Functions	11
My Menu registration	Possible
Copyright information	Entry and appending possible
Interface
Digital terminal	Hi-Speed USB equivalent:	Computer communication, Direct printing, GPS Receiver GP-E2, Connect Station CS100 connection
HDMI mini OUT terminal	Type C (Auto switching of resolution)
Remote control terminal	For Remote Switch RS-60E3
Eye-Fi card	Compatible
Power
Battery	Battery Pack LP-E10 (Quantity 1) * AC power can be supplied via household power outlet accessories.
Number of possible shots (Based on CIPA testing standards, with 50% flash use)	With viewfinder shooting:	Approx. 500 shots at room temperature (23°C / 73°F), approx. 410 shots at low temperatures (0°C / 32°F)
	With Live View shooting:	Approx. 180 shots at room temperature (23°C / 73°F), approx. 170 shots at low temperatures (0°C / 32°F)
Movie shooting time	Approx. 1hr. 15min. at room temperature (23°C / 73°F) Approx. 1hr. 10min. at low temperatures (0°C / 32°F) (with a fully-charged Battery Pack LP-E10)
Dimensions and Weight
Dimensions (W x H x D)	Approx. 129.0 x 101.3 x 77.6mm / 5.08 x 3.99 x 3.06in.
Weight	Approx. 485g / 17.11oz. (CIPA Guidelines), Approx. 440g / 15.52oz. (Body only)
Operation Environment
Working temperature range	0°C - 40°C / 32°F - 104°F
Working humidity	85% or less
Wireless Communications
Standards compliance	IEEE 802.11b/g/n
Transmission method	DS-SS modulation (IEEE 802.11b) OFDM modulation (IEEE 802.11g/n)
Transmission range	Approx. 15m / 49.2ft. * When connected to a smartphone * With no obstructions between the transmitting and receiving antennas and no radio interference
Transmission frequency (central frequency)	Frequency:	2412 - 2462MHz
	Channels:	1 to 11 ch
Connection method	Camera access point mode, infrastructure* * Wi-Fi Protected Setup supported
Security	Authentication method:	Open system, Shared key, WPA/WPA2-PSK
	Encryption:	WEP, TKIP, AES
NFC connection	For communication with smartphones or connection to Connect Station
Wi-Fi Functions
Connection to smartphones	Images can be viewed, controlled, and received using a smartphone. Remote control of the camera using a smartphone is possible. Images can be sent to a smartphone.
Connect to Connect Station	Images can be sent and saved to Connect Station.
Send images to a Web service	Images in the camera or links to images can be sent to registered Web services.
* All the data above is based on Canon’s testing standards.
Battery Pack LP-E10
Type	Rechargeable lithium-ion battery
Rated voltage	7.4V DC
Battery capacity	860mAh
Working temperature range	During charging:	6°C - 40°C / 43°F - 104°F
	During shooting:	0°C - 40°C / 32°F - 104°F
Working humidity	85% or less
Dimensions (W x H x D)	Approx. 36.2 x 14.7 x 49.0mm / 1.4 x 0.6 x 1.9in.
Weight	Approx. 45g / 1.6oz.
Battery Charger LC-E10
Compatible battery	Battery Pack LP-E10
Recharging time	Approx. 2 hours (at room temperature (23°C / 73°F))
Rated input	100 - 240V AC (50/60 Hz)
Rated output	8.3V DC / 580 mA
Working temperature range	6°C - 40°C / 43°F - 104°F
Working humidity	85% or less
Dimensions (W x H x D)	Approx. 67.0 x 30.5 x 87.5mm / 2.6 x 1.2 x 3.4in.
Weight	Approx. 85g / 3.0oz.
Battery Charger LC-E10E
Compatible battery	Battery Pack LP-E10
Power cord length	Approx. 1m / 3.3ft.
Recharging time	Approx. 2 hours (at room temperature (23°C/73°F))
Rated input	100 - 240V AC (50/60 Hz)
Rated output	8.3V DC / 580mA
Working temperature range	6°C - 40°C / 43°F - 104°F
Working humidity	85% or less
Dimensions (W x H x D)	Approx. 67.0 x 30.5 x 87.5mm / 2.6 x 1.2 x 3.4in.
Weight	Approx. 82g / 2.9oz. (excluding power cord)

•	All the data above is based on Canon's testing standards and CIPA (Camera & Imaging Products Association) testing standards and guidelines.
•	Dimensions and weight listed above are based on CIPA Guidelines (except weight for camera body only).
•	Product specifications and the exterior are subject to change without notice.
•	If a problem occurs with a non-Canon lens attached to the camera, consult the respective lens manufacturer.

4 Smartphone Camera Hacks

2017-05-13T04:43:00.000-07:00

Cardboard Tube Speaker System

2017-05-13T04:10:00.000-07:00

This is an instuctable i saw on a DIY site. These speakers will be very cheap and easy to make with depending on brand, color, and store would be the spray paint which even then is optional. These speakers can be used really for anything you want from music to stories. Depending on how you cut it it can work on most technology. Now before we begin here is a photo of the end product and I just want you to know that this is heavily inspired by another item and most of the design is also based off that. But now without further ado here is the supplies.

Step 1: Tools and Supplies

With this project the Tools and supplies go a bit hand in hand and due to the small supply needed they will be merged into one step.. So with that out of the way here it is.

Scissors
Felt tipped Pen
Paint (optional)
Cups x2
Cardboard tube

Step 2: Phone Placement

Take the cardboard paper towel tube and mark the middle where you will put the cell phone.

Step 3: Cut Slot

Use the scissors to cut the tube along the marked lines.

Step 4: Cut Cups

Mark the end of the tube against the cup and cut along the line.

Step 5: Assemble

Slip the tube into the two cups.

Step 6: Install Baffle Material

Stuff the two tissues/paper towels into the cardboard tube (this makes it sound quality better).

If you feel it sounds fine without the without the tissue then you can just leave it be.

Step 7: Install Phone

Put it together to make sure everything fits.

Step 8: Paint

Take apart again and paint. Don’t forget to remove the iPhone!

Step 9: Reassemble

Put it all together!

Top 5 - Technology that has changed the world

2017-05-13T03:52:00.001-07:00

C program for Application of Linked List: Polynomial Multiplication

2016-11-11T05:20:00.000-08:00

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct poly
{
       int c,e;
       struct poly *next;
};
void read_poly(struct poly *header)
{
       struct poly *newnode,*temp;
       char ch;
       printf("\nCreate a node (Y/N) : ");
       getchar();
       scanf("%c",&ch);
       header->next=NULL;
       while(ch!='n')
       {
           newnode=(struct poly *)malloc(sizeof(struct poly));
           printf("\nEnter the coefficient value : ");
           scanf("%d",&newnode->c);
           printf("\nEnter the exponential value : ");
           scanf("%d",&newnode->e);
           newnode->next=NULL;
           if(header->next==NULL)
           {
                header->next=newnode;
                temp=newnode;
           }
           else
           {
               temp->next=newnode;
               temp=newnode;
           }
           printf("\nCreate a node (Y/N) : ");
           getchar();
           scanf("%c",&ch);
       }
}
void mult_poly(struct poly *p,struct poly *q,struct poly *r)
{
       int c,e;
       r->next=NULL;
       p=p->next;
       q=q->next;
       struct poly *node,*temp,*last,*ptr;
       temp=q;
       while(p!=NULL)
       {
          q=temp;
          while(q!=NULL)
          {
             c=p->c*q->c;
             e=p->e+q->e;
             if(r->next==NULL)
             {
                node=(struct poly *)malloc(sizeof(struct poly));
                node->c=c;
                node->e=e;
                node->next=NULL;
                r->next=node;
                last=node;
             }
             else
             {
                ptr=r->next;
                while(ptr!=NULL)
                {
                   if(ptr->e!=e)
                      ptr=ptr->next;             
                   else
                      break;    
                }
                if(ptr!=NULL)
                {
                   ptr->c+=c;             
                }
                else
                {
                   node=(struct poly *)malloc(sizeof(struct poly));
                   node->c=c;
                   node->e=e;
                   node->next=NULL;
                   last->next=node;
                   last=node;    
                }  
             }
          q=q->next;
          }
       p=p->next;
       }
}
void delt(struct poly *header)
{
   struct poly *ptr,*ptr1;
   ptr=header->next;
   while(ptr!=NULL)
     {
          ptr1=ptr;
          ptr=ptr->next;
          free(ptr1);
     }
}
void traverse(struct poly *header)
{
     printf("\n");
     struct poly *ptr=header->next;
     while(ptr!=NULL)
     {
          printf(" %dX%d+",ptr->c,ptr->e);
          ptr=ptr->next;
     }
     printf("\n");
}
int main()
{
    int ch;
    struct poly *p,*q,*r;
    p=(struct poly *)malloc(sizeof(struct poly));
    q=(struct poly *)malloc(sizeof(struct poly));
    r=(struct poly *)malloc(sizeof(struct poly));
    do
    {
        printf("\n..MENU..\n1. Enter Polynomial\n2. Polynomial Multiplication\n3. Exit\n\nEnter your choice: ");
        scanf("%d",&ch);
        switch(ch)
        {
                  case 1: printf("\nEnter polynomial P : ");
                          read_poly(p);
                          traverse(p);
                          printf("\n\nEnter polynomial Q : ");
                          getchar();
                          read_poly(q);
                          traverse(q);
                          break;
                  case 2: mult_poly(p,q,r);
                          printf("\nResultant polynomial is: ");
                          traverse(r);
                          break;
                  case 3: exit(0);
        }
    }while(1);
    delt(p);
    delt(q);
    delt(r);
    getchar();
}

C program for Bubble, Selection, Insertion and Heap Sorting

2016-11-11T04:57:00.000-08:00

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
void enterelements(int a[],int size)
{
int i;
for(i=1;i<=size;i++)
{
printf("\nEnter element%d: ",i);
scanf("%d",&a[i]);
}
}
void bubblesort(int a[],int size)
{
int i,j,temp;
for(i=1;i<=size;i++)
{
for(j=1;j<=size-i;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
}
void selectionsort(int a[],int size)
{
int i,j,temp;
for(i=1;i<=size;i++)
{
for(j=i+1;j<size+1;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
}
void insertionsort(int a[],int size)
{
int i,j,key;
for(i=2;i<=size;i++)
{
key=a[i];
j=i-1;
while((j>=1)&&(a[j]>key))
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=key;
}
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
}
void buildheap(int a[],int b[],int size)
{
int i=1,j,temp;
while(i<=size)
{
b[i]=a[i];
j=i;
while(j>1)
{
if(b[j]>b[(int)floor(j/2)])
{
temp=b[j];
b[j]=b[(int)floor(j/2)];
b[(int)floor(j/2)]=temp;
j=(int)floor(j/2);
}
else
{
j=1;
}
}
i+=1;
}
}
void maxheap(int b[],int i,int n)
{
int great,temp,l,r;
l=2*i;
r=(2*i)+1;
if((l<=n)&&(b[l]>b[i]))
{
great=l;
}
else
{
great=i;
}
if ((r<=n)&&(b[r]>b[great]))
{
great=r;
}
if(great!=i)
{
temp=b[great];
b[great]=b[i];
b[i]=temp;
maxheap(b,great,n);
}
}
void heapsort(int a[],int size)
{
int i,b[100],c[100],temp;
buildheap(a,b,size);
for(i=size;i>=1;i--)
{
temp=b[1];
b[1]=b[i];
c[i]=temp;
if((i!=1)&&(1!=2))
{
maxheap(b,1,i-1);
}
}
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",c[i]);
i=i+1;
}
}
int main()
{
int a[100],i,j,size,ch;
printf("\nEnter the size of array: ");
scanf("%d",&size);
do
{
printf("\n\n..MENU..\n1. Bubble sort\n2. Selection sort\n3. Insertion Sort\n4. Heap sort\n5. Exit\n\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
bubblesort(a,size);
break;
case 2: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
selectionsort(a,size);
break;
case 3: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
insertionsort(a,size);
break;
case 4: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
heapsort(a,size);
break;
case 5: exit(0);
default:printf("\nWrong choice!");
}
}while(1);
}

C program for Merge sort and Quick Sort

2016-11-11T04:56:00.000-08:00

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
void enterelements(int a[],int size)
{
int i;
for(i=1;i<=size;i++)
{
printf("\nEnter element%d: ",i);
scanf("%d",&a[i]);
}
}
void merge(int a[],int p,int mid,int r,int size)
{
int b[size],i,j,k;
k=0;
i=p;
j=mid+1;
while((i<=mid)&&(j<=r))
{
if(a[i]<a[j])
{
b[k]=a[i];
k++;
i++;
}
else
{
b[k]=a[j];
k++;
j++;
}
}
while(i<=mid)
{
b[k]=a[i];
k++;
i++;
}
while(j<=r)
{
b[k]=a[j];
k++;
j++;
}
for(i=r;i>=p;i--)
{
a[i]=b[--k];
}
}
void mergesort(int a[],int p,int r,int size)
{
int mid;
if(p<r)
{
mid=(int)floor((p+r)/2);
mergesort(a,p,mid,size);
mergesort(a,mid+1,r,size);
merge(a,p,mid,r,size);
}
}
int partition(int a[],int p,int r)
{
int i,j,pivot,temp;
pivot=a[p];
i=p;
j=r;
while(1)
{
while((a[i]<pivot)&&(a[i]!=pivot))
{
i++;
}
while((a[j]>pivot)&&(a[j]!=pivot))
{
j--;
}
if(i<j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
else
{
return j;
}
}
}
void quicksort(int a[],int p,int r)
{
if(p<r)
{
int q;
q=partition(a,p,r);
quicksort(a,p,q);
quicksort(a,q+1,r);
}
}
int main()
{
int a[100],i,j,size,ch;
printf("\nEnter the size of array: ");
scanf("%d",&size);
do
{
printf("\n\n..MENU..\n1. Merge Sort\n2. Quick Sort\n3. Exit\n\nEnter your choice: ");
scanf("%d",&ch); switch(ch)
{
case 1: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
mergesort(a,1,size,size);
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
break;
case 2: enterelements(a,size);
printf("\nUnsorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
quicksort(a,1,size);
printf("\nSorted elements are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
break;
case 3: exit(0);
default:printf("\nWrong choice!");
}
}while(1);
}

C program for Linear search and Binary search

2016-11-11T04:55:00.000-08:00

#include <stdio.h>
#include <stdlib.h>
void enterelements(int a[],int size)
{
int i;
for(i=1;i<=size;i++)
{
printf("\nEnter element%d: ",i);
scanf("%d",&a[i]);
}
}
void linear_search(int a[],int item,int size)
{
int flag=0,i;
for(i=0;i<=size;i++)
{
if(a[i]==item)
{
printf("\nElement found at position %d",i);
flag=1;
}
}
if(flag==0)
{
printf("\nElement not found!");
}
}
void binary_search(int a[],int item,int size)
{
int i=0,mid,l=1,u=size+1,flag=0;
while((flag!=1)&&(i<=u))
{
mid=(l+u)/2;
if(a[mid]==item)
{
printf("\nElement found at position %d",mid);
flag=1;
}
if(item<mid)
{
u=mid-1;
}
else
{
l=mid+1;
}
i++;
}
if(flag==0)
{
printf("\nElement not found!");
}
}
int main()
{
int a[100],i,j,size,ch,item;
printf("\nEnter the size of array: ");
scanf("%d",&size);
enterelements(a,size);
printf("\nElements in array are: ");
i=1;
while(i<=size)
{
printf(" %d",a[i]);
i=i+1;
}
do
{
printf("\n\n..MENU..\n1. Linear Search\n2. Binary Search\n3. Exit\n\nEnter your choice: ");
scanf("%d",&ch); switch(ch)
{
case 1: printf("\nEnter the item to be searched: ");
scanf("%d",&item);
linear_search(a,item,size);
break;
case 2: printf("\nEnter the item to be searched: ");
scanf("%d",&item);
binary_search(a,item,size);
break;
case 3: exit(0);
default:printf("\nWrong choice!");
}
}while(1);
}

C program for Graph Traversals: DFS and BFS

2016-11-11T04:53:00.000-08:00

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
int push(int s[],int top,int item)
{
top=top+1;
s[top]=item;
return top;
}
int pop(int s[],int *top)
{
int i;
i=s[*top];
*top=*top-1;
return i;
}
int check(int visit[],int item)
{
int i=0;
while(i<100)
{
if(visit[i]==item)
{
return 1;
}
i++;
}
return 0;
}
void enq(int open2[],int item,int *front,int *rear)
{
if((*front==-1)&&(*rear==-1))
{
*front=*front+1;
*rear=*rear+1;
open2[*front]=item;
}
else
{
*rear=*rear+1;
open2[*rear]=item;
}
}
int dq(int open2[],int *front,int *rear)
{
int i;
i=open2[*front];
if(*front==*rear)
{
*front=-1;
*rear=-1;
}
else
{
*front=*front+1;
}
return i;
}
void bfs(int g[][20],int n)
{
int k=0,q=0,i=0,j=0,visit2[100],front=-1,rear=-1,open2[100],item;
while(i<100)
{
visit2[i]=0;
i++;
}
enq(open2,1,&front,&rear);
while(front!=-1)
{
item=dq(open2,&front,&rear);
i=check(visit2,item);
if(!i)
{
printf(" %d",item);
visit2[j]=item;
j++;
for(k=1;k<=n;k++)
{
if(g[item][k]==1)
{
enq(open2,k,&front,&rear);
}
}
}
}
}
void dfs(int g[][20],int n)
{
int k=0,q=0,i=0,j=0,visit1[100],top=-1,open1[100],item;
while(i<100)
{
visit1[i]=0;
i++;
}
top=push(open1,top,1);
while(top!=-1)
{
item=pop(open1,&top);
i=check(visit1,item);
if(!i)
{
printf(" %d",item);
visit1[j]=item;
j++;
for(k=1;k<=n;k++)
{
if(g[item][k]==1)
{
top=push(open1,top,k);
}
}
}
}
}
int main()
{
int i,j,n,g[20][20];
char op;
printf("\nEnter the number of vertices: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("\nIs %d neigbour of %d (Y/N)",i,j);
fflush(stdin);
scanf("%c",&op);
if((op=='Y')||(op=='y'))
{
g[i][j]=1;
}
else
{
g[i][j]=0;
}
}
}
printf("\n\nDFS: ");
dfs(g,n);
printf("\n\nBFS: ");
bfs(g,n);
getch();
}

C program for Maze Problem

2016-11-11T04:51:00.000-08:00

#include <stdio.h>
int flag=0;
void jump(int maze[][6],int visit [][6],int i,int j,int endi,int endj)
{
        if((i>=0&&i<=5)&&(j>=0&&j<=5))
        {
           if(visit[i][j]==0 && maze[i][j]==0)
           {
              visit[i][j]=1;
              if((endi==i)&&(endj==j))
                 flag=1;
              jump(maze,visit,i-1,j-1,endi,endj);
              jump(maze,visit,i-1,j,endi,endj);                                                
              jump(maze,visit,i-1,j+1,endi,endj);
              jump(maze,visit,i,j-1,endi,endj);
              jump(maze,visit,i,j+1,endi,endj);
              jump(maze,visit,i+1,j-1,endi,endj);
              jump(maze,visit,i+1,j,endi,endj);
              jump(maze,visit,i+1,j+1,endi,endj);
           }                                      
        }
}
int main()
{
   int i=0,j=0,endi,endj,visit[6][6];
   char ch;
   int maze[6][6]={{0,1,0,1,1,1},{1,0,1,1,0,0},{1,0,1,1,1,1},{1,1,0,0,1,0},{1,0,1,0,1,1},{0,0,0,1,0,0}};
   
   for(i=0;i<6;i++)
   {
      printf("\n");
      for(j=0;j<6;j++)
         printf("%d ",maze[i][j]);
   }
   do
   {
      flag=0;
      for(i=0;i<6;i++)
      {
         for(j=0;j<6;j++)
         visit[i][j]=0;
      }
      printf("\n\nEnter the starting location i: ");
      scanf("%d",&i);
      printf("\nEnter the starting location j: ");
      scanf("%d",&j);
      printf("\nEnter the end location i: ");
      scanf("%d",&endi);
      printf("\nEnter the end location j: ");
      scanf("%d",&endj);
      jump(maze,visit,i,j,endi,endj);
      if(flag==0)
         printf("\nNo path exist!");
      else
         printf("\nPath exists");
      printf("\nDo you want to continue (Y/N)?");
      fflush(stdin);
      scanf("%c",&ch);
   }while(ch!='n');
}

Binary tree using array

2016-11-04T06:40:00.000-07:00

#include <stdio.h>
#include <stdlib.h>
void build_tree(int tree[],int index)
{

char op1,op2;
if(index!=0)
{
printf("\nEnter the element: ");
scanf("%d",&tree[index]);
printf("\nCreate left node? (Y/N)");
fflush(stdin);
scanf("%c",&op1);
if ((op1=='Y')||(op1=='y'))
{
build_tree(tree,2*index);
}
else
{
build_tree(tree,0);
}
printf("\nCreate right node? (Y/N)");
fflush(stdin);
scanf("%c",&op2);
if ((op2=='Y')||(op2=='y'))
{
build_tree(tree,2*index+1);
}
else
{
build_tree(tree,0);
}
}
}
void tree_traversal(int tree[],int index)
{
if(tree[index]!=0)
{
printf("%d ",tree[index]);
tree_traversal(tree,2*index);
tree_traversal(tree,2*index+1);
}
}
int search_tree(int tree[],int item)
{
int i;
for(i=0;i<100;i++)
{
if(tree[i]==item)
{
return i;
break;
}
}
return 0;
}
void insert_tree(int tree[],int parent)
{
char opt;
int ptr,el;
ptr=search_tree(tree,parent);
if(ptr==0)
{
printf("\nElement not found!");
}
else
{
if((tree[ptr*2]==0)||(tree[ptr*2+1]==0))
{
printf("\nInsert as Left/Right child? (L/R)");
fflush(stdin);
scanf("%c",&opt);
if ((opt=='L')||(opt=='l'))
{
if(tree[ptr*2]==0)
{
printf("\nEnter the element: ");
scanf("%d",&tree[ptr*2]);
}
else
{
printf("\nInsertion not possible!");
}
}
else
{
if(tree[ptr*2+1]==0)
{
printf("\nEnter the element: ");
scanf("%d",&tree[ptr*2+1]);
}
else
{
printf("\nInsertion not possible!");
}
}
}
else
{
printf("\nInsertion not possible!");
}
}
}
int search_parent(int tree[],int item)
{
int i;
for(i=0;i<100;i++)
{
if(tree[i]==item)
{
if(i%2==0)
{
return i/2;
}
else
{
return (i-1)/2;
}
}
}
return 0;
}
void delete_tree(int tree[],int leaf)
{
int ptr,ptr1,ptr2;
ptr=search_parent(tree,leaf);
if(ptr==0)
{
printf("\nDeletion not possible!");
}
else
{
ptr1=ptr*2;
ptr2=ptr*2+1;
if(tree[ptr1]==leaf)
{
if((tree[ptr1*2]==0)&&(tree[ptr1*2+1]==0))
{
tree[ptr1]=0;
}
else
{
printf("\nDeletion not possible!");
}
}
if(tree[ptr2]==leaf)
{
if((tree[ptr2*2]==0)&&(tree[ptr2*2+1]==0))
{
tree[ptr2]=0;
}
else
{
printf("\nDeletion not possible!");
}
}
}
}
int main ()
{
int tree[100],i,j,item,parent,leaf,ch;
for(i=0;i<100;i++)
{
tree[i]=0;
}
printf("\nArray");
build_tree(tree,1);
tree_traversal(tree,1);
do
{
printf("\n\n..MENU..\n1. Insert an element.\n2. Delete a leaf.\n3. Traversal\n4. Exit\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\nEnter a parent node: ");
fflush(stdin);
scanf("%d",&parent);
insert_tree(tree,parent);
break;
case 2: printf("\nEnter a leaf node: ");
fflush(stdin);
scanf("%d",&leaf);
delete_tree(tree,leaf);
break;
case 3: tree_traversal(tree,1);
break;
case 4: exit(0);
default: printf("\nWrong choice");
}
}
while(1);
}

Binary Tree using Linked List

2016-10-25T07:21:00.000-07:00

#include <stdlib.h>
#include <stdio.h>
struct node
{
int data;
struct node *lc;
struct node *rc;
};
void build_tree (struct node * ptr)
{
char op1,op2;
if(ptr!=NULL)
{
printf("\nEnter the element: ");
scanf("%d",&ptr->data);
printf("\nCreate left node? (Y/N)");
fflush(stdin);
scanf("%c",&op1);
if ((op1=='Y')||(op1=='y'))
{
struct node *lcptr;
lcptr=(struct node *)malloc(sizeof(struct node));
ptr->lc=lcptr;
build_tree(lcptr);
}
else
{
struct node *lcptr;
lcptr=(struct node *)malloc(sizeof(struct node));
ptr->lc=NULL;
lcptr=NULL;
build_tree(lcptr);
}
printf("\nCreate right node? (Y/N)");
fflush(stdin);
scanf("%c",&op2);
if ((op2=='Y')||(op2=='y'))
{
struct node *rcptr;
rcptr=(struct node *)malloc(sizeof(struct node));
ptr->rc=rcptr;
build_tree(rcptr);
}
else
{
struct node *rcptr;
rcptr=(struct node *)malloc(sizeof(struct node));
ptr->rc=NULL;
rcptr=NULL;
build_tree(rcptr);
}
}
}
void traversal(struct node * ptr)
{
if(ptr!=NULL)
{
printf("%d ",ptr->data);
traversal(ptr->lc);
traversal(ptr->rc);
}
};
struct node * search_parent(struct node *ptr,int item,struct node *check)
{
if(ptr!=NULL)
{
if((ptr->lc!=NULL)||(ptr->rc!=NULL))
{
if(ptr->lc!=NULL)
{
if(ptr->lc->data==item)
{
check=ptr;
return check;
}
}
if(ptr->rc!=NULL)
{
if(ptr->rc->data==item)
{
check=ptr;
return check;
}
}
}
}
if(check!=NULL)
{
return check;
}
if(ptr==NULL)
{
return NULL;
}
check=search_parent(ptr->lc,item,check);
check=search_parent(ptr->rc,item,check);
return check;
}
struct node *search_tree(struct node *ptr,int key,struct node *check)
{
if(ptr!=NULL)
{
if(ptr->data==key)
{
check=ptr;
return check;
}
}
if(check!=NULL)
{
return check;
}
if(ptr==NULL)
{
return NULL;
}
check=search_tree(ptr->lc,key,check);
check=search_tree(ptr->rc,key,check);
return check;
}
void insert_tree(struct node * root, int item)
{
struct node * ptr;
ptr=search_tree(root,item,NULL);
char opt;
if(ptr==NULL)
{
printf("\nElement not found! ");
exit (0);
}
if((ptr->lc==NULL)||(ptr->rc==NULL))
{
printf("\nInsert as Left/Right child? (L/R)");
fflush(stdin);
scanf("%c",&opt);
if ((opt=='L')||(opt=='l'))
{
if(ptr->lc==NULL)
{
struct node *newnode=(struct node *)malloc(sizeof(struct node));
ptr->lc=newnode;
printf("\nEnter the element: ");
scanf("%d",&newnode->data);
newnode->lc=NULL;
newnode->rc=NULL;
}
else
{
printf("\nInsertion not possible at left child!");
}
}
else
{
if(ptr->rc==NULL)
{
struct node *newnode=(struct node *)malloc(sizeof(struct node));
ptr->rc=newnode;
printf("\nEnter the element: ");
scanf("%d",&newnode->data);
newnode->lc=NULL;
newnode->rc=NULL;
}
else
{
printf("\nInsertion not possible at right child!");
}
}
}
else
{
printf("\nInsertion not possible");
}
}
void delete_leaf(struct node *root, int item)
{
struct node *parent,*ptr1,*ptr2;
if(root==NULL)
{
printf("\nTree is empty, Deletion not possible");
}
parent=search_parent(root,item,NULL);
if (parent==NULL)
{
printf("\nElement not found");
}
if(parent!=NULL)
{
ptr1=parent->lc;
ptr2=parent->rc;
if(ptr1!=NULL)
{
if(ptr1->data==item)
{
if((ptr1->lc==NULL)&&(ptr1->rc==NULL))
{
parent->lc=NULL;
}
else
{
printf("\nNode is not a leaf node!");
}
}
}
if(ptr2!=NULL)
{
if(ptr2->data==item)
{
if((ptr2->lc==NULL)&&(ptr2->rc==NULL))
{
parent->rc=NULL;
}
else
{
printf("\nNode is not a leaf node!");
}
}
}
}
else
{
printf("\nNo such node exist in tree!");
}
}
int main()
{
struct node *root,*search=NULL;
root=(struct node *)malloc(sizeof(struct node));
root->lc=NULL;
root->rc=NULL;
int item,ch,parent,leaf;
build_tree(root);
traversal(root);
do
{
printf("\n\n..MENU..\n1. Insert an element.\n2. Delete a leaf.\n3. Traversal\n4. Exit\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\nEnter a parent node: ");
fflush(stdin);
scanf("%d",&parent);
insert_tree(root,parent);
break;
case 2: printf("\nEnter a leaf node: ");
fflush(stdin);
scanf("%d",&leaf);
delete_leaf(root,leaf);
break;
case 3: traversal(root);
break;
case 4: exit(0);
default: printf("\nWrong choice");
}
}
while(1);
}

Application of Linked List - Polynomial addition and subtraction

2016-09-30T09:07:00.000-07:00

#include<stdio.h>
#include<conio.h>
#inlcude<stdlib.h>
struct poly
{
int c,e;
struct poly *next;
};
struct poly * read_poly(struct poly *header)
{
struct poly *p,*temp;
char ch;
printf("\nDo you want to create a node (y/n) : ");
scanf("%c",&ch);
header->c=NULL;
header->e=NULL;
header->next=NULL;
printf("%c",ch);
while(ch!='n')
{
p=(struct poly *)malloc(sizeof(struct poly));
printf("\nEnter the coefficient value : ");
scanf("%d",&p->c);
printf("\nEnter the exponential value : ");
scanf("%d",&p->e);
p->next=NULL;
if(header->next==NULL)
{
header->next=p;
temp=p;
}
else
{
temp->next=p;
temp=p;
}
printf("\nDo you want to create a node (y/n) : ");
getchar();
scanf("%c",&ch);
}
return header;
}
struct poly * poly_add(struct poly *p,struct poly *q,struct poly *r)
{
p=p->next;
q=q->next;
struct poly *newnode,*temp;
r->next=NULL;
while((p!=NULL)&&(q!=NULL))
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
if(p->e==q->e)
{
newnode->c=p->c+q->c;
//printf("newnode c %d",newnode->c);
newnode->e=p->e;
p=p->next;
q=q->next;
}
else if(p->e>q->e)
{
newnode->c=p->c;
newnode->e=p->e;
p=p->next;
}
else
{
newnode->c=q->c;
newnode->e=q->e;
q=q->next;
}
if(r->next==NULL)
{
r->next=newnode;
temp=newnode;
}
else
{
temp->next=newnode;
temp=newnode;
}
}
if(p!=NULL)
{
while(p!=NULL)
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
newnode->c=p->c;
newnode->e=p->e;
temp->next=newnode;
temp=newnode;
p=p->next;
}
}
if(q!=NULL)
{
while(q!=NULL)
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
newnode->c=q->c;
newnode->e=q->e;
temp->next=newnode;
temp=newnode;
q=q->next;
}
}
}
struct poly * poly_sub(struct poly *p,struct poly *q,struct poly *r)
{
p=p->next;
q=q->next;
struct poly *newnode,*temp;
r->next=NULL;
while((p!=NULL)&&(q!=NULL))
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
if(p->e==q->e)
{
newnode->c=p->c-q->c;
newnode->e=p->e;
p=p->next;
q=q->next;
}
else if(p->e>q->e)
{
newnode->c=p->c;
newnode->e=p->e;
p=p->next;
}
else
{
newnode->c=q->c;
newnode->e=q->e;
q=q->next;
}
if(r->next==NULL)
{
r->next=newnode;
temp=newnode;
}
else
{
temp->next=newnode;
temp=newnode;
}
}
if(p!=NULL)
{
while(p!=NULL)
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
newnode->c=p->c;
newnode->e=p->e;
temp->next=newnode;
temp=newnode;
p=p->next;
}
}
if(q!=NULL)
{
while(q!=NULL)
{
newnode=(struct poly *)malloc(sizeof(struct poly));
newnode->next=NULL;
newnode->c=q->c;
newnode->e=q->e;
temp->next=newnode;
temp=newnode;
q=q->next;
}
}
}
void traverse(struct poly *header)
{
struct poly *ptr=header->next;
while(ptr!=NULL)
{
printf(" %dX%d",ptr->c,ptr->e);
ptr=ptr->next;
}
}
int main()
{
//struct poly *header=(struct poly *)malloc(sizeof(struct poly));
//header->next=NULL;
int ch;
struct poly *p,*q,*r;
p=(struct poly *)malloc(sizeof(struct poly));
q=(struct poly *)malloc(sizeof(struct poly));
r=(struct poly *)malloc(sizeof(struct poly));

printf("\n Enter polynomial P : ");
p=read_poly(p);
traverse(p);
printf("\n Enter polynomial Q : ");
getchar();
q=read_poly(q);
traverse(q);
do
{
printf("\n MENU ");
printf("\n 1.Polynomial Addition ");
printf("\n 2.Polynomial Subtraction ");
printf("\n 3.Exit ");
printf("\n Enter your choice..... ");
scanf("%d",&ch);

switch(ch)
{
case 1 : poly_add(p,q,r);
traverse(r);
break;
case 2 : poly_sub(p,q,r);
traverse(r);
break;
case 3 : exit(0);
}

}while(ch!=4);
getchar();
}

OUTPUT :

Enter polynomial P :