In this post we will share with you CS502 Lecture Wise MCQs Midterm you can read online these CS502 Solved mcqs on this website because we permote online education so that can easily search on google and visit our website and read a complete post that students want. If students want to read this post CS502 Lecture Wise MCQs in pdf form then you can search on google by using this keyword CS502 Lecture Wise MCQs PDF or another keyword then we hope you will find if any students uplaod on his website but don't worry you can also make this. Please write all these CS502 mcqs in google docs where you can easily generate PDF of any study solution. But we suggest reading online on our website as we already uplaod many post and students will read online on our website. Please Also Read CS504 Past Papers For Final Term. Students if you like these  for midterm then you can share them with other students who have this book and they also want to read solved mcqs, past papers, notes, and other study solutions so you can help them by sharing these CS502 mcqs with them. This is the CS502 - Design And Analysis of Algorithms book midterm lecture-wise mcqs for students so please read complete this post and get benefits from these CS502 mcqs. Students if you want to prepare their midterm mcqs preparation so please read these CS502 mcqs properly and also confirm them from your CS502 Handouts we hope these mcqs will help you in your papers but you should also read complete midterm CS502 handouts because papers will come from your midterm syllabus so pleas first focus on CS502 handouts then any other notes and past papers and solved mcqs.

We Also Recommend

CS502 Lecture Wise Solved MCQs

Post TitleCS502 Lecture Wise MCQs Midterm
Book CodeCS502
UniversityVirtual Univerity of Pakistan
CS502 Quiz 1/ Quiz 2 / Quiz 3CS502 Quiz 1
Mid/FinalCS502 Lecture Wise MCQs Midterm
Also, ReadCS401 Solved MCQs Midterm
Also, ReadCS601 Solved MCQs Midterm

CS502 Lecture Wise MCQs Midterm

 In ram, each instruction involves performing some basic operation on how many values are in the machine's memory?  (CS502)





The ……… the weighted sum of running times with weights.  (CS502)

Average case time

Best case time

Both best case and average case

Worse case time 

Merge sort is based on ………..(CS502)

Axis sweep

Divide and conquer

Brute force

Pian sweep

In the following code the statement ‘cout << i,’ executes …………. Times for [int i = 1, i < = n; i++] cout<<i;  (CS502)

Infinite times

N+5 times

N times

Zero times 

The main purpose of mathematical analysis is to measure the ………required by the algorithm.  (CS502)


Execution time and memory

Inputs & outputs 

Execution time 

The important factors to measure the running time of the brute force 2-d maxima algorithm is.  (CS502)

Count the number of times an element of P is accessed 

Count the number of steps of the pseudo-code that is executed

All of above 

The number of comparisons that are performed 

Pseudocode of algorithms are to be read by…………(CS502)





If input ‘n’ is odd, then the median will be …………..(CS502)





Merge sort is based on ………..(CS502)

Axis sweep

Divide and conquer

Pian sweep

Brute force 

The cubic function will………..a quadratic function.  (CS502)



Be equal to


Merge sort algorithm discussed in handouts contains………(CS502)

One loop only

4 loops 

2 loops

3 loops

Using ……………..algorithm, efficiency is not given much importance.  (CS502)


Merge sort


Brute force 

In the statement if (p[i].x & (p[i].y < p[j].y): the number of times elements of p are accessed is ………..(CS502)





For small values of n ………… the algorithm is fast enough.   (CS502)



Merge sort


For solving the selection problem, we introduced the sieving technique due to …………  (CS502)

Eliminating rank of an element 

Avoiding to sort all input data

Using brute force approach 

Using decrease and conquer strategy 

CS502 Lecture Wise MCQs Midterm

CS502 Lecture Wise MCQs Midterm

Post a Comment

Powered by Blogger.