Track any Mobile No. in India Free

Now you can track maximum mobile no. owner name in India. There is one of the biggest database available for it.

Easy Steps:

1. go to Site2sms.com.

2. Register here.

3. Now go through the below link-

Locate Mobile No.

C program to implement LRU page replacement algorithm

IMPLEMENTATION OF LRU PAGE REPLACEMENT ALGORITHM

AIM:

To write a c program to implement LRU page replacement algorithm

ALGORITHM :

1. Start the process

2. Declare the size

3. Get the number of pages to be inserted

4. Get the value

5. Declare counter and stack

6. Select the least recently used page by counter value

7. Stack them according the selection.

8.  Display the values

9. Stop the process

PROGRAM:

#include<stdio.h>

main()

{

int q[20],p[50],c=0,c1,d,f,i,j,k=0,n,r,t,b[20],c2[20];

printf("Enter no of pages:");

scanf("%d",&n);

printf("Enter the reference string:");

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

            scanf("%d",&p[i]);

printf("Enter no of frames:");

scanf("%d",&f);

q[k]=p[k];

printf("\n\t%d\n",q[k]);

c++;

k++;

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

            {

                        c1=0;

                        for(j=0;j<f;j++)

                        {

                                    if(p[i]!=q[j])

                                    c1++;

                        }

                        if(c1==f)

                        {

                                    c++;

                                    if(k<f)

                                    {

                                                q[k]=p[i];

                                                k++;

                                                for(j=0;j<k;j++)

                                                printf("\t%d",q[j]);

                                                printf("\n");

                                    }

                                    else

                                    {

                                                for(r=0;r<f;r++)

                                                {

                                                            c2[r]=0;

                                                            for(j=i-1;j<n;j--)

                                                            {

                                                            if(q[r]!=p[j])

                                                            c2[r]++;

                                                            else

                                                            break;

                                                }

                                    }

                                    for(r=0;r<f;r++)

                                     b[r]=c2[r];

                                    for(r=0;r<f;r++)

                                    {

                                                for(j=r;j<f;j++)

                                                {

                                                            if(b[r]<b[j])

                                                            {

                                                                        t=b[r];

                                                                        b[r]=b[j];

                                                                        b[j]=t;

                                                            }

                                                }

                                    }

                                    for(r=0;r<f;r++)

                                    {

                                                if(c2[r]==b[0])

                                                q[r]=p[i];

                                                printf("\t%d",q[r]);

                                    }

                                    printf("\n");

                        }

            }

}

printf("\nThe no of page faults is %d",c);

}

OUTPUT:

Enter no of pages:10

Enter the reference string:7 5 9 4 3 7 9 6 2 1

Enter no of frames:3

        7

        7       5

        7       5       9

        4       5       9

        4       3       9

        4       3       7

        9       3       7

        9       6       7

        9       6       2

        1       6       2

The no of page faults is 10

Any problem?? Drop a comment!

Program for FIFO Page Replacement Algorithm in C

IMPLEMENTATION OF FIFO PAGE REPLACEMENT ALGORITHM

AIM

To write a c program to implement FIFO page replacement algorithm

ALGORITHM

1. Start the process

2. Declare the size with respect to page length

3. Check the need of replacement from the page to memory

4. Check the need of replacement from old page to new page in memory

5. Forma queue to hold all pages

6. Insert the page require memory into the queue

7. Check for bad replacement and page fault

8. Get the number of processes to be inserted

9. Display the values

10. Stop the process

PROGRAM:

#include<stdio.h>

int main()

{

int i,j,n,a[50],frame[10],no,k,avail,count=0;

            printf("\n ENTER THE NUMBER OF PAGES:\n");

scanf("%d",&n);

            printf("\n ENTER THE PAGE NUMBER :\n");

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

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

            printf("\n ENTER THE NUMBER OF FRAMES :");

            scanf("%d",&no);

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

            frame[i]= -1;

                        j=0;

                        printf("\tref string\t page frames\n");

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

                        {

                                    printf("%d\t\t",a[i]);

                                    avail=0;

                                    for(k=0;k<no;k++)

if(frame[k]==a[i])

                                            {

                                               avail=1;

                                               count++;

                                            }

                                    if (avail==0)

                                    {

                                                frame[j]=a[i];

                                                j=(j+1)%no; 

                                                for(k=0;k<no;k++)

                                                printf("%d\t",frame[k]);

}

                                    printf("\n");

}

                        printf("Page Fault Is %d",count);

                        return 0;

}

OUTPUT:

ENTER THE NUMBER OF PAGES:  20

ENTER THE PAGE NUMBER :       7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1

ENTER THE NUMBER OF FRAMES :3

      ref string       page frames

7               7       -1      -1

0               7       0       -1

1               7       0       1

2               2       0       1

0

3               2       3       1

0               2       3       0

4               4       3       0

2               4       2       0

3               4       2       3

0               0       2       3

3

2

1               0       1       3

2               0       1       2

0

1

7               7       1       2

0               7       0       2

1               7       0       1

Page Fault Is 5

Any problem?? Drop a comment!

