CS502 - Fundamentals of Algorithms Quiz No 1 Solution and Discussion Spring 2014 Due Date: May 08, 2014
Quiz No.01 will open on May 07, 2014 and the last date of taking quiz is May 08, 2014
Tags:
Please all students related this subject Share your online Quizzes here to help each other.thanks
Please share the question and their answers of this quiz if anyone has done.
Thanks.
Question # 1 of 10
Analysis of Selection algorithm ends up with,
Select correct option:
T(n) (p37)
T(1 / 1 + n)
T(n / 2)
T((n / 2) + n)
Question # 2 of 10
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Hre Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
Select correct option:
More
Quiet
Not (p24)
At least
Question # 3 of 10
The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
Select correct option:
True
False (p7)
Question # 4 of 10 ( Start time: 03:26:18 PM ) Total Marks: 1
After sorting in merge sort algorithm, merging process is invoked.
Select correct option:
=True (p27)
False
Question # 5 of 10
Asymptotic growth rate of the function is taken over_________ case running time.
Select correct option:
Best
Average
Worst (p14 Note sure)
Normal
Question # 6 of 10
In analysis of f(n)=n(n/5)+n-10 log n, f(n) is asymptotically equivalent to ________.
Select correct option:
n
2n
n+1
= n2 (p23)
Question # 7 of 10
f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Select correct option:
Results
Variables
Size
= Growth rates (p23)
Question # 8 of 10
Algorithm is concerned with.......issues.
Select correct option:
Macro
Micro
Both Macro & Micro (p8)
Normal
Question # 9 of 10
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
Question # 10 of 10
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
Select correct option:
Two (p28)
Three
Four
Five
Question # 1 of 10 ( Start time: 01:57:15 PM)
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
Select correct option:
True
False (p27) [Divide and Conquer]
Question # 2 of 10 ( Start time: 01:58:29 PM)
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Select correct option:
Member
Minimal
Maximal (p11)
Joint
Question # 3 of 10 ( Start time: 01:59:45 PM)
How much time merge sort takes for an array of numbers?
Select correct option:
T(n^2)
T(n)
T( log n)
T(n log n)
Question # 4 of 10 ( Start time: 02:00:46 PM)
An algorithm is a mathematical entity that is dependent on a specific programming language.
Select correct option:
True
False (p7)
Question # 5 of 10 ( Start time: 02:01:59 PM)
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4
Question # 6 of 10 ( Start time: 02:03:12 PM)
The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
Select correct option:
True
False (p13)
Question # 7 of 10 ( Start time: 02:04:02 PM)
f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Select correct option:
Results
Variables
Size
Growth rates (p23)
Question # 8 of 10 ( Start time: 02:04:56 PM)
8n2 + 2n - 3 will eventually exceed c2*(n) no matter how large we make c2.
Select correct option:
True (p25)
False
Question # 9 of 10 ( Start time: 02:05:45 PM)
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
Select correct option:
Fast
Slow
Expensive
Cheap (p11)
Question # 10 of 10 ( Start time: 02:06:58 PM)
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
+++++++++++++++++++
Question # 1 of 10
Analysis of Selection algorithm ends up with,
Select correct option:
T(n) (p37)
T(1 / 1 + n)
T(n / 2)
T((n / 2) + n)
Question # 2 of 10
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Hre Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
Select correct option:
More
Quiet
Not (p24)
At least
1. Brute-force algorithm uses no intelligence in pruning out decisions.
True
False
2. f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Results
Variables
Size
Growth rates
3. In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
True
False
4. Efficient algorithm requires less computational…….
Memory
Running Time
Memory and Running Time
Energy
5. The O-notation is used to state only the asymptotic ________bounds.
Two
Lower
Upper
Both lower & upper
6. Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
left-complete
right-complete
tree nodes
tree leaves
7. ........of reference is an important fact of current processor technology.
Defining
Assigning
Formality
Locality
8. In the analysis of Selection algorithm, we get the convergent ______________ series.
Harmonic
Linear
Arithmetic
Geometric
9. Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Two
Some
Most
All
10. In ____________ we have to find rank of an element from given input.
Merge sort algorithm
Selection problem
Brute force technique
Plane Sweep algorithm
Fairy thanks gud keep it up
Note for All Members: You don’t need to go any other site for this assignment/GDB/Online Quiz solution, Because All discussed data of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
AsslamoAlaikum Dear students; Online Quiz 1; for subject Fundamentals of Algorithms; will be conducted from 8-May to 9 May 2014; it will be remained open for mentioned two days. Lectures 1-8 are included in this Quiz. You will get maximum marks if you have concept wise grips on the mentioned lectures i.e. First eight Lectures of the course. Be active for your sake and for the Nation. Do not allow anything to disturb your internal peace and integrity to lead better life.
All the best.
details
How to Get This Badge at Your Profile DP
------------------------------------
Management: Admins ::: Moderators
© 2021 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We are user-generated contents & non-commercial site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. All Contents on site are for personal & non-commercial use.We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post