Soa Technology

April 12, 2020 in C and CPP

Queue example for remove value with front fixed

#include<iostream>
#include<conio.h>
#define MAX 100
using namespace std;
class queue
{
int data[MAX];
int rear,front;

public:
//default constructor
queue()
{
rear=-1;
front=0;
}
int full()
{
return(rear==5-1);
}
int empty()
{
return(rear==-1 && front==0);
}
void addqueue(int x)
{
cout<<"rear= "<<rear<<"....front="<<front<<endl;
if(!full())
{
rear++;
data[rear]=x;
}
else
{
cout<<"full\n";
}
}

int removequeueFrontFixed()
{
int x=0;            
cout<<"front="<<front<<"....rear="<<rear<<endl;
if(!empty())
{
x=data[front];
for(int i=front;i<rear;i++)
{
data[i]=data[i+1];
}
rear--;
}
else
{
cout<<"empty\n";
}
return x;

}
int count()
{
return((rear-front)+1);
}

int removequeueRearFixed()
{
int x=0;
cout<<"rear="<<rear<<"....front="<<front<<endl;
if(!empty())
{
x=data[front];
front++;
}
else
{
cout<<"empty";
}
return x;

}
};


int main()
{
queue q1;
int ch,cnt,x;
do{
cout<<"enter\n1.add value in queue\n2.remove value with front fixed\n3.remove value with rear fixed\n4.count\n";
cin>>ch;
if(ch==1)
{
cout<<"add value\n";
for(int i=0;i<5;i++)
{
cin>>x;
q1.addqueue(x);
}
}
else if(ch==2)
{
cout<<"delete queue\n";
for(int i=0;i<5;i++)
{
cout<<q1.removequeueFrontFixed()<<endl;
}

}
else if(ch==3)
{
     cout<<"remove queue";
     for(int i=0;i<5;i++)
     {
     
cout<<q1.removequeueRearFixed()<<endl;
}
}
else if(ch==4)
{
cout<<q1.count()<<endl;
}
cout<<"do u want to continue then press 5\n";
cin>>cnt;}
while(cnt==5);

getch();
}

April 12, 2020 in C and CPP

Queue Example in CPP

#include<iostream>
#include<conio.h>
#define MAX 100
using namespace std;
class queue
{
int data[MAX];
int rear,front,temp;

public:
//default constructor
queue()
{
rear=-1;
front=0;
}
int full()
{
return(rear==5-1);
}
int empty()
{
return(rear==-1 && front==0);
}
void addqueue(int x)
{
cout<<"rear= "<<rear<<"....front="<<front<<endl;
if(!full())
{
rear++;
data[rear]=x;
}
else
{
cout<<"full\n";
}
}
int sort()
{
//cout<<"rear="<<rear<<"front="<<front;
for(int i=front;i<rear;i++)
{
if(data[i]<data[i+1])
{
temp=data[i];
data[i]=data[i+1];
data[i+1]=temp;
}}
}
/*int sort2()
{
cout<<"rear="<<rear<<"front="<<front;
for(int i=rear;i>=front;i++)
{
if(data[i]<data[i+1])
{
temp=data[i];
data[i]=data[i+1];
data[i+1]=temp;
}}


}*/
void view()
{
  cout<<"view"<<endl;   
for(int i=0;i<5;i++ )
{
   cout<<"rear="<<rear<<"front="<<front<<endl;     
cout<<data[i]<<endl;
}
}                                                

int removequeueFrontFixed()
{
int x=0;            
cout<<"front="<<front<<"....rear="<<rear<<endl;
if(!empty())
{
x=data[front];
for(int i=front;i<rear;i++)
{
data[i]=data[i+1];
}
rear--;
}
else
{
cout<<"empty\n";
}
return x;

}
int count()
{
return((rear-front)+1);
}

int removequeueRearFixed()
{
int x=0;
cout<<"rear="<<rear<<"....front="<<front<<endl;
if(!empty())
{
x=data[front];
front++;
}
else
{
cout<<"empty";
}
return x;

}
};


