# CS502 Solved MCQs With Answers For Midterm

In this post, students will read CS502 Solved MCQs for midterm so students please read and complete this post and also try to share with other class fellows students who also have this CS502 book. Students we have uploaded many books that solved MCQs so please also check them by visiting our entire website. This is theÂ CS502 -Â Fundamentals of AlgorithmsÂ Solved MCQs for CS502 book students who join this Virtual University and have theÂ CS502 book. Many students feel that VU study is very difficult because Virtual Univerity is a distance-based university as well as an online education system but some students face problems don't worry we will help you by providing VU all books study solutions then you will easily prepare for Virtual University Exams. Students if you like theseÂ Â With Answers then you can share them on WhatsApp groups and Facebook groups. Also, Read CS502 Solved MCQs Midterm.

### CS502Â -Â Fundamentals of AlgorithmsÂ Solved MCQs

 Post Title CS502 Solved MCQs With Answers For Midterm Book Code CS502 Current/Past Current CS502 Solved MCQs With Answers Mid/Final CS502 Solved MCQs With Answers For Midterm Also, Read CS502 Lecture Wise MCQs Midterm Also, Read CS502 Quiz 1 Solution

## CS502 Solved MCQs With Answers For Midterm

Array divided into â€¦â€¦â€¦â€¦sub arrays while copying seve technique to selection problem.Â  (CS502)

3

2

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 places remaining that it is trivial to solve them.Â  (CS502)

Divide and conquer

Axis sweep

Plan sweep

Brute forceÂ

While analyzing algorithmsâ€¦â€¦â€¦â€¦â€¦and â€¦â€¦â€¦are usually considered difficult to calculate.Â  (CS502)

Floor,ceiling

Row,columnÂ

Finite ,infiniteÂ

Graph ,treeÂ

The rank of an element can be defined as â€¦â€¦â€¦â€¦â€¦(CS502)

One minus the number of elements that are smallerÂ

One plus the number of elements that are smallerÂ

Two plus the number of elements that are greater

Two minus the number of elements that are smallerÂ

The algorithm is a sequence of computational steps that â€¦â€¦â€¦.. The input into output.Â  (CS502)

Merge

Transform

AssignÂ

IntegratorÂ

In 2-D maxima problem. A point p is said to be dominated by point q if â€¦â€¦â€¦â€¦(CS502)

px>qx and p,y>q.y

P.x = and p.y = q.y

Px = q.x and p.y = q.y

bp.x <= q.x and p.y <= q.y

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Â

For small values of nâ€¦â€¦â€¦â€¦algorithm is last enough.Â  (CS502)

Reap sortÂ

QuicksortÂ

AnyÂ

Merge sortÂ

Two functions are said to be asymptotically equivalent if they have â€¦â€¦â€¦â€¦.(CS502)

Been proved as equivalentÂ

Some number of polynomialsÂ

Some inputÂ

Some growth rates for large n

The approach of solving geometric problems by sweeping a line across the plane is called â€¦â€¦â€¦â€¦.sweep.Â  (CS502)

LineÂ

PlaneÂ

CubeÂ

Box

The brute force algorithm for 20 maxima runs in ordered O(..............) time.Â  (CS502)

n*n

n(logn)

N

N3

â€¦â€¦â€¦â€¦is not a characteristic of random access machines.Â  (CS502)

Â

Single processorÂ

Executing an arithmetic instructionÂ

Locality of referenceÂ

Assigning a value to a variableÂ

In the brute force algorithm, we measure running time T(n) based onâ€¦â€¦â€¦â€¦â€¦.(CS502)

Average case time and best case timeÂ

Worst-case time and best case timeÂ

Best case time and starting case timeÂ

Worst-case time and average-case timeÂ

 CS502 Solved MCQs With Answers For Midterm