Engineer Portal - Prem Sasi Kumar Arivukalanjiam

Monday, February 20, 2023

Easy Gitlab Migration

Migrating to GitLab from another version control system or GitLab instance can be a complex process, but there are several steps you can follow to make it as smooth as possible. Here's a general guide on how to do an easy GitLab migration:

PPost Before “read more” And here is the rest of it

Prepare the GitLab instance: Make sure your GitLab instance is up and running with the latest version. You may also need to install any additional components that your current system requires.
Backup your data: Before you start the migration process, create a backup of your existing Git repositories, issues, merge requests, and other data. This will allow you to restore your data in case something goes wrong during the migration.
Export data from the existing system: Depending on the system you're migrating from, there may be different tools or plugins available to help you export your data. For example, if you're migrating from GitHub, you can use the GitHub Importer tool provided by GitLab. If you're migrating from another GitLab instance, you can use the built-in backup and restore functionality to transfer data.
Import data to GitLab: Once you have exported the data from the existing system, you can import it into GitLab. GitLab provides several import tools that you can use to import data from different sources. For example, you can use the GitHub Importer to import data from GitHub, or the GitLab Import/Export tool to import data from another GitLab instance.
Verify the migration: After importing the data, check if everything is working as expected. Verify that the data is correctly imported, and all the repositories, issues, merge requests, and other data are accessible in GitLab.
Update settings: Finally, make sure to update any settings that were previously configured in the old system, such as access controls, permissions, and integrations.

Overall, the migration process may differ depending on the source system you're migrating from and the amount of data you're transferring. However, by following these general steps, you can perform a successful and easy GitLab migration.

Sunday, October 4, 2015

Program to Find the Prime Index elements Prime index sum Duplicate Elements Removal Occurence of the Elements copy an array Element That has occurred Maximum in an Array Using C Programming

Program to Find the Prime Index elements Prime index sum Duplicate Elements Removal Occurence of the Elements copy an array Element That has occurred Maximum in an Array Using C Programming

#include<stdio.h>

int main()
{
int n;
int a[100];
int i;
int j;
int temp=0;
int max=0;
int min=0;
int tempa[100];
int dup[100];
int idx=0;
int k;
int dn=0;
int count=0;
int prime[100];
int pidx=0;
int flag=0;
int primesum=0;
int maxoc=0;
int maxoel=0;

scanf("%d",&n);
printf("getting inputs \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}

printf("Elements in the array\n ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}

printf("\ncopy elements fom one array to another\n");
for(i=0;i<n;i++)
{
tempa[i]=a[i];
}
for(i=0;i<n;i++)
{
printf("%d ",tempa[i]);
}

printf("\n prime index elements and prime index sum\n");
for(i=0;i<n;i++)
{
flag=0;
for(j=1;j<=i;j++)
{
if(i%j==0)
{
flag++;
}
}
if(flag==2)
{
primesum=primesum+tempa[i];
prime[pidx]=tempa[i];
pidx++;
}
}
for(i=0;i<pidx;i++)
{
printf("%d ",prime[i]);
}
printf("\nprime index sum : %d",primesum) ;

printf("\nSorting the elements \n");
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}

for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}

printf("\nMaximum and minimum\n");
max=a[n-1];
min=a[0];
printf("max : %d min : %d",max,min);

printf("\n descending order\n");
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]<=max)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}

printf("\nremove duplicate and occurrence \n");
for(i=0;i<n;i++)
{
count=1;
for(j=i+1;j<n;)
{
if(a[i]==a[j])
{
count++;
for(k=j;k<n;k++)
{
a[k]=a[k+1];
}
n--;
dn=n;
}
else
{
j++;
}
}
dup[idx]=a[i];
dup[idx+1]=count;
idx=idx+2;
}

printf("occurrence of an element\n");
for(i=0;i<idx;i++)
{
printf("%d ",dup[i]);
}

printf("\nremoved duplicates\n");
for(i=0;i<dn;i++)
{
printf("%d ",a[i]);
}
printf("\nmaximum repeated element\n");
for(i=1;i<idx;i=i+2)
{
if(dup[i]>maxoc)
{
maxoc=dup[i];
maxoel=i;
}
}
printf("maximum count occured: %d\n",maxoc);
printf("maximum times occured element : %d",dup[maxoel-1]);
return 0;
}

