Ushtrime Ne Java

public class llogari{
private String emri;

private int mosha;
private double mes;
// konstruktor pa parameter
public llogari(){
}
//konstruktor me parameter
public llogari(String em, int m, double mes){
this.emri=em;
this.mosha=m;
this.mes=mes;
}
//method set
public void setEmri(String em){
this.emri=em;
}
public void setMosha(int mo){
this.mosha=mo;
}
public void setMes(double mes){
this.mes=mes;
}
//method get
public String getEmri(){
return emri;
}
public int getMosha(){
return mosha;
}
public double getMes(){
return mes;
}
public static void main(String [] args){
llogari obj=new llogari();
obj.setEmri("hana");
obj.setMes(9.6); Hana
obj.setMosha(32); 32
obj.getEmri();
9.6
obj.getMosha();
obj.getMes();
System.out.println(obj.getEmri());
System.out.println(obj.getMosha());
System.out.println(obj.getMes());
}
}
Ushtrimi 2.
import java.util.Scanner;
class Student {
private String name;
private int age;
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public void display() {
System.out.println("name: "+getName());
System.out.println("age: "+getAge());
}
}
public class AccessData{
public static void main(String args[]) {
//Reading values from user
Scanner sc = new Scanner(System.in);
System.out.println("Enter the name of the student: ");
String name = sc.nextLine();
System.out.println("Enter the age of the student: ");
int age = sc.nextInt();
//Calling the setter and getter methods
Student obj = new Student();
obj.setName(name);
obj.setAge(age);
obj.display();
}
}
Ushtrimi 3.
import java.util.Scanner;
class Student {
private String name;
private int age;
Student(){
Student(String name, int age){
this.name = name;
this.age = age;
public void display() {
System.out.println("name: "+this.name);
System.out.println("age: "+this.age);
public class AccessData{
public static void main(String args[]) {
//Reading values from user
Scanner sc = new Scanner(System.in);
System.out.println("Enter the name of the student: ");
String name = sc.nextLine();
System.out.println("Enter the age of the student: ");
int age = sc.nextInt();
Student obj1 = new Student(name, age);
obj1.display();
}
Ushtrim 1
Të shkruhet një program që gjen shumën e elementëve pozitive në një tabelë njëpërmasore T me n numra të plotë.
Zgjidhje
Kodi
#include <stdio.h>
#include <conio.h>
int main(){
//deklarimi i variablave
int shuma,n;
shuma=0;
printf("Jepni madhesine e tabeles:\n");
//lexon nga tastjera numrin e elementeve te vektorit
scanf("%d",&n);
int t[n]; //deklaron vektorin me emrin t dhe madhesi n
//kap elementet e vektorit nga indexi 0 ne n-1 me hap 1

//mbush vektorin me vlera nga tastjera
for(int i=0;i<n;i++){
printf("Jepni elementin e %d:",i);
scanf("%d",&t[i]);
printf("\n");

}
//bredh elementet e vektorit nga indexi 0 ne n-1 me hap 1
if(t[i]>0)//kontollon elementin t[i] te vektorit nese ka vlere pozitive
shuma+=t[i]; //shton vleren e elementit t[i] tek variabli shuma

}
printf("Shuma elem pozitiv:%d",shuma); //afishon shumen e elementeve pozitive te
vektorit
getch();
return 0;
}
Ushtrim 2
Të shkruhet programi në C, që lexon tabelat njëpërmasore a dhe b, me n numra të plotë, dhe njeheson prodhimin e tyre si vijon
p=a[0]*b[0]+a[1]*b[1]+....a[n-1]*b[n-1]
Zgjidhje
Kodi
#include <stdio.h>
#include <conio.h>
int main()
{
//deklarimet e variablave
int n;
printf("Jepni nr e elem te tab:\n");
//lexon nga tastjera sasine e elementeve te vektorit a dhe b
scanf("%d",&n);
//deklaron vektoret a dhe b
int a[n],b[n];
//mbush me vlera nga tastjera vektorin a
for(int i=0;i<n;i++)
{
printf("Jepni elem e %d per tabelen a :",i+1);
scanf("%d",&a[i]);
printf("\n");
}
//mbush me vlera nga tastjera vektorin b
{
printf("Jepni elem e %d per tabelen b :",i+1);
scanf("%d",&b[i]);
printf("\n");
}
int p=0;
//bredh elementet e vektorit a dhe b nga indexi 0 ne n-1
p+=a[i]*b[i];

printf("%d ",p); //afishon shumen e prodhimit te elementeve te dy vektoreve
getch();
return 0;
}
Ushtrim 3
Shkruani një program në C, që gjen 2 elementët më të medhenjë në një tabelë t[n].
Zgjidhje
Kodi
#include <stdio.h>
#include <conio.h>
int main()
{
//deklaron madhesine e vektorit
int n;
printf("Jepni nr e elem te tab:\n");
//lexon nga tastjera vleren n
scanf("%d",&n);
//deklaron vektorin t me n elemente te plote
int t[n];
//mbush me vlera nga tastjera elementet e vektorit me index 0 deri ne n-1
{
printf("Jepni elem e: %d :",i+1);
scanf("%d",&t[i]);
printf("\n");
}
//rendit vektorin ne rendin zbrites
int tmp;
for(int i=0;i<n-1;i++)
for(int j=i;j<n;j++)
if(t[i]<t[j]){
tmp=t[i];
t[i]=t[j];
t[j]=tmp;
}
//lexon dy vlerat e para te vektorit, pra dy maximumet
for(int i=0;i<2;i++)
printf("%d ",t[i]);
getch();
return 0;
}
Objektivat e leksionit
Ushtrimet me poshte paraqesin ndertimin e disa figurave gjeometrike duke perdorur ciklet dhe ciklet e nderfutura
Serite numerike
#include <stdio.h>
#include <conio.h>
int main(){
int n;
printf("Jep sasine e numrave: ");
scanf("%d",&n);
/*
//duam te gjejme 1+4+9+16+25+......+n*n n pra ne pergjithesi f(n)
int sh=0;
int k;
for(int i=1;i<=n;i++){
k=i*i;//f(i)
sh=sh+k;
}
printf("Shume e %d numrave te pare te serise eshte %d\n",n,sh);
*/
/*
//duam te gjejme 3/1+5/4+7/9+9/16+11/25+......+(2n-1)/(n*n) n pra ne pergjithesi
f(n)/g(n)
float sh=0;
float k;
k=1.0*(2*i+1)/(i*i);//f(i)/g(i)
printf("%d---> %f\n",i,k);
sh=sh+k;
}
printf("Shume e %d numrave te pare te serise eshte %f\n",n,sh);
*/
/*
//duam te gjejme 2/3+5/6+11/30+......a/b+(a+b)/(a*b)
float sh=0;
float k;
int num=2, em=3, num_ri, em_ri;
k=1.0*num/em;
printf("%d---> %f\n",i,k);
sh=sh+k;
num_ri=num+em;
em_ri=num*em;
num=num_ri;
em=em_ri;
}
printf("Shume e %d numrave te pare te serise eshte %f\n",n,sh);
*/
/*
//duam te gjejme 1+4-9+16-25+......+n*n (++-)
int sh=0;
int k;
int shenja;
k=i*i;
shenja=1;
if(i%3==0){
shenja=-1;
}
sh=sh+shenja*k;
}
printf("Shume e %d numrave te pare te serise eshte %d\n",n,sh);
*/
getch();
return 0;
}
Katror
#include <stdio.h>
#include <conio.h>
int main(){
int m;
int nr_yje;
int nr_plus;
printf("Jep numrin e rreshtave: ");
scanf("%d",&m);
//inicializojme per rreshtin e pare
nr_yje=1;
nr_plus=m-1;
for(int i=1;i<=m;i++){
for(int j=1;j<=nr_yje;j++){
printf("*");
}
for(int j=1;j<=nr_plus;j++){
printf("+");
}
printf("\n");
nr_yje++;
nr_plus--;
}
getch();
return 0;
}
Trekendesh
#include <stdio.h>
#include <conio.h>
int main(){
int m;
scanf("%d",&m);
//M.1
/*
//kapim cdo rresht nje e nga nje
//afisho hapesira
for(int j=1;j<=m-i;j++){
printf(" ");
}
//afisho yje
for(int j=1;j<=i;j++){
printf("*");
}
//kalo rresht te ri
printf("\n");
}
*/
//M.2
/*
int nr_yje;
int nr_hapesira;

nr_yje=1;
nr_hapesira=m-1;
//afishojme hapesira
for(int j=1;j<=nr_hapesira;j++){
printf(" ");
}
//afishojme yjet
printf("*");
}
//kalojme rresht te ri
printf("\n");
//zbatojme ndryshimin
nr_yje++;
nr_hapesira--;
}
*/
getch();
return 0;
}
Trekëndësh dybrinjishëm
#include <stdio.h>
#include <conio.h>
int main(){
int m;
scanf("%d",&m);
//M.1

//afisho hapesira
printf(" ");
}
//afisho yje
for(int j=1;j<=2*i-1;j++){
printf("*");
}
//kalo rresht te ri
printf("\n");
}
//M.2
/*
int nr_yje;
int nr_hapesira;

nr_yje=1;
nr_hapesira=m-1;
printf(" ");
}
//afishojme yjet
printf("*");
}
printf("\n");
nr_yje=nr_yje+2;
nr_hapesira--;
}
*/
getch();
return 0;
}
Romb
#include <stdio.h>
#include <conio.h>
int main(){
int m;
scanf("%d",&m);
//M.1
/*
//afishon pjesen e siperme te rombit
//afisho hapesira
printf(" ");
}
//afisho yje
for(int j=1;j<=2*i-1;j++){
printf("*");
}
//kalo rresht te ri
printf("\n");
}
//afishon pjesen e poshtme te rombit

for(int i=1;i<=m-1;i++){
//afisho hapesira
for(int j=1;j<=i;j++){
printf(" ");
}
//afisho yje
for(int j=1;j<=2*m-2*i-1;j++){
printf("*");
}
//kalo rresht te ri
printf("\n");
}
*/
//M.2
int nr_yje;
int nr_hapesira;
//afishojme pjesen siper
nr_yje=1;
nr_hapesira=m-1;
printf(" ");
}
//afishojme yjet
printf("*");
}
printf("\n");
nr_yje=nr_yje+2;
nr_hapesira--;
}
//afishojme pjesen poshte

