CS502 Midterm Past Paper

You have come here while searching for CS502 midterm past papers. But before going to download the CS502 midterm past paper. I have a better option for you. That is, that you can attempt the online quiz of CS502.

Practice Quiz from CS502 Midterm Past Paper

This quiz will evaluate your preparation for the CS502 midterm examination and it is based on the past papers of CS502 . The purpose of this quiz is to evaluate your performance in this subject. If you can pass this quiz, then there is a great chance that you can secure good marks in your exams.

0 votes, 0 avg

Your Time starts now

Times Up

Created on January 16, 2022 By

faisal_faisi

CS502

CS502 Midterm Past Papers Practice Quiz

Welcome to CS502 Midterm Online Practice Quiz.

You can check your preparation of CS5021 for your Exams here.

Questions Will be different every time you will attempt.

1 / 30

Category: CS502-mid

Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________

a. phases

b. pointers

c. n items

d. constant

2 / 30

Category: CS502-mid

When we call heapify then at each level the comparison performed takes time

a. It will take Θ (1)

b. It will take Θ (log n)

c. It can not be predicted

d. Time will vary according to the nature of input data

3 / 30

Category: CS502-mid

For Chain Matrix Multiplication we can not use divide and conquer approach because,

a. We use divide and conquer for sorting only

b. Size of data is not given

c. We do not know the optimum k

d. We can easily perform it in linear time

4 / 30

Category: CS502-mid

Brute-force algorithm uses no intelligence in pruning out decisions.

a. True

b. False

5 / 30

Category: CS502-mid

In Quick sort, we don’t have the control over the sizes of recursive calls

a. Less information to decide

b. True

c. Either true or false

d. False

6 / 30

Category: CS502-mid

Mergesort is a stable algorithm but not an in-place algorithm

a. false

b. True

7 / 30

Category: CS502-mid

______________ graphical representation of algorithm.

a. Flowchart

b. asymptotic

8 / 30

Category: CS502-mid

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

a. True

b. False

9 / 30

Category: CS502-mid

The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.

a. Not

b. Quiet

c. More

d. At least

10 / 30

Category: CS502-mid

For the Sieve Technique we take time

a. n^2

b. T(nk)

c. T(n / 3)

d. n/3

11 / 30

Category: CS502-mid

What is the total time to heapify?

a. Ο(log2 n)

b. Ο(log n)

c. Ο(n log n)

d. Ο(n2 log n)

12 / 30

Category: CS502-mid

8n2 + 2n - 3 will eventually exceed c2*(n) no matter how large we make c2.

a. False

b. True

13 / 30

Category: CS502-mid

If there are Θ (n2) entries in edit distance matrix then the total running time is

a. Θ (n)

b. Θ (n2)

c. Θ (n log n)

d. Θ (1)

14 / 30

Category: CS502-mid

Consider the following code:
For(j=1; j<n;j++)
For(k=1; k<15;k++)
For(l=5; l<n; l++)
{
Do_something_constant();
}
What is the order of execution for this code.

a. O(n3)

b. O(n2 log n)

c. O(n2)

d. O(n)

15 / 30

Category: CS502-mid

After sorting in merge sort algorithm, merging process is invoked.

a. True

b. False

16 / 30

Category: CS502-mid

Asymptotic growth rate of the function is taken over_________ case running time.

a. Normal

b. Worst

c. Best

d. Average

17 / 30

Category: CS502-mid

Random access machine or RAM is a/an

a. Electronics machine

b. Mechanical machine

c. Mathematical model

d. Machine build by Al-Khwarizmi

18 / 30

Category: CS502-mid

Algorithm is concerned with.......issues.

a. Micro

b. Macro

c. Both Macro & Micro

d. Normal

19 / 30

Category: CS502-mid

Counting sort the numbers to be sorted are in the range 1 to k where k is small.

a. True

b. False

20 / 30

Category: CS502-mid

If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

a. Slow

b. Fast

c. Expensive

d. Cheap

21 / 30

Category: CS502-mid

What type of instructions Random Access Machine (RAM) can execute?

a. Arithmetic and logic

b. Parallel and recursive

c. Algebraic and logic

d. Geometric and arithmetic

22 / 30

Category: CS502-mid

In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

a. Maximal

b. Joint

c. Minimal

d. Member

23 / 30

Category: CS502-mid

Due to left complete nature of binary tree, the heap can be stored in

a. Arrays (

b. Stack

c. Link Lis

d. Structures

24 / 30

Category: CS502-mid

What type of instructions Random Access Machine (RAM) can execute? Choose best answer

a. Geometric and arithmetic

b. Parallel and recursive

c. Algebraic and logic

d. Arithmetic and logic

25 / 30

Category: CS502-mid

What is the solution to the recurrence T(n) = T(n/2)+n .

a. O(nlogn)

b. O(n)

c. O(n2)

d. O(logn)

26 / 30

Category: CS502-mid

The Knapsack problem belongs to the domain of _______________ problems.

a. Sorting

b. Linear Solution

c. NP Complete

d. Optimization

27 / 30

Category: CS502-mid

If the indices passed to merge sort algorithm are not equal, the algorithm may return immediately

a. True

b. False

28 / 30

Category: CS502-mid

The time assumed for each basic operation to execute on RAM model of computation is-----

a. Constant

b. Continuous

c. Variable

d. Infinite

29 / 30

Category: CS502-mid

Is it possible to sort without making comparisons?

a. No

b. Yes

30 / 30

Category: CS502-mid

In RAM model instructions are executed

a. One after another

b. Random

c. Concurrent

d. Parallel

Your score is

The average score is 0%

Exit

Note before downloading CS502 midterm past paper

One thing to note dear fellows that you must don’t rely on these papers only. They can be a source of help but not an ultimate solution. If you want to get good marks in your exams you are advised to go through all of your handouts and must watch all of the video lectures.

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules. So here they are:

Never miss your Quiz, Assignment, or GDB.
Always try to do your Assignment on your own.
Try your best to finish your video lectures 10 days before exams.
Try your best to read your handouts twice before exams.
Read forward attempt backward.
Never schedule more than one paper on the same day.
Your most difficult paper should have a gap of 1 or more days.
Toughest paper must be scheduled first.
Read questions forward and attempt backward.
Don’t waste your time during a paper on illegal activities.

You can also download the Latest VU Handouts

To download the CS502 midterm past paper click here.

CS502 Midterm Past Paper online Practice Quiz

CS502 Midterm Past Paper

Practice Quiz from CS502 Midterm Past Paper

Note before downloading CS502 midterm past paper

Golden rules for good marks in VU Exams.

Leave a Comment Cancel Reply