How to Find People on Twitter

There are many ways to locate other Twitter users, but quickest way to find people on Twitter is to enter their name in the search box at the top of your Twitter home page.
In the right-side column, you'll see a list labeled "people results" containing names of Twitter users who have the name that you searched for as their Twitter username, Twitter real name, in their Twitter bio or some combination.
Tweets that contain the word you typed also will appear, displayed directly in the main column.
Click "view all" to see the full list of matching Twitter users. It will appear in the main column, replacing the search results for tweets that also matched the name you searched.
This basic Twitter people search is the simplest way to find people, but perhaps not the most effective. It only works if people have entered their real name in their bio or signup form, and you've got to spell it correctly.
You might want to bookmark Twitter's main search page for easy reference.

Search by Web Address to Find People on Twitter

One good shortcut for finding people on Twitter is to type the name you're looking for directly into your Web browser's address bar after twitter.com.
If you were looking for Samantha Rain, for example, you'd type http://twitter.com/samantharain and see if that is indeed her Twitter user name.
This works occasionally, but not if people have used a variant of their real name to create their Twitter user name. It has to be precisely the same name for this method to work in finding people on Twitter.

Search Your Email Address Book

Another good way to find people on Twitter is to mine your email contacts by importing them to Twitter and see which ones are using Twitter. If you want, Twitter will search your contact lists in most popular Web-based email services and look for matches with its database of Twitter users.
This function is accessible under the "Who to Follow" area of Twitter. Click the "Find friends" link, select your email service provider and then enter your email address and password to give Twitter permission to remotely connect to and search your email contact list.
Twitter will present a list of matching Twitter users and allow you to selectively follow certain people by checking a box next to their names. Then click "follow" and you will be following all the ones you checked.
Twitter offers a detailed explainer on how to import your email address book to find people.

Twitter's People Suggestions

Twitter offers a "suggestions for you" feature that presents you with a list of Twitter users who tweet on topics that Twitter's computers have calculated are relevant to your interests. The calculation is based on who else you follow and interact with on Twitter.
This feature also is accessible under the "Who to follow" area, via a link that says "view suggestions."
To see the entire list of suggested people, click "view all" under your suggested user short list. Read this article on how to get Twitter followers" for more about the site's people suggestions.
In late 2010, Twitter added more sophisticated topic-specific people recommendations. When you search a keyword or specific topic, it will show you suggestions for people to follow who tweet a lot on that topic. Clicking on the "People" tab near the top of the main search results will show you more people tweeting on your topic.
Researching popular hashtags (keywords preceded by hash symbol) is another good way to identify people worth following on topics that interest you.

Mine Tweets for Good Tweeters

This may be stating the obvious, but reading tweets and following people who write interesting ones is an excellent strategy for finding people to follow. There is really no substitute for this practice, which should be a core part of anyone's Twitter strategy. You, after all, are the best judge of what interests you, not some algorithm or Twitter yellow pages directory.

Other Ways to Find People on Twitter

That said, some third-party directories of Twitter users and specialized search services can be helpful if you are trying to find people on Twitter.
One good Twitter user search service is Tweepz, which allows you to filter your searches to target specific Twitter fields such as location, bio description or just name. Click on the "advanced search" link on the Tweepz home page if you want to do a filtered search on Tweepz.
Twellow, WeFollow, Listorius and WhoShouldIFollow are examples of people directories for Twitter. This article on how to find followers on Twitter has more tips to consider.

Use Twitter's Help Center

Finally, Twitter's own help center has a useful page outlining the basics of how to find people on Twitter. It's a good place to check for updates and changes in case Twitter changes its search tools.

How to Activate/Deactivate BSNL GPRS?

How to Activate BSNL GPRS?

To activate GPRS by sending SMS. The SMS codes to get GPRS, 3G, MMS, LIVE TV services is listed below.

SMS : GPRS<space>PRE to 53733, to get GPRS, 3G activated on your prepaid mobile phone within 72 Hours. But generally it starts within one day.

SMS : Mobile Make<space>Model No. to 58355, to get the GPRS settings as per your mobile handset model No. Ex. : Nokia 6630 to 58355, will give you the GPRS settings compatible to your mobile.

After receiving the settings into your SMS inbox be sure to SAVE the settings, and where ever PIN is required put 1111.

SMS : LIVE to 58355, will give you the settings for BSNL live, this is limited bandwidth GPRS setting to surf BSNL live portal.

SMS : BSNL to 58355, will give you the settings for GPRS, BSNL Live, MMS, and Live TV streaming on your handsets, be sure to save the settings after receiving it into your SMS inbox.

SMS : TV to 58355, to get the setting for Live TV streaming on your mobile phone.

SMS : MMS to 58355, to get the settings for MMS, that is Multimedia Messaging Service. To be able to send Pictures, Images, Sound or Music message to another mobile phone.

How to Deactivate BSNL GPRS?
To deactivate GPRS sent

SMS "GPRSDE" (for prepaid account) or "GPRSDC" (for postpaid account)

TO "53733"

Program of comparison between FCFS,SJF,PRIORTY & ROUND-ROBIN CPU Scheduling Algorithm

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

