Chapter 1: Introduction (6 questions) 1 / OS is a program of activities between users with: a / computer software b / hardware of the computer c / The application

program
d / CPU and memory

Answer: b 2 / In the classification model of operating system, processor type has multiple systemsshare the same transmission systems, data, clock, memory, and peripherals in the form: a / multi-processor system program b / The system process has to c / parallel processing system d / distributed processing system e / System real-time processing Answer: e 3 / Computers can store information in several different physical devices such as tape , magnetic discs. For uniform access storage system in the computer, operating system defines a storage unit is: a / Directories b / Partition c / FAT d / file Answer: d

4 / The operating system has layered structure, the set of system calls generated by: a / class hardware b / layer interface with the user c / Application Layer d / Grade class hardware design - nuclear Answer: d
5 / This call to the command system is provided by the operating system used to communicate between the operating system and: a / process b / the application program c / Computer Hardware d / users Answer: a 6/Trong the structure of the following operating systems are compatible structures easily with tissue the distributed system a / Simple structure b / a layered structure c / virtual machine structure d / Servicer-client architecture Answer: d

Chapter 2: Process Management (16 questions) 1 / Which of the following is incorrect: a / The process is a program that is in memory b / The process is a program processing, owning an address space, a cursor commands, a set of registers and stack c / process to decide when to stop processing operation is to serve the advancement other works. d / The process can not communicate with each other through the operating system. e / The c, d are correct f / The a and b are correct Answer: e 2 / "The process requires a resource but has not been met because resources notavailable sieve, or process to wait for an event or input-output operations "in the form of transfer state the following: a / Running -> Ready b / Ready -> Running c / Running -> Blocked d / Blocked -> Ready e / Running -> End Answer: c 3 / When a user process calls a system call, the process of the operating system to process calls this operation mode: a / No privileges b / Privileges c / no questions correct does Answer: b A process born 4/Gia sub-process B, C, the following sentence is incorrect: a / sub B and C do not use the cursor commands general b / sub B and C do not use the general register file does not use general c / sub B and C do not use the common stack d / sub B and C do not use the shared address space. Answer: d 5 / DCB is a memory area storing the information describing the process, it has many components. Information about the list of system resources that are using the process of the type Which of the following components: a / The name of the process b / Status of the process c / Information Communication d / context of the process e / statistical information Answer: d 6 / When a process ends processor, operating system, cancel it by a number of activities, work What follows is not the need: a / Cancel identifier of the process. b / Revocation of resources allocated to process c / To cancel all processes from the list of system management d / Cancel PCB of the process

e / sentence b, c are correct Answer: a 7 / OS uses the following components to convert its context and given CPU to another process (for executing the process) a / The Ministry Coordinator b / The distribution c / Block management process d / Block Resource Management in Answer: b 8 / For the processes share the CPU equitably, without any waiting process waiting indefinitely for the CPU, operating system components used to solve problems this: a / The Ministry Coordinator b / block management process c / Block Resource Management in d / The distribution Answer: a 9 / coordination algorithm is simple and easy to install but is not suitable for systems many users of the type: a / The exclusive b / The non-exclusive distribution c / no questions correct does d / Both sentences are correct Answer: a 10 / exclusive principle generally suitable for the generation process: a / processing system in real time b / multi-program system c / share interactive system d / batch processing system e / not correct sentence //Khng cu no ng Answer: d 11/ executing process will move on the type of list when waiting for an event manipulate input / output is completed, the resource request has not been satisfactory data, requests for the suspension: a / list ready (Ready list) b / The task list (Job list) c / Waiting List (Waiting list) d / not correct sentence Answer: c 12 / In the entire operating system to use as many lists available: a / 2 list b / a list c / A list for each process d / A for a list for each resource (peripherals) e / The c, d are correct Answer: b 13 / coordination function of the operating system task is activated when: a / create a system process b / processing process ends

c / interrupt occurs d / The a, b right e / The b, c right Answer: d 14 / Which of the following algorithm is an algorithm can coordinate on the principle of monopoly: a / FIFO b / rotation c / Coordinating with the priority d / The shortest job (Shortest job first) e / strategy coordination with multiple priority levels f / The a, c, d right g / The c, d, e right Answer : h 15 / The FIFO algorithm Coordinator, with the following table: Process Time in RL P1 P2 P3 012 Standby time of all the processes are: a / 24s b / 27s c / 30s d / 25s Answer d Processing Time 2433

