Students if you are looking for CS502 Quiz 1 Solution and want to find it on any website, thanks for visiting this website because this website provides you with any book CS502 Quizand other study solutions free of cost, and already many students also get benefits from this website. Students, please read these CS502 Quiz 1 MCQs online on this website or if you want to read these CS502 solved MCQs then you can make a pdf of CS502 MCQs. Students you can search on google and we hope you will find it easily if any student uploads on his website otherwise you can make a pdf of this . Search on google and type google docs then open it in this software you can generate a PDF of these by writing all these MCQs in these google docs. But students should read online and prepare for their exams. This is the CS502 - Fundamentals of Algorithms Quiz 1 2022 Solution and very helpful for those students who have this book CS502 and want to find . If you like these CS502 - Fundamentals of Algorithms MCQs then you can share them with more students who also want to read and prepare for their midterm exams. Also, Read CS502 Quiz 1 Solution.
We Also Recommend |
CS502 - Fundamentals of Algorithms MCQs |
| Post Title | CS502 Quiz 1 Solution 2022 |
| Book Code | CS502 |
| Degree | BSIT/BSCS/Other |
| University | Virtual Univerity of Pakistan |
| CS502 Quiz 1/ Quiz 2 / Quiz 3 | CS502 Quiz 1 |
| Mid/Final | CS502 Quiz 1 Midterm MCQs |
| Also Read | CS502 Quiz 1 Solved |
| Also Read | CS502 Lecture Wise MCQs For Midterm |
CS502 Quiz 1 Solution
There are no hard formal rules to the syntax of the …………code. (CS502)
Pseudo
ProgrammingÂ
Assembly
Basic
………..provides us more accurate results, when input values are not closer with each other. (CS502)
Mode
Average
Median
MeanÂ
To find maximal points in a brute-force algorithm each point at the space is compared against…………of that space. (CS502)
Most of the other pointsÂ
All other pointsÂ
One other point
Few other pointsÂ
In addition to passing in the array itself to merge sort algorithms we will pass in ………..other arguments which are indices. (CS502)
3
2
5
4
If the time complexity of an algorithm is given by O (1), then its time complexity would be. (CS502)
Polynomial
Constant
Exponential
Average
Which one of the following is the worst-case time complexity of merge sort? (CS502)
O(nlogn)
O[(n^2logn]
O[nlogn^2]
O[n^2]
The words of algebra and algorithm were derived from? (CS502)
Title of Al-Khwarizmi writings and his name
 Al-Khwarizmi writings  Â
 Al-Khwarizmi name
Book of algebraÂ
The approach of solving geometric problems by sweeping a line across the plane is called ………..sweep. (CS502)
Cube
Line
Plane
Box
Using ………….algorithm, efficiency is not given much importance. (CS502)
ProcessingÂ
Brute forceÂ
Merge sort
Greedy
In the following code the statement cout <<j executes …………times. For (int i = 1, i< =n;i++) cout<<i; (CS502)
Infinite timesÂ
N+5 times
Zero timesÂ
N timesÂ
In addition to passing in the array itself to merge sort algorithms, we will pass in ………..other arguments which are incidents. (CS502)
5
2
4
3
The process of …….ends when you are left with such tiny pieces remaining that it is trivial t-o solve them. (CS502)
Brute - forceÂ
Axis - sweep
Divide and conquer
Plan sweepÂ
The total no of arguments passed to merge sort algorithm is ……………….(CS502)
4
3
5
2
In 2d maxima problem, a point is said to be ……….if it is not dominated by any other point in that space.  (CS502)
Maximal
Minimal
Member
JointÂ
A number of ………….of the pseudo code are counted to measure the running time. (CS502)
Pages
Outputs
Inputs
Steps
While analysis of the brute-force maxima algorithm, on array sorted in the reverse order is the type of ……….code input. (CS502)
Average
Best
Somewhat bad
WorstÂ
 |
CS502 Quiz 1 Solution 2022 |
Post a Comment