Showing posts with label Array. Show all posts
Showing posts with label Array. Show all posts

Write a program to Implement a Linked List in C++

The user is provided with the following options..



To insert an item at begining

To insert an item at end

To insert an item at position

To traverse the list

To delete first item

To delete last item

To delete item from position

To count no. of items in list





Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<conio.h>

  2. #include<stdio.h>

  3. #include<alloc.h>

  4. #include<process.h>

  5. struct node

  6. { int info;

  7. struct node *next;

  8. };


  10. typedef struct node sn;


  12. void insertatbeg(sn **,int);

  13. void insertatend(sn **,int);

  14. void insertatpos(sn **,int,int);

  15. void traverse(sn *);

  16. int delfirst(sn *);

  17. int dellast(sn *);

  18. int delpos(sn *,int);

  19. int count(sn *);

  20. //Coding by: Snehil Khanor

  21. //http://WapCPP.blogspot.com

  22. void main()

  23. { sn *p;

  24. int n,i,l;

  25. char ch;

  26. clrscr();

  27. p=NULL;

  28. do

  29. { printf("\n-----select an operation-----");

  30. printf("\n1->To insert an item at begining<-");

  31. printf("\n2->To insert an item at end<-");

  32. printf("\n3->To insert an item at position<-");

  33. printf("\n4->To traverse the list<-");

  34. printf("\n5->To delete first item<-");

  35. printf("\n6->To delete last item<-");

  36. printf("\n7->To delete item from position<-");

  37. printf("\n8->To count no. of items in list<-");

  38. printf("\n9->Exit<-");

  39. printf("\n->Enter your choice:");

  40. scanf("%d",&n);

  41. switch(n)

  42. { case 1:printf("\n->Enter the item to insert");

  43. scanf("%d",&i);

  44. insertatbeg(&p,i);

  45. break;

  46. case 2:printf("\n->Enter the item to insert");

  47. scanf("%d",&i);

  48. insertatend(&p,i);

  49. break;

  50. case 3:printf("\n->Enter the item to insert");

  51. scanf("%d",&i);

  52. printf("\n->Enter the position");

  53. scanf("%d",&l);

  54. insertatpos(&p,i,l);

  55. break;

  56. case 4:traverse(p);

  57. break;

  58. case 5:i=delfirst(p);

  59. printf("\nItem deleted is %d.",i);

  60. break;

  61. case 6:i=dellast(p);

  62. printf("\nItem deleted is %d.",i);

  63. break;

  64. case 7:printf("\n->Enter the position");

  65. scanf("%d",&l);

  66. i=delpos(p,l);

  67. printf("\nItem deleted is %d.",i);

  68. break;

  69. case 8:i=count(p);

  70. printf("\nNumber of nodes in list are %d.",i);

  71. break;

  72. case 9:exit(0);

  73. break;

  74. default:printf("\n->You have entered wrong choice");

  75. }

  76. printf("\n->Do you want to continue/exit(y/n)");

  77. fflush(stdin);

  78. scanf("%c",&ch);

  79. } while((ch=='y')||(ch=='Y'));

  80. getch();

  81. }


  83. int count(sn *p)

  84. { sn *temp;

  85. int c=1;

  86. temp=p;

  87. while((temp->next)!=NULL)

  88. { c++;

  89. temp=temp->next;

  90. }

  91. return c;

  92. }


  94. void insertatbeg(sn **p,int item)

  95. { sn *ptr;

  96. ptr=(sn *)malloc(sizeof(sn));

  97. ptr->info=item;

  98. if(*p==NULL)

  99. ptr->next=NULL;

  100. else

  101. ptr->next=*p;

  102. *p=ptr;

  103. }


  105. void insertatend(sn **p,int item)

  106. { sn *ptr,*temp;

  107. ptr=(sn *)malloc(sizeof(sn));

  108. ptr->info=item;

  109. ptr->next=NULL;

  110. if(*p==NULL)

  111. *p=ptr;

  112. else

  113. { temp=*p;

  114. while((temp->next)!=NULL)

  115. temp=temp->next;

  116. temp->next=ptr;

  117. }

  118. }


  120. void insertatpos(sn **p,int item,int loc)

  121. { sn *ptr,*temp,*s;

  122. int i,c;

  123. temp=*p;

  124. ptr=(sn *)malloc(sizeof(sn));

  125. ptr->info=item;

  126. c=count(*p);

  127. if(loc>c)

  128. printf("\nList is short,Item can't inserted");

  129. else

  130. {

  131. for(i=0;i<loc-1;i++)

  132. { s=temp;

  133. temp=temp->next;

  134. }

  135. ptr->next=s->next;

  136. s->next=ptr;

  137. }

  138. }


  140. //Coding by: Snehil Khanor

  141. //http://WapCPP.blogspot.com

  142. void traverse(sn *p)

  143. { sn *temp;

  144. if(p==NULL)

  145. printf("\nList is empty.");

  146. else

  147. {

  148. temp=p;

  149. while((temp->next)!=NULL)

  150. { printf("\nno.=%d",temp->info);

  151. temp=temp->next;

  152. }

  153. printf("\nno.=%d",temp->info);

  154. }

  155. }


  157. int delfirst(sn *p)

  158. { int item;

  159. sn *temp;

  160. if(p==NULL)

  161. { printf("\nList is empty");

  162. return 0;

  163. }

  164. else

  165. { temp=p;

  166. p=p->next;

  167. item=temp->info;

  168. free(temp);

  169. return item;

  170. }

  171. }


  173. int dellast(sn *p)

  174. { int item;

  175. sn *temp,*s;

  176. if(p==NULL)

  177. { printf("\nList is empty");

  178. return 0;

  179. }

  180. else

  181. { temp=p;

  182. while((temp->next)!=NULL)

  183. { s=temp;

  184. temp=temp->next;

  185. }

  186. item=temp->info;

  187. s->next=NULL;

  188. free(temp);

  189. return item;

  190. }

  191. }


  193. int delpos(sn *p,int loc)

  194. { int item,i,c;

  195. sn *temp,*s;

  196. c=count(p);

  197. if(p==NULL)

  198. { printf("\nList is empty");

  199. return 0;

  200. }

  201. else

  202. { if(loc>c)

  203. { printf("\nItem is not in list.");

  204. return 0;

  205. }

  206. else

  207. { temp=p;

  208. for(i=0;i<loc-1;i++)

  209. { s=temp;

  210. temp=temp->next;

  211. }

  212. item=temp->info;

  213. s->next=temp->next;

  214. free(temp);

  215. return item;

  216. }

  217. }

  218. }