nr_yje=2*m-3;
nr_hapesira=1;
printf(" ");
}
//afishojme yjet
printf("*");
}
printf("\n");
nr_yje=nr_yje-2;
nr_hapesira++;
}
getch();
return 0;
}
Drejtkëndësh bosh
#include <stdio.h>
#include <conio.h>
int main(){
int m,n;
scanf("%d",&m);
printf("Jep numrin e kolonave: ");
scanf("%d",&n);
//afishimi i rreshtit te pare
for(int j=1;j<=n;j++){
printf("*");
}
printf("\n");
//afishojme rreshtat ne mes
//afishojme yjet
printf("*");
//afishojme hapesirat
for(int j=1;j<=n-2;j++){
printf(" ");
}
//afishojme yjet
printf("*");
printf("\n");
}
//afishojme rreshtin e fundit

printf("*");
}
getch();
return 0;
}
Drejtkëndësh bosh me kontur dinamik
#include <stdio.h>
#include <conio.h>
int main(){
int m,n,k;
scanf("%d",&m);
printf("Jep numrin e kolonave: ");
scanf("%d",&n);
printf("Jep trashesine: ");
scanf("%d",&k);
//afishimi i rreshtat e pare

for(int i=1;i<=k;i++){
printf("*");
}
printf("\n");
}
//afishojme rreshtat ne mes

