Looking for Structuri de date test answers and solutions? Browse our comprehensive collection of verified answers for Structuri de date at elearning.e-uvt.ro.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Se considera crearea cu reordonare a unei liste dinamice
function nod(x){
this.contor=1;
this.x=x;
this.urmator=null;
}
function inserare(){
x=eval(prompt("val x",""));
fanion.x=x;
q1=inceput;
if(q1==fanion){
inceput=new nod(x);
inceput.urmator=fanion;
}
else
if(q1.x==x)
q1.contor++;
else
do{
q2=q1;
q1=q2.urmator;
}while (q1.x!=x);
if(q1==fanion){
q=new nod(x);
q.urmator=inceput;
inceput=q;
}
else{
q1.contor++;
q2.urmator=q1.urmator;
q1.urmator=inceput;
inceput=q1;
}
}
function afisare(){
s=""; q=inceput;
while(q!=fanion){
s+="q.x="+q.x+"q.contor="+q.contor+"<br>";
q=q.urmator;
}
document.write("Lista: <br>"+s);
}
inceput=new nod(0); fanion= inceput
c=eval(prompt("1-inserare, 2-afisare",""));
while(c==1 || c==2){
if(c==1)
inserare();
else
afisare();
c=eval(prompt("1-inserare, 2-afisare",""));
}
Faceti asocierile (inserarea unui nod nou):
Se considera crearea unei liste dinamice ordonata
function nod(x){
this.comtor=1;
this.x=x;
this.urmator=null;
}
function inserare(){
x=eval(prompt("val x",""));
fanion.x=x;
q1=inceput;
q2=inceput.urmator;
while(q2.x<x){
q1=q2;
q2=q1.urmator;
}
if((q2.x==x) && (q2!=fanion))
q2.contor++;
else {
p=new nod(x);
q1.urmator=p;
p.urmator=q2;
}
}
function afisare(){
s=""; q=inceput.urmator;
while(q!=fanion){
s+="q.x="+q.x+"<br>";
q=q.urmator;
}
document.write("Lista: <br>"+s);
}
inceput=new nod(0); fanion=new nod(0); inceput.urmator=fanion;
c=eval(prompt("1-inserare, 2-afisare",""));
while(c==1 || c==2){
if(c==1)
inserare();
else
afisare();
c=eval(prompt("1-inserare, 2-afisare",""));
}
Faceti asocierile (Inserarea unui nod nou):
Se considera crearea unei liste dinamice, folosind metoda problemei concordantei
function nod(cuvant){ this.contor=1; this.cuvant=cuvant; this.urmator=null;}function inserare(){ let x=prompt("Introduceti cuvant",""); let p=inceput;b=true; while((p!=null) && (b==true)){ if(x==p.cuvant) b=false; else p=p.urmator; } if(p==null){ p=new nod(x); p.urmator=inceput; inceput=p; } else p.contor++;}function afisare(){ let q=inceput; while(q!=null){ console.log(q.cuvant, q.contor); q=q.urmator; } }let inceput=null;let c=Number(prompt("1-inserare, 2-afisare"));while(c==1 || c==2){ if(c==1) inserare(); else afisare();c=Number(prompt("1-inserare, 2-afisare")); }Faceti asocierile (inserarea unui nod nou):
Se considera crearea unei liste dinamice, folosind metoda
problemei concordantei
function nod(cuvant){
this.contor=1; this.cuvant=cuvant; this.urmator=null;}function inserare(){ let x=prompt("Introduceti cuvant",""); let p=inceput;b=true; while((p!=null) && (b==true)){ if(x==p.cuvant) b=false; else p=p.urmator; } if(p==null){ p=new nod(x); p.urmator=inceput; inceput=p; } else p.contor++;}function afisare(){ let q=inceput; while(q!=null){ console.log(q.cuvant, q.contor); q=q.urmator; } }let inceput=null;let c=Number(prompt("1-inserare, 2-afisare"));while(c==1 || c==2){ if(c==1) inserare(); else afisare();c=Number(prompt("1-inserare, 2-afisare")); }Faceti asocierile (structura nodurilor):
Se considera crearea unei liste dinamice de tip coada:
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("Valoare x")); let q=new nod(x); if(p==null) p=q; else u.urmator=q; u=q;}function afisare(){ let q=p; while(q!=null){ console.log(q.x); q=q.urmator; }}function stergere(){ if(p!=null){ let q=p; p=q.urmator; q=null; if(p==null)u=null; }}let p=null, u=null;let c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));while(c==1 || c==2 || c==3){ if(c==1) inserare(); else if(c==2) afisare(); else stergere();c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));}Faceti asocierile (Meniul principal)
Se considera crearea unei liste dinamice de tip coada:
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("Valoare x")); let q=new nod(x); if(p==null) p=q; else u.urmator=q; u=q;}function afisare(){ let q=p; while(q!=null){ console.log(q.x); q=q.urmator; }}function stergere(){ if(p!=null){ let q=p; p=q.urmator; q=null; if(p==null)u=null; }}let p=null, u=null;let c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));while(c==1 || c==2 || c==3){ if(c==1) inserare(); else if(c==2) afisare(); else stergere();c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));}Faceti asocierile (stergerea unui nod din vârful listei):
Se considera crearea unei liste dinamice de tip coada:
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("Valoare x")); let q=new nod(x); if(p==null) p=q; else u.urmator=q; u=q;}function afisare(){ let q=p; while(q!=null){ console.log(q.x); q=q.urmator; }}function stergere(){ if(p!=null){ let q=p; p=q.urmator; q=null; if(p==null)u=null; }}let p=null, u=null;let c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));while(c==1 || c==2 || c==3){ if(c==1) inserare(); else if(c==2) afisare(); else stergere();c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));}Faceti asocierile (afisarea nodurilor listei):
Se considera crearea unei liste dinamice de tip coada:
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("Valoare x")); let q=new nod(x); if(p==null) p=q; else u.urmator=q; u=q;}function afisare(){ let q=p; while(q!=null){ console.log(q.x); q=q.urmator; }}function stergere(){ if(p!=null){ let q=p; p=q.urmator; q=null; if(p==null)u=null; }}let p=null, u=null;let c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));while(c==1 || c==2 || c==3){ if(c==1) inserare(); else if(c==2) afisare(); else stergere();c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));}Faceti asocierile (structura nodurilor si inserarea unui nod nou la sfarsitul listei):
Se considera o stiva
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("valoare x")); let p=new nod(x); p.urmator=varf; varf=p;}function afisare(){ let q=varf; while(q!=null){ console.log("q.x=",q.x); q=q.urmator; }}function stergere(){ if(varf!=null){ let p=varf; varf=p.urmator; p=null; }}let varf=null;let c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));while(c==1 || c==2 || c==3){ if(c==1) inserare(); else if(c==2) afisare(); else stergere();c=Number(prompt("1 - inserare nod in varf, 2 - afisare lista, 3 - stergere nod din varf"));}Faceti asocierile:
Se considera crearea unei liste dinamice cu inserarea unui nod nou la sfarsitul listei.
function nod(x){ this.x=x; this.urmator=null;}function inserare(){ let x=Number(prompt("Valoare x")); let q=new nod(x); if(p==null) p=q; else u.urmator=q; u=q;}function afisare(){ let q=p; while(q!=null){ console.log(q.x); q=q.urmator; } }let p=null, u=null;let c=Number(prompt("1-inserare, 2-afisare"));while(c==1 || c==2){ if(c==1) inserare(); else afisare();c=Number(prompt("1-inserare, 2-afisare")); }Faceti asocierile