TODAY 360 TECH: March 2014

Wednesday, March 26, 2014

Top 2 Media Players for Windows

1. VLC Player

VLC media player (commonly known as VLC) is a portable, free and open-source, cross-platform media player and streaming media server written by the VideoLAN project.It is king of media players of windows.

Features:

Multiple media format support
Multiple customizations

Easy to Use

Excellent performance

Cross platform support

skins support

Download site link: http://sh.st/qDSvv

2. Media Player classic

Media Player Classic (MPC) is a compact media player for

32-bit and 64-bit Microsoft Windows. MPC mimics the
look and feel of the old, lightweight Windows Media Player 6.4, but provides most options and features available in modern media players. It and its forks are standard media players in the K-Lite Codec Pack and the Combined Community Codec Pack.

Features:

aspect ratio control
multiple codecs pack availabe
skin support

Download site link: http://sh.st/qDS47

DEV C++

Dev-C++ is a free integrated development environment (IDE) distributed under the GNU General Public License for programming in C and C++.MinGW, a free compiler, is bundled with it. The IDE is written in Delphi.for more info click here

Links to download Dev C++

Link1: http://sh.st/qDAvG

Link2: http://sh.st/qDAWj

Tuesday, March 25, 2014

Tourbo c compiler for windows 7

link for zip download http://adf.ly/hOInR

C Program for strassen matrix multiplication

#include<conio.h>
#include<stdio.h>
int main(){
int a[2][2],b[2][2],c[2][2],i,j;
int m1,m2,m3,m4,m5,m6,m7;

printf("Enter the 4 elements of first matrix: ");
for(i=0;i<2;i++)
for(j=0;j<2;j++)
scanf("%d",&a[i][j]);

printf("Enter the 4 elements of second matrix: ");
for(i=0;i<2;i++)
for(j=0;j<2;j++)
scanf("%d",&b[i][j]);

printf("\nThe first matrix is\n");
for(i=0;i<2;i++){
printf("\n");
for(j=0;j<2;j++)
printf("%d\t",a[i][j]);
}

printf("\nThe second matrix is\n");
for(i=0;i<2;i++){
printf("\n");
for(j=0;j<2;j++)
printf("%d\t",b[i][j]);
}

m1= (a[0][0] + a[1][1])*(b[0][0]+b[1][1]);
m2= (a[1][0]+a[1][1])*b[0][0];
m3= a[0][0]*(b[0][1]-b[1][1]);
m4= a[1][1]*(b[1][0]-b[0][0]);
m5= (a[0][0]+a[0][1])*b[1][1];
m6= (a[1][0]-a[0][0])*(b[0][0]+b[0][1]);
m7= (a[0][1]-a[1][1])*(b[1][0]+b[1][1]);

c[0][0]=m1+m4-m5+m7;
c[0][1]=m3+m5;
c[1][0]=m2+m4;
c[1][1]=m1-m2+m3+m6;

printf("\nAfter multiplication using \n");
for(i=0;i<2;i++){
printf("\n");
for(j=0;j<2;j++)
printf("%d\t",c[i][j]);
}

getch();
return 0;
}

Program in c for LRU (Last recently used page peplacement) algorithm

#include<stdio.h>

#include<conio.h>

int n,ref[100],fs,frame[100],count=0;

void input();

void show();

void cal();

void main()

{

printf("****************** LRU Page Replacement Algo *********************\n");

input();

cal();

show();

getch();

}

void input()

{

int i;

printf("Enter no of pages in Refrence String\t");

scanf("%d",&n);

printf("Enter the reference string:");

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

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

printf("Enter the Frame Size\t");

scanf("%d",&fs);

}

void cal()

{

int i,j,k=0,c1,c2[100],r,temp[100],t;

frame[k]=ref[k];

count++;

k++;

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

{

c1=0;

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

{

if(ref[i]!=frame[j])

c1++;

}

if(c1==fs)

{

count++;

if(k<fs)

{

frame[k]=ref[i];

k++;

}

else

{

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

{

c2[r]=0;

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

{

if(frame[r]!=ref[j])

c2[r]++;

else

break;

}

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

temp[r]=c2[r];

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

{

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

{

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

{

t=temp[r];

temp[r]=temp[j];

temp[j]=t;

}

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

{

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

frame[r]=ref[i];

}

void show()

{

printf("Page Faults = %d",count);

}

Program in C for fifo page replacement algorithm

#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;
if (avail==0)
{
frame[j]=a[i];
j=(j+1)%no;
count++;
for(k=0;k<no;k++)
printf("%d\t",frame[k]);
}
printf("\n");
}
printf("Page Fault Is %d",count);
return 0;
}

Program in c for insertion and selection sort

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

int a[1000];
int main()
{
int i,j,s,temp,p=0,h=0,op,ans,upper,c,n,y,x,count=0;

printf("Enter the upper limits");

scanf("%d",&upper);
for(c=0;c<upper;c++)

{
a[c]=rand()%1000+1;

}
do
{

printf("enter sorting operations to perfom:/t 1-Insertion sort 2-selection sort 3-exit");
scanf("%d",&op);

{
switch(op)
{
case 1:
{

for(i=1;i<upper;i++)
{
temp=a[i];
j=i-1;
h++;
while((temp<a[j])&&(j>=0))
{
a[j+1]=a[j];
j=j-1;
p++;
}
a[j+1]=temp;
}

printf("After sorting: ");
for(i=0;i<upper;i++)
printf(" %d",a[i]);
printf("\nNO OF COUNT FOR OUTER LOOP IS =%d\n",h);
printf("\nNO OF COUNT IS =%d",p);
break;
}

case 2:
{

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

{

int index_of_min = x;

for(y=x;y<n;y++)

{

if(a[index_of_min]>a[y])
{

index_of_min = y;
count++;

}

}

int temp = a[x];

a[x] = a[index_of_min];

a[index_of_min] = temp;

}

printf("After sorting is: ");
for(i=0;i<n;i++)
printf(" %d",a[i]);

printf("\nThe count is :%d",count);

break;
}
case 3:
{
exit(0);
break;
}

default:
{
printf("wrong choice");

}

}
}

printf("do you want to cont.if yes press 1 or else 0\n");
scanf("%d",&ans);
}while(ans==1);
getch();
return 0;
}