Shruti Speak's

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 { 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 { ser[i].min=i+1; if(i==0) ser[i].c_prob=0.0; else ser[i].c_prob=ser[i-1].c_prob+ser[i-1].pro...

#include #include #include int ia(int a) { if(a>=0 && a =26 && a =51 && a =76 && a =0 && a =26 && a =51 && a =76 && a 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("InterArr Arrival EventNtc ServTime ServComp Notice\n"); printf("%6d%9d (%c,%4d)%8d%8d",ia(a[i]),b[i],e[i],f[i],c[i],d[i]); notice[0][0]=d[i]; notice[0][1]=e[i]; } printf(" (%d,%c)",notice[0][0],notice[0][1]); getch(); }

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 && c =25 && c =38 && c =50 && c =63 && c =75 && c =0 && c =11 && c =31 && c =61 && c =86 && c =b?a:b; } void prtfel(event fel[],int t,int in,int dp) { event temp[3],temp2; int i,j; for(i=0;i

Sumit Prasad (MCA/4521/10) #include #include #include int interarr(int rand) { if(rand>=0&&rand<=12) return 1; if(rand>=13&&rand<=25) return 2; if(rand>=26&&rand<=37) return 3; if(rand>=38&&rand<=50) return 4; if(rand>=51&&rand<=62) return 5; if(rand>=63&&rand<=75) return 6; if(rand>=76&&rand<=87) return 7; if(rand>=88&&rand<=99) return 8; return 0; } int main() { int arrival=0,s[10],ia,idle=0,st,servend,servbegin=0,r[10],i,wt=0,notice[2][2]; char ch='A'; clrscr(); for(i=0;i   {   r[i]= rand()%100;   s[i]=rand()%100;   } printf("Sno.Interarr Arr Servtime Servbegin Servend WT Idle  Event     Fel\n"); for(i=0;i { ia=interarr(r[i]); st=interarr(s[i]); servend=servbegin+st; wt=servbegin-arrival; if(i>0) printf("(%d,%c),(%d,%c)\n\n",notice[0][0],notice[0][1],notice[1][0],notice[1][1]); printf("%3d%5d...

FEL by Saurabh Piyush MCA/4509/10 */ FEL GENERATED FOR 500 CUSTOMERS------TIME =1000 mins */ #include #include #include typedef struct { int cust_no,int_arrival,arrival,service,tsb,tse,wait,tsis,idle; }customer; int lookup2(int c) { if(c>=0 && c =11 && c =31 && c =61 && c =86 && c =0 && c =13 && c =25 && c =38 && c =50 && c =63 && c =75 && c =b?a:b; } void sort_fel(event fel[],int t,int in,int dp) { event temp[3],temp2; int i,j; for(i=0;i

Answer /* 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 20. */ -->