Blog

Priority Scheduling with Round Robin Consider the following set of processes: Process Burst Time Priority P1 5 2 P2 3 1 P3 6 2 P4 4 3 P5 2 1 Assume the time quantum = 2. Which of the following is the correct execution sequence (Gantt order)?

Consider the following processes scheduled using Shortest-Remaining-Time-First (SRTF) scheduling: Process Arrival Time Burst Time P1 0 7 P2 2 4 P3 4 1 P4 5 4 Which of the following is the CORRECT execution sequence (Gantt Chart)?

A distributed system is best described as:

Considering the code:  #include #include #include #include sem_t empty; sem_t full; int item = 0; void* producer(void* arg) { sem_wait(&empty); item = 100; printf(“Producer produced item\n”); sem_post(&full); return NULL; } void* consumer(void* arg) { sem_wait(&full); printf(“Consumer consumed item = %d\n”, item); sem_post(&empty); return NULL; } int main() { pthread_t p, c; sem_init(&empty, 0, 1); sem_init(&full, 0, 0); pthread_create(&c, NULL, consumer, NULL); sleep(1); pthread_create(&p, NULL, producer, NULL); pthread_join(p, NULL); pthread_join(c, NULL); return 0; } Which statement is CORRECT?

Which sequence correctly protects a critical section using a mutex lock?

Which statement BEST describes a spinlock?

Consider a system where no process is inside the critical section, but processes waiting to enter are never selected. Which requirement of solution to critical-section problem fails? 

How is a distributed system different from a centralized system?

Syntax has to do with….

What is supposed to be the difference between the “easy” problems of consciousness and the “hard problem” of consciousness, according to Australian philosopher David Chalmers?