16 / The Round bin coordination algorithms, quantum of 4 with the following table: Process P1 P2 P3 a / 24s b / 14s c / 30s d / 25s Answer b Time in RL 012 Processing Time 2433

17 / For coordination algorithms with priority levels and exclusive, with the following table: Process P1 P2 P3 a / 48s b / 47s c / 25s d / 30s Answer a Priority 321 Time in RL 012 Processing Time 2433

18 / For coordination algorithms with priority levels and non-exclusive, with the following table: Process Priority P1 P2 P3 321 Standby time of all the processes are: a / 8s Time in RL 012 Processing Time 2433

b / 7s c / 9s d / 5s Answer a 19 / When a process is created that is not enough memory that it will be inserted to the list: a / Job list b / Ready list c / waiting list Answer: a Chapter 3: Communication and synchronization process (8 questions) 1 / Which of the following incorrect statement: a / signal processing process in its own way b / signal processing process by calling the signal handler c / can process data exchange d / The process can inform each other about an event e / The c, d right Answer: d 2 / the fastest method for exchanging information between processes a / Pipelines b / The shared memory c / exchange messages d / Socket Answer: b 3 / Which of the following techniques can not be applied effectively in a distributed system a / Pipes (Pipe) b / The shared memory c / exchange messages d / Socket e / The c, d is right Answer : e 4 / Which of the following technique is direct communication between two processes a / Pipes (Pipe) b / The shared memory c / exchange messages d / Socket Answer: a 5 / When solving unfurl domain, the following conditions is not necessary: a / There are two processes at the same time-domain spread b / To assume the speed of the process, as well as the number of processors c / a domain outside the process spread is not prevented by other processes domain to unfurl d / There are no processes waiting to be infinite domain in John Answer: b 6 / In the solution process after synchronization solution which violates the "No there are two processes in the same domain at the same time spread. " a / Use variable flags b / The use of alternative

c / Solution Peterson d / The b, c are right Answer: a 7 / In the solution process after synchronization solution that solved the access problemexclusively on computers with one or more processors share a common memory area: a / exchange messages b / Monitor c / Semaphone d / Sleep and Wakeup e / The a and b is right f / The b, c are right Answer : f 8 / In the following solution, any solution but the process is waiting for CPU occupancy a / Sleep and Wakeup b / Monitor c / Semaphone d / Busy waiting e / exchange messages Answer : d Chapter 5: Obstruction (5 questions) 1 / In the preventive measures as congestion, any measures likely to affect the protection of data integrity of the system: a / The process to request all resources before processing b / When a process requests a new resource and denied, it must release resources are occupied, which is then allocated back to the same time resources new c / Allows the recovery of resources from the process is blocked and allocated back process when it is locked out of the state. d / The a and b right e / The b and c right Answer : e 2 / To prevent congestion we have to ensure at least one of the conditions must notcause a blockage occurs in the following conditions are conditions which are unlikely totake: a / There can not use shared resources b / The occupied and not to request additional resources can be shared c / no recoverable resources from processes that are holding them d / There exists a cycle in the resource allocation graph Answer: a 3 / In graph resource allocation, resources are represented by: a / Circle b / Diamond c / Square d / triangle Answer: c 4 / In the resource allocation graph, the process is represented by: a / Circle b / Diamond

c / Square d / triangle Answer: a 5 / To prevent a bottleneck simply: a / There can not use shared resources b / The occupied and not to request additional resources can be shared c / no recoverable resources from processes that are holding them d / There exists a cycle in the resource allocation graph e / One of these conditions do not occur Answer : e Chapter 6: Memory Management (17 questions) 1 / Add the fact that the memory manager can see and manipulate are: a / Address logic b / physical address c / The address space d / Space Physics Answer: b 2/Tap of all virtual addresses generated by a program called: a / The address space b / Space Physics c / physical address d / address logic Answer: a 3 / At the time of the following processes only operate on virtual addresses, never seen is the physical address a / compile time b / The time of loading c / processing time d / The a and b is right