Tags: , , , , , , , , , , , , , , , , , , ,

Write a program to Implement a Queue in C++

User is asked to Insert into.. Delete from or Display the entire queue..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<stdio.h> 

  2. #include<conio.h> 

  3. #include<process.h> 

  4. int queue[5]; 

  5. long front,rear; 

  6. void initqueue(); 

  7. void display(); 

  8. void main() 

  9. { 

  10. int choice,info; 

  11. clrscr(); 

  12. while(1) 

  13. { 

  14. clrscr(); 

  15. printf(" MENU \n"); 

  16. printf("1.Insert an element in queue\n"); 

  17. printf("2.Delete an element from queue\n"); 

  18. printf("3.Display the queue\n"); 

  19. printf("4.Exit!\n"); 

  20. printf("Your choice: "); 

  21. scanf("%i",&choice); 

  22. //Coding by: Snehil Khanor  

  23. //http://WapCPP.blogspot.com  

  24. switch(choice) 

  25. { 

  26. case 1:if(rear<4) 

  27. { 

  28. printf("enter the number: "); 

  29. scanf("%d",&info); 

  30. if (front==-1) 

  31. { 

  32. front=0; 

  33. rear=0; 

  34. } 

  35. else 

  36. rear=rear+1; 

  37. queue[rear]=info; 

  38. } 

  39. else 

  40. printf("queue is full"); 

  41. getch(); 

  42. break; 

  43. case 2: int info; 

  44. if(front!=-1) 

  45. { 

  46. info=queue[front]; 

  47. if(front==rear) 

  48. { 

  49. front=-1; 

  50. rear=-1; 

  51. } 

  52. else 

  53. front=front+1; 

  54. printf("no deleted is = %d",info); 

  55. } 

  56. else 

  57. printf("queue is empty"); 

  58. getch(); 

  59. break; 

  60. case 3: display(); 

  61. getch(); 

  62. break; 

  63. case 4: exit(1); 

  64. break; 

  65. default:printf("You entered wrong choice!"); 

  66. getch(); 

  67. break; 

  68. } 

  69. } 

  70. } 

  71. void initqueue() 

  72. { 

  73. front=rear=-1; 

  74. } 

  75. void display() 

  76. { 

  77. int i; 

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

  79. printf("%i\n",queue[i]); 

  80. } 

Tags: , , , , , , , , , , , , , , , , , , ,

Write a program to Implement a stack in C++

