Fundamentals

1. 1The OS has two components. They are [blank_start]user interface[blank_end] and [blank_start]kernel[blank_end]

   1. Auser interface
   2. Bkernel
2. 2Kernel is composed of: [blank_start]file manager[blank_end], [blank_start]device drivers[blank_end], [blank_start]memory manager[blank_end] and [blank_start]schedular/ dispatcher[blank_end].

   1. Afile manager
   2. Bdevice drivers
   3. Cmemory manager
   4. Dschedular/ dispatcher
3. 3A device driver is a [blank_start]software unit[blank_end] which communicates with [blank_start]controllers[blank_end] to carry out [blank_start]operations[blank_end].

   1. Asoftware unit
   2. Bcontrollers
   3. Coperations
4. 4Is a printer a device driver?

   1. AVerdadero
   2. BFalso
5. 5A file manager manages the computer's [blank_start]mass storage[blank_end] such as a [blank_start]hard disk[blank_end]. It also decides which [blank_start]file[blank_end] goes where, which [blank_start]users[blank_end] are allowed and noe how much of [blank_start]free space[blank_end] there is available.

   1. Amass storage
   2. Bhard disk
   3. Cfile
   4. Dusers
   5. Efree space
6. 6Does the memory manager have the same job as the file manager but for the system's memory instead of mass memory?

   1. AVerdadero
   2. BFalso
7. 7The overall job of a schedular and dispatcher is to [blank_start]schedule[blank_end] and [blank_start]execute[blank_end] activities, and to [blank_start]control the time[blank_end] of the activities.

   1. Aschedule
   2. Bexecute
   3. Ccontrol the time
8. 8The process of 'Booting' is:

   1. AProgram Counter points to Boot Loader which is stored in ROM which then transfers OS from mass storage to main memory.
   2. BProgram Counter points to Boot Loader which is stored in RAM which then executes activities and loads Windows.
9. 9An in more depth job of a schedular is to [blank_start]add[blank_end] new and/or [blank_start]remove[blank_end] processes to and from the [blank_start]process table[blank_end].

   1. Aadd
   2. Bremove
   3. Cprocess table
10. 10An in more depth job of a schedular is to [blank_start]add[blank_end] new and/or [blank_start]remove[blank_end] processes to and from the [blank_start]process table[blank_end].

    1. Aadd
    2. Bremove
    3. Cprocess table

11. 11A more in depth job of a dispatcher is to [blank_start]control[blank_end] the allocation of [blank_start]time-slices[blank_end] to the processes in the [blank_start]process table[blank_end].

    1. Acontrol
    2. Btime-slices
    3. Cprocess table
12. 12A more in depth job of a dispatcher is to [blank_start]control[blank_end] the allocation of [blank_start]time-slices[blank_end] to the processes in the [blank_start]process table[blank_end].

    1. Acontrol
    2. Btime-slices
    3. Cprocess table
13. 13The end of time-slice is signaled by an [blank_start]interrupt[blank_end]

    1. Ainterrupt
14. 14The end of time-slice is signaled by an [blank_start]interrupt[blank_end]

    1. Ainterrupt
15. 15Time-slice is the amount of time each [blank_start]program[blank_end] or [blank_start]user[blank_end] gets to [blank_start]execute[blank_end].

    1. Aprogram
    2. Buser
    3. Cexecute
16. 16Time-slice is the amount of time each [blank_start]program[blank_end] or [blank_start]user[blank_end] gets to [blank_start]execute[blank_end].

    1. Aprogram
    2. Buser
    3. Cexecute
17. 17A process table is:

    1. AA block of information in main memory. Every new execution of a program creates a new entry in the table.
    2. BA block of information in mass storage. Every new execution of a program creates a new entry in the table
    3. CA block of information in main memory. Every new execution of a program creates a new entry in a table only when the table didnt exceed its capacity
18. 18A process table is:

    1. AA block of information in main memory. Every new execution of a program creates a new entry in the table.
    2. BA block of information in mass storage. Every new execution of a program creates a new entry in the table
    3. CA block of information in main memory. Every new execution of a program creates a new entry in a table only when the table didnt exceed its capacity
19. 19Every entry in the process table holds information of [blank_start]memory area[blank_end], the [blank_start]priority[blank_end] of the process and wether the process is [blank_start]waiting[blank_end] or [blank_start]ready[blank_end]

    1. Amemory area
    2. Bpriority
    3. Cwaiting
    4. Dready
20. 20Every entry in the process table holds information of [blank_start]memory area[blank_end], the [blank_start]priority[blank_end] of the process and wether the process is [blank_start]waiting[blank_end] or [blank_start]ready[blank_end]

    1. Amemory area
    2. Bpriority
    3. Cwaiting
    4. Dready
21. 21An interrupt is a [blank_start]signal[blank_end] generated by the [blank_start]dispatcher[blank_end] between [blank_start]switches[blank_end]

    1. Asignal
    2. Bdispatcher
    3. Cswitches
22. 22An interrupt is a [blank_start]signal[blank_end] generated by the [blank_start]dispatcher[blank_end] between [blank_start]switches[blank_end]

    1. Asignal
    2. Bdispatcher
    3. Cswitches
23. 23In each time-slice, the CPU executes one process at a time

    1. AVerdadero
    2. BFalso
24. 24In each time-slice, the CPU executes one process at a time

    1. AVerdadero
    2. BFalso
25. 25When a CPU reacts to an interrupt it saves its position and beggins execution of a program called [blank_start]interrupt handler[blank_end]

    1. Ainterrupt handler
26. 26When a CPU reacts to an interrupt it saves its position and beggins execution of a program called [blank_start]interrupt handler[blank_end]

    1. Ainterrupt handler
27. 27Interrupt handler is stored in [blank_start]main memory[blank_end]

    1. Amain memory
28. 28Interrupt handler is stored in [blank_start]main memory[blank_end]

    1. Amain memory
29. 29The dispatcher selects random processes from the process table to execute next

    1. AVerdadero
    2. BFalso
30. 30The dispatcher selects random processes from the process table to execute next

    1. AVerdadero
    2. BFalso
31. 31It is very important for the OS to handle and allcoate machines resources such as the [blank_start]CPU time[blank_end], [blank_start]memory space[blank_end] and other connected [blank_start]devices[blank_end]

    1. ACPU time
    2. Bmemory space
    3. Cdevices
32. 32It is very important for the OS to handle and allcoate machines resources such as the [blank_start]CPU time[blank_end], [blank_start]memory space[blank_end] and other connected [blank_start]devices[blank_end]

    1. ACPU time
    2. Bmemory space
    3. Cdevices
33. 33Algorithms need to be build so that they can work without [blank_start]resource conflict[blank_end]

    1. Aresource conflict
34. 34Algorithms need to be build so that they can work without [blank_start]resource conflict[blank_end]

    1. Aresource conflict
35. 35When a resource is needed but not available, it is put in a [blank_start]waiting process[blank_end]

    1. Awaiting process
36. 36When a resource is needed but not available, it is put in a [blank_start]waiting process[blank_end]

    1. Awaiting process
37. 37A deadlock is a condition when there is a [blank_start]competition[blank_end] for a [blank_start]non-sharable[blank_end] resource

    1. Acompetition
    2. Bnon-sharable

Descripción

Test sobre Fundamentals, creado por Klaudia Sopata el 27/11/2017.

Autor

Klaudia Sopata

Idioma

English

Visitas

0

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Operating System Structure and Booting