CS502 Midterm MCQs

CS502 Midterm Solved MCQs: In this post students, you will read which you search on google that CS502 Midterm MCQs are very informative and helpful MCQs for those students who want to prepare their exams but they could not find the right place from where they can easily find these . But we are always here to help our VU students by making helpful study solutions so that our students can easily search on google and they can find these CS502 Midterm MCQs without any cost because many websites on the internet demand money to find any book study solutions but students here you will find any book solutions free of cost but we need your support only to your our this post with more students. This is the CS502 - Fundamentals of Algorithms MCQs for the midterm. Students you read then you like it we hope you will also try to share fundamentals of algorithms MCQs with other students. Also, Read CS502 Quiz 1 Solution.

CS502 - Fundamentals of Algorithms MCQsÂ

 Post Title CS502 Midterm MCQs Book Code CS502 Degree BSIT/BSCS/Other University Virtual Univerity of Pakistan CS502 Quiz 1/ Quiz 2/ Quiz 3 CS502 Midterm MCQs Mid/Final CS502 Midterm Solved MCQs Also, Read CS502 Quiz 1 MCQs Also, Read CS502 Quiz 1 2022

CS502 Midterm Solved MCQs

PUSH and POP terminologies are used in â€¦â€¦â€¦â€¦..(CS502)

StackÂ

Double-ended queueÂ

Circular queueÂ

QueueÂ

If we have an equation Bn2+7f+n+5f+6 then n is large â€¦â€¦â€¦â€¦.term will be much larger than the n term and will dominate the running time.Â  (CS502)

g(n)^2

n^2

f(g(n)

f(n)

RAM is an idealized machine with â€¦â€¦â€¦â€¦large random access memory.Â  (CS502)

AverageÂ

FiniteÂ

InfiniteÂ

SmallÂ

To find maximal points in brute force algorithm each point of the space is compared against â€¦â€¦â€¦â€¦.of that space.Â  (CS502)

One other pointÂ

Most of the other pointsÂ

All other pointsÂ

Few other pointsÂ

If input n is odd then the median will be â€¦â€¦.. (CS502)

(n+1)/2

N+2

n/2

(n-1)/2

An efficient algorithm requires less computational â€¦â€¦â€¦â€¦..(CS502)

MemoryÂ

NotationÂ

Running timeÂ

Memory and running timeÂ

In an asymptotical analysis of n(n-3) and 4n n as n becomes large the dominant (fastest growing) term is some constant times â€¦â€¦â€¦â€¦..(CS502)

N+1

N*n

N-1

N

In the selection problem, the sleeve technique works in â€¦â€¦â€¦â€¦(CS502)

Constant timeÂ

PhasesÂ

One complete goÂ

Nonrecursive mannerÂ

Best â€¦â€¦â€¦helps in minimizing algorithm cost.Â  (CS502)

AnalysisÂ

InputÂ

OutputÂ

DesignÂ

The 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Â

An algorithm is a mathematical entity that is independent of â€¦â€¦â€¦â€¦â€¦..(CS502)

Programming languageÂ

Programming language compiler and machineÂ

Compiler and programming languageÂ

Machine and programming languageÂ

The definition of theta-notation relies on proving â€¦â€¦..asymptotic bound.Â  (CS502)

Both lower and upperÂ

Upper

OneÂ

LowerÂ

In order to say anything meaningful about our algorithms, it will be important for us to settle on a â€¦â€¦â€¦â€¦..(CS502)

C++ program

Java program

Mathematical model of computationÂ

Pseudo program

Asymptotic growth of plane sweep algorithm for 2-D maximum problem is â€¦â€¦â€¦â€¦(CS502)

8(logn)

8(nlogn)

8(n^2)

8(n)

Which symbol is used for omega notation?Â  (CS502)

(@)

(0)

(8)

In sleeve technique, we solve the problem â€¦â€¦â€¦â€¦..(CS502)

Using brute force techniqueÂ

In a recursive manner

Non recursively

Using merge sort algorithmÂ

Which of the following is calculated with big omega notation?Â  (CS502)

Upper boundsÂ

Both upper and lower boundsÂ

Medium boundsÂ

Lower boundsÂ

If the indices passed to merge sort algorithm are â€¦â€¦â€¦.then this means that there is only one element to sort.Â  (CS502)

LargeÂ

Small

Equal

Not equalÂ

Pseudocode of algorithms are to be read by â€¦â€¦â€¦â€¦(CS502)

Compiler

RAM

ComputerÂ

PeopleÂ

B(1) means â€¦â€¦â€¦â€¦â€¦â€¦â€¦(CS502)

That it is used for large n

That if used for small nÂ

A constant amount of timeÂ

Time can not be calculatedÂ

For â€¦â€¦â€¦â€¦..values of n, any algorithm is fast enough.Â  (CS502)

LargeÂ

Small

InfinityÂ

MediumÂ

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

Best case time and starting case timeÂ

Worst-case time and best case timeÂ

Average case time and best case timeÂ

Worst-case time and average-case timeÂ

In process of â€¦â€¦â€¦â€¦â€¦ends when you are left with such tiny pieces remaining that it is trivial to solve them.Â  (CS502)Â

Plan-sweepÂ

Brute-forceÂ

Divide and conquer

Axis sweepÂ

The brute force algorithm for 2D maximum runs in order O(...............) time.Â  (CS502)

N3

n(logn)

N

Nn

In 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 log2 (n)

Theta nlog (n)

Asymptotic notations are used to describe â€¦â€¦â€¦..of an algorithm.Â  (CS502)

SizeÂ

Compile-timeÂ

LengthÂ

Running timeÂ

The worst-case running time of quicksort is â€¦â€¦â€¦..in order to sort an array of n.Â  (CS502)

O(n2)

O(n)

O(nlogn)

O(logn)

Two functions 4n2 and (Bn2+2n-3) are â€¦â€¦â€¦â€¦..(CS502)

Not equivalentÂ

Related to power functionsÂ

Asymptotically equivalentÂ

Hard to calculateÂ

 CS502 Midterm MCQs