User is asked to PUSH, POP , or TRAVERSE.. PUSH is to add items to the Stack, POP is to remove item from the Stack, and TRAVERSE is to traverse the whole Stack

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<stdio.h> 

  2. #include<conio.h> 

  3. #include<process.h> 

  4. #define MAXSIZE 10 

  5. void push(); 

  6. int pop(); 

  7. void traverse(); 

  8. int stack[MAXSIZE]; 

  9. int Top=-1; 

  10. void main() 

  11. { 

  12. int choice; 

  13. char ch; 

  14. do 

  15. { 

  16. clrscr(); 

  17. printf("\n1. PUSH "); 

  18. printf("\n2. POP "); 

  19. printf("\n3. TRAVERSE "); 

  20. printf("\nEnter your choice "); 

  21. scanf("%d",&choice); 

  22. switch(choice) 

  23. { 

  24. case 1: push(); 

  25. break; 

  26. case 2: printf("\nThe deleted element is %d ",pop()); 

  27. break; 

  28. case 3: traverse(); 

  29. break; 

  30. default: printf("\nYou Entered Wrong Choice"); 

  31. } 

  32. printf("\nDo You Wish To Continue (Y/N)"); 

  33. fflush(stdin); 

  34. scanf("%c",&ch); 

  35. } 

  36. while(ch=='Y' || ch=='y'); 

  37. } 

  38. //Coding by: Snehil Khanor  

  39. //http://WapCPP.blogspot.com  

  40. void push() 

  41. { 

  42. int item; 

  43. if(Top == MAXSIZE - 1) 

  44. { 

  45. printf("\nThe Stack Is Full"); 

  46. getch(); 

  47. exit(0); 

  48. } 

  49. else 

  50. { 

  51. printf("Enter the element to be inserted "); 

  52. scanf("%d",&item); 

  53. Top= Top+1; 

  54. stack[Top] = item; 

  55. } 

  56. } 

  57.  

  58. int pop() 

  59. { 

  60. int item; 

  61. if(Top == -1) 

  62. { 

  63. printf("The stack is Empty"); 

  64. getch(); 

  65. exit(0); 

  66. } 

  67. else 

  68. { 

  69. item = stack[Top]; 

  70. Top = Top-1; 

  71. } 

  72. return(item); 

  73. } 

  74.  

  75. void traverse() 

  76. { 

  77. int i; 

  78. if(Top == -1) 

  79. { 

  80. printf("The Stack is Empty"); 

  81. getch(); 

  82. exit(0); 

  83. } 

  84. else 

  85. { 

  86. for(i=Top;i>=0;i--) 

  87. { 

  88. printf("Traverse the element "); 

  89. printf("%d\n",stack[i]); 

  90. } 

  91. } 

  92. } 

Tags: , , , , , , , , , , , , , , ,

Write a program to sort elements of array using Selection Sorting

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<stdio.h> 

  2. #include<conio.h> 

  3. void main() 

  4. { 

  5. int a[100],n,i,j,temp,loc,min; 

  6. clrscr(); 

  7. printf("\How many elements:\n"); 

  8. scanf("%d",&n); 

  9. printf("Enter the element of array\n"); 

  10. for(i=0;i<=n-1;i++) 

  11. { 

  12. scanf("%d",&a[i]); 

  13. } 

  14. min=a[0]; 

  15. //Coding by: Snehil Khanor  

  16. //http://WapCPP.blogspot.com  

  17. for(i=0;i<=n-1;i++) 

  18. { 

  19. min=a[i]; 

  20. loc=i; 

  21. for(j=i+1;j<=n-1;j++) 

  22. { 

  23. if(a[j]<min) 

  24. { 

  25. min=a[j]; 

  26. loc=j; 

  27. } 

  28. } 

  29. if(loc!=1) 

  30. { 

  31. temp=a[i]; 

  32. a[i]=a[loc]; 

  33. a[loc]=temp; 

  34. } 

  35.  

  36. } 

  37. printf("The number after selection sorting are:\n"); 

  38. for(i=0;i<=n-1;i++) 

  39. { 

  40. printf("%d\n",a[i]); 

  41. } 

  42. getch(); 

  43. } 


Tags: , , , , , , , , , , , , , ,

Write a program to sort elements of array using Quick Sort

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<stdio.h> 

  2. #include<conio.h> 

  3. #define max 100 

  4. int a[max],n,i,l,h; 

  5. void main() 

  6. { 

  7. void input(void); 

  8. input(); 

  9. getch(); 

  10. } 

  11.  

  12. void input(void) 

  13. { 

  14. void output(int a[],int n); 

  15. void quick_sort(int a[],int l,int h); 

  16. printf("How many elements in the array : "); 

  17. scanf("%d",&n); 

  18. printf("\n"); 

  19. printf("Enter the elemennts : \n"); 

  20. for(i=0;i<=n-1;i++) 

  21. { 

  22. scanf("%d",&a[i]); 

  23. } 

  24. l=0; 

  25. h=n-1; 

  26. quick_sort(a,l,h); 

  27. printf("Sorted Array :\n "); 

  28. output(a,n); 

  29. } 

  30.  

  31. void quick_sort(int a[],int l, int h) 

  32. { 

  33. int temp,key,low,high; 

  34. low=l; 

  35. high=h; 

  36. key=a[(low+high)/2]; 

  37. do 

  38. { 

  39. while(key>a[low]) 

  40. { 

  41. low++; 

  42. } 

  43. while(key<a[high]) 

  44. { 

  45. high--; 

  46. } 

  47. if(low<=high) 

  48. { 

  49. temp=a[low]; 

  50. a[low++]=a[high]; 

  51. a[high--]=temp; 

  52. } 

  53. //Coding by: Snehil Khanor 

  54. //http://WapCPP.blogspot.com 

  55. } while(low<=high); 

  56. if(l<high) 

  57. quick_sort(a,l,high); 

  58. if(low<h) 

  59. quick_sort(a,low,h); 

  60. } 

  61. void output(int a[],int n) 

  62. { 

  63. for(i=0;i<=n-1;i++) 

  64. { 

  65. printf("%d\n",a[i]); 

  66. } 

  67. }

