CS502 Solved Quiz (MCQs) Mega File Midterm: Students here will read CS502 Solved MCQs which help you in your midterm preparation for midterm exams. We request to all Vu students who have CS502 books please read complete this post for midterm and also try to share these CS502 MCQs with more students so that they can also read these . Students we provide you online reading process so if you want to Download or other solutions then you can write all these CS502 MCQs on google docs then generates a PDF file. This is the CS502 - Fundamentals of Algorithms MCQs for midterm only. S if you want to read the final term then you can visit our visit and find the final term MCQs. Students Please Also Read CS502 Solved MCQs Midterm.
We Also Recommend |
CS502 - Fundamentals of Algorithms MCQs |
Post Title | CS502 Quiz (MCQs) Mega File Midterm |
Book Code | CS502 |
Degree | BSIT/BSCS/Other |
University | Virtual Univerity of Pakistan |
CS502 Mege File / Giga File | CS502 Quiz (MCQs) Mega File |
Mid/Final | CS502 Quiz (MCQs) Mega File Midterm |
Also, Read | CS502 Solved MCQs Midterm |
Also, Read | CS502 Midterm Solved MCQs |
CS502 Quiz (MCQs) Mega File Midterm
In the merge sort algorithm we split the array………..to find index q. (CS502)
From start
Both from start or end
Midway
From end
Which of the following is calculated with big O notation? (CS502)
Lower bounds
Both upper and lower bounds
Upper bounds
Medium bounds
While applying the sleeve technique to selection sort how to choose a pivot element. (CS502)
Through mean
Sequentially
Linear
Randomly
In running time analysis we are also concerned about the ……… required algorithm. (CS502)
Memory
Both space and memory
Space
Code
Plane sweep uses ………..for storing maximal points. (CS502)
List
Stack
Array
Queue
Asymptotic growth of plane sweep algorithm for 2-D maxima problem is ………..(CS502)
e(n)
e(nlogn)
e(logn)
e(n^2)
If we have an equation 8n2+7f+6 then n is large ……….term will be much larger than the n term and will dominate the running time. (CS502)
n^2
f(n)
g(n)^2
f(g(n)
In the following code the statment cout <<j executes ……times for (j=1,j<=5; j =j+2) cout<<j. (CS502)
2 times
5 times
3 times
0 times
Bn 2+2n-3 will eventually exceed c2”(n) no matter how large we make the …….(CS502)
2n
This equation
N
C2
In order to say anything meaningful about our algorithm, it will be important for us to a……….(CS502)
Mathematical model of computation
Pseudo program
C ++ program
Java program
To predict the cost of an algorithm in terms of resources is called………….(CS502)
Design
Output
Key
Analysis
The omega notation us to state only the asymptotic ………bounds. (CS502)
Upper
Middle
Lower
Both lower upper
The brute force algorithm for 2D maxima runs in order O(.........) time. (CS502)
n(logn)
N
N*n
N3
………time is the maximum running time overall legal inputs. (CS502)
Good case
Average case
Worst case
Best case
In the following code the statement cout <<i executes………..for (int i=1,i<=n,i++) cout<<i; (CS502)
N+5 times
Infinite times
N times
Zero times
…………….is not a characteristic of a random-access machine. (CS502)
Locality of reference
Executing arithmetic instruction
Assigning a value to a variable
Single processor
The sleeve technique is a special case, where the number of subproblems is just…………(CS502)
4
2
3
1
The approach of solving geometric problems by sweeping a line across the plane is called………..(CS502)
Box
Line
Plane
Cube
The worst-case running time of quicksort is ……… to sort on an array of n ………..(CS502)
O(n^{2})
O(n)
O(nlog n)
O(log n)
In the merge sort algorithm to merge two lists of size n/2 to a list of size, n takes …………time. (CS502)
Theta log(n)
theta(n)
Theta log 2(n)
Theta nlog(n)
For …………values of n any algorithm is fast enough. (CS502)
Large
Small
Infinity
Medium
In sleeve technique, we solve the problem…………(CS502)
Using brute force technique
Non recursively
Using merge sort algorithm
In a recursive manner
Which of the following is calculated with big omega notation? (CS502)
Upper bounds
Both upper and lower bounds
Medium bounds
Lower bounds
Which symbol is used for omega notation? (CS502)
Î©
(0)
(8)
(@)
To say anything meaningful about our algorithms, it will be important for us to settle on a ……………(CS502)
C ++ progaram
Java program
Mathematical model of computation
Pseudo program
An algorithm is a mathematical entity, which is independent of ………….(CS502)
Programming language
Programming language compiler and machine
Compiler and programming language
Machine and programming language
Result of asymptotical analysis of n(n-3) and 4n”n is that ………….(CS502)
n(n-1) is asymptotically greater
Both are asymptotically not equivalent
n(n-1) is asymptotically less
Both are asymptotically equivalent
In the selection problem the sleeve techniques works in ……….(CS502)
Constant time
Phases
One complete go
Nonrecursive manner
The efficient algorithm requires less computational …………(CS502)
Memory
Notation
Running time
Memory and running time
RAM is an idealized machine with …………large random access memory. (CS502)
Average
Finite
Infinite
Small
The total no of arguments passed to merge sort algorithm is ………..(CS502)
3
2
4
5
Which applying the sleeve technique …………subarray will contain all elements that are less than pivot element x. (CS502)
A [1…….n]
A [q+1…n]
A [q]
A [1-q-1]
Array divided into ………..subarrays while applying sleeve technique to selection problem. (CS502)
2
3
1
4
In ……..we have to find the rank of an element from a given input. (CS502)
Plane sweep algorithm
Merge sort algorithm
Brute force technique
Selection problem
The process of ……..ends when you are left with such tiny pieces remaining that it is trivial to solve them. (CS502)
Divide and conquer
Axis sweep
Plan sweep
Brute force
The rank of an element can be defined as …………(CS502)
One minus the number of smaller elements
One plus the number of smaller elements
Two plus the number of greater elements
Two minus the number of smaller elements
The time assumed for each basic operation to execute on the RAM model of computation is …………..(CS502)
Variable
Constant
Infinite
Continuous
In the analysis of algorithms …….plays an important role. (CS502)
Money
Time
Growth rate
Text analysis
Two functions are said to be asymptotically equivalent they have ……….(CS502)
Been proved as equivalent
Some number of polynomials
Some input
Some growth for large n
The approach of solving geometric problems by sweeping a line across the plane is called …………sweep. (CS502)
Line
Plane
Cube
Box
CS502 Quiz (MCQs) Mega File Midterm |
Post a Comment