Present inf (to) be + pp

My car needs to be serviced soon

Perfect inf (to) have been + pp

My car should have been serviced by last month.

We can use the verb “to get” instead of the verb “to be ………………………..

Use the passive is used when:

- the person who carries out the action is unknowns unimportant or obvious from
the context.
Her ruby ring was stolen. (unknown)

- the action is more important than the person who carries it, as in news
headlines, newspaper articles, formal notices ….
Two teenagers were injured last night…

- we want to be more polite

My new blouse is ruined. (versus “You ruined my new blouse”)

NOTE: The passive is used more often in written English, than in spoken English.

We use by + agent to say who / what carries out the action. We use with +
instrument / material / ingredient to say what the agent used.
A kite was made by John. It was made with paper, paint and string.

The agent is often omitted when the subject of the active is: people, one,
someone/ somebody, they, he, ….
People eat a lot of junk food nowadays.
A lot of junk food is eaten nowadays.

With verbs which take two objects such as bring, tell, read, pass, pay, feed, allow,
…, we can make two different passives. However, it is more usual to bring with
the person (in passives).
Jessica showed Rod a picture.
a) Rod was show a picture by Jessica.
b) A picture was shown to Rod by Jessica.
 Personal / Impersonal Construction
Say
Believe
Think
Know
Expect
Consider
Understand
…

1) Active: People say has lost his job.

Passive: It is said he has lost his job. (impers.)
He is said to have lost his job. (pers.)

2) Active: People know he works hard.

Passive: He is known to work hard. (pers.)
It is known that he works hard. (impers.)

In personal passive is…..

//intercalasarea a doi vectori
#include <fstream>

using namespace std;

ifstream f ("date.in");
ofstream g ("date.out");

int main ()
{
int a[100], n, i, b[100], m, j, c[200], k, t;
f >> n;
for ( i = 1; i <= n; i ++ )
f >> a[i];
f >> m;
for ( i = 1; i <= m; i ++ )
f >> b[i];
i = 1;
j = 1;
k = 0;
while (i <= n && j <= m)
if(a[i] < b[j])
/*k++;
c[k] = a[i];
i++;*/
c[++k] = a[i++];
else
c[++k] = b[j++];
for(t = i; t <= n; t++)
c[++k] = a[t];
for(t = j; t <= m; t++)
c[++k] = b[t];
for ( i = 1; i <= n+m; i ++ )
g << c[i] << ' ';

return 0;
}

// cautare binara
#include <fstream>

using namespace std;

ifstream f ("date.in");
ofstream g ("date.out");

int CautBin(int x, int v[], int n)

{
int mij, li, ls;
 li = 1;
ls = n;
while (li <= ls)
{
mij = (li + ls) / 2;
if (x == v[mij])
return 1;
else
if (x > v[mij])
li = mij + 1;
else
ls = mij - 1;
}

return 0;
}

int main ()
{
int v[100], n, i, x;
f >> n >> x;
for ( i = 1; i <= n; i ++ )
f >> v[i];
g << CautBin(x, v, n);
return 0;
}