Tags: , , , , , , , , , , , , ,

Write a program to sort elements of array using Insert Sorting

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<stdio.h> 

  2. main() 

  3. { 

  4. int a[100],n,k,i,j,temp; 

  5. printf("How many elements: \n"); 

  6. scanf("%d",&n); 

  7. printf("Enter the element of array: \n"); 

  8. for(i=0;i<=n-1;i++) 

  9. scanf("%d",&a[i]); 

  10. for(k=1;k<=n-1;k++) 

  11. { 

  12. temp=a[k]; 

  13. j=k-1; 

  14. //Coding by: Snehil Khanor 

  15. //http://WapCPP.blogspot.com 

  16. while((temp<a[j])&&(j>=0)) 

  17. { 

  18. a[j+1]=a[j]; 

  19. j=j-1; 

  20. } 

  21. a[j+1]=temp; 

  22. } 

  23. printf("Elements of array after sorting: \n"); 

  24. for(i=0;i<=n-1;i++) 

  25. printf("%d\n",a[i]); 

  26. getch();

  27. } 

Tags: , , , , , , , , , , , , , ,

Memory Allocation example for Double Pointer of a class

The following program should be self explanatory:



//Program tested on Microsoft Visual Studio 2008 - Zahid Ghadialy
//Program to demonstrate memory allocation to double pointers
#include<iostream>

using namespace std;

//Class named NewClass
class NewClass
{
public:
  int a;
  int* b;
  void* c;
};

//List Structure containing multiple NewClass objects
struct NewClassList
{
  int numOfObjects;
  NewClass** Objects;
};

int main()
{
  //Create NewClassList with 4 objects with following values:
  //1, 10, 100; 2, 20; 200; 3, 30, 300; 4, 40, 400;
  NewClassList someList;
  someList.numOfObjects = 4;
  //someList.Objects = new NewClass*; //1. Common mistake in allocating memory
  someList.Objects = new NewClass*[someList.numOfObjects];

  someList.Objects[0] = new NewClass;
  someList.Objects[0]->a = 1;
  someList.Objects[0]->b = new int(10);
  someList.Objects[0]->c = (void*) new int(100);

  someList.Objects[1] = new NewClass;
  someList.Objects[1]->a = 2;
  someList.Objects[1]->b = new int(20);
  someList.Objects[1]->c = (void*) new int(200);

  someList.Objects[2] = new NewClass;
  someList.Objects[2]->a = 3;
  someList.Objects[2]->b = new int(30);
  someList.Objects[2]->c = (void*) new int(300);

  someList.Objects[3] = new NewClass;
  someList.Objects[3]->a = 4;
  someList.Objects[3]->b = new int(40);
  someList.Objects[3]->c = (void*) new int(400);

  //Printing the outputs
  for(int i = 0; i < someList.numOfObjects; i++)
  {
    cout<<"Iteration = "<<i;
    cout<<": a = "<<someList.Objects[i]->a;
    cout<<": b = "<<*(someList.Objects[i]->b);
    cout<<": c = "<<*((int*)someList.Objects[i]->c)<<endl;
  }

  //Clear all the memory allocation
  for(int i = 0; i < someList.numOfObjects; i++)
  {
    delete someList.Objects[i]->b;
    delete someList.Objects[i]->c;
    delete someList.Objects[i];
  }
  delete[] someList.Objects;
  return 0;
}




The output is as follows:
Tags: , , ,

The challenging 'Infinite loop' problem

Picked this one up from The C++ blog.

Consider the following program:



#include <iostream>

int main()
{
    int i;
    int array[4];
    for(i=0; i<=8; i++)
    {
        array[i]=0;
    }

  return 0;
}

Most people including myself expect this program to crash. This is not the case. The reason being the way everything is stored on stack. In simple representation, the storage is something like this:



So when i = 6, value of i is reset to 0 and the loop continues forever.

After digging some information on stack, heap, etc. I found some useful info in C++ in 24 hours:

Programmers generally deal with five areas of memory:
  • Global name space
  • The free store (a.k.a. Heap)
  • Registers
  • Code space
  • The stack

Local variables are on the stack, along with function parameters. Code is in code space, of course, and global variables are in global name space. The registers are used for internal housekeeping functions, such as keeping track of the top of the stack and the instruction pointer. Just about all remaining memory is given over to the free store, which is sometimes referred to as the heap.

