In this post, students will read CS502 Quiz 1 Solution online on this website but if you want to read or find these CS502 Quiz 1 In pdf form then you can search on google we hope you will find it easily one student uploads on his website otherwise we also tell that how to make PDF file of these Students, please search on google as google docs where you can easily make PDF files of these CS502 MCQs and write these all MCQs on google docs then generate a PDF file of this CS502 Quiz1 otherwise you can read online on our website. Students these CS502 Quiz 1 MCQs are very helpful for you and other students who have this CS502 Book because we add many MCQs in this single post but we also upload another post of this book CS502 MCQs so please also read it CS502 Lecture Wise MCQs Midterm. Students if you like these then you can also share them with other students so that other students can also prepare for their midterm exams and they can also get good marks in midterm exams.
We Also Recommend |
CS502 Solved MCQs Of Quiz 1 |
Post Title | CS502 Quiz 1 Solution |
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 Midterm MCQs |
Also, Read | CS401 Solved MCQs Midterm |
Also, Read | CS502 Lecture Wise MCQs Midterm |
CS502 Quiz 1 Solution
An algorithm is well defined computational procedure that takes. (CS502)
Design, analysis
Design, analysis
Key, analysis
Input, output
The result of asymptotical analysis of n(n-3) and 4n&n is that ……………..(CS502)
Both are asymptotically equivalent
n(n-1) is asymptotically greater
n(n-1) is asymptotically less
Both are asymptotically not equivalent
Two functions 4n2 and (8n2 + 2n -3) are ……………(CS502)
Hard to calculate
Related to power functions
Asymptotically equivalents
Not equivalent
Two functions are said to be asymptotically equivalent if they have? (CS502)
The same number of polynomials
The same growth rate for large n
Same input
Been proved as equivalent
The important factors to measure the running time at the brute force 2-d maxima algorithm are. (CS502)
Count the number of times an element of p is accessed
All of the above
Count the number of steps of the pseudo-code that is executed
The number of comparisons that are performed
For n> 1,..............divides into two halves, sorts the two, and then combine them together. (CS502)
Insertion sort
Quicksort
Merge sort
Heapsort
Two functions 4n2 and (8n2+2n-3) are …………..
Asymptotically equivalent
Hard to calculate
Not equivalent
Related to power functions
Array divided into …………sub arrays while copying seve technique to selection problem. (CS502)
3
2
1
4
In average case time, the probability of seeing input is denoted by ……………(CS502)
P[1]
P[1]
p(1)
P{1}
In running time analysis we are also conc earned about the ……… required by the algorithm. (CS502)
Code
Memory
Both space and memory
Space
In the merge sort algorithm to merge two lists of size n/2 to a list of size n, take………time? (CS502)
Theta nlog(n)
Theta (n)
Theta log (n)
Theta log2 (n)
In the statement if [p(i)x) & (p[i] y < p[i]y)] the number of times elements of pase accessed is……….(CS502)
4
1
2
3
The total no. of arguments passed to merge sort algorithms ……………(CS502)
3
2
4
5
While applying the sieve techniques ………….. the subarray will contain all elements that are less than pivot element x. (CS502)
A[1,.......n]
A[p+1,.........n]
A[q]
A[1………q-1]
In order to say anything meaningful about our algorithms, it will be important for us to settle on a …………..(CS502)
Java program
Mathematical model of computation
C++program
Pseudo program
Which symbol is used for omega notation? (CS502)
[4]
[e]
[Î©]
[O]
In average case time, the probability of seeing input is denoted by ……………(CS502)
P[1]
P[1]
p(1)
P{1}
While applying the sieve techniques ………….. the subarray will contain all elements that are less than pivot element x. (CS502)
A[1,.......n]
A[p+1,.........n]
A[q]
A[1………q-1]
CS502 Quiz 1 Solution |
Post a Comment