Shruti Speak's

                                                dinesh sainani                                                     Mca/4538/10 #include   #include #include typedef struct {         int cn,iarr,arr,stime,b,e,w,tsis,c_idle; }customer; int lookup1(int c) {     if(c>=0 && c<13 p="p">    {                 return 1;     }     else if(c>=13 && c<25 p="p">    {                 return 2;     }     else if(c>=25 && c<38 p="p">    {                  return 3;     }     else if(c>=38 && c<50 p="p">    {                 return 4;     }     else if(c>=50 && c<63 p="p">    {                  return 5;     }     else if(c>=63 && c<75 p="p">    {                 return 6;     }     else if(c>=75 && c<87 p="p">    {                 return 7;     }     return 8; } int lookup2(int c)

Many people go for link purchase to improve page rank. It is considered as black hat seo and crticized by Google. Such technique is considered as manipulation of search results and a violation of Google’s quality guidelines. These guidelines are prime focus of Google’s Penguin update.  It’s interesting that there seem to be exceptions to the rule, such as a directory like Best Of The Web, which has users pay for their sites to be considered for links. Here’s a video about it from Matt Cutts from 2009 that I have taken from  WebProw news:   http://www.webpronews.com/the-blurry-lines-of-googles-paid-links-policy-2012-05

If a website  is ranking well in Google. Its an algorithm which keeps on changing.    You are relying on an algorithm, and algorithms do not care whether or not they have a substantial impact on your business.  People are still turning mostly to search for seeking the answers to their questions. However, the gap between search and social networks is narrowing.  Social Media is the new way of getting traffic.  It is much more about people, and regardless of where they share it, people will always share good content, and are not necessarily influenced by over   200 mysterious signals   when they share it with their own networks of friends and followers. T here are plenty of sites out there that are getting more traffic from social media sites than they are from search engines. In fact, Google’s constantly changing algorithm almost demands that sites diversify their traffic sources and rely less on Google (the clearly dominant search engine) for the bulk of their traffic. With t

How Dell India is changing from a box-maker to a high-margin end-to-end IT solutions player ET Bureau Sep 14, 2012, 10.20AM IST Dell India News The news says Michael Dell,the dapper founder of Dell Inc explains in detail how an IT segment fits nicely into his new transformational business plan-— of transitioning the eponymous PC company to an IT solutions company. Research In Motion lures app makers with Marmalade software Reuters Sep 19, 2012, 06.44PM IST Research In Motion The news says, according to Research In Motion Ltd said software development kit (SDK) maker ( Marmalade ) is offering licenses to mobile applications developers to bring their games and apps to the BlackBerry 10 smartphones and PlayBook tablets. According to the news offer is expected to bring up thousands of new apps before its BlackBerry 10 hits market early next year.

Name :-Khushboo Roll no:-MCA/4518/10 #include #include #include #define MAX 5 typedef struct arrival { float prob; float c_prob; int min; }; typedef struct service { float prob; float c_prob; int min; }; typedef struct simulation { int cust_no; float random; int inter_arr; int c_inter_arr; float rand_no; int service_tym; int s_start; int s_end; int w_tym; int t_s_tym; int idle_tym; }; typedef struct FEL { char ch; int min; int cust_no; }; FEL fel[(MAX*2)]; arrival arr[8]; service ser[6]; simul ation sim[MAX]; void arr_prob() { int i; for(i=0;i<8;i++) { arr[i].min=i+1; arr[i].prob=.125; if(i==0) arr[i].c_prob=0.0; else arr[i].c_prob=arr[i-1].c_prob+arr[i-1].prob; } } void ser_prob() { int i; ser[0].prob=0.1;ser[1].prob=0.2;ser[2].prob=0.3; ser[3].prob=0.25;ser[4].prob=0.1; ser[5].prob=0.05; for(i=0;i<6;i++) { ser[i].min=i+1; if(i==0) ser[i].c_prob=0.0; else ser[i].c_prob=ser[i-1

#include #include #include int ia(int a) { if(a>=0 && a<=25) return 1; if(a>=26 && a<=50) return 2; if(a>=51 && a<=75) return 3; if(a>=76 && a<=99) return 4; return 0; } int sa(int a) { if(a>=0 && a<=25) return 1; if(a>=26 && a<=50) return 2; if(a>=51 && a<=75) return 3; if(a>=76 && a<=99) return 4; return 0; } void main() { int a[5],notice[2][2],b[5],e[5],d[5]={0,0,0,0,0},f[5],i,c[5],s1[5]; clrscr(); for(i=0;i<5;i++) { a[i]=rand()%100; s1[i]=rand()%100; } for(i=0;i<5;i++) { if(i==0) { b[i]=ia(a[i]); f[i]=b[i]; } else { b[i]=b[i-1]+ia(a[i]); if(d[i-1]>b[i]) f[i]=d[i-1]; else f[i]=b[i]; } c[i]=sa(s1[i]); e[i]=65+i; d[i]=f[i]+c[i]; notice[1][0]=b[i]; notice[1][1]=e[i]; if(i>0 && notice[1][0] 0 && notice[1][0]>notice[0][0]) printf( " (%d,%c)(%d,%c)\n",notice[0][0],notice[0][1],notice[1][0],notice[1][1]); if(i==0) printf("

Name: Mukesh H Mulani Roll No : MCA/4527/10 #include #include #include typedef struct { int cno,in_arr,arr,ser_time,tsb,tse,wait,tsis,idle; }customer; int lookup1(int c) { if(c>=0 && c<13 1="1" c="c" else="else" if="if" return="return">=13 && c<25 2="2" c="c" else="else" if="if" return="return">=25 && c<38 3="3" c="c" else="else" if="if" return="return">=38 && c<50 4="4" c="c" else="else" if="if" return="return">=50 && c<63 5="5" c="c" else="else" if="if" return="return">=63 && c<75 6="6" c="c" else="else" if="if" return="return">=75 && c<87 7="7" 8="8&qu