Embedded Operating System

Question 1

Which of these characteristics of Monolithic Kernel is false?

Fast Execution

A service crash does not crash the whole system

Both user services and kernel services are kept in the same address space

Hard to extend its functionality

Answer 1

A service crash does not crash the whole system

Question 2

In FreeRTOS, the lowest priority interrupt (ISR) will interrupt the highest priority task.

True
False

Answer 2

True

FreeRTOS just supports it…

Question 3

Which Task State occurs the least amount of time?

Blocked
Running
Ready
Terminated

Answer 3

Terminated

Question 4

Which service/feature is the most important for multi-tasking to work in an EOS?

polling
context switch
inter-process communication
memory management

Answer 4

context switch

While other services and features like inter-process communication, memory management, and polling are important for multitasking and operating system functionality, context switching is the key mechanism that makes it possible to run multiple tasks in a time-sliced or concurrent manner.

Question 5

If a task calls the following function, it will be placed into a “blocked” state for 250ms:
vTaskDelay(250);

True
False

Answer 5

False

vTaskDelay parameters are measured in Ticks NOT ms hence 250 ticks may or may not be == to 250ms according to travis

Question 6

A task is the smallest sequence of instructions that can be managed independently by an/a ….

task control block (TCB)
scheduler
inter-process communication (IPC)
interrupt

Answer 6

scheduler

Question 7

Task functions typically do not call “return()”

True
False

Answer 7

True

Task functions in FreeRTOS, typically do not call return() to exit the task. Instead, they use other mechanisms to exit or terminate the task

Question 8

Which of the following statement is true based on the following code snippet?

xTaskCreate(avg_task, “AvgThread”, configMINIMAL_STACK_SIZE, NULL,
TEST_TASK_PRIORITY
, NULL);
xTaskCreate(simpleaverage, “TempThread”, configMINIMAL_STACK_SIZE, NULL,
TEST_TASK_PRIORITY
, NULL);

xTaskCreate(printfunction, “AvgThread”, configMINIMAL_STACK_SIZE, NULL, TEST_TASK_PRIORITY, &printtask);

Priority-based scheduling will occur 

The program will crash at the instruction: "for( ; ; )"

The program will crash at the instruction: "vTaskStartScheduler()"

Round-robin scheduling will occur

Answer 8

Round-robin scheduling will occur

Question 9

Which Priority Driven Scheduling Algorithm is dynamic-priority based?

Earliest Deadline First (EDF)

Rate Monotonic Scheduling (RMS)

Least Slack Time (LST)

Deadline Monotonic Scheduling (DMS)

Answer 9

Earliest Deadline First (EDF) each task is assigned a priority based on its relative urgency or the closeness of its deadline. Tasks with earlier deadlines are given higher priorities.

Least Slack Time (LST) assigns priorities to tasks based on their remaining execution time and their deadlines

Question 10

Which of the following are considerations when selecting an RTOS? [Select 2]

Decompilers

Debuggers

Features

Machine Learning

Answer 10

Debuggers

Features