IE 332 Exam 1 2022 With Complete Solution

IE 332 exam 1 State machines correspond to ____ in the von Neumann Architecture: A. RAM B. the bus C. the operating system D. Cache Ans: none are correct Modern CPUs: A. have a clock that is used to maintain synchronization B. speed is commonly measured in Peta-Hertz C. all share the same instruction set D. cannot contain more than one ALU Ans: A. have a clock that is used to maintain synchronization Which of the following properly order computer storage by increasing cost ($): A. magnetic disk, register, cache, ROM B. magnetic tape, optical, ROM, RAM C. register, RAM, optical, magnetic tape D. optical, ROM, cache, register Ans: B. magnetic tape, optical, ROM, RAM D. optical, ROM, cache, register The multi-tasking illusion is possible because: A. CPU state is typically composed of only a few dozen variables B. operating system programmers are clever folks C. hard drive organization permits the use of virtual memory D. it takes a negligible amount of time to store all of the CPU cache to a hard drive Ans: A. CPU state is typically composed of only a few dozen variables B. operating system programmers are clever folks Object oriented programs: A. tend to have larger sizes vs procedural programs (for the same task) B. are usually easier to maintain, largely a consequence of data encapsulation C. have a 1:1 mapping of instructions to assembly code D. are usually more portable than logic programming languages Ans: A. tend to have larger sizes vs procedural programs (for the same task) B. are usually easier to maintain, largely a consequence of data encapsulation D. are usually more portable than logic programming languages Crowdsourcing: A. is really just another term used for open source development B. typically has few contributors C. does not have to come under the legal umbrella of GPL D. typically has many contributors and many beneficiaries Ans: C. does not have to come under the legal umbrella of GPL Providing the correctness of an algorithm: A. provides greater confidence than any finite number of tests could every provide B. is equivalent to showing that it yields the optimal solution C. requires first determining the best case running time D. requires the determination of the worst case running time Ans: A. provides greater confidence than any finite number of tests could every provide Asymptotic behavior of an algorithm's runtime: A. refers to the rate of problem size increase with more computational power B. provides the exact number of computing steps required for any given input size C. is impacted by the CPU used D. is used to determine if a greedy algorithm with terminate in finite time Ans: none are correct Numerical methods: A. are discrete procedures B. have existed longer than computers C. primarily deal with solving stochastic problems D. are another name for any algorithm that uses numbers Ans: A. are discrete procedures B. have existed longer than computers Which of the following are important questions to address when using Monte Carlo algorithms: A. What is the best case runtime complexity? B. What probability distribution to sample from? C. How accurate can we expect results to be? D. Is the gradient of the objective function known? Ans: B. What probability distribution to sample from? C. How accurate can we expect results to be? The Church-Turing thesis states that any algorithm can be represented by a Turing Machine Ans: True In general, a value stored in cache is slower for a Control Unit to access than if in RAM Ans: False In general, non-volatile memory is much faster than volatile memory Ans: False Semantics refers to the rules outlining valid syntax in a programming language Ans: False Loop invariants are used to formally provide entire video games work as expected Ans: False Asymptotic analysis can only be performed on algorithm runtime Ans: False The P vs NP question refers to whether solving a problem in polynomial time implies that it can be verified in polynomial time Ans: False