int main()
{
queue q1;
int ch,cnt,x;
do{
cout<<"enter\n1.add value in queue\n2.remove value with front fixed\n3.remove value with rear fixed\n4.count\n5.sort\n";
cin>>ch;
if(ch==1)
{
cout<<"add value\n";
for(int i=0;i<5;i++)
{
cin>>x;
q1.addqueue(x);
}
}
else if(ch==2)
{
cout<<"delete queue\n";
for(int i=0;i<5;i++)
{
cout<<q1.removequeueFrontFixed()<<endl;
}

}
else if(ch==3)
{
cout<<"remove queue";
for(int i=0;i<5;i++)
{

cout<<q1.removequeueRearFixed()<<endl;
}
}
else if(ch==4)
{
cout<<q1.count()<<endl;
}
else if(ch==5)
{
for( int i=0;i<5;i++)
{
q1.sort();
}
q1.view();
}

cout<<"do u want to continue then press 6\n";
cin>>cnt;}
while(cnt==6);

getch();
}

April 12, 2020 in C and CPP, Tips and Tricks

Linked List In CPP

#include<iostream>
#include<conio.h>
#include<stdio.h>
#include<ctype.h>
using namespace std;
class node
{
int data;
node*next;
public:
node *creatlist()
{
node*head,*tail, *temp;
int x;
head=NULL;
cout<<"Enter number(-99 to stop):";
cin>>x;
while(x!=-99)
{
temp=new node();
temp->data=x;
temp->next=NULL;
if(head==NULL)
{
head=tail=temp;
}
else
{
tail->next=temp;
tail=temp;
}
cout<<"enter value(-99 to stop)";
cin>>x;
}
return head;
}

void traverse(node*head)
{
node*p=head;
while(p!=NULL)
{
cout<<p->data<<"->";
p=p->next;
}
cout<<"\b"<<char(12)<<endl;
}

void searchnode(node*head,int srch)
{

node*p=head;
while(p!=NULL)
{

if(srch==p->data)
{

cout<<endl<<p->data<<" found\n";
{

break;
}
}
p=p->next;
}

if(p==NULL)
{
cout<<"\nnot found\n";
}

}



node *inserthead(node*head,int x)
{
node *tmp;
if(head==NULL)
{
cout<<"empty list";
}
else
{
tmp=new node();
tmp->data=x;
tmp->next=head;
head=tmp;
}
return head;
}
node *deletehead(node*head)
{
     
node*p=head;
if(head==NULL)
{
cout<<"empty list";
}
else
{
 head=p->next;
 delete(p);
 }
 return head;
}
node* inserttail(node*head,int x)
{
      node *tmp;
node*p=head;
if(head==NULL)
{
              cout<<"empty list";
              }
              else
              {
while(p->next!=NULL)
{
p=p->next;
}
tmp=new node();
tmp->data=x;
tmp->next=NULL;
p->next=tmp;
}

return head;
}
node*deletebefore(node*head,int srch)
{
node *p,*q;
p=head;
q=head->next;
while(q!=NULL)
{
if(q->next->data==srch)
{
break;
}
p=p->next; q=q->next;
}
if(q!=NULL)
{
p->next=q->next;
delete(q);
}
else
{
cout<<"Delete error";
}
return head;
}

};
int main()
{
int ch,srch,x;
char cnt;
node singly;
node*head;
do{
cout<<"1.for creatlist"<<endl<<"2.for traverse"<<endl<<"3.for search"<<endl<<"4. head insert"<<endl<<"5.delete head"<<endl<<"6.for insert tail"<<endl<<"7 for deletebefore"<<endl;
cout<<"enter your choice\n";
cin>>ch;

if(ch==1)
{
head=singly.creatlist();
}
else if(ch==2)
{
singly.traverse(head);
}
else if(ch==3)
{
cout<<"enter srch value";
cin>>srch;
singly.searchnode(head,srch);	
}
else if(ch==4)
{
cout<<"enter value for insert ";
cin>>x;
head=singly.inserthead(head,x);	
}
else if(ch==5)
{
cout<<"delete head";
head=singly.deletehead(head);

}
else if(ch==6)
{
     cout<<"insert new value for tail : ";
     cin>>x;
     head=singly.inserttail(head,x);
 }
 else if(ch==7)
 {
 cout<<"enter srch value";
 cin>>srch;

 head=singly.deletebefore(head,srch);
}
fflush(stdin);
cout<<"do you want to continue then press (y/n) : ";
cin>>cnt;
}
while(toupper(cnt)=='Y');


getch();
}

