The time table of railway, and airline which defines arrival and departure can be considered as

Related MCQs

• In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
• In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires
• In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
• In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
• CD defines
• In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
• In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of
• Memory table is used
• The operating system control tables maintains file table, because
• In secondary storage management, bit table, for each block on disk a vector contains