Answer: c 4 / In the continuous memory allocation process, which allows the model to move in memory processes after charging: a / Linker-Loader Models b / Base-Limit Models c / Both sentences are correct d / Both sentences are incorrect Answer: a 5 / The algorithm chosen to satisfy the space needs for a process (in the segment memory) a / First-fit b / Best-fit c / Worst-fit d / not right sentence //Khng cu no ng Answer: d 6 / fragmentation are: a / The memory is divided into many areas of discontinuous b / The free list is cumulative from the discrete pieces of smaller memory c / Total memory space sufficient to meet demand but this memory is not

not continuous enough energy for other processes d / not correct sentence Answer: c 7 / In memory techniques allocate a virtual address segment is represented by: a / The Ministry <s,d> where s is the number of segments, d is the relative address in thes b / The <base, limit> with the base index, the limit is only limited c / no questions correct does d / Both sentences are correct Answer: a 8 / The address registers and the logic <s,d> STBR, registers STLR limited physicaladdress corresponds to the logical address is: a / STLR-s-d b / s d STBR c / s d STLR-STBR d/sd Answer: b
9 / algorithm first select the blank area large enough to load the process are: a / First-fit b / Best-fit c / Worst-fit d / not correct sentence Answer: a 10 / space algorithm first selected the most liberal small but big enough to load theprocess are: a / First-fit b / Best-fit c / Worst-fit d / not correct sentence Answer: b 11 / The algorithm first select the largest free space to load the process are: a / First-fit b / Best-fit c / Worst-fit d / not correct sentence Answer: c 12 / In the paging technique if the address space size is 2mkich page size 2ncau following is incorrect statements: a / nm bits of virtual address high performance n-bit page number and address low relative in the page b / mn bits of virtual address low performance numbers and n bit high for page address relative in the page c / mn bits of virtual address high performance n-bit numbers and low page address relative in the page d / The b, c right Answer: c 13 / At the technical mechanism in paging MMU with virtual addresses of the form to convert <p,d> addresses to physical addresses, the MMU uses the page table, the followingstatements is

correct: a / d th element in the page table stored in the page frame number of the physicalmemory is contains page p b / p th element in the page table stored in the page frame number of the physicalmemory is containing page d c / pd th element in the page table stored in the page frame number of the physicalmemory page containing the p d / p th element in the page table stored in the page frame number of the physicalmemory is contains page p Answer : d 14 / technique following allocation eliminates external fragmentation a / paging. b / Segment c / Allocate continuous d / The a and b are correct Answer: a 15 / Assuming that the main memory can be partitioned in order of size is 600k, 500k,200k, 300k, and process the order allocation request of size 212K, 417K, 112K, using an algorithm 426K.Neu Best-fit accounting processes such as memory allocation will be able to: a / 212K-> 600K, 417K-> 500K, 112K-> 300K, 426K-> 200K b/212K-> 600K, 417K-> 500K, 112K-> 200K, 426K-> 300K c/212K-> 300K, 417K-> 500K, 112K-> 200K, 426K-> 300K d / not correct sentence Answer: c 16 / At the address space of 8 pages, each page size 1K mapped into the framememory 32 pages, Ask not how many bits to represent the logical address of thisaddress space a / 32bit b / 8 bit c / 24bit d / 13bit Answer: d 17 / At the address space of 8 pages, each page size 1K mapped into the framememory 32 page Q How many bits must be used to present physical address of thisaddress space a / 32bit b / 8 bit c / 15bit (215bit) d / 13bit Answer: c 17 / Conditions can be attached to a segment address space of two processes: a / may not be b / The elements in the two segments of the same process only to a position most physicists c / no questions correct does Answer: b