April 12, 2020 in C and CPP, Tips and Tricks

What is Linked List

linked-list Download

List of Program of C language

WAP to ADD, Sum, MUL, Divide of two numbers X, Y?
WAP to enter five nos. and print sum and average?
WAP to enter Principle, Rate, Time and calculate Simple Interest?
WAP to enter basic and calculate hra 2% of basic, da 3%of basic and find gross salary?
WAP to exchange value of two Variables of Two Values X, Y?
WAP to print prime or not prime numbers?
WAP to print even or odd numbers?
WAP to reverse numbers?
WAP of factorial numbers?
WAP of Fibonacci series?
WAP fine the largest numbers in array?
WAP sum of two matrix?
WAP Mul of two Matrix?
WAP print reverse order of array?
WAP of array implementation of queue?
WAP array of pointer?
WAP array of structure?
WAP of automatic storage class?
WAP of Binary Search?
WAP of Bubble sort, insertion sort and selection sort?
WAP of Call by value and Call by reference?
WAP of stack using array?
WAP of stack using linked list?
WAP of Merging of two D array?
WAP of Transpose of Two D Array?
WAP of recursive function?
WAP of Singly linked list in C with using structure?
WAP of smallest and largest number in 2 D Array?
WAP of Negative and positive number ?
WAP to display largest of from three inputs?
WAP of Looping statement
For Loop
While loop
Do while loop

Using these loop make a program of even and odd number, prime and not prime numbers, negative and positive numbers etc.

WAP of loop control statement

(a)Break

(b)continue

(c ) exit(0)

(d)goto

Using these loop control statement write a program of prime or not prime numbers and even and odd number etc.

WAP of Linear Search?
WAP of Binary search?
WAP of insert,search and delete in Array?
WAP of string create a string count the words of string and reverse the string?
WAP search the string?
WAP matrix add calculating with 2 D Array
Row major ording
Coolum Major ordering
WAP of file handling with file oprations

(a)Read

(b)Write

(c )append

(d)read/write

37. WAP enter two string copy one string to another string?

38. WAP to enter the string and count word and space in string?

39. WAP to convert decimal to binary number?

40. WAP to print their value in decreasing order?

41.WAP to enter string convert lower alpha to upper alpha?

42. WAP to sort the character in the string

Input-> COMPU

OUTPUT->CMOPU

43. WAP to remove space from string?

44.WAP of Sparse Matrix?

45.WAP display name, roll, marks, t.makrs, sub, hindi, eng, sci, math using string in array?

46.WAP display name, desi, contact etc. in string?

47. WAP to compare to string equal or not?

48. WAP find the sum of prime numbers 2-100?

49. WAP to enter two numbers and swap their values

50. WAP to the enter the user want at the end it should display the count the positive, negative and zero

51.WAP to digit wise reverse

52. WAP to digit wise multiply

53 WAP to digit wise reverse and add 5 with it.

54. WAP to print count digit numbers

55. WAF create a factorial of number with return argument

56. WAF of prime and not prime numbers

57 WAF of stack

58 WAF to enter the n number print their sum of total numbers

59 WAP of deep copying and shallow coping