output
-------
10
getting inputs
1 2 3 1 1 1 2 2 4 5
Elements in the array
1 2 3 1 1 1 2 2 4 5
copy elements fom one array to another
1 2 3 1 1 1 2 2 4 5
prime index elements and prime index sum
3 1 1 2
prime index sum : 7
Sorting the elements
1 1 1 1 2 2 2 3 4 5
Maximum and minumum
max : 5 min : 1
descending order
5 4 3 2 2 2 1 1 1 1
remove duplicate and occurence
occurence of an element
5 1 4 1 3 1 2 3 1 4
removed duplicates
5 4 3 2 1
maximum repeated element
maximum count : 4
maximum count element : 1

Saturday, October 3, 2015

Program to Find the Sum of Even Numbers Within a limit Using C Programming

Program to Find the Sum of Even Numbers Within a limit Using C Programming

#include<stdio.h>
void fun(int n);
int main()
{
int n;
scanf("%d",&n);
fun(n);
return 0;
}

void fun(int n)
{
int i;
int evensum=0;
for(i=0;i<=n;i++)
{
if(i%2==0)
{
evensum+=i;
}
}
printf("%d",evensum);
}

output
--------
10
30

Program to Find the Maximum of the Sum of the Even and Odd Numbers in an Array Using C Programming

Program to Find the Maximum of the Sum of the Even and Odd Numbers in an Array Using C Programming

#include<stdio.h>
void fun(int a[],int n);
int main()
{
int n;
int i;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
fun(a,n);
return 0;
}

void fun(int a[],int n)
{
int i;
int oddsum=0;
int evensum=0;
int max=0;
for(i=0;i<n;i++)
{
if(a[i]%2==0)
{
evensum+=a[i];
}
else
{
oddsum+=a[i];
}
}
if(evensum>oddsum)
{
max=evensum;
printf("%d",max);
}
else if(oddsum>evensum)
{
max=oddsum;
printf("%d",max);
}
else
{
max=evensum;
printf("both are equal max: %d",max);
}
}

output:
-------

10
1 2 3 4 5 6 7 8 9 10
30

Program to Find the Sum of the Cubes of the Prime Using C Programming

Program to Find the Sum of the Cubes of the Prime Using C Programming

#include<stdio.h>
void fun(int n1);
int main()
{
int n1;
scanf("%d",&n1);
fun(n1);
return 0;
}

void fun(int n1)
{
int i,j;
int flag=0;
int sum=0,temp=0;
for(i=1;i<=n1;i++)
{
flag=0;
for(j=1;j<=i;j++)
{
if(i%j==0)
{
flag++;
}
}
if(flag==2)
{
temp=i*i*i;
sum=sum+temp;
}
}
printf("%d",sum);
}

output
--------
5
160

Program to Find the Largest Element Among Three Numbers Using C Programming

Program to Find the Largest Element Among Three Numbers Using C Programming

#include<stdio.h>
void fun(int n1,int n2,int n3);
int main()
{
int n1,n2,n3;
scanf("%d",&n1);
scanf("%d",&n2);
scanf("%d",&n3);
fun(n1,n2,n3);
return 0;
}

void fun(int n1,int n2,int n3)
{
if( (n1>n2) && (n1>n3) )
{
printf("%d",n1);
}
else if(n2>n3)
{
printf("%d",n2);
}
else
{
printf("%d",n3);
}
}

output:
--------
4 2 3
4

Program to Eliminate Duplicates in an Array Using C Programming

Program to Eliminate Duplicates in an Array Using C Programming

#include<stdio.h>
void fun(int a[],int n);
int main()
{
int n;
int i;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
fun(a,n);
return 0;
}

void fun(int a[],int n)
{
int i;
int j;
int k;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;)
{
if(a[i]==a[j])
{
for(k=j;k<n;k++)
{
a[k]=a[k+1];
}
n--;
}
else
{
j++;
}
}
}
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
}

Output
--------

10
1 2 3 1 2 3 1 2 3 4
1 2 3 4