- Type
- Final term past paper
- Course
- CS301 Data Structures
- Size
- PDF 1.2 MB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2, 3 of 28. Download the file for all 28 pages.
- An expression tree will always be a,
- Heap AVL tree
- 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
- 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-
What is printed by the call test_a(4)?
- 4 2#
- 0 2 4
- 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
- It is necessary for Huffman encoding tree to be,
- AVL tree
Binary tree#
- 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
- 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 #
- 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
Related CS301 files
All CS301 files →- CS301 Final Term Solved Papers 1 by Waqar Siddhu Final term PDF 2.7 MB
- CS301 Final Term Solved MCQs Set 2 by Junaid Final term PDF 1.1 MB
- CS301 Final Term Solved MCQs Set 3 by Junaid Final term PDF 1.2 MB
- CS301 Final Term Subjective Set 2 by Waqar Siddhu Final term PDF 6.2 MB
- CS301 Highlighted Handouts by World of Education Highlighted PDF 13 MB
- CS301 Quiz 2 by Junaid Quiz PDF 727 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.