60 WAP array of pointer

61.WAP to show the contents of pointer an array of pointer

62. WAP of pointer with pointer

63 WAP of two point p1 and p2

Int i=10,j=20; compare tow pointers

64. WAP to exchange two integer values using function in pointer

65. WAP to find the sum of all element stored in array

Int *p, sum=0, I;

Int A[3]={4,5,6}

66. WAP to return largest value in pointer

67. WAP 2D Array elements using pointer?

68. WAP of structure pointer

69. WAP of Nested Structure

70. WAP of Singly linked through structure in C

71. WAP of Doubly linked list through structure in C

72. WAP of Circular linked list through structure in C

73. WAP of implementation stack using linked list in C

74. WAP to store even values in another link list

75. WAP of recursive to display the nodes of linked list

76. WAP of stack using array and linked list.

April 12, 2020 in C and CPP, Tips and Tricks

Singly linked list in c language

#include<stdio.h>
#include<process.h>
struct node
{
	int data;
	struct node *next;
};
typedef struct node *singly;
singly createlist()
{
	int x;
	singly head,tail,tmp;
	head=NULL;
	printf("\n enter value(-99 to stop)");
	scanf("%d",&x);
	while(x!=-99)
	{
		tmp=(singly)malloc(sizeof(struct node));
		tmp->data=x;
		if(head==NULL)
		{
			head=tail=tmp;
		}
		else
		{
			tail->next=tmp;
			tail=tmp;
		}
		tail->next=NULL;
		printf("\n Enter value(-99 to stop)");
		scanf("%d", &x);
			}
			return(head);
}
void traverse(singly head)
{
	singly p=head;
	while(p!=NULL)
	{
		printf("%d --> ",p->data);
		p=p->next;
	}
}
singly inserthead(singly head,int ins)
	{
		singly tmp;
		tmp=(singly)malloc(sizeof(struct node));
		tmp->data=ins;
		if(head==NULL)
		{
			printf("\n error insert");
		}
		else
		{
			tmp->next=head;
			head=tmp;
		}
		return(head);
}
singly insertbefore(singly head, int srch,int ins)
{
	singly p=head,tmp;
	while(p!=NULL)
	{	if(p->next->data==srch)
		{
			break;
		}
		p=p->next;
	}
	if(p!=NULL)
	{
		tmp=(singly)malloc(sizeof(struct node));
	
		tmp->data=ins;
		tmp->next=p->next;
		p->next=tmp;
		
	}
	else
	{
		printf("\n error insert");
	}
	return(head);
}
singly deletetail(singly head)
{
	singly p=head,q=head->next;
	while(q->next!=NULL)
	{
		p=p->next;
		q=q->next;
	}
	p->next=NULL;
	free(q);
	return(head);
}
singly deleteafter(singly head,int srch)
{
	singly p=head,q=head->next;
	while(p->next!=NULL)
	{
		if(p->data==srch)
		{
			break;
		}
		p=p->next;q=q->next;
	}
	if(p->next==NULL)
	{
		printf("\n delete error");
	}
	else
	{
		p->next=q->next;
		free(q);
	}
	return(head);
}


int main()
{
	singly head;int ch,ins;char cnt;int srch;

	do{
		printf("\n1. create list\n2. traverse\n3. insert as head\n4. insert before\n5. Delete tail\n6. Delete after\nEnter your choice : ");
	scanf("%d",&ch);
	switch(ch){
		case 1:
	head=createlist();
		break;
		case 2:
	traverse(head);
		break;
		case 3:
		printf("\nenter value to insert : ");
		scanf("%d",&ins);
	head=inserthead(head,ins)	;
		break;
		case 4:
		printf("\n enter value to insert :");
		scanf("%d",&ins);
		printf("\n enter value to search :");
		scanf("%d",&srch);
	head=insertbefore(head,srch,ins)	;
		break;
		case 5:
	head=deletetail(head);
		break;
		case 6:
		printf("\n enter value to search");
		scanf("%d",&srch);
		head=deleteafter(head,srch) ;
		break;	
	}
	fflush(stdin);
	printf("\ndo you want to continue (y/n) : ");
	scanf("%c",&cnt);
	}while(cnt=='y');
}

