Prove scritte 2020 - Revision history

Flecart: /* Soluzione proposta 1 (da controllare) */

2023-01-16T14:36:04Z

Soluzione proposta 1 (da controllare)

2023-01-16T13:43:03Z

Prova 2020/01/15

2023-01-13T14:26:03Z

esercizio c2

2023-01-13T14:24:20Z

esercizio c2

2023-01-13T14:22:30Z

Prova 2020/01/15

2023-01-13T13:56:22Z

esercizio c1

2023-01-13T13:55:49Z

esercizio c1

2023-01-13T13:55:04Z

2023-01-13T13:54:12Z

Created blank page

New page

@@ Line 111: / Line 111: @@
-=== Soluzione proposta 1 (da controllare)===
+=== Soluzione proposta 1 ===
 [[User:Gio|Gio]] ([[User talk:Gio|talk]]) 14:43, 16 January 2023 (CET)
 <syntaxhighlight lang="C">
 void multisend(pid_t destination,T msg,int times){
-   for(int i=0;i<n;i++){
+   for(int i=0; i<n; i++) {
-     asend(<n-i,getpid(),msg>,destination);
+     asend(<n-i, getpid(), msg>, destination);
-     ack=arecv(destination)
+     ack = arecv(destination);
+   }
+}
-T multirecv(pid_t sender){
-   int i;
+T multirecv(pid_t sender_first) {
-  if(sender==ANY){
+   <i, sender, msg> = arecv(sender_first);
-    //assegna il pid preso da a recv a sender
+   asend(ack, sender);
-    <i, sender, msg>=arecv(ANY);
-  }else{
+   while(i > 0) {
-    <i, sender, msg>=arecv(sender);
+     <j, _, msg>=arecv(sender);
      asend(ack, sender);
      i--;
      assert(i==j);
@@ Line 141: / Line 137: @@
    return msg;
+}
 </syntaxhighlight>

← Older revision		Revision as of 13:43, 16 January 2023
Line 109:		Line 109:

	== esercizio c2 ==		== esercizio c2 ==
		+
		+
		+	=== Soluzione proposta 1 (da controllare)===
		+
		+	[[User:Gio\|Gio]] ([[User talk:Gio\|talk]]) 14:43, 16 January 2023 (CET)
		+
		+	<syntaxhighlight lang="C">
		+
		+	void multisend(pid_t destination,T msg,int times){
		+	for(int i=0;i<n;i++){
		+	asend(<n-i,getpid(),msg>,destination);
		+	ack=arecv(destination)
		+	}
		+	}
		+	T multirecv(pid_t sender){
		+	int i;
		+	if(sender==ANY){
		+	//assegna il pid preso da a recv a sender
		+	<i, sender, msg>=arecv(ANY);
		+	}else{
		+	<i, sender, msg>=arecv(sender);
		+	}
		+	asend(ack,sender);
		+	i--;
		+	while(i>0)
		+	<j, sender, msg>=arecv(sender);
		+	asend(ack,sender);
		+	i--;
		+	assert(i==j);
		+	}
		+	return msg;
		+	}
		+	</syntaxhighlight>

	= Prova 2020/02/20 =		= Prova 2020/02/20 =

← Older revision		Revision as of 13:56, 13 January 2023
Line 4:		Line 4:

	=== Soluzione proposta 1 ===		=== Soluzione proposta 1 ===
		+	<syntaxhighlight lang="C">
		+	class TS{
		+
		+	int v=0;
		+	queue<(unsigned int,cond)> pq;
		+	usinged int timer;
		+
		+
		+	void V(){
		+	if(pq.empty()){
		+	v++;
		+	}else{
		+	pq.pop().signal();
		+	}
		+	}
		+	bool P(unsigned int timeout){
		+	if(v == 0){
		+	cond c = new condition();
		+	pq.push((timeout+timer,));
		+	c.wait();
		+	free(c);
		+	if timer== timeout+timer{
		+	return true;
		+	}
		+	}else{
		+	v--;
		+	}
		+	return false;
		+	}
		+
		+	void tick(){
		+	timer++;
		+	for [i,c] in pq.iter(){
		+	if( i <= timer) {
		+	c.signal();
		+	// la nostra stuttura dati supporta la rimozione durante lo scorrimento
		+	// per esempio può essere una lista
		+	pq.remove(c);
		+	}
		+	}
		+	}
		+	}
		+
		+	</syntaxhighlight>

@@ Line 3: / Line 3: @@
 == esercizio c1 ==
 === Soluzione proposta 1 ===
 == esercizio c2 ==