The problem with local variables is that they don't persist. When the function returns, the local variables are thrown away. Global variables solve that problem at the cost of unrestricted access throughout the program, which leads to the creation of code that is difficult to understand and maintain. Putting data in the free store solves both of these problems.

You can think of the free store as a massive section of memory in which thousands of sequentially numbered cubbyholes lie waiting for your data. You can't label these cubbyholes, though, as you can with the stack. You must ask for the address of the cubbyhole that you reserve and then stash that address away in a pointer.

The stack is cleaned automatically when a function returns. All the local variables go out of scope, and they are removed from the stack. The free store is not cleaned until your program ends, and it is your responsibility to free any memory that you've reserved when you are done with it.

The advantage to the free store is that the memory you reserve remains available until you explicitly free it. If you reserve memory on the free store while in a function, the memory is still available when the function returns.

The advantage of accessing memory in this way, rather than using global variables, is that only functions with access to the pointer have access to the data. This provides a tightly controlled interface to that data, and it eliminates the problem of one function changing that data in unexpected and unanticipated ways.

For this to work, you must be able to create a pointer to an area on the free store and to pass that pointer among functions. The pointer is created using new and once you are done with it you can free the memory using delete.
Tags: , ,

Write a program to store Name, Age and address of student

Name age and address of students are stored in a string..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. #include<stdio.h>
  4. void main()
  5. {
  6. clrscr();
  7. char name[100],age[100],address[100];
  8. cout<<"Please enter a name: ";
  9. gets(name);
  10. cout<<"Please enter age: ";
  11. //Coding by: Snehil Khanor
  12. //http://WapCPP.blogspot.com
  13. gets(age);
  14. cout<<"Please eneter address: ";
  15. gets(address);
  16. cout<<endl<<endl<<"Name is: "<<name<<endl<<"Age is: "<<age<<endl<<"Address is:
  17. "<<address;
  18. getch();
  19. }
Tags: , , , ,

Write a program to count the number of vowels in a word

A word is taken from the user and number of vowels is determined..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. char str[10];
  7. int v=0;
  8. cout<<"Please enter a string: ";
  9. cin>>str;
  10. //Coding by: Snehil Khanor
  11. //http://WapCPP.blogspot.com
  12. for(int i=0;str[i]!='\0';i++)
  13. {
  14. if(str[i]=='a'||str[i]=='A'||str[i]=='e'||str[i]=='E'||str[i]=='i'||str[i]=='I'||str[i]=='o'||str[i]=='O'||str[i]=='u'||str[i]=='U')
  15. v++;
  16. }
  17. cout<<v<<" Number of Vowels are there.";
  18. getch();
  19. }
Tags: , , , , , ,

Write a program to find transpose of a matrix

A matrix is taken from user.. and its Transpose is displayed as output..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[10][10],m,n,i,j;
  7. cout<<"Enter number of rows: ";
  8. cin>>m;
  9. cout<<"Enter number of coloumns: ";
  10. cin>>n;
  11. //Coding by: Snehil Khanor
  12. //http://WapCPP.blogspot.com
  13. if(m!=n)
  14. {
  15. cout<<"Matrix not square so Transpose not possible :(";
  16. }
  17. else
  18. {
  19. cout<<endl<<"Enter elements of matrix: "<<endl;
  20. for(i=0;i<m;i++)
  21. {
  22. for(j=0;j<n;j++)
  23. {
  24. cout<<"Enter element a"<<i+1<<j+1<<": ";
  25. cin>>a[i][j];
  26. }
  27. }
  28. cout<<endl<<"Displaying Matrix: "<<endl<<endl;
  29. for(i=0;i<m;i++)
  30. {
  31. for(j=0;j<n;j++)
  32. {
  33. cout<<a[i][j]<<" ";
  34. }
  35. cout<<endl<<endl;
  36. }
  37. cout<<endl<<"Displaying Matrix Transpose: "<<endl<<endl;
  38. for(i=0;i<m;i++)
  39. {
  40. for(j=0;j<n;j++)
  41. {
  42. cout<<a[j][i]<<" ";
  43. }
  44. cout<<endl<<endl;
  45. }
  46. }
  47. getch();
  48. }
Tags: , , , , , ,

Write a program for multiplication of two matrices

