CS502 Midterm Past Paper online Practice Quiz

midterm past paper quiz
midterm past paper quiz

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 By faisal_faisi


midterm past paper quiz

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

1. In simple brute-force algorithm, we give no thought to efficiency

2 / 30

Category: CS502-mid

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

3 / 30

Category: CS502-mid

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

4 / 30

Category: CS502-mid

4. Due to left-complete nature of binary tree, heaps can be stored in

5 / 30

Category: CS502-mid

5. The Knapsack problem belongs to the domain of _______________ problems.

6 / 30

Category: CS502-mid

6. In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

7 / 30

Category: CS502-mid

7. In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the

8 / 30

Category: CS502-mid

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

9 / 30

Category: CS502-mid

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

10 / 30

Category: CS502-mid

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

11 / 30

Category: CS502-mid

11. In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.

12 / 30

Category: CS502-mid

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

13 / 30

Category: CS502-mid

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

14 / 30

Category: CS502-mid

14. Random access machine or RAM is a/an

15 / 30

Category: CS502-mid

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

16 / 30

Category: CS502-mid

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

17 / 30

Category: CS502-mid

17. 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.

18 / 30

Category: CS502-mid

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

19 / 30

Category: CS502-mid

19. A RAM is an idealized machine with ______________ random-access memory.

20 / 30

Category: CS502-mid

20. Consider the following Algorithm: Factorial (n){ if (n=1) return 1 else
return (n * Factorial(n-1)) }
Recurrence for the following algorithm is:

21 / 30

Category: CS502-mid

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

22 / 30

Category: CS502-mid

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

23 / 30

Category: CS502-mid

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

24 / 30

Category: CS502-mid

24. ______________ graphical representation of algorithm.

25 / 30

Category: CS502-mid

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

26 / 30

Category: CS502-mid

26. In RAM model instructions are executed

27 / 30

Category: CS502-mid

27. What is the total time to heapify?

28 / 30

Category: CS502-mid

28. We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.

29 / 30

Category: CS502-mid

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

30 / 30

Category: CS502-mid

30. In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.

Your score is

The average score is 0%

Share your results with your fellow students

LinkedIn Facebook Twitter VKontakte


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:

  1. Never miss your Quiz, Assignment, or GDB.
  2. Always try to do your Assignment on your own.
  3. Try your best to finish your video lectures 10 days before exams.
  4. Try your best to read your handouts twice before exams.
  5. Read forward attempt backward.
  6. Never schedule more than one paper on the same day.
  7. Your most difficult paper should have a gap of 1 or more days.
  8. Toughest paper must be scheduled first.
  9. Read questions forward and attempt backward.
  10. 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.