devfolio.co/@arikmukherjee

 

How to install OPENCV package of python in Ubuntu

 First be sure that gedit is already installed in your system. 

If it is not installed, run this command 

                                sudo apt  install gedit  # version 46.1-3

Next run : 

                                sudo apt update

Now, run these following commands to install opencv in your ubuntu operating system.

sudo apt install libopencv-dev python3-opencv

Check opencv version:

                                python3 -c "import cv2; print(cv2.__version__)"

After installing, you can check wheather your program is properly running or not, you can simply write a sample code like....

To create python file : gedit p1.py

import cv2 img = cv2.imread("/home/arik/Downloads/image.jpeg", cv2.IMREAD_GRAYSCALE) cv2.imshow('image',img) cv2.waitKey(0) cv2.destroyAllWindows()

Here is the above given image:  

To run : python3 p1.py

If output is,

So, your installation is successfull.

Warshall Algorithm

 #include<iostream>

using namespace std;

int main()

{

    int n;

    cout<<"Enter total number of vertices"<<endl;

    cin>>n;

    //matrix

    int a[n][n];

    int i,j,k;

    cout<<"Input the value of adjacency matrix"<<endl;

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

    {

        cout<<"Enter the value of "<<i+1<<"row";

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

        {

            cin>>a[i][j];

        }

    }

    

    //display cost matrix

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

    {

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

        {

            cout<<a[i][j]<<" ";

        }

        cout<<endl;

    }

    // algo

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

    {

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

    {

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

        {

                a[i][j]=a[i][j] || (a[i][k] && a[k][j]);

        }

    }

    }

    //diaplay 

    cout<<"output matrix"<<endl;

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

    {

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

        {

            cout<<a[i][j]<<" ";

        }

        cout<<endl;

    }

    

}

Floyd's Algorithm

 #include<iostream>

using namespace std;

int main()

{

    int n;

    cout<<"Enter total number of vertices"<<endl;

    cin>>n;

    //matrix

    int a[n][n];

    int i,j,k;

    cout<<"Input the value of adjacency matrix"<<endl;

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

    {

        cout<<"Enter the value of "<<i+1<<"row";

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

        {

            cin>>a[i][j];

        }

    }

    

    //display adjacency matrix

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

    {

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

        {

            cout<<a[i][j]<<" ";

        }

        cout<<endl;

    }

    //floyd algo

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

    {

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

    {

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

        {

            if(a[i][j]>a[i][k]+a[k][j])

            {

                a[i][j]=a[i][k]+a[k][j];

            }

        }

    }

    }

    //diaplay 

    cout<<"output matrix"<<endl;

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

    {

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

        {

            cout<<a[i][j]<<" ";

        }

        cout<<endl;

    }

    

}

EMPLOYEE TABLE in ORACLE (RDBMS)

Q.EMPLOYEE TABLE

create table EMP(eid number, ename varchar2(20),age number,salary number,company varchar2(60));

insert into EMP values (1,'raju',30,30000,'TCS');

insert into EMP values (2,'indu',35,40000,'IBM');

insert into EMP values (3,'kalia',40,50000,'CTS');

select *

from EMP;

drop table EMP;

select * 

from EMP

where company='TCS';

select ename 

from EMP

where salary>=40000;

select ename 

from EMP

where age<=35 and salary>=40000;

select ename 

from EMP

where age<=35 or salary>=40000;

select min(salary)

from EMP;

select min(salary) as minimum_salary

from EMP;

select max(salary)

from EMP;

select max(salary) as maximum_salary

from EMP;

select avg(salary)

from EMP;

select avg(salary) as average_salary

from EMP;

++++++++++++++++++++++++++++++++++++++++++++++++++++++++

create table EMP(eid number, ename varchar2(20),age number,salary number,company varchar2(60));

insert into EMP values (1,'raju',30,30000,'TCS');

insert into EMP values (2,'indu',35,40000,'IBM');

insert into EMP values (3,'kalia',40,50000,'CTS');

select *

from EMP;