void main()
{
clrscr();
//fcfs
int temp=0,i,PR3[4],tq,B1[4],TAT1[4],B2[4],B3[4],B4[4],W1[4],SWT1=0,STT1=0;
float AWT1=0.0,ATT1=0.0;
char P1[4];

for(i=0;i<3;i++)
{
cout<<"Enter process names with their Burst Time and Priority(Ashish)\n";
cin>>P1[i]>>B1[i]>>PR3[i];
B2[i]=B1[i];
B3[i]=B1[i];
B4[i]=B1[i];
}
cout<<"\nEnter time slice for round robin\n";
cin>>tq;

W1[0]=0;
for(i=1;i<3;i++)
W1[i]=W1[i-1]+B1[i-1];

for(i=0;i<3;i++)
TAT1[i]=W1[i]+B1[i];

for(i=0;i<3;i++)
{
SWT1=SWT1+W1[i];
STT1=STT1+TAT1[i];
}
AWT1=(float)SWT1/3;
ATT1=(float)STT1/3;

//sjf
int W2[4],TAT2[4],SWT2=0,STT2=0;
float AWT2=0.0,ATT2=0.0;

for(int j=0;j<3;j++)
{
for(i=0;i<2-j;i++)
{
if(B2[i]>B2[i+1])
{temp=B2[i];
B2[i]=B2[i+1];
B2[i+1]=temp;}
}
}
W2[0]=0;
for(i=1;i<3;i++)
W2[i]=W2[i-1]+B2[i-1];

for(i=0;i<3;i++)
TAT2[i]=W2[i]+B2[i];

for(i=0;i<3;i++)
{
SWT2=SWT2+W2[i];
STT2=STT2+TAT2[i];
}
AWT2=(float)SWT2/3;
ATT2=(float)STT2/3;

//priority

int W3[4],TAT3[4],SWT3=0,STT3=0;
float AWT3=0.0,ATT3=0.0;
for(j=0;j<3;j++)
{
for(i=0;i<2-j;i++)
{
if(PR3[i]>PR3[i+1])
{temp=PR3[i];
PR3[i]=PR3[i+1];
PR3[i+1]=temp;
temp=B3[i];
B3[i]=B3[i+1];
B3[i+1]=temp;
}
}
}
W3[0]=0;
for(i=1;i<3;i++)
W3[i]=W3[i-1]+B3[i-1];

for(i=0;i<3;i++)
TAT3[i]=W3[i]+B3[i];

for(i=0;i<3;i++)
{
SWT3=SWT3+W3[i];
STT3=STT3+TAT3[i];
}
AWT3=(float)SWT3/3;
ATT3=(float)STT3/3;

//round
int st[10],wt[10], tat[10];
int  count=0, swt=0, stat=0, sq=0,n=3;
float AWT4=0.0, ATT4=0.0;
for(i=0;i<3;i++)
st[i]=B4[i];


while(1)
{
for(i=0, count=0;i<n;i++)
{
temp=tq;
if(st[i]==0)
{
count++;
continue;
}
if(st[i]>tq)
{
st[i]=st[i]-tq;
}
else
if (st[i]>=0)
{
temp=st[i];
st[i]=0;
}
sq=sq+temp;
tat[i]=sq;
}
if(n==count)
break;
}
for(i=0;i<n;i++)
{
wt[i]=tat[i]-B4[i];
swt=swt+wt[i];
stat=stat+tat[i];
}
AWT4=(float)swt/n;
ATT4=(float)stat/n;

//calculation

cout<<"FCFS- Average waiting time is "<<AWT1<<" and Average turn around time is "<<ATT1<<"\n";
cout<<"SJF- Average waiting time is "<<AWT2<<" and Average turn around time is "<<ATT2<<"\n";
cout<<"PRIORITY- Average waiting time is "<<AWT3<<" and Average turn around time is "<<ATT3<<"\n";
cout<<"ROUND ROBIN- Average waiting time is "<<AWT4<<" and Average turn around time is "<<ATT4<<"\n";

if(AWT1<AWT2 && AWT1<AWT3 && AWT1<AWT4)
{
cout<<"FCFS Scheduling has least average waiting time and turn around time\n";
cout<<"Average Waiting time= "<<AWT1<<" and Average Turn Around time= "<<ATT1;
}
else if(AWT2<AWT1 && AWT2<AWT3 && AWT2<AWT4)
{
cout<<"SJF Scheduling has least average waiting time and turn around time\n";
cout<<"Average Waiting time= "<<AWT2<<" and Average Turn Around time= "<<ATT2;

}
else if(AWT3<AWT1 && AWT3<AWT2 && AWT3<AWT4)
{
cout<<"Priority Scheduling has least average waiting time and turn around time\n";
cout<<"Average Waiting time= "<<AWT3<<" and Average Turn Around time= "<<ATT3;

}
else
{
cout<<"Round Robin Scheduling has least average waiting time and turn around time\n";
cout<<"Average Waiting time= "<<AWT4<<" and Average Turn Around time= "<<ATT4;

}
getch();
}