Two matrices are taken from user..multiplication matrix is displayed as output.


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[10][10],b[10][10],c[10][10],m,n,o,p,i,j;
  7. cout<<"Enter number of rows of A: ";
  8. cin>>m;
  9. cout<<"Enter number of coloumns of A: ";
  10. cin>>n;
  11. cout<<endl<<"Enter elements of matrix A: "<<endl;
  12. //Coding by: Snehil Khanor
  13. //http://WapCPP.blogspot.com
  14. for(i=0;i<m;i++)
  15. {
  16. for(j=0;j<n;j++)
  17. {
  18. cout<<"Enter element a"<<i+1<<j+1<<": ";
  19. cin>>a[i][j];
  20. }
  21. }
  22. cout<<endl<<"Enter number of rows of B: ";
  23. cin>>o;
  24. cout<<"Enter number of coloumns of B: ";
  25. cin>>p;
  26. cout<<endl<<"Enter elements of matrix B: "<<endl;
  27. for(i=0;i<o;i++)
  28. {
  29. for(j=0;j<p;j++)
  30. {
  31. cout<<"Enter element b"<<i+1<<j+1<<": ";
  32. cin>>b[i][j];
  33. }
  34. }

  36. cout<<endl<<"Displaying Matrix A: "<<endl<<endl;
  37. for(i=0;i<m;i++)
  38. {
  39. for(j=0;j<n;j++)
  40. {
  41. cout<<a[i][j]<<" ";
  42. }
  43. cout<<endl<<endl;
  44. }
  45. cout<<endl<<"Displaying Matrix B: "<<endl<<endl;
  46. for(i=0;i<o;i++)
  47. {
  48. for(j=0;j<p;j++)
  49. {
  50. cout<<b[i][j]<<" ";
  51. }
  52. cout<<endl<<endl;
  53. }
  54. if(n==o)
  55. {
  56. for(i=0;i<m;i++)
  57. {
  58. for(j=0;j<p;j++)
  59. {
  60. c[i][j]=0;
  61. for(int k=0;k<n;k++)
  62. {
  63. c[i][j]=c[i][j]+a[i][k]*b[k][j];
  64. }
  65. }
  66. }
  67. cout<<endl<<"Matrix A * Matrix B = Matrix C: "<<endl<<endl;
  68. for(i=0;i<m;i++)
  69. {
  70. for(j=0;j<p;j++)
  71. {
  72. cout<<c[i][j]<<" ";
  73. }
  74. cout<<endl<<endl;
  75. }
  76. }
  77. else
  78. cout<<"Multiplication not possible :(";
  79. getch();
  80. }
Tags: , , , , , , , , ,

Write a program to find Difference of two matrix

Two matrix are taken from user.. Substraction matrix is displayed as output..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[10][10],b[10][10],c[10][10],m,n,i,j;
  7. cout<<"Enter number of rows: ";
  8. cin>>m;
  9. cout<<"Enter number of coloumns: ";
  10. cin>>n;
  11. cout<<endl<<"Enter elements of matrix A: "<<endl;
  12. //Coding by: Snehil Khanor
  13. //http://WapCPP.blogspot.com
  14. for(i=0;i<m;i++)
  15. {
  16. for(j=0;j<n;j++)
  17. {
  18. cout<<"Enter element a"<<i+1<<j+1<<": ";
  19. cin>>a[i][j];
  20. }
  21. }
  22. cout<<endl<<"Enter elements of matrix B: "<<endl;
  23. for(i=0;i<m;i++)
  24. {
  25. for(j=0;j<n;j++)
  26. {
  27. cout<<"Enter element b"<<i+1<<j+1<<": ";
  28. cin>>b[i][j];
  29. }
  30. }
  31. //Coding by: Snehil Khanor
  32. //http://WapCPP.blogspot.com
  33. cout<<endl<<"Displaying Matrix A: "<<endl<<endl;
  34. for(i=0;i<m;i++)
  35. {
  36. for(j=0;j<n;j++)
  37. {
  38. cout<<a[i][j]<<" ";
  39. }
  40. cout<<endl<<endl;
  41. }
  42. cout<<endl<<"Displaying Matrix B: "<<endl<<endl;
  43. for(i=0;i<m;i++)
  44. {
  45. for(j=0;j<n;j++)
  46. {
  47. cout<<b[i][j]<<" ";
  48. }
  49. cout<<endl<<endl;
  50. }
  51. cout<<endl<<"Matrix A - Matrix B = Matrix C: "<<endl<<endl;
  52. for(i=0;i<m;i++)
  53. {
  54. for(j=0;j<n;j++)
  55. {
  56. cout<<a[i][j]-b[i][j]<<" ";
  57. }
  58. cout<<endl<<endl;
  59. }
  60. getch();
  61. }
Tags: , , , , , ,

Write a program to find sum matrix of two matrix

