[["Question: Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p_1, p_2, p_3, p_4 and the connectives \u2227,\u2228 (without \u00ac)?\nI. At least three of p_1, p_2, p_3, p_4 are true.\nII. Exactly three of p_1, p_2, p_3, p_4 are true.\nIII. An even number of p_1, p_2, p_3, p_4 are true.\nChoices:\nA. I only\nB. II only\nC. III only\nD. I and III\nAnswer:", " I only"], ["Question: Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p_1, p_2, p_3, p_4 and the connectives \u2227,\u2228 (without \u00ac)?\nI. At least three of p_1, p_2, p_3, p_4 are true.\nII. Exactly three of p_1, p_2, p_3, p_4 are true.\nIII. An even number of p_1, p_2, p_3, p_4 are true.\nChoices:\nA. I only\nB. II only\nC. III only\nD. I and III\nAnswer:", " II only"], ["Question: Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p_1, p_2, p_3, p_4 and the connectives \u2227,\u2228 (without \u00ac)?\nI. At least three of p_1, p_2, p_3, p_4 are true.\nII. Exactly three of p_1, p_2, p_3, p_4 are true.\nIII. An even number of p_1, p_2, p_3, p_4 are true.\nChoices:\nA. I only\nB. II only\nC. III only\nD. I and III\nAnswer:", " III only"], ["Question: Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p_1, p_2, p_3, p_4 and the connectives \u2227,\u2228 (without \u00ac)?\nI. At least three of p_1, p_2, p_3, p_4 are true.\nII. Exactly three of p_1, p_2, p_3, p_4 are true.\nIII. An even number of p_1, p_2, p_3, p_4 are true.\nChoices:\nA. I only\nB. II only\nC. III only\nD. I and III\nAnswer:", " I and III"], ["Question: Which of the following sets of bit strings CANNOT be described with a regular expression?\nChoices:\nA. All bit strings whose number of zeros is a multiple of five\nB. All bit strings starting with a zero and ending with a one\nC. All bit strings with an even number of zeros\nD. All bit strings with more ones than zeros\nAnswer:", " All bit strings whose number of zeros is a multiple of five"], ["Question: Which of the following sets of bit strings CANNOT be described with a regular expression?\nChoices:\nA. All bit strings whose number of zeros is a multiple of five\nB. All bit strings starting with a zero and ending with a one\nC. All bit strings with an even number of zeros\nD. All bit strings with more ones than zeros\nAnswer:", " All bit strings starting with a zero and ending with a one"], ["Question: Which of the following sets of bit strings CANNOT be described with a regular expression?\nChoices:\nA. All bit strings whose number of zeros is a multiple of five\nB. All bit strings starting with a zero and ending with a one\nC. All bit strings with an even number of zeros\nD. All bit strings with more ones than zeros\nAnswer:", " All bit strings with an even number of zeros"], ["Question: Which of the following sets of bit strings CANNOT be described with a regular expression?\nChoices:\nA. All bit strings whose number of zeros is a multiple of five\nB. All bit strings starting with a zero and ending with a one\nC. All bit strings with an even number of zeros\nD. All bit strings with more ones than zeros\nAnswer:", " All bit strings with more ones than zeros"], ["Question: At time 0, five jobs are available for execution on a single processor, with service times of 25, 15, 5, 3, and 2 time units. Which of the following is the minimum value of the average completion time of these jobs?\nChoices:\nA. 50\nB. 208/5\nC. 92/5\nD. 10\nAnswer:", " 50"], ["Question: At time 0, five jobs are available for execution on a single processor, with service times of 25, 15, 5, 3, and 2 time units. Which of the following is the minimum value of the average completion time of these jobs?\nChoices:\nA. 50\nB. 208/5\nC. 92/5\nD. 10\nAnswer:", " 208/5"], ["Question: At time 0, five jobs are available for execution on a single processor, with service times of 25, 15, 5, 3, and 2 time units. Which of the following is the minimum value of the average completion time of these jobs?\nChoices:\nA. 50\nB. 208/5\nC. 92/5\nD. 10\nAnswer:", " 92/5"], ["Question: At time 0, five jobs are available for execution on a single processor, with service times of 25, 15, 5, 3, and 2 time units. Which of the following is the minimum value of the average completion time of these jobs?\nChoices:\nA. 50\nB. 208/5\nC. 92/5\nD. 10\nAnswer:", " 10"], ["Question: Suppose sharing of tiles in a multilevel directory structure is achieved with directory entries that are links pointing to a node containing information about a shared file. Information in this node includes (1) the owner of the file, (2) a count of the number of links to the tile, and (3) the disk block numbers of the file. What is a primary drawback to this approach to sharing?\nChoices:\nA. If the owner modifies the file, another user who does not share will see the changes.\nB. If the owner renames the file, other users will not be able to access it.\nC. If the owner is allowed to delete a file, dangling links may result.\nD. If any user who shares the file appends to it, others who share it will not be able to access the new disk blocks.\nAnswer:", " If the owner modifies the file, another user who does not share will see the changes."], ["Question: Suppose sharing of tiles in a multilevel directory structure is achieved with directory entries that are links pointing to a node containing information about a shared file. Information in this node includes (1) the owner of the file, (2) a count of the number of links to the tile, and (3) the disk block numbers of the file. What is a primary drawback to this approach to sharing?\nChoices:\nA. If the owner modifies the file, another user who does not share will see the changes.\nB. If the owner renames the file, other users will not be able to access it.\nC. If the owner is allowed to delete a file, dangling links may result.\nD. If any user who shares the file appends to it, others who share it will not be able to access the new disk blocks.\nAnswer:", " If the owner renames the file, other users will not be able to access it."], ["Question: Suppose sharing of tiles in a multilevel directory structure is achieved with directory entries that are links pointing to a node containing information about a shared file. Information in this node includes (1) the owner of the file, (2) a count of the number of links to the tile, and (3) the disk block numbers of the file. What is a primary drawback to this approach to sharing?\nChoices:\nA. If the owner modifies the file, another user who does not share will see the changes.\nB. If the owner renames the file, other users will not be able to access it.\nC. If the owner is allowed to delete a file, dangling links may result.\nD. If any user who shares the file appends to it, others who share it will not be able to access the new disk blocks.\nAnswer:", " If the owner is allowed to delete a file, dangling links may result."], ["Question: Suppose sharing of tiles in a multilevel directory structure is achieved with directory entries that are links pointing to a node containing information about a shared file. Information in this node includes (1) the owner of the file, (2) a count of the number of links to the tile, and (3) the disk block numbers of the file. What is a primary drawback to this approach to sharing?\nChoices:\nA. If the owner modifies the file, another user who does not share will see the changes.\nB. If the owner renames the file, other users will not be able to access it.\nC. If the owner is allowed to delete a file, dangling links may result.\nD. If any user who shares the file appends to it, others who share it will not be able to access the new disk blocks.\nAnswer:", " If any user who shares the file appends to it, others who share it will not be able to access the new disk blocks."], ["Question: Let T (n) be defined by T(1) = 7 and T(n + 1) = 3n + T(n) for all integers n \u2265 1. Which of the following represents the order of growth of T(n) as a function of n?\nChoices:\nA. \u0398(n)\nB. \u0398(n log n)\nC. \u0398(n^2)\nD. \u0398(n^2 log n)\nAnswer:", " \u0398(n)"], ["Question: Let T (n) be defined by T(1) = 7 and T(n + 1) = 3n + T(n) for all integers n \u2265 1. Which of the following represents the order of growth of T(n) as a function of n?\nChoices:\nA. \u0398(n)\nB. \u0398(n log n)\nC. \u0398(n^2)\nD. \u0398(n^2 log n)\nAnswer:", " \u0398(n log n)"], ["Question: Let T (n) be defined by T(1) = 7 and T(n + 1) = 3n + T(n) for all integers n \u2265 1. Which of the following represents the order of growth of T(n) as a function of n?\nChoices:\nA. \u0398(n)\nB. \u0398(n log n)\nC. \u0398(n^2)\nD. \u0398(n^2 log n)\nAnswer:", " \u0398(n^2)"], ["Question: Let T (n) be defined by T(1) = 7 and T(n + 1) = 3n + T(n) for all integers n \u2265 1. Which of the following represents the order of growth of T(n) as a function of n?\nChoices:\nA. \u0398(n)\nB. \u0398(n log n)\nC. \u0398(n^2)\nD. \u0398(n^2 log n)\nAnswer:", " \u0398(n^2 log n)"], ["Question: If a malicious process is granted temporary administrator-level access to a system\nChoices:\nA. the threat is over as soon as the process is killed\nB. the threat is over after the operating system is rebooted\nC. the thread is over after rebooting the machine and replacing files that show a virus infection\nD. the threat is often permanent until the entire disk is wiped clean\nAnswer:", " the threat is over as soon as the process is killed"], ["Question: If a malicious process is granted temporary administrator-level access to a system\nChoices:\nA. the threat is over as soon as the process is killed\nB. the threat is over after the operating system is rebooted\nC. the thread is over after rebooting the machine and replacing files that show a virus infection\nD. the threat is often permanent until the entire disk is wiped clean\nAnswer:", " the threat is over after the operating system is rebooted"], ["Question: If a malicious process is granted temporary administrator-level access to a system\nChoices:\nA. the threat is over as soon as the process is killed\nB. the threat is over after the operating system is rebooted\nC. the thread is over after rebooting the machine and replacing files that show a virus infection\nD. the threat is often permanent until the entire disk is wiped clean\nAnswer:", " the thread is over after rebooting the machine and replacing files that show a virus infection"], ["Question: If a malicious process is granted temporary administrator-level access to a system\nChoices:\nA. the threat is over as soon as the process is killed\nB. the threat is over after the operating system is rebooted\nC. the thread is over after rebooting the machine and replacing files that show a virus infection\nD. the threat is often permanent until the entire disk is wiped clean\nAnswer:", " the threat is often permanent until the entire disk is wiped clean"], ["Question: An integer c is a common divisor of two integers x and y if and only if c is a divisor of x and c is a divisor of y. Which of the following sets of integers could possibly be the set of all common divisors of two integers?\nChoices:\nA. {-6,-2, -1, 1, 2, 6}\nB. {-6, -2, -1, 0, 1, 2, 6}\nC. {-6, -3, -2, -1, 1, 2, 3, 6}\nD. {-6, -3, -2, -1, 0, 1, 2, 3, 6}\nAnswer:", " {-6,-2, -1, 1, 2, 6}"], ["Question: An integer c is a common divisor of two integers x and y if and only if c is a divisor of x and c is a divisor of y. Which of the following sets of integers could possibly be the set of all common divisors of two integers?\nChoices:\nA. {-6,-2, -1, 1, 2, 6}\nB. {-6, -2, -1, 0, 1, 2, 6}\nC. {-6, -3, -2, -1, 1, 2, 3, 6}\nD. {-6, -3, -2, -1, 0, 1, 2, 3, 6}\nAnswer:", " {-6, -2, -1, 0, 1, 2, 6}"], ["Question: An integer c is a common divisor of two integers x and y if and only if c is a divisor of x and c is a divisor of y. Which of the following sets of integers could possibly be the set of all common divisors of two integers?\nChoices:\nA. {-6,-2, -1, 1, 2, 6}\nB. {-6, -2, -1, 0, 1, 2, 6}\nC. {-6, -3, -2, -1, 1, 2, 3, 6}\nD. {-6, -3, -2, -1, 0, 1, 2, 3, 6}\nAnswer:", " {-6, -3, -2, -1, 1, 2, 3, 6}"], ["Question: An integer c is a common divisor of two integers x and y if and only if c is a divisor of x and c is a divisor of y. Which of the following sets of integers could possibly be the set of all common divisors of two integers?\nChoices:\nA. {-6,-2, -1, 1, 2, 6}\nB. {-6, -2, -1, 0, 1, 2, 6}\nC. {-6, -3, -2, -1, 1, 2, 3, 6}\nD. {-6, -3, -2, -1, 0, 1, 2, 3, 6}\nAnswer:", " {-6, -3, -2, -1, 0, 1, 2, 3, 6}"], ["Question: Which of the following considerations applies (apply) to choosing the page size in a paging system?\nI. An advantage of larger pages is that they lead to smaller page tables.\nII. An advantage of smaller pages is that they lead to less waste due to internal fragmentation.\nIII. Normally, the dominant factor in disk access time is not dependent on page length, so longer pages can be used advantageously.\nChoices:\nA. I only\nB. II only\nC. I and III only\nD. I, II, and III\nAnswer:", " I only"], ["Question: Which of the following considerations applies (apply) to choosing the page size in a paging system?\nI. An advantage of larger pages is that they lead to smaller page tables.\nII. An advantage of smaller pages is that they lead to less waste due to internal fragmentation.\nIII. Normally, the dominant factor in disk access time is not dependent on page length, so longer pages can be used advantageously.\nChoices:\nA. I only\nB. II only\nC. I and III only\nD. I, II, and III\nAnswer:", " II only"], ["Question: Which of the following considerations applies (apply) to choosing the page size in a paging system?\nI. An advantage of larger pages is that they lead to smaller page tables.\nII. An advantage of smaller pages is that they lead to less waste due to internal fragmentation.\nIII. Normally, the dominant factor in disk access time is not dependent on page length, so longer pages can be used advantageously.\nChoices:\nA. I only\nB. II only\nC. I and III only\nD. I, II, and III\nAnswer:", " I and III only"], ["Question: Which of the following considerations applies (apply) to choosing the page size in a paging system?\nI. An advantage of larger pages is that they lead to smaller page tables.\nII. An advantage of smaller pages is that they lead to less waste due to internal fragmentation.\nIII. Normally, the dominant factor in disk access time is not dependent on page length, so longer pages can be used advantageously.\nChoices:\nA. I only\nB. II only\nC. I and III only\nD. I, II, and III\nAnswer:", " I, II, and III"], ["Question: For all strings x, the function x^M is defined recursively as follows.\ne^M= e, and\nif w is a string and a is a string with length 1, then\n(aw)^M = aw^Ma.\nLet a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true?\nChoices:\nA. a^M = a\nB. (ax)^M = (xa)^M\nC. (xy)^M = y^Mx^M\nD. None of the above\nAnswer:", " a^M = a"], ["Question: For all strings x, the function x^M is defined recursively as follows.\ne^M= e, and\nif w is a string and a is a string with length 1, then\n(aw)^M = aw^Ma.\nLet a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true?\nChoices:\nA. a^M = a\nB. (ax)^M = (xa)^M\nC. (xy)^M = y^Mx^M\nD. None of the above\nAnswer:", " (ax)^M = (xa)^M"], ["Question: For all strings x, the function x^M is defined recursively as follows.\ne^M= e, and\nif w is a string and a is a string with length 1, then\n(aw)^M = aw^Ma.\nLet a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true?\nChoices:\nA. a^M = a\nB. (ax)^M = (xa)^M\nC. (xy)^M = y^Mx^M\nD. None of the above\nAnswer:", " (xy)^M = y^Mx^M"], ["Question: For all strings x, the function x^M is defined recursively as follows.\ne^M= e, and\nif w is a string and a is a string with length 1, then\n(aw)^M = aw^Ma.\nLet a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true?\nChoices:\nA. a^M = a\nB. (ax)^M = (xa)^M\nC. (xy)^M = y^Mx^M\nD. None of the above\nAnswer:", " None of the above"], ["Question: The hit ratio of a cache memory is the percentage of accesses (reads and writes) for which data are found in the cache. Write-through is a policy whereby every write operation updates main memory. Write-back is a policy whereby a write operation to a line found in the cache does not affect main memory until the line is evicted from the cache. Write-allocation is a policy whereby a cache line is allocated and loaded on a write-miss. If it is assumed that write-allocation is always used, which of the following is true?\nChoices:\nA. Write-back usually results in a better hit ratio than write-through.\nB. Write-through usually results in a better hit ratio than write-back.\nC. The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through.\nD. The percentage of write operations resulting in a main memory operation will never be larger for writethrough than for write-back.\nAnswer:", " Write-back usually results in a better hit ratio than write-through."], ["Question: The hit ratio of a cache memory is the percentage of accesses (reads and writes) for which data are found in the cache. Write-through is a policy whereby every write operation updates main memory. Write-back is a policy whereby a write operation to a line found in the cache does not affect main memory until the line is evicted from the cache. Write-allocation is a policy whereby a cache line is allocated and loaded on a write-miss. If it is assumed that write-allocation is always used, which of the following is true?\nChoices:\nA. Write-back usually results in a better hit ratio than write-through.\nB. Write-through usually results in a better hit ratio than write-back.\nC. The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through.\nD. The percentage of write operations resulting in a main memory operation will never be larger for writethrough than for write-back.\nAnswer:", " Write-through usually results in a better hit ratio than write-back."], ["Question: The hit ratio of a cache memory is the percentage of accesses (reads and writes) for which data are found in the cache. Write-through is a policy whereby every write operation updates main memory. Write-back is a policy whereby a write operation to a line found in the cache does not affect main memory until the line is evicted from the cache. Write-allocation is a policy whereby a cache line is allocated and loaded on a write-miss. If it is assumed that write-allocation is always used, which of the following is true?\nChoices:\nA. Write-back usually results in a better hit ratio than write-through.\nB. Write-through usually results in a better hit ratio than write-back.\nC. The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through.\nD. The percentage of write operations resulting in a main memory operation will never be larger for writethrough than for write-back.\nAnswer:", " The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through."], ["Question: The hit ratio of a cache memory is the percentage of accesses (reads and writes) for which data are found in the cache. Write-through is a policy whereby every write operation updates main memory. Write-back is a policy whereby a write operation to a line found in the cache does not affect main memory until the line is evicted from the cache. Write-allocation is a policy whereby a cache line is allocated and loaded on a write-miss. If it is assumed that write-allocation is always used, which of the following is true?\nChoices:\nA. Write-back usually results in a better hit ratio than write-through.\nB. Write-through usually results in a better hit ratio than write-back.\nC. The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through.\nD. The percentage of write operations resulting in a main memory operation will never be larger for writethrough than for write-back.\nAnswer:", " The percentage of write operations resulting in a main memory operation will never be larger for writethrough than for write-back."]]