<script async src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
<ins class="adsbygoogle"
     style="display:block"
     data-ad-format="autorelaxed"
     data-ad-client="ca-pub-7462577112023113"
     data-ad-slot="1814817697"></ins>
<script>
     (adsbygoogle = window.adsbygoogle || []).push({});
</script>

April 1, 2020 in Learning, Tips and Tricks

open graph tags example

Open Graph tags is a protocol (i.e. a set of rules) that is used to integrate any web page into the social graph. For example, Facebook can be your social graph or social circle.

Using of Open Graph protocol, you can tell Facebook how to render your shared content to displayed on Facebook.

Open Graph Meta Tags Example

To enable your web page into a graph object, you need to use Open Graph meta tags.

Following are examples of such meta tags:

<meta property="og:title" content=""/>
<meta property="og:type" content=""/>
<meta property="og:url" content=""/>
<meta property="og:image" content=""/>
<meta property="fb:admins" content=""/>
<meta property="og:site_name" content=""/>
<meta property="og:description" content=""/>

March 26, 2020 in Learning, Tips and Tricks

datatable change show entries number | disable sort datatable

aLengthMenu : This parameter allows you to readily specify the entries in the length drop down menu that DataTables shows when pagination is enabled. It can be either a 1D array of options which will be used for both the displayed option and the value, or a 2D array which will use the array in the first position as the value, and the array in the second position as the displayed options (useful for language strings such as ‘All’).

$(document).ready(function() {
    $('#tbl_id').dataTable({
        "aLengthMenu": [[25, 50, 75, -1], [25, 50, 75, "All"]],
        "iDisplayLength": 25
    });
} );

iDisplayLength is now legacy. Use pageLength instead.

How to disable sort in datatable?

Note that this will disable sorting all around, so there is no need to disable it on individual columns.

$('#jTable').dataTable({ "bSort" : false } );

Sorting apply per field, is:

$('#id-of-my-table').DataTable({
    "columnDefs": [
        { "orderable": false, "targets": [0, 4, 5, 6] },
        { "orderable": true, "targets": [1, 2, 3] }
    ]
});

February 29, 2020 in Learning, Php

Table 1 to 10

1	2	3	4	5	6	7	8	9	10
2	4	6	8	10	12	14	16	18	20
3	6	9	12	15	18	21	24	27	30
4	8	12	16	20	24	28	32	36	40
5	10	15	20	25	30	35	40	45	50
6	12	18	24	30	36	42	48	54	60
7	14	21	28	35	42	49	56	63	70
8	16	24	32	40	48	56	64	72	80
9	18	27	36	45	54	63	72	81	90
10	20	30	40	50	60	70	80	90	100

February 29, 2020 in Learning

Table 11 to 20

11	12	13	14	15	16	17	18	19	20
22	24	26	28	30	32	34	36	38	40
33	36	39	42	45	48	51	54	57	60
44	48	52	56	60	64	68	72	76	80
55	60	65	70	75	80	85	90	95	100
66	72	78	84	90	96	102	108	114	120
77	84	91	98	105	112	119	126	133	140
88	96	104	112	120	128	136	144	152	160
99	108	117	126	135	144	153	162	171	180
110	120	130	140	150	160	170	180	190	200

Basic Queue Example

Basic Queue Example

Queue example for remove value with front fixed

Queue Example in CPP

Linked List In CPP

What is Linked List

Singly linked list in c language

open graph tags example

Open Graph Meta Tags Example

datatable change show entries number | disable sort datatable

How to disable sort in datatable?

Table 1 to 10

Table 11 to 20

Soa Technology

Recent Posts

Aditya