Two matrix are taken from user.. Sum matrix is displayed as output..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[10][10],b[10][10],c[10][10],m,n,i,j;
  7. cout<<"Enter number of rows: ";
  8. cin>>m;
  9. cout<<"Enter number of coloumns: ";
  10. cin>>n;
  11. cout<<endl<<"Enter elements of matrix A: "<<endl;
  12. for(i=0;i<m;i++)
  13. {
  14. for(j=0;j<n;j++)
  15. {
  16. cout<<"Enter element a"<<i+1<<j+1<<": ";
  17. cin>>a[i][j];
  18. }
  19. }
  20. cout<<endl<<"Enter elements of matrix B: "<<endl;
  21. //Coding by: Snehil Khanor
  22. //http://WapCPP.blogspot.com
  23. for(i=0;i<m;i++)
  24. {
  25. for(j=0;j<n;j++)
  26. {
  27. cout<<"Enter element b"<<i+1<<j+1<<": ";
  28. cin>>b[i][j];
  29. }
  30. }

  32. cout<<endl<<"Displaying Matrix A: "<<endl<<endl;
  33. for(i=0;i<m;i++)
  34. {
  35. for(j=0;j<n;j++)
  36. {
  37. cout<<a[i][j]<<" ";
  38. }
  39. cout<<endl<<endl;
  40. }
  41. cout<<endl<<"Displaying Matrix B: "<<endl<<endl;
  42. for(i=0;i<m;i++)
  43. {
  44. for(j=0;j<n;j++)
  45. {
  46. cout<<b[i][j]<<" ";
  47. }
  48. cout<<endl<<endl;
  49. }
  50. cout<<endl<<"Matrix A + Matrix B = Matrix C: "<<endl<<endl;
  51. for(i=0;i<m;i++)
  52. {
  53. for(j=0;j<n;j++)
  54. {
  55. cout<<a[i][j]+b[i][j]<<" ";
  56. }
  57. cout<<endl<<endl;
  58. }

  60. getch();
  61. }
Tags: , , , , , , ,

Write a program to store elements in m x n 2D array (Matrix)

m(row) and n(coloumns) are taken from user.. Elements are taken from user.. matrix is displayed in tabular form..
This should be your first program for Matrix.


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[10][10],m,n,i,j;
  7. cout<<"Enter number of rows: ";
  8. cin>>m;
  9. cout<<"Enter number of coloumns: ";
  10. cin>>n;
  11. cout<<endl<<"Enter elements of matrix: "<<endl;
  12. //Coding by: Snehil Khanor
  13. //http://WapCPP.blogspot.com
  14. for(i=0;i<m;i++)
  15. {
  16. for(j=0;j<n;j++)
  17. {
  18. cout<<"Enter element a"<<i+1<<j+1<<": ";
  19. cin>>a[i][j];
  20. }
  21. }
  22. cout<<endl<<"Displaying Matrix: "<<endl<<endl;
  23. for(i=0;i<m;i++)
  24. {
  25. for(j=0;j<n;j++)
  26. {
  27. cout<<a[i][j]<<" ";
  28. }
  29. cout<<endl<<endl;
  30. }
  31. getch();
  32. }
Tags: , , , , , , ,

Write a program to Insert and Delete elemnt of an array

Size of array is taken from user.. Elements are Entered.. Array is shown.. user is prompted for adding another element.. new element is added at desired position.. user is prompted to delete an element.. Element is deleted from entered position..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<conio.h>
  2. #include<iostream.h>
  3. void main()
  4. {
  5. clrscr();
  6. int a[100],i,pos,num,item,size;
  7. cout<<"How many element: ";
  8. cin>>size;
  9. cout<<"Enter the elements of array: "<<endl;
  10. for(i=0;i<size;i++)
  11. cin>>a[i];
  12. cout<<endl;
  13. cout<<"Now Array is: "<<endl;
  14. for(i=0;i<size;i++)
  15. cout<<"Element at position "<<i+1<<" is "<<a[i]<<endl;
  16. cout<<endl<<"Press any key to add another element"<<endl<<endl;
  17. getch();
  19. //Coding by: Snehil Khanor
  20. //http://WapCPP.blogspot.com
  21. cout<<"Enter another element: ";
  22. cin>>num;
  23. cout<<"Enter position number: ";
  24. cin>>pos;
  25. cout<<endl;
  26. --pos;
  27. for(i=size;i>=pos;i--)
  28. a[i+1]=a[i];
  29. a[pos]=num;
  30. size++;
  31. cout<<"New Array: "<<endl;
  32. for(i=0;i<size;i++)
  33. cout<<"Element at position "<<i+1<<" is "<<a[i]<<endl;
  34. cout<<endl<<"Press any key to delete any element"<<endl<<endl;
  35. getch();

  38. //Coding by: Snehil Khanor
  39. //http://WapCPP.blogspot.com
  40. cout<<"Enter position number to delete: ";
  41. cin>>pos;
  42. --pos;
  43. item=a[pos];
  44. for(i=pos;i<size;i++)
  45. a[i]=a[i+1];
  46. size--;
  47. cout<<"Deleted element: "<<item<<endl;
  48. cout<<endl<<"New array: "<<endl;
  49. for(i=0;i<size;i++)
  50. cout<<"Element at position "<<i+1<<" is "<<a[i]<<endl;
  51. getch();
  52. }
Tags: , , , , , ,

Write a program to sort elements of array (bubble Sorting)