drop table EMP;

select * 

from EMP

where company='TCS';

select ename 

from EMP

where salary>=40000;

select ename 

from EMP

where age<=35 and salary>=40000;

select ename 

from EMP

where age<=35 or salary>=40000;

select min(salary)

from EMP;

select min(salary) as minimum_salary

from EMP;

select max(salary)

from EMP;

select max(salary) as maximum_salary

from EMP;

select avg(salary)

from EMP;

select avg(salary) as average_salary

from EMP;

select ename

from EMP

where salary=(select max(salary)

                from EMP);

select ename

from EMP

where salary=(select min(salary)

                from EMP);

select ename

from EMP

where salary>=(select avg(salary)

                from EMP);

select ename

from EMP

where age=(select max(age)

                from EMP);

select ename

from EMP

where salary>(select salary

                from EMP

                where ename='raju');

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

update EMP set company='TCS'

where eid=1;

select * from EMP;

update EMP set company='IBM'

where eid=2;

select * from EMP;

update EMP set company='CTS'

where eid=3;

select * from EMP;

update EMP set age=age+1;

select * from EMP;

OS-Shortest Job First-SJF Scheduling

 #include<stdio.h>

int main()

{

    int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,totalT=0,pos,temp;

    float avg_wt,avg_tat;

    printf("Enter number of process:");

    scanf("%d",&n);

 

    printf("\nEnter Burst Time:\n");

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

    {

        printf("p%d:",i+1);

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

        p[i]=i+1;

    }

 

    //sorting of burst times

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

    {

        pos=i;

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

        {

            if(bt[j]<bt[pos])

                pos=j;

        }

 

        temp=bt[i];

        bt[i]=bt[pos];

        bt[pos]=temp;

 

        temp=p[i];

        p[i]=p[pos];

        p[pos]=temp;

    }

 

    wt[0]=0;

 

    //finding the waiting time of all the processes

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

    {

        wt[i]=0;

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

             //individual WT by adding BT of all previous completed processes

            wt[i]+=bt[j];

 

        //total waiting time

        total+=wt[i];   

    }

 

    //average waiting time

    avg_wt=(float)total/n;  

 

    printf("\nProcess\t Burst Time \tWaiting Time\tTurnaround Time");

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

    {

        //turnaround time of individual processes

        tat[i]=bt[i]+wt[i]; 

 

        //total turnaround time

        totalT+=tat[i];      

        printf("\np%d\t\t %d\t\t %d\t\t\t%d",p[i],bt[i],wt[i],tat[i]);

    }

 

    //average turnaround time

    avg_tat=(float)totalT/n;     

    printf("\n\nAverage Waiting Time=%f",avg_wt);

    printf("\nAverage Turnaround Time=%f",avg_tat);

}

OS- First Come First Serve - FCFS Scheduling

 #include <stdio.h>

int main()

{

    int pid[15];

    int bt[15];

    int n,i;

    printf("Enter the number of processes: ");

    scanf("%d",&n);

 

    printf("Enter process id of all the processes: ");

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

    {

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

    }

 

    printf("Enter burst time of all the processes: ");

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

    {

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

    }

 

    int wt[n];

    wt[0]=0;

 

    //for calculating waiting time of each process

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

    {

        wt[i]= bt[i-1]+ wt[i-1];

    }

 

    printf("Process ID     Burst Time     Waiting Time     TurnAround Time\n");

    float twt=0.0;

    float tat= 0.0;

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

    {

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

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

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

 

        //calculating and printing turnaround time of each process

        printf("%d\t\t", bt[i]+wt[i]);

        printf("\n");

 

        //for calculating total waiting time

        twt += wt[i];

 

        //for calculating total turnaround time

        tat += (wt[i]+bt[i]);

    }

    float att,awt;

 

    //for calculating average waiting time

    awt = twt/n;

 

    //for calculating average turnaround time

    att = tat/n;

    printf("Avg. waiting time= %f\n",awt);

    printf("Avg. turnaround time= %f",att);

}