//afishojme yjet
for(int j=1;j<=k;j++){
printf("*");
}
//afishojme hapesirat
for(int j=1;j<=n-2*k;j++){
printf(" ");
}
//afishojme yjet
for(int j=1;j<=k;j++){
printf("*");
}
printf("\n");
}
//afishojme rreshtat e fundit

for(int i=1;i<=k;i++){
printf("*");
}
printf("\n");
}
getch();
return 0;
}
04 - Arrays
#include <stdio.h>
#include <conio.h>
int main(){
int n;
printf("Jep gjatesine e vektorit: ");
scanf("%d",&n);
int numrat[n];
//leximi i vlerave te vektorit

printf("Jep %d vlerat e vektorit\n",n);
scanf("%d",&numrat[i]);
}
//afishimi i vlerave te vektorit

printf("\n");
printf("%d ",numrat[i]);
}
printf("\n");
//shuma e elementeve te vektorit
int s=0;
s=s+numrat[i];
}
printf("Shuma e elementeve eshte %d\n",s);
printf("\n");
//sasia e elementeve tek ne vektor
int nr_tek=0;
if(numrat[i]%2==1){//numrat[i]>0 numrat[i]==10
nr_tek++;
}
}
printf("Sasia e numrave tek ne vektor eshte %d\n",nr_tek);
printf("\n");
//shuma e elementeve ne pozicionet teke