Chapter 7: Virtual memory (12 questions) 1 / page replacement algorithm that selects the most used pages long in the future of Category: a / FIFO b / LRU c / Optimization d / NRU Answer: c 2 / The page replacement algorithm "Advanced second chance" was chosen as the site page: a / The first page is found in the class has the lowest priority and non-empty. b / The first page is found in the class have the highest priority and non-empty. c / The last page is found in the class has the lowest priority and non-empty d / The last page is found in the class has the highest priority and non-empty Answer: a 3 / page replacement algorithm used the last time the page is accessed is the algorithm: a / FIFO b / LRU c / Optimization d / NRU Answer: b 4 / page replacement algorithm using the time the page will be used is the algorithm: a / FIFO b / LRU c / Optimization d / NRU Answer: c Dirty 5/Bit in the structure of a page table elements mean: a / Indicates pages and has access to any page b / To know that page exists in memory or not. c / To know the page has been changed or not to update the page on disk. Answer: c 6 / Call p is the probability of a page fault occurs (0 <p <1) p = 0: no error page p = 1: each access generates a page fault ma: memory access time swapin, swapout is time to switch the page Execution time a memory access times will be: a/ EAT= p*ma +(1-p)*(swapout+swapout); b/ EAT= (1-p)*ma + p*(swapout+swapout); c/ EAT= p*ma + (1-p)*(swapout-swapout) d/ Cu a,b l sai p n :a

7/ With FIFO page replacement algorithm using 3 frames page, the page numbers go on the last respectively: 1,2,3,4,1,2 as the following table: 1 1 2 12 3 123 4 423 1 413 2 412

The number of page faults is a / 6 errors b / 5 errors c / 4 error d / not correct sentence Answer: a
8 / With LRU page replacement algorithm using 3 frames page, the page numbers go onin turn: 7,0,1,2,0,3 as the following table: 7 7 0 70 1 701 2 201 0 201 3 203

The number of page faults is a / 4 error b / 6 errors c / 5 errors d / not correct sentence Answer: c 9 / The following algorithm algorithm algorithm any statistical category: a / LFU b / LRU c / NRU d / NFU e / The a and d correct f / The a and b true Answer : e 10 / minimum number of page frames allocated to a process defined by: a / Computer Architecture b / physical memory capacity can be used c / Programmers d / not correct sentence Answer: a 11 / If the total number of page frames required by the processes in the system exceeds the page frame can use, the operating system will: a / cancellation processes using multiple frame page b / Pause process that frees the page frame to another process to complete c / Cancel the money is used at the page frame d / not correct sentence Answer: b 12/Trong following algorithms are algorithms that do not allocate page frame algorithm a / Allocate fair b / Allocation according to size ratio c / Allocation order before after.

d / Allocation by priority. Answer: c Chapter 8: The system file management (13 questions) 1 / style files relating to import and export through sequential input-output devices such as screen, printer, network card a / files often b / Directories c / file with special characters d / file blocks Answer: c

2 / What operating system later distinguish letters, flowers for file A / MS-DOS b / UNIX c / WINDOW d / The a and c are right Answer: d 3 / Type folder to organize and exploit, but makes it difficult to set the file name do not overlap and can not be used for grouping files and search within a / directory one level b / two-level directory c / multi-level directory d / not right sentence Answer: a 4 / How to setup file system does not need to use the FAT a / Allocate continuous b / Allocation of intermittent use linked lists c / Allocation of intermittent use index table d / The a and b is right Answer: d 5 / How to setup file system does not go to waste due to external fragmentation without FAT table using random access, but will slow and difficult to protect the file number of theblock a / Allocate continuous b / Allocation of continuous use linked lists c / Use index table d / Using FAT Answer: b 6/Cach system is installed the following files for the efficient management of large filesystems a / Allocate continuous b / Allocation of intermittent use FAT c / Use I-node structure d / The a and b are correct

Answer: c 7 / For a 1 Gb disk block size is 4K, if the manager is empty blocks using bit vector bit vector size is? a / 2 blocks b / 4 block c / 8 blocks d/16 blocks Answer: c HD: 4K = 212byte 1Gb = 230byte => have 218khoi => bit vector is 218bit = 215byte = 32K = 8 blocks 8 / With a 20M disk block size is 1K, if managers use DSLK empty blocks need How many blocks to manage how much this disc: a / 20 block b / 40 block c / 80 block d/16 blocks Answer: b HD: 4K = 2 ^ 12byte 20M = 20 * 2 ^ 10 = 2 ^ 15khoi => need to use two bytes to store a number of the block 1 block = 1024 bytes block store 512 numbers Need 20 * 210/512 ~ 40 blocks to this disk management 9 / In the file system of MS-DOS first sector, track 0, side 0 for hard disk information on: a / Boot sector b / partition table b / FAT table c / Data are often Answer: b 9 / In the table of the FAT file system MS-DOS disks one described by: a / Use the first two entries of the FAT b / Using a first entry of FAT table c / Use of the directory table entry RDET d / not right sentence Answer: a 10 / For the system to open a file, MS-DOS to find the information on file at: a / Table FAT b / Table directory c / Boot sector d / all are wrong Answer: b 11 / For the WINDOW file of NTFS Partition, the partition size from 8 -> 16 Gb, the number of sectors per cluster is: a / 8 Sector b / 16 Sector c / 32 Sector d / 64 Sector

