Vuhelper
04-21-2011, 07:13 PM
full solve paper in attachment
Question No: 1 ( Marks: 1 ) - Please choose one
Random access machine or RAM is a/an
Machine build by Al-Khwarizmi
Mechanical machine
Electronics machine
Mathematical model
Question No: 2 ( Marks: 1 ) - Please choose one
_______________ is a graphical representation of an algorithm
S notation
Q
notation
Flowchart
Asymptotic notation
Question No: 3 ( Marks: 1 ) - Please choose one
A RAM is an idealized machine with ______________ random-access memory.
256MB
512MB
an infinitely large
100GB
Question No: 4 ( Marks: 1 ) - Please choose one
What type of instructions Random Access Machine (RAM) can execute? Choose best
answer
Algebraic and logic
Geometric and arithmetic
Arithmetic and logic
Parallel and recursive
Question No: 5 ( Marks: 1 ) - Please choose one
What will be the total number of max comparisons if we run brute-force maxima
algorithm with n elements?
n2
2
n
n
n
Question No: 1 ( Marks: 1 ) - Please choose one
Random access machine or RAM is a/an
Machine build by Al-Khwarizmi
Mechanical machine
Electronics machine
Mathematical model
Question No: 2 ( Marks: 1 ) - Please choose one
_______________ is a graphical representation of an algorithm
S notation
Q
notation
Flowchart
Asymptotic notation
Question No: 3 ( Marks: 1 ) - Please choose one
A RAM is an idealized machine with ______________ random-access memory.
256MB
512MB
an infinitely large
100GB
Question No: 4 ( Marks: 1 ) - Please choose one
What type of instructions Random Access Machine (RAM) can execute? Choose best
answer
Algebraic and logic
Geometric and arithmetic
Arithmetic and logic
Parallel and recursive
Question No: 5 ( Marks: 1 ) - Please choose one
What will be the total number of max comparisons if we run brute-force maxima
algorithm with n elements?
n2
2
n
n
n