int nr_pozicion_tek=0;
if(i%2==1){
nr_pozicion_tek++;
}
}
/*M.2
for(int i=1;i<n;i=i+2){
nr_pozicion_tek++;
}
*/
printf("\n");
//A ka elemente cift ne vektor?
int nr_cift=0;
if(numrat[i]%2==0){
nr_cift++;
break;
}
}
if(nr_cift==1){
printf("Ne vektor ka numra cift.");
}
else{
printf("Ne vektor nuk ka numra cift.");
}
printf("\n");
//A ka 5 elemente cift ne vektor?
int nr_cift=0;
if(numrat[i]%2==0){
nr_cift++;
if(nr_cift==5){
break;
}
}
}
if(nr_cift==5){
printf("Ne vektor ka te pakten 5 numra cift.");
}
else{
printf("Ne vektor ka me pak se 5 numra cift.");
}
printf("\n");
//A jane te gjithe elemente cift ne vektor?
int nr_jo_cift=0;
if(!(numrat[i]%2==0)){
nr_jo_cift++;
break;
}
}
if(nr_jo_cift==1){
printf("Ne vektor nuk jane te gjithe numra cift.");
}
else{
printf("Ne vektor jane te gjithe numra cift.");
}
/*
int max=numrat[0];
int poz_max=0;
if(numrat[i]>=max){
max=numrat[i];
poz_max=i;
}
}
int nr_max=0;
if(numrat[i]==max){
nr_max++;
}
}
*/
int max=v[0];
int nr_max=1;
int poz=0;
if(numrat[i]>max){
max=numrat[i];
nr_max=1;
poz=i;
}
else if(numrat[i]==max){
nr_max++;
}
}
//elementi i ekuilibrit
/*
//M.1 Metoda gjate
int poz_ek=-1;
int shuma_para=0;
for(int j=0;j<i;j++){
shuma_para=shuma_para+numrat[j];
}
int shuma_pas=0;
for(int j=i+1;j<n;j++){
shuma_pas=shuma_pas+numrat[i];
}
if(shuma_para==shuma_pas){
poz_ek=i;
break;
}
}
if(poz_ek==-1){
printf("Nuk ka element ekuilibri ne vektor\n");
}
else{
printf("Elementi i ekuilibrit ka indeksin %d\n",poz_ek)''
}
*/
//M.2 Metoda shkurt
int shuma_tot=0;
shuma_tot=shuma_tot+numrat[i];
}
int shuma_mbetur=shuma_tot;
int poz_ek=-1;
shuma_mbetur=shuma_mbetur-numrat[i];
if(shuma_tot==(2*shuma_mbetur+numrat[i])){
poz_ek=i;
break;
}
}
if(poz_ek==-1){
printf("Nuk ka element ekuilibri ne vektor\n");
}
else{
printf("Elementi i ekuilibrit ka indeksin %d\n",poz_ek)''
}
//renditje
/*
//m.1
for(int i=0;i<n-1;i++){
int max=v[i];
int poz=i;
if(numrat[j]>max){
max=numrat[j];
poz=j;
}
}
int tmp=numrat[i];
numrat[i]=numrat[poz];
numrat[poz]=tmp;
}*/
//M.2
for(int i=0;i<n-1;i++){
if(numrat[i]<numrat[j]){
//bejme shkembimin
int tmp=numrat[i];
numrat[i]=numrat[j];
numrat[j]=tmp;
}
}
}
getch();
return 0;
}

Ushtrime Ne Java

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ushtrime Ne Java

Uploaded by

Copyright:

Available Formats

public class llogari{

private String emri;

private String name;

private int age;

Student(String name, int age){

public void display() {

public class AccessData{

public static void main(String args[]) {

//Reading values from user

Scanner sc = new Scanner(System.in);

System.out.println("Enter the name of the student: ");

String name = sc.nextLine();

System.out.println("Enter the age of the student: ");

int age = sc.nextInt();

Student obj1 = new Student(name, age);

//kap elementet e vektorit nga indexi 0 ne n-1 me hap 1

//inicializojme per rreshtin e pare

//kapim cdo rresht nje e nga nje

//inicializojme per rreshtin e pare

//afishon pjesen e poshtme te rombit

//afishojme pjesen poshte

//afishojme rreshtin e fundit

Drejtkëndësh bosh me kontur dinamik

//afishimi i rreshtat e pare

//afishojme rreshtat ne mes

//afishojme rreshtat e fundit

//leximi i vlerave te vektorit

//afishimi i vlerave te vektorit

//shuma e elementeve ne pozicionet teke

You might also like