Skip to content
VUBuddy

CS301 Final Term MCQs by Sparrows

Data Structures PDF 1.2 MBUpdated 23 Oct 2026
Final term past paper CS301 Final Term MCQs by Sparrows PDF 1.2 MB
vubuddy.com
Type
Final term past paper
Course
CS301 Data Structures
Size
PDF 1.2 MB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 1.2 MB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 28. Download the file for all 28 pages.

CS301 by Sparrow · Final Term · Fall 2021-2022

  1. An expression tree will always be a,
  •  Heap AVL tree
  1. Derived class can inherit from public base class as well as private and protected base classes

 True#

  •  False

3. Which line will produce error. Class phone: Private Transmit, private Receiver { }

1.int main () 2. {3.phone obj; 4.Tranmit*obj1 = &obj; 5.Received obj2 = &obj; 6.}

 3rd line will produce error#

  •  4th line will produce error
  •  3rd and 4th line will produce error.
  •  5th line will produce error.

Q4. Consider a max heap, represented by the following array; 40,30,20,10,15,16,17,18,4 after inserting a nodes with value 35. Which of following is the updated max heap?

 40,30,20,10,15,16,17,8,4,35#

  •  40,30,20,10,35,16,17,8,4,15
  1. A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a Link) ___________Successor.
  •  Preorder

 Inorder#

Q6. Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?

  •  Linked List

 Stack #

  •  Queue

Q7. For compiler a postfix expression is easier to evaluate than infix expression?

  • True #
  •  False

Q8. What will be postfix expression of the following infix expression?

Infix Expression : a + b*c-d

  •  Ab +c*d-

 abc*+d-#

  •  abc+*d-

9. Consider the following function: · void test_a (int n) · cout << n << " "; · if (n>0) · test_a (n-2);

What is printed by the call test_a(4)?

  • 4 2#
  •  0 2 4
  1. A binary tree with 45 internal nodes has _________ links to external nodes.
  •  44
  •  45
  • 46#

Q11. In which of the following tree, parent nodes has key greater than or equal to its both children?

  •  Max heap
  1. It is necessary for Huffman encoding tree to be,
  •  AVL tree

 Binary tree#

  1. Methodologies to the development of reusable software relate to ____________.
  •  Structure programming
  •  Procedural programming

 Generic programming#

  •  None of the given

Q14. Which of the following is a property of binary tree?

  •  A binary tree of N external nodes has N internal node

 A Binary tree of N internal nodes has N+1 external node#

  •  A Binary tree of N external nodes has N+1 internal nodeA Binary tree of N internal has N-1 external node

Q15. In a threaded binary tree which nodes have NULL child pointers?

 All leaf nodes#

  •  Nodes other than leaf nodes
  •  Root Node
  •  None of the nodes
  1. A template provides a convenient way to make a family of.
  •  variables and data members

 functions and classes#

  •  classes and exceptions
  •  programs and algorithms

17. The total numbers of nodes on 10th level of perfect binary tree are

  •  256
  •  512

 1024 #

  1. Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees, the collection of these trees is called ___________.
  •  Cluster
  •  Class
All CS301 files →
CS301 Data Structures All CS301 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.