Question # 1
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
Select correct option:
p.x only
p.y only
p.x & p.z
p.x & p.y (p10)
Question # 2
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
Select correct option:
True
False (p173)
Question # 3
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Select correct option:
Two
Some
Most
All (p18)
Question # 4
In ____________ we have to find rank of an element from given input.
Select correct option:
Merge sort algorithm
Selection problem (p34)
Brute force technique
Plane Sweep algorithm
Question # 5
In Heap Sort algorithm, if heap property is violated _________
Select correct option:
We call Build heap procedure
We call Heapify procedure (answer)
We ignore
Heap property can never be violated
Question # 6
We can not make any significant improvement in the running time which is better than that of brute-force algorithm.
Select correct option:
True
False (p92 Not Sure)
Question # 7
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0
Select correct option:
Less than
Equal to or Less than (p25 => for all n >= n0)
Equal or Greater than
Greater than
Question # 8
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Select correct option:
True
False (p10 => A RAM is an idealized machine)
Question # 9
In simple brute-force algorithm, we give no thought to efficiency.
Select correct option:
True (p11)
False
Question # 10
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
Select correct option:
Searching
Sorting (p39)
Both Searching & Sorting
Graphing
Question # 1 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
The number of accesses to any element of space is not counted for the running time calculation of algorithm.
Select correct option:
True
False
Question # 2 of 10 ( Start time: 07:01:56 PM ) Total Marks: 1
The O-notation is used to state only the asymptotic ________bounds.
Select correct option:
Two Lower
Upper
Both lower & upper
Question # 3 of 10 ( Start time: 07:02:28 PM ) Total Marks: 1
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
Select correct option:
True
False
Question # 4 of 10 ( Start time: 07:03:40 PM ) Total Marks: 1
Floor and ceiling are ____________ to calculate while analyzing algorithms.
Select correct option:
Very easy
Usually considered difficult
Question # 5 of 10 ( Start time: 07:05:04 PM ) Total Marks: 1 In Heap Sort algorithm, the maximum levels an element can move upward is _________
Select correct option:
Theta (log n)
Order (log n)
Omega (log n)
O (1) i.e. Constant time
Question # 6 of 10 ( Start time: 07:06:23 PM ) Total Marks: 1
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________ Select correct option:
p.x only p.y
only p.x & p.z
p.x & p.y
Question # 7 of 10 ( Start time: 07:06:49 PM ) Total Marks: 1
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
Select correct option:
True
False
Question # 8 of 10 ( Start time: 07:07:23 PM ) Total Marks: 1
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
Select correct option:
Theta (log n)
Order (log n)
Omega (log n)
O (1) i.e. Constant time
Question # 9 of 10 ( Start time: 07:08:49 PM ) Total Marks: 1
Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above Page 54
Selection sort
Question # 10 of 10 ( Start time: 07:09:37 PM ) Total Marks: 1
For the worst-case running time analysis, the nested loop structure containing one "for" and one "while" loop, might be expressed as a pair of _________nested summations.
Select correct option:
1
2
3
4
--
-------------------------------------------------------------
"VU CLUB" | Learning and Entertainment |
-------------------------------------------------------------
For study material join VU Club at:
http://vuclub.net & http://vuforum.net
To post to this group, send email to:
vu-club@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vu-club?hl=en?hl=en
Join us on Facebook:
http://www.facebook.com/#!/groups/190713217644560/
---
You received this message because you are subscribed to the Google Groups "VU CLUB" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu-club+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
No comments:
Post a Comment