Answer: c 12 / In the WINDOW structure of the NTFS partition information about files and folders on This partition is stored in: a / partition bootsector b / Master File Table (MFT) c / The file system d / The files Answer: b 13 / Create, destroy, open, close, read, write ... are tasks necessary for the operating system: a / file manager b / Memory Management c / Management process d / Network Management e / No questions are right Answer: a Chapter 9: Managing import and export (12 questions) 1 / Which of the following equipment is no input / output sequence: a / Screen b / Keyboard c / Mouse d / NIC e / CD Answer: e 2 / Van DMA transfer is done by: a / control equipment b / CPU c / memory d / The a, b is false Answer: a
3 / For example in the C programming language commands Count = write (fd, buffer, nbytes); the software does the following entry: a / Device Control b / Import of the scope of software users c / software independent of the input-output devices c / The b, c are correct Answer: b 4 / In the system I / O disk read time to head to the right volume needed on a track called: a / Seek time b / tranfer time c / Latency time d / not correct sentence Answer: c 5 / In the system I / O disk read time to head to the right track on a disc called necessary are: a / Seek time b / tranfer time

c / Latency time d / not correct sentence Answer: a 6 / When the system must access large volumes of data, the scheduling algorithm is effective following: a / FCFS b / SSTF c / SCAN d / C-SCAN e / The a and b are correct f / The c, d are correct Answer: f 7 / When the system must access data block number continuously after scheduling algorithm which this is most effective: a / FCFS b / SSTF c / SCAN d / C-SCAN e / The a and b are correct f / The c, d are correct Answer: a 8 / For example to read the following blocks 98,183,37,122,14,122,65,67 reader at position 53, using SCAN scheduling algorithm, the reader will turn over the block has the following order: a / 53, 37, 14, 65, 67, 98, 122, 124, 183 b / 53, 65, 67, 98, 122, 124, 183,37,14 c / 53, 14, 37, 65, 67, 98, 122, 124, 183 d / 53, 183, 124, 122, 98, 67, 65, 37, 14 e / The a and b are correct f / The c, d are correct Answer: e 9 / For example to read the following blocks 98,183,37,122,14,122,65,67 reader at position 53, using scheduling algorithm C-SCAN, the reader will turn over the block has the following order: a / 53, 37, 14, 65, 67, 98, 122, 124, 183 b / 53, 65, 67, 98, 122, 124, 183,14,37 c / 53, 14, 37, 65, 67, 98, 122, 124, 183 d / 53, 183, 124, 122, 98, 67, 65, 37, 14 e / The a and b are correct f / The c, d are correct Answer: b 10 / For example to read the following blocks 98,183,37,122,14,122,65,67 reader at position 53, using FCFS scheduling algorithm, the reader will turn over the block has the following order: a / 53, 37, 14, 65, 67, 98, 122, 124, 183 b / 53, 65, 67, 98, 122, 124, 183,37,14 c / 53, 14, 37, 65, 67, 98, 122, 124, 183 d / 53, 98, 183, 37, 122, 14, 124, 65, 67 e / The a and b are correct f / The c, d are correct

Answer: d 11 / For example to read the following blocks 98,183,37,122,14,122,65,67 reader at position 53, using SSTF scheduling algorithm, the reader will turn over the block has the following order: a / 53, 37, 14, 65, 67, 98, 122, 124, 183 b / 53, 65, 67, 37, 14, 98.122, 124, 183 c / 53, 14, 37, 65, 67, 98, 122, 124, 183 d / 53, 183, 124, 122, 98, 67, 65, 37, 14 e / The a and b are correct f / The c, d are correct Answer: b 12 / On the disk sectors with consecutive numbers lie next to each other a / Yes b / False Answer: b