Size of array is taken from user.. Elemnts are entered by user.. Elements are sorted in ascending order..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<conio.h>

  2. #include<iostream.h>

  3. void main()

  4. {

  5. clrscr();

  6. int a[100],i,n,j,temp;

  7. cout<<"How many element: ";

  8. cin>>n;

  9. cout<<"Enter the elements of array: "<<endl;

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

  11. cin>>a[i];

  12. cout<<"The elements of array Before Sorting: "<<endl;

  13. //Coding by: Snehil Khanor

  14. //http://WapCPP.blogspot.com

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

  16. cout<<a[i]<<" ";

  17. cout<<endl;

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

  19. {

  20. for(j=0;j<n-1-i;j++)

  21. {

  22. if(a[j]>a[j+1])

  23. {

  24. temp=a[j];

  25. a[j]=a[j+1];

  26. a[j+1]=temp;

  27. }

  28. }

  29. }

  30. cout<<"Elements of array After Sorting: "<<endl;

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

  32. cout<<a[i]<<" ";

  33. getch();

  34. }

Tags: , , , , , , , , , , , ,

Write a program to search an element in an array (Binary searching)

Size of array is taken from user.. Elements are entered by user in order (ascending or descending).. user is asked for the element to be searched... Search is performed..
Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<conio.h>

  2. #include<iostream.h>

  3. void main()

  4. {

  5. clrscr();

  6. int a[100],i,loc,mid,beg,end,n,flag=0,item;

  7. cout<<"How many element: ";

  8. cin>>n;

  9. cout<<"Enter (IN ORDER) the elements of array: "<<endl;

  10. //Coding by: Snehil Khanor

  11. //http://WapCPP.blogspot.com

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

  13. cin>>a[i];

  14. cout<<"Enter the element to be searched: ";

  15. cin>>item;

  16. loc=0;

  17. beg=0;

  18. end=n-1;

  19. while((beg<=end)&&(item!=a[mid]))

  20. {

  21. mid=(beg+end)/2;

  22. if(item==a[mid])

  23. {

  24. cout<<"Search successful :)";

  25. loc=mid;

  26. cout<<"Position of the Item: "<<loc+1;

  27. flag=flag+1;

  28. }

  29. else if(item<a[mid])

  30. end=mid-1;

  31. else

  32. beg=mid+1;

  33. }

  34. if(flag==0)

  35. {

  36. cout<<"Search NOT sucessfull :( ";

  37. }

  38. getch();

  39. }

Tags: , , , , , , , , , , , , ,

Write a program to search an element in an array (Linear searching)

Size of array is taken from user.. Elements are entered.. Then user is asked to enter element to be searched.. Search is performed..
Select To use this code as it is.. select and copy paste this code into code.cpp file :)
  1. #include<iostream.h>

  2. #include<conio.h>

  3. void main()

  4. {

  5. clrscr();

  6. int ar[10],n,num,no;

  7. cout<<"Enter size of the array: ";

  8. cin>>n;

  9. cout<<"Enter array element: "<<endl;

  10. for(int i=0;i<n;i++)

  11. {

  12. cout<<"Enter element "<<i<<": ";

  13. cin>>ar[i];

  14. }

  15. //Coding by: Snehil Khanor

  16. //http://WapCPP.blogspot.com

  17. cout<<"Elements of array: "<<endl;

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

  19. cout<<"Element at index number "<<i<<" is: "<<ar[i]<<endl;

  20. //////To search////

  21. cout<<"Enter number to search: ";

  22. cin>>num;

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

  24. {

  25. if(num==ar[i])

  26. {

  27. cout<<"Found at index number: "<<i;

  28. no=0;

  29. break;

  30. }

  31. else

  32. {

  33. no=1;

  34. continue;

  35. }

  36. }

  37. if(no==1)

  38. cout<<"Sorry your search returned NO results. :(";

  39. getch();

  40. }

Tags: , , , , , , , , ,

Write a program to find minimum in array

Size of array is taken from user..Elements are entered by user..Minimum of the elements is displayed..


Select To use this code as it is.. select and copy paste this code into code.cpp file :)



  1. #include<iostream.h>
  2. #include<conio.h>
  3. void main()
  4. {
  5. clrscr();
  6. int ar[10],n,min;
  7. cout<<"Enter size of the array: ";
  8. cin>>n;
  9. cout<<"Enter array element: "<<endl;
  10. for(int i=0;i<n;i++)
  11. //Coding by: Snehil Khanor
  12. //http://WapCPP.blogspot.com
  13. {
  14. cout<<"Enter element "<<i<<": ";
  15. cin>>ar[i];
  16. }
  17. cout<<"Elements of array: "<<endl;
  18. for(i=0;i<n;i++)
  19. cout<<"Element at index number "<<i<<" is: "<<ar[i]<<endl;
  20. ////To find MIN////
  21. min=ar[0];
  22. for(i=0;i<n;i++)
  23. {
  24. if(min>ar[i])
  25. min=ar[i];
  26. }
  27. cout<<"Minimum in the array is "<<min;
  28. getch();
  29. }
Tags: , , , ,
Subscribe to: Posts (Atom)

Check out this stream