Laborator 1 February 22, 2010

1. Se consider o list liniar simplu nlnuit cu elemente de numere ntregi.

S se nsereze naintea fecrui element negati un element care a conine
opusul su.
namespace _1.Inserare_a_unui_elem_opus
{
public class nod
{
public object val;
public nod adr;
public nod()
{
val = null;
adr = null;
}
public nod(object x)
{
val = x;
adr = null;
}
}
public class llin
{
static nod p,u,q,q1;
static void ain(strin!"# ar!s)
{
int n,i,x;
$onsole.%rite(&n= &);
n=int.'arse($onsole.(ead)ine());
$onsole.(ead)ine();
p=ne* nod();
u=p;
+or(i=1; i,=n; i--)
{
$onsole.%rite(&x= &);
x=int.'arse($onsole.(ead)ine());
q=ne* nod(x);
u.adr=q;
u=q;
}
$onsole.%rite(&)ista initiala. &);
q=p;
*/ile(0(q.adr==null))
{
$onsole.%rite(q.adr.val- & &);
q=q.adr;
}
$onsole.%rite(&1n&);
q=p;
*/ile(0(q.adr==null))
{
i+ ((int) q.adr.val,2)
{
q1=ne* nod();
q1.val=3(int) q.adr.val;
q1.adr=q.adr;
q.adr=q1;
q=q.adr.adr;
}
else
q=q.adr;
}
$onsole.%rite(&)ista noua. &);
q=p;
*/ile(0(q.adr==null))
{
$onsole.%rite(q.adr.val - & &);
q=q.adr;
}
$onsole.(ead)ine();
}
}
}
}
!1"
Laborator 1 February 22, 2010
2. Se consider o list liniar simplu nlnuit cu n#1 de elemente, care
conine coefcieni reali ai unui polinom de grad n. Se cite$te de la tastatur
un numr real y. %alculai aloarea polinomului n y.
namespace _4.5al.polinomului_in_6
{
public class nod
{
public object val;
public nod adr;
public nod()
{
val = null;
adr = null;
}
public nod(object x)
{
val = x;
adr = null;
}
}
public class llin
{
static nod p, u, q;
static void ain(strin!"# ar!s)
{
int n, i;
+loat x, 6, pol, pute;
$onsole.%rite(&7radul polinomului= &);
n = int.'arse($onsole.(ead)ine());
p = ne* nod();
u = p;
+or (i=2; i,=n; i--)
{
$onsole.%rite(&$oe+icientii. &);

x=+loat.'arse($onsole.(ead)ine());
q=ne* nod(x);
u.adr=q;
u=q;
}
$onsole.%rite(&6= &);
6=+loat.'arse($onsole.(ead)ine());
pol=2;
q=p;
pute=1;
*/ile(0(q.adr==null))
{
pol-=(+loat)q.adr.val8pute;
pute=pute86;
q=q.adr;
}
$onsole.%rite(pol);
$onsole.(ead)ine();
}
}
}
!2"
Laborator 1 February 22, 2010
&. Se citesc numere natural p'n la nt'lnirea alorii 0. S se af$eze toate
perec(ile de numere citite consecutie cu proprietatea c al doilea numr
este egal cu suma ci)relor primului numr.
namespace _9.'erec/i_de_numere
{
public class nod
{
public object val;
public nod adr;
public nod()
{
val = null;
adr = null;
}
public nod(object x)
{
val = x;
adr = null;
}
}
public class llin
{
static nod p, u, q;
static int suma(int :)
{
int s = 2;
*/ile (: 0= 2)
{
s -= : ; 12;
}
return s;
}
static void ain(strin!"# ar!s)
{
int x, 6;
$onsole.%rite(&<pasa 2 pentru
s+arsit0&);
$onsole.(ead)ine();
p = ne* nod();
u = p;
$onsole.%rite(&x= &);
x = int.'arse($onsole.(ead)ine());
*/ile (x 0= 2)
{
q = ne* nod(x);
u.adr = q;
u = q;
$onsole.%rite(&x= &);
x = int.'arse($onsole.(ead)ine());
}
q = p;
*/ile (0(q.adr == null))
{
6 = suma((int)q.adr.val);
i+ ((q.adr 0= u) ==
((int)q.adr.adr.val == 6))
$onsole.%rite)ine(q.adr.val - & & -
q.adr.adr.val);
q = q.adr;
}
$onsole.(ead)ine();
}
}
}
!&"