Datasets:

OpenDCAI
/

dataflex-selector-MMLUSubset-test

instruction stringlengths 43 4.87k	output stringlengths 4 822	category stringclasses 7 values
Question: The access matrix approach to protection has the difficulty that A. the matrix, if stored directly, is large and can be clumsy to manage B. it is not capable of expressing complex protection requirements C. deciding whether a process has access to a resource is undecidable D. there is no way to express who ha...	A. the matrix, if stored directly, is large and can be clumsy to manage	computer
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? A. {-6,-2, -1, 1, 2, 6} B. {-6, -2, -1, 0, 1, 2, 6} C. {-6, -3, -2, -1, 1, 2, 3, 6} D. ...	C. {-6, -3, -2, -1, 1, 2, 3, 6}	computer
Question: In the NoNicks operating system, the time required by a single file-read operation has four nonoverlapping components: disk seek time-25 msec disk latency time-8 msec disk transfer time- 1 msec per 1,000 bytes operating system overhead-1 msec per 1,000 bytes + 10 msec In version 1 of the system, the file read...	B. 1:3.5	computer
Question: You want to cluster 7 points into 3 clusters using the k-Means Clustering algorithm. Suppose after the first iteration, clusters C1, C2 and C3 contain the following two-dimensional points: C1 contains the 2 points: {(0,6), (6,0)} C2 contains the 3 points: {(2,2), (4,4), (6,6)} C3 contains the 2 points: {(5,5)...	A. C1: (3,3), C2: (4,4), C3: (6,6)	computer
Question: Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is NOT complete? A. {AND, NOT} B. {NOT, OR} C. {AND, OR} D. {NAND}	C. {AND, OR}	computer
Question: Consider the collection of all undirected graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no selfloops and there is at most one edge between any pair of nodes, which of the following is true? ...	C. M = 7, m = 4	computer
Question: Resolution theorem proving for showing that a formula of propositional logic is not satisfiable has which of the following properties? I. It is a sound proof system in the sense that there does not exist a proof of the unsatisfiability of a satisfiable formula of propositional logic. II. It is a complete proo...	C. I and II only	computer
Question: Which of the following statements describe(s) properties of a purely segmented memory system? I. It divides memory into units of equal size. II. It permits implementation of virtual memory. III. It suffers from internal fragmentation. A. I only B. II only C. III only D. I and III	B. II only	computer
Question: Which of the following statements about floating-point arithmetic is NOT true? A. It is inherently nonassociative because some numbers have no exact representation. B. It is inherently nonassociative because there have to be upper and lower bounds on the size of numbers. C. Associativity can be achieved with ...	C. Associativity can be achieved with appropriate roundoff conventions.	computer
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 numb...	C. If the owner is allowed to delete a file, dangling links may result.	computer
Question: Mergesort works by splitting a list of n numbers in half, sorting each half recursively, and merging the two halves. Which of the following data structures will allow mergesort to work in O(n log n) time? I. A singly linked list II. A doubly linked list III. An array A. None B. III only C. I and II only D. I,...	D. I, II, and III	computer
Question: If p(x) is the minimal-degree interpolating polynomial for the real-valued function f(x) at the n + 1 distinct real numbers x0, .... xn what is the maximum possible degree of p(x)? A. n B. n + 1 C. n + 2 D. 2n	A. n	computer
Question: An internal hash table has 5 buckets, numbered 0, 1, 2, 3, 4. Keys are integers, and the hash function h(i) = i mod 5 is used, with linear resolution of collisions (i.e., if bucket h(i) is filled, the buckets h(i) + 1, h(i) + 2, ... are tried successively with all bucket numbers computed modulo 5). If element...	A. 3	computer
Question: TCP protocol is responsible (among other things) for A. Routing packets through the network B. Reliable delivery of packets between directly connected machines C. Reliable delivery of large (multi-packet) messages between machines that are not necessarily directly connected D. Dealing with differences among o...	C. Reliable delivery of large (multi-packet) messages between machines that are not necessarily directly connected	computer
Question: Let A and B be two sets of words (strings) from Σ*, for some alphabet of symbols Σ. Suppose that B is a subset of A. Which of the following statements must always be true of A and B ? I. If A is finite, then B is finite. II. If A is regular, then B is regular. III. If A is context-free, then B is context-free...	A. I only	computer
Question: For all strings x, the function x^M is defined recursively as follows. e^M= e, and if w is a string and a is a string with length 1, then (aw)^M = aw^Ma. Let a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true? A. a^M = a B. (ax)^M = (xa)^M C. (xy)^M = y^Mx^M D. N...	D. None of the above	computer
Question: Which of the following is NOT a reasonable justification for choosing to busy-wait on an asynchronous event? A. The wait is expected to be short. B. A busy-wait loop is easier to code than an interrupt handler. C. There is no other work for the processor to do. D. The program executes on a time-sharing system...	D. The program executes on a time-sharing system.	computer
Question: The language {ww \| w in (0 + 1)*} is A. not accepted by any Turing machine B. accepted by some Turing machine, but by no pushdown automaton C. accepted by some pushdown automaton, but not context-free D. context-free, but not regular	B. accepted by some Turing machine, but by no pushdown automaton	computer
Question: Which of the following statements about Ethernets is typically FALSE? A. Ethernets use circuit switching to send messages. B. Ethernets use buses with multiple masters. C. Ethernet protocols use a collision-detection method to ensure that messages are transmitted properly. D. Networks connected by Ethernets a...	A. Ethernets use circuit switching to send messages.	computer
Question: Let P be a procedure that for some inputs calls itself (i.e., is recursive). If P is guaranteed to terminate, which of the following statements must be true? I. P has a local variable. II. P has an execution path where it does not call itself. III. P either refers to a global variable or has at least one para...	D. II and III only	computer
Question: Which of the following comes closest to being a perfectly secure encryption scheme? A. The Caesar Cipher, a substitution cipher B. DES (Data Encryption Standard), a symmetric-key algorithm C. Enigma, a transposition cipher D. One-time pad	D. One-time pad	computer
Question: Of the following problems concerning a given undirected graph G, which is currently known to be solvable in polynomial time? A. Finding a longest simple cycle in G B. Finding a shortest cycle in G C. Finding ALL spanning trees of G D. Finding a largest clique in G	B. Finding a shortest cycle in G	computer
Question: The IP protocol is primarily concerned with A. Routing packets through the network B. Reliable delivery of packets between directly connected machines C. Reliable delivery of large (multi-packet) messages between machines that are not necessarily directly connected D. Dealing with differences among operating ...	A. Routing packets through the network	computer
Question: Of the following, which best approximates the ratio of the number of nonterminal nodes to the total number of nodes in a complete K-ary tree of depth N? A. 1/K B. K-1/K C. log_10 (1/N) D. N-1/m	A. 1/K	computer
Question: Consider a computer system in which processes can request and release one or more resources. Once a process has been granted a resource, the process has exclusive use of that resource until it is released. If a process requests a resource that is already in use, the process enters a queue for that resource, w...	A. Giving priorities to processes and ordering the wait queues by priority	computer
Question: "Magic memory"' has two operations: Read and Clear. Both are indivisible and mutually exclusive. Clear sets the magic memory to zero. Read returns a value that represents the number of Read operations since the last Clear operation. Which of the following is (are) true of "Magic memory"? I. It can provide the...	D. I and II	computer
Question: Which of the following is the name of the data structure in a compiler that is responsible for managing information about variables and their attributes? A. Abstract Syntax Tree (AST) B. Attribute Grammar C. Symbol Table D. Semantic Stack	C. Symbol Table	computer
Question: Which of the following algorithms has running time Θ(n^2) in the worst case but Θ(n log n) on average? A. Bubblesort B. Mergesort C. Heapsort D. Quicksort	D. Quicksort	computer
Question: Languages with a structure that implements abstract data types (e.g., a C++ class) can prevent access to components of this structure by all operations except those that are part of this structure. However, definitions of such a structure often contain declarations of components of the structure (e.g., the he...	D. II and III only	computer
Question: Which of the following is NOT a property of bitmap graphics? A. Fast hardware exists to move blocks of pixels efficiently. B. Realistic lighting and shading can be done. C. All line segments can be displayed as straight. D. Polygons can be filled with solid colors and textures.	C. All line segments can be displayed as straight.	computer
Question: Which of the following is true of interrupts? A. They are generated when memory cycles are "stolen". B. They are used in place of data channels. C. They can indicate completion of an I/O operation. D. They cannot be generated by arithmetic operations.	C. They can indicate completion of an I/O operation.	computer
Question: In a height-balanced binary search tree, the heights of the left and right descendents of any node differ by at most 1. Which of the following are true of such a tree? I. Worst-case search time is logarithmic in the number of nodes. II. Average-case search time is logarithmic in the number of nodes. III. Best...	D. I, II, and IV	computer
Question: Bob writes down a number between 1 and 1,000. Mary must identify that number by asking "yes/no" questions of Bob. Mary knows that Bob always tells the truth. If Mary uses an optimal strategy, then she will determine the answer at the end of exactly how many questions in the worst case? A. 1,000 B. 999 C. 500 ...	D. 10	computer
Question: Which of the following is (are) true about virtual memory systems that use pages? I. The virtual address space can be larger than the amount of physical memory. II. Programs must be resident in main memory throughout their execution. III. Pages correspond to semantic characteristics of the program. A. I only ...	A. I only	computer
Question: Which of the following is usually NOT represented in a subroutine's activation record frame for a stack-based programming language? A. Values of local variables B. A heap area C. The return address D. Stack pointer for the calling activation record	B. A heap area	computer
Question: Which of the following statements about a remote procedure call is true? A. It is used to call procedures with addresses that are farther than 2^16 bytes away. B. It cannot return a value. C. It cannot pass parameters by reference. D. It cannot call procedures implemented in a different language.	C. It cannot pass parameters by reference.	computer
Question: Of the following sorting algorithms, which has a running time that is LEAST dependent on the initial ordering of the input? A. Insertion sort B. Quicksort C. Merge sort D. Selection sort	C. Merge sort	computer
Question: A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is "inherently sequential" (i.e., will not benefit from additional processors), then the theoretically best possible elapsed times for this program running with 2 and 4 process...	D. 70 and 55 seconds	computer
Question: Consider the representation of six-bit numbers by two's complement, one's complement, or by sign and magnitude. In which representation is there overflow from the addition of the integers 011000 and 011000? A. Two's complement only B. Sign and magnitude and one's complement only C. Two's complement and one's ...	D. All three representations	computer
Question: Of the following, which best characterizes computers that use memory-mapped I/O? A. The computer provides special instructions for manipulating I/O ports. B. I/O ports are placed at addresses on the bus and are accessed just like other memory locations. C. To perform an I/O operation, it is sufficient to plac...	B. I/O ports are placed at addresses on the bus and are accessed just like other memory locations.	computer
Question: Many cryptographic protocols base their security on assumptions about the computational difficulty of integer factorization. Integer factorization serves this purpose because we believe that A. integer multiplication is a function whose inverse, factorization, remains difficult for a large class of inputs B. ...	A. integer multiplication is a function whose inverse, factorization, remains difficult for a large class of inputs	computer
Question: Which of the following sets of bit strings CANNOT be described with a regular expression? A. All bit strings whose number of zeros is a multiple of five B. All bit strings starting with a zero and ending with a one C. All bit strings with an even number of zeros D. All bit strings with more ones than zeros	D. All bit strings with more ones than zeros	computer
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 ∧,∨ (without ¬)? I. At least three of p_1, p_2, p_3, p_4 are true. II. Exactly three of p_1, p_2, p_3, p_4 are true. III. An even number of p_1, p_2, p_3, p_4 are true. A. I ...	A. I only	computer
Question: Two alternatives for interconnecting a set of processors with bidirectional links are (1) the fully interconnected network, in which each processor is directly connected to every other processor, and (2) the ring network, in which each processor is connected to two other processors. The worst-case path length...	D. (n-1)/n	computer
Question: For a connected, undirected graph G = (V, E), which of the following must be true? I. Σ_{v∈V} degree(v) is even. II. \|E\| ≥ \|V\| − 1 III. G has at least one vertex with degree 1. A. I only B. II only C. III only D. I and II	D. I and II	computer
Question: In multiprogrammed systems it is advantageous if some programs such as editors and compilers can be shared by several users. Which of the following must be true of multiprogrammed systems in order that a single copy of a program can be shared by several users? I. The program is a macro. II. The program is rec...	C. III only	computer
Question: Which of the following decimal numbers has an exact representation in binary notation? A. 0.1 B. 0.2 C. 0.3 D. 0.5	D. 0.5	computer
Question: Function signatures describe the types of the arguments to a function as well as the return value of the function. For instance, the addition function on reals has a signature of add : real x real -> real since it takes two real numbers and returns a real number. But, for a language that allows functions as r...	A. Currying can be applied to any function to the point where it has exactly one input argument.	computer
Question: Array A contains 256 elements of 4 bytes each. Its first element is stored at physical address 4,096. Array B contains 512 elements of 4 bytes each. Its first element is stored at physical address 8,192. Assume that only arrays A and B can be cached in an initially empty, physically addressed, physically tagg...	A. 0	computer
Question: In which of the following representations of numbers by 8-bit words is the addition of the integers 109 and -42 within range? I. One's complement II. Two's complement III. Sign and magnitude A. I only B. II only C. I and II only D. I, II, and III	D. I, II, and III	computer
Question: If a malicious process is granted temporary administrator-level access to a system A. the threat is over as soon as the process is killed B. the threat is over after the operating system is rebooted C. the thread is over after rebooting the machine and replacing files that show a virus infection D. the threat...	D. the threat is often permanent until the entire disk is wiped clean	computer
Question: Which of the following statements about horizontal versus vertical microarchitecture is (are) true? I. Programs for horizontal architectures require more time steps than those for vertical architectures. II. Horizontal microinstructions are unencoded. III. Horizontal microinstructions usually have a single op...	B. II only	computer
Question: A "strictly binary tree" is a binary tree in which every node that is not a leaf has two children. Suppose that for a class of strictly binary trees there exists c > 0 such that, for any tree in the class, the ratio of the lengths of any two root-to-leaf paths is bounded above by c. Which of the following bes...	C. h < c log2(N)	computer
Question: Which of the following sorting algorithms has average-case and worst-case running times of O(n log n)? A. Bubble sort B. Insertion sort C. Merge sort D. Quicksort	C. Merge sort	computer
Question: Consider the following equations concerning a stack module that has the operations Push, Pop, Top, and IsEmpty. Which of the equations does NOT represent the conventional semantics of a stack? A. IsEmpty(Push(Stack,Elem)) = true B. Pop(Push(Stack,Elem)) = Stack C. Top(Push(Stack,Elem)) = Elem D. IsEmpty(Push(...	A. IsEmpty(Push(Stack,Elem)) = true	computer
Question: Assume that any assignment statement can be executed in unit time. If as many identical processors as needed are used, what is the minimum number of time units needed to execute the assignments A := B + C B := A - B C := A * E D := A/F E := B - C F := A + B with the same result as if the assignments were exec...	C. 3	computer
Question: Two expressions E and F are said to be unifiable if there are substitutions for the variables of E and F that make the expressions lexically identical. In the following three expressions, only w, x, y, and z are variables. I. f(w,w) II. f(x,1) III. f(y,g(z)) Which pairs of these expressions is (are) pairs of ...	D. (I, II) and (I, III) only	computer
Question: Which of the following instruction-set features is NOT generally considered an obstacle to aggressive pipelining of an integer unit? A. Condition codes set by every instruction B. Variable-length encoding of instructions C. Instructions requiring widely varying numbers of cycles to execute D. Several differen...	D. Several different classes (sets) of registers	computer
Question: Let k >= 2. Let L be the set of strings in {0, 1}^* such that x \in L if and only if the number of 0's in x is divisible by k and the number of 1's in x is odd. The minimum number of states in a deterministic finite automaton (DFA) that recognizes L is A. k + 2 B. 2k C. k log k D. k^2	B. 2k	computer
Question: Let G = (V, E) be a finite directed acyclic graph with \|E\| > 0. Which of the following must be true? I. G has a vertex with no incoming edge. II. G has a vertex with no outgoing edge. III. G has an isolated vertex, that is, one with neither an incoming edge nor an outgoing edge. A. I only B. II only C. III on...	D. I and II only	computer
Question: Let T be a depth-first search tree of a connected undirected graph G. For each vertex v of T, let pre(v) be the number of nodes visited up to and including v during a preorder traversal of T, and post(v) be the number of nodes visited up to and including v during a postorder traversal of T. The lowest common ...	D. II and III	computer
Question: In systems with support for automatic memory management, a garbage collector typically has the responsibility for reclaiming allocated memory objects whose contents cannot affect any future legal computation. Such objects are identified by determining that they cannot be reached from a root set. Which of the ...	B. Dynamically allocated objects on the heap	computer
Question: In the Internet Protocol (IP) suite of protocols, which of the following best describes the purpose of the Address Resolution Protocol? A. To translate Web addresses to host names B. To determine the IP address of a given host name C. To determine the hardware address of a given host name D. To determine the ...	D. To determine the hardware address of a given IP address	computer
Question: Which of the following language features requires that stack-based storage allocation be used rather than static allocation? A. Recursive procedures B. Arbitrary goto's C. Two-dimensional arrays D. Integer-valued functions	A. Recursive procedures	computer
Question: Which of the following is not a sentence that is generated by the grammar A -> BC, B -> x\|Bx, C -> B\|D, D -> y\|Ey, E -> z? A. xyz B. xy C. xxzy D. xxxxy	A. xyz	computer
Question: Let T (n) be defined by T(1) = 7 and T(n + 1) = 3n + T(n) for all integers n ≥ 1. Which of the following represents the order of growth of T(n) as a function of n? A. Θ(n) B. Θ(n log n) C. Θ(n^2) D. Θ(n^2 log n)	C. Θ(n^2)	computer
Question: Which of the following problems is (are) decidable? I. Given a (finite) string w, is w a prefix of the decimal expansion of π? II. Given a program and an input, is the program’s output the decimal expansion of π? III. Given a program that takes as input a prefix of the decimal expansion of π, is the program’s...	A. I only	computer
Question: Which of the following statements about circuits is (are) true? I. Combinational circuits may have feedback; sequential circuits do not. II. Combinational circuits have a "memoryless" property; sequential circuits do not. III. Both sequential and combinational circuits must be controlled by an external clock....	B. II only	computer
Question: Two single-user workstations are attached to the same local area network. On one of these workstations, file pages are accessed over the network from a file server; the average access time per page is 0.1 second. On the other of these workstations, file pages are accessed from a local disk; the average access...	B. 5/4	computer
Question: Assume that a debugger places a breakpoint at a load instruction at virtual address 0x77E81234 (hexadecimal notation) in a debugged process P. If the text segment of P begins at 0x77E80000 in P’s virtual address space and if the debugger has mapped this same text segment at 0x01000000 in its virtual address s...	A. 0x01001234; page mapped with READ/WRITE access	computer
Question: Which of the following considerations applies (apply) to choosing the page size in a paging system? I. An advantage of larger pages is that they lead to smaller page tables. II. An advantage of smaller pages is that they lead to less waste due to internal fragmentation. III. Normally, the dominant factor in d...	D. I, II, and III	computer
Question: Two processors, M-5 and M-7, implement the same instruction set. Processor M-5 uses a 5-stage pipeline and a clock cycle of 10 nanoseconds. Processor M-7 uses a 7-stage pipeline and a clock cycle of 7.5 nanoseconds. Which of the following is (are) true? I. M-7’s pipeline has better maximum throughput than M-5...	A. I only	computer
Question: Which of the following pairs of 8-bit, two's-complement numbers will result in overflow when the members of the pairs are added? A. 11111111, 00000001 B. 00000001, 10000000 C. 11111111, 10000001 D. 10000001, 10101010	D. 10000001, 10101010	computer
Question: Two computers communicate with each other by sending data packets across a local area network. The size of these packets is 1,000 bytes. The network has the capacity to carry 1,000 packets per second. The CPU time required to execute the network protocol to send one packet is 10 milliseconds. The maximum rate...	C. 100,000 bytes/ second	computer
Question: Consider the following grammar. S → ( S ) S → x Which of the following statements is (are) true? I. The grammar is ambiguous. II. The grammar is suitable for top-down parsing. III. The grammar is suitable for bottom-up parsing. A. I only B. II only C. III only D. II and III only	D. II and III only	computer
Question: Hash tables can contribute to an efficient average-case solution for all of the problems described below EXCEPT: A. Counting distinct values: Given a set of n keys, determine the number of distinct key values. B. Dynamic dictionary: Support the operations of insert, delete, and search in a dictionary. C. Rang...	C. Range search: Given values a and b, find all the records whose key value is in the range a, b.	computer
Question: Let A be a finite set with m elements, and let B be a finite set with n elements. The number of distinct functions mapping A into B is A. n^m B. n!/(n - m)! C. n! D. n!/(m!(n - m)!)	A. n^m	computer
Question: To compute the matrix product M_1M_2, where M_1 has p rows and q columns and where M_2 has q rows and r columns, takes time proportional to pqr, and the result is a matrix of p rows and r columns. Consider the product of three matrices N_1N_2N_3 that have, respectively, w rows and x columns, x rows and y colu...	B. 1/x + 1/z < 1/w + 1/y	computer
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 t...	C. The percentage of write operations resulting in a main memory operation will never be larger for write-back than for write-through.	computer
Question: A particular disk unit uses a bit string to record the occupancy or vacancy of its tracks, with O denoting vacant and 1 denoting occupied. A 32-bit segment of this string has the hexadecimal value D4FE2003. The percentage of occupied tracks for the corresponding part of the disk, to the nearest percent, is A....	D. 44%	computer
Question: An Euler circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an Euler circuit? I. A complete graph with 12 vertices II. A complete graph with 13 vertices III. A tree with 13 vertices A. I only B. II only C. III on...	B. II only	computer
Question: Which of the following characteristics of a programming language is best specified using a context-free grammar? A. Identifier length B. Maximum level of nesting C. Operator precedence D. Type compatibility	C. Operator precedence	computer
Question: Which of the following statements about datagrams sent by a node in a network using IPv4 protocol is (are) true? I. Datagrams at the source must be the size of the smallest maximum transmission unit (MTU) of all the links on a path to the destination. II. Datagrams may be fragmented during routing. III. Datag...	D. II and III	computer
Question: A starvation-free job-scheduling policy guarantees that no job waits indefinitely for service. Which of the following job-scheduling policies is starvation-free? A. Round-robin B. Priority queuing C. Shortest job first D. Youngest job first	A. Round-robin	computer
Question: Of the following, which gives the best upper bound for the value of f(N) where f is a solution to the recurrence f(2N + 1) = f(2N) = f(N) + log N for N >= 1, with f(1) = 0? A. O(log N) B. O(N log N) C. O(log N) + 0(1) D. O((log N)^2)	D. O((log N)^2)	computer
Question: Company X shipped 5 computer chips, 1 of which was defective, and Company Y shipped 4 computer chips, 2 of which were defective. One computer chip is to be chosen uniformly at random from the 9 chips shipped by the companies. If the chosen chip is found to be defective, what is the probability that the chip c...	D. 2 / 3	computer
Question: Which of the following problems can be solved by a standard greedy algorithm? I. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights II. Finding a maximum clique in an undirected graph III. Finding a maximum flow from a source node to a sink node in a directed graph with ...	A. I only	computer
Question: A program that checks spelling works in the following way. A hash table has been defined in which each entry is a Boolean variable initialized to false. A hash function has been applied to each word in the dictionary, and the appropriate entry in the hash table has been set to true. To check the spelling in a...	B. II only	computer
Question: One approach to handling fuzzy logic data might be to design a computer using ternary (base-3) logic so that data could be stored as “true,” “false,” and “unknown.” If each ternary logic element is called a flit, how many flits are required to represent at least 256 different values? A. 4 B. 5 C. 6 D. 7	C. 6	computer
Question: Local caching of files is common in distributed file systems, but it has the disadvantage that A. Temporary inconsistencies among views of a file by different machines can result B. The file system is likely to be corrupted when a computer crashes C. A much higher amount of network traffic results D. Caching ...	A. Temporary inconsistencies among views of a file by different machines can result	computer
Question: Array A contains 256 elements of 4 bytes each. Its first element is stored at physical address 4,096. Array B contains 512 elements of 4 bytes each. Its first element is stored at physical address 8,192. Assume that only arrays A and B can be cached in an initially empty, physically addressed, physically tagg...	C. 1024	computer
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? A. 50 B. 208/5 C. 92/5 D. 10	C. 92/5	computer
Question: Let G = (V, E) be a connected, undirected graph, and let a and b be two distinct vertices in V. Let P_1 be the problem of finding a shortest simple path between a and b, and let P_2 be the problem of finding a longest simple path between a and b. Which of the following statements about P_1 and P_2 is true? A....	B. P_1 can be solved in polynomial time but P_2 is not known to be solvable in polynomial time.	computer
Question: A major advantage of direct mapping of a cache is its simplicity. The main disadvantage of this organization is that A. it does not allow simultaneous access to the intended data and its tag B. it is more expensive than other types of cache organizations C. the cache hit ratio is degraded if two or more block...	C. the cache hit ratio is degraded if two or more blocks used alternately map onto the same block frame in the cache	computer
Question: Let M be a single-tape, deterministic Turing machine with tape alphabet {blank,0,1}, and let C denote the (possibly infinite) computation of M starting with a blank tape. The input to each problem below is M, together with a positive integer n. Which of the following problems is (are) decidable? I. The comput...	D. I and III only	computer
Question: A 3-way, set-associative cache is A. one in which each main memory word can be stored at any of 3 cache locations B. effective only if 3 or fewer processes are running alternately on the processor C. possible only with write-back D. faster to access than a direct-mapped cache	A. one in which each main memory word can be stored at any of 3 cache locations	computer
Question: Consider an object-oriented language in which all entities are objects. Two relationships arise: (1) the instance relationship, between an object and the class of which that object is a member, and (2) the subclass relationship, between a class and the superclass from which that class inherits properties. In ...	A. one instance link and then zero or more subclass links	computer
Question: In a pipelined RISC computer where all arithmetic instructions have the same CPI (cycles per instruction), which of the following actions would improve the execution time of a typical program? I. Increasing the clock cycle rate II. Disallowing any forwarding in the pipeline III. Doubling the sizes of the inst...	D. I and III	computer
Question: A microcomputer used for data acquisition and control is required to digitize and process four analog input signals and to output their average continually; i.e., in real time. The time for an external analog-to-digital converter (which is triggered by a CPU instruction) to digitize one input is 12 microsecon...	C. 1.6 microseconds	computer
Question: Suppose that a certain software product has a mean time between failures of 10,000 hours and has a mean time to repair of 20 hours. If the product is used by 100 customers, what is its availability? A. 80% B. 90% C. 98% D. 99.80%	D. 99.80%	computer