blob84

Hello i implemented this FIFO queue: #include <stdio.h> void enqueue(int *, int); int dequeue(int *); int qempty(void); int head = 0; int tail = 0; int qerror(void); #define N 4 int main(void) { int i = 0; int v[N]; while (i < 10) { enqueue(v, i); i++; } while (!qempty()) …

Hello when I compile this piece of program written in pascal with gpc (GNU pascal for linux) for pascal, I get errors: cradle: In function `_start': (.text+0x0): multiple definition of `_start' /usr/lib/gcc/x86_64-linux-gnu/4.1.3/../../../../lib/crt1.o:(.text+0x0): first defined here cradle: In function `_fini': (.fini+0x0): multiple definition of `_fini' /usr/lib/gcc/x86_64-linux-gnu/4.1.3/../../../../lib/crti.o:(.fini+0x0): first defined here cradle:(.rodata+0x0): multiple …

Hi i'm reading the Silberschatz book about Operating system, 7th edition. Theory is good but there is no support for exercises, nor exhaustive explanation. I'm trying to do the exercise 5.4, calculate the average waiting time of round robin sheduling. [CODE] Process cpu-Burst priority p1 10 3 p2 1 1 …

Hi this is the fact procedure: [CODE]fact: addi $sp, $sp, -8 sw $ra, 4($sp) sw $a0, 0($sp) slti $t0, $a0, 1 beq $t0, $zero, L1 addi $v0, $zero, 1 addi $sp, $sp, 8 jr $ra L1: addi $a0, $a0, -1 jal fact lw $a0, 0($sp) lw $ra, 4($sp) addi $sp, …