Documente Academic
Documente Profesional
Documente Cultură
Portofoliu Teme PCLP3
Portofoliu Teme PCLP3
Portofoliu de
teme
[PCLP3]
Zarnescu Laurentiu
Gr. 4433, AIA II
BRAOV, 2015
1. Bitmap Editor
1.1. Enuntarea temei :
S se scrie un program care s genereze, pe baza unui fiier bitmap de
intrare, trei fiiere
bitmap, care prezint separat cele trei componente de culoare.
package bmped;
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
public class BitmapEditorMain
{
public static void main(String[] args) {
try{
while(img.available()>0){
int r,g,b;
//Citirea valorilor RGB
b=img.read();
g=img.read();
r=img.read();
//Scrierea noilor valori in 3 poze diferite
imgB.write(b);
imgB.write(b);
imgB.write(b);
imgG.write(g);
imgG.write(g);
imgG.write(g);
imgR.write(r);
imgR.write(r);
imgR.write(r);
}
img.close();
imgR.close();
imgG.close();
imgB.close();
}
catch(Exception e)
{
System.out.println(e);
}
}
}
3 | Page
Zarnescu Laurentiu
AIA 4433
import java.awt.Color;
import java.awt.FlowLayout;
import java.awt.Frame;
import java.awt.image.BufferedImage;
import java.io.File;
import java.io.IOException;
import javax.imageio.ImageIO;
import javax.swing.ImageIcon;
import javax.swing.JLabel;
public class ImgageReading
{
public static void main(String[] args) {
try
{
BufferedImage img=ImageIO.read(new File("woman.jpg"));
int h=img.getHeight();
int w=img.getWidth();
int R,G,B;
//int x=2;
int aux;
BufferedImage buf =new BufferedImage(w, h, BufferedImage.TYPE_INT_RGB);
Color c=null;
Color col=null;
4 | Page
Zarnescu Laurentiu
AIA 4433
for(int i=0;i<w;i++) {
for(int j=0;j<h;j++) {
//Citirea si scrierea culorii
c=new Color(img.getRGB(i, j));
R=c.getRed();
G=c.getGreen();
B=c.getBlue();
aux=(R+G+B)/3;
col=new Color(aux,aux,aux);
buf.setRGB(i, j,col.getRGB());
}}
//Scrierea imaginii
File f=new File("EditImg.jpg");
ImageIO.write(buf,"jpg",f);
//Afisarea in fereastra
ImageIcon im=new ImageIcon(buf);
ImageIcon im2=new ImageIcon(img);
String description=im.getDescription();
Frame geam=new Frame(description);
geam.setSize(w, 2*h);
geam.setLayout(new FlowLayout());
geam.add(new JLabel(im2));
geam.add(new JLabel(im));
geam.show();
}
catch(IOException e){}
}
public void Desaturate(String url)
}
5 | Page
Zarnescu Laurentiu
AIA 4433
for(int i=0;i<9;i++){
if(a[i]>a[i+1]){
int aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
sort=false;
contor++;
}
}
}
System.out.println();
System.out.println("Sirul ordonat:");
for (int i=0; i<10;i++){
System.out.print(a[i]+", ");
}
System.out.println();
System.out.println("Orodnarea a fost facuta folosind un numar de "+contor+"
intershimbari .");
}
}
7 | Page
Zarnescu Laurentiu
AIA 4433
while(i<j){
if(T[i]>T[j])
public static
void main(String[] args) {
{ new int[10];
int []a=
inti<10;i++){
aux=T[i];
for (int i=0;
T[i]=T[j];
a[i]=(int)((Math.random()*100));
}
T[j]=aux;
quicksort(a,0,9);
if(mod)
System.out.println();
i++;
System.out.println("Sirul ordonat:");
else
for (int i=0; i<10;i++){
j--;
}
System.out.print(a[i]+", ");
}
return i;
}
System.out.println();
System.out.println("Orodnarea a fost facuta folosind un numar
de "+contor+" intershimbari .");
}
Zarnescu Laurentiu
}
AIA 4433
8 | Page
3.Comparatie
Bubble Sort
Quick
Sort
VS
9 | Page
Zarnescu Laurentiu
AIA 4433
10 | P a g e
Zarnescu Laurentiu
AIA 4433
11 | P a g e
Zarnescu Laurentiu
AIA 4433
12 | P a g e
Zarnescu Laurentiu
AIA 4433
4. Liste inlantuite.
4.1 Enuntul problemei.
S se modifice programul de mai sus prin implementarea opiunii de
eliminare a elementelor negative din list (opiunea 4).
13 | P a g e
Zarnescu Laurentiu
AIA 4433
14 | P a g e
Zarnescu Laurentiu
AIA 4433
else
{
int nr=nrElemente(lista);
if (N>nr+1)
N=nr+1;
Nod* tmp=new Nod;
tmp->inf = val;
Nod *aux = lista;
for(int i=1; i>N-1; i++)
aux=aux -> urm;
tmp -> urm = aux-> urm;
aux -> urm = tmp;
}
}
void afisare (Nod * lista)
{
Nod *aux = lista ;
cout<<"Lista este:";
while(aux != NULL)
{
cout<<aux->inf<<" ";
aux = aux -> urm;
}
if (lista == NULL)
cout<<"vida."<<endl;
else
cout<<endl;
}
void eliberaremem(Nod *&lista)
{
Nod* aux =lista;
while (aux != NULL)
{
lista = lista->urm;
delete aux;
aux=lista;
}
}
15 | P a g e
Zarnescu Laurentiu
AIA 4433
16 | P a g e
Zarnescu Laurentiu
AIA 4433
switch (opt)
{
case 1:
{
int v,p;
cout<<endl<<"Introduceti valoarea: ";
cin>>v;
cout<<"Introduceti pozitia (lista are "<<nrElemente(L)<<" el): ";
cin>>p;
adauga(L,v,p);
afisare(L);
break;
}
case 2:
{
int p;
cout<<endl<<"Pozitia (lista are "<<nrElemente(L)<<" el): ";
cin>>p;
elimin(L,p);
afisare(L);
break;
}
case 3:
{
cout<<endl;
afisare(L);
break;
}
case 4:
{
eliminnegat(L);
cout<<"Eliminarea elementelor negative incheiata !"<<endl;
break;
}
}
fflush(stdin);
getch();
}
while(opt!=0);
eliberaremem(L);
}
17 | P a g e
Zarnescu Laurentiu
AIA 4433
18 | P a g e
Zarnescu Laurentiu
AIA 4433
Contents
1. Bitmap Editor..........................................................1
1.1. Enuntarea temei :.................................................1
1.2.Algoritmul de rezolvare a problemei :....................1
1.3.Imagini din timpul functionarii:..............................3
1.4 Algoritmul pentru desaturarea unei imagini de
format jpeg..................................................................3
1.4.1 Imagini din timpul rularii..................................3
1.4.2 Cod sursa.........................................................4
2. Buble sort i Quick sort.........................................6
2.1. Enuntarea temei :.................................................6
2.2. Algoritmul de rezolvare a problemei :...................6
2.3.Imagini din timpul functionarii:..............................7
2.4. Enuntarea temei :.................................................8
2.5. Algoritmul de rezolvare a problemei :...................8
2.6.Imagini din timpul functionarii:............................10
3.Comparatie Quick Sort VS Bubble Sort..............10
3.1 Enuntul problemei...............................................10
3.2 Algoritmul de rezolvare al problemei..................10
3.3 Imagini din timpul functionarii.............................12
4. Liste inlantuite.....................................................13
4.1 Enuntul problemei...............................................13
4.2 Algoritmul de rezolvare al problemei...................13
4.3 Imagini din timpul functionarii.............................17
19 | P a g e
Zarnescu Laurentiu
AIA 4433