CS301 Midterm Past Paper Online Practice Quiz

midterm past paper quiz
midterm past paper quiz

CS301 Midterm Past Paper

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

Practice Quiz from CS301 Midterm Past Paper

This quiz will evaluate your preparation for the CS301 midterm examination and it is based on the past papers of CS301. 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

CS301 Mid Term Past Papers Online Practice Quiz

Welcome to CS301 Midterm Online Practice Quiz.

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

1 / 30

Category: CS301-mid

1. Consider the function X as under
int X (int& Value)
return Value;
Now a and b are integers in a calling function. Which one of the following is a valid call to the above function

2 / 30

Category: CS301-mid

2. The nodes with no successor are called _________

3 / 30

Category: CS301-mid

3. Which one is a self- referential data type?

4 / 30

Category: CS301-mid

4. The tree data structure is a

5 / 30

Category: CS301-mid

5. Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What boolean expression will be true when cursor refers to the tail node of the list?

6 / 30

Category: CS301-mid

6. The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

7 / 30

Category: CS301-mid

7. A queue where the de-queue operation depends not on FIFO, is called a priority queue

8 / 30

Category: CS301-mid

8. A tree is an AVL tree if

9 / 30

Category: CS301-mid

9. Let’s call the node as that requires re-balancing. Consider the two cases given below:
1) An insertion into left sub tree of the left child of a
2) An insertion into right sub tree of the right child of a.
Which of the following statement is correct about these two cases?

10 / 30

Category: CS301-mid

10. I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

11 / 30

Category: CS301-mid

11. AVL Tree is,

12 / 30

Category: CS301-mid

12. A queue where the de-queue operation depends not on FIFO, is called a priority queue

13 / 30

Category: CS301-mid

13. In the linked list implementation of the stack class, where does the push member function places the new entry
on the linked list?

14 / 30

Category: CS301-mid

14. _________ is a binary tree where every node has a value, every node's left subtree contains only values less
than or equal to the node's value, and every node's right subtree contains only values that are greater then or

15 / 30

Category: CS301-mid

15. Suppose that the class declaration of SomeClass includes the following function prototype bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha and beta?

16 / 30

Category: CS301-mid

16. Which one of the following statement is NOT correct .

17 / 30

Category: CS301-mid

17. A tree is an AVL tree if

18 / 30

Category: CS301-mid

18. When should you use a const reference parameter?

19 / 30

Category: CS301-mid

19. The expression AB+C* is called?

20 / 30

Category: CS301-mid

20. In which of the traversal method, the recursive calls can be used to traverse a binary tree ?

21 / 30

Category: CS301-mid

21. Each node in doubly link list has,

22 / 30

Category: CS301-mid

22. (i) A binary tree can contain at least 2L Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive.
(iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1- 1 .
(iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

23 / 30

Category: CS301-mid

23. Doubly Linked List always has one NULL pointer

24 / 30

Category: CS301-mid

24. Each operator in a postfix expression refers to the previous ________ operand(s)

25 / 30

Category: CS301-mid

25. Which one of the following calling methods does not change the original value of the argument in the calling function?

26 / 30

Category: CS301-mid

26. Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?

27 / 30

Category: CS301-mid

27. Here is the start of a C++ class declaration:
class foo
void x(foo f);
void y(const foo f);
void z(foo f) const;
Which of the three member functions can alter the PRIVATE member variables of the foo object that activates
the function?

28 / 30

Category: CS301-mid

28. We access elements in AVL Tree in,

29 / 30

Category: CS301-mid

29. Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

30 / 30

Category: CS301-mid

30. In the call by value methodology, a copy of the object is passed to the called function.

Your score is

The average score is 0%

Share your results with your fellow students.

LinkedIn Facebook Twitter VKontakte


Note before downloading CS301 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.

CS301 Data Structures

CS301 Data Structures is main subject for programmers to understand the data structures used in different programming languages. If anyone having strong grip on this subject, definitely that student will prosper in programming.

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 CS301 midterm past paper click here.