(A) True
(B) False
(C) NA
(D) NA
Tag: Fundamentals of Algorithms
We assume that in RAM machine , each basic operation takes the __ constant time to execut.
(A) same
(B) different
(C) constant
(D) none
A RAM is an idealized machine with__.
(A) an infinitely large random-access memory
(B) with Instructions are executed one-by-one (there is no parallelism)
(C) single processor machine
(D) all
Ideally this model should be a reasonable abstraction of a standard generic single-processor machine. We call this model a __.
(A) RAM Memory
(B) ROM Memory
(C) random access machine or RAM
(D) none
Analyzig algorithms in terms of the amount of computational resources that the algorithm requires. These resources include mostly __.
(A) running time
(B) memory
(C) running time and memory
(D) none
NP-complete problem are those for which __ algorithms are known, but no one knows for sure whether efficient solutions might exist?
(A) Efficient
(B) No efficient
(C) Ordinary
(D) none
The mathematical tools necessary for the analysis of algorithms. This will focus on asymptotics, summations, recurrences?
(A) True
(B) False
(C) NA
(D) NA
Compilers, operating systems, databases, artificial intelligence, computer graphics and vision, etc. use algorithm?
(A) True
(B) False
(C) NA
(D) NA