CS301 Final Term Quiz 4 Jan 2024 by Miss Mehwish
- Type
- Final term past paper
- Course
- CS301 Data Structures
- Size
- PDF 420 KB
- 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 4. Download the file for all 4 pages.
Past Papers for Mids./Finals are also Available
- In AVL tree insertion occurs on the inside in cases _________ and 3 which a single rotation cannot fix.
- 1
- 3
- 4
Q2. Which of the following statement is true about a dummy node of a threaded binary tree?
- This dummy node has always some dummy value
- This dummy node never has a value
- This dummy node has either no value or some dummy value. (Correct Option)
- This dummy node has always some integer value.
- In Huffman tree, the process of combining the two nodes of the lowest frequency will be carried out until ________ node/nodes left.
- More than two nodes
- 0
- 2
- A binary tree with 33 internal nodes has _______ links to internal nodes.
- 31
- 33
- 34
Q5. To evaluate an expression tree which of the following techniques is used?
- Right to left
- Bottom up (Correct Option)
- Top down
- Left to right
- The worst case of building a heap of N keys is _______.
- NlogN (Correct Option)
- N^2
- 2^N
- N^2
- Traversing a binary tree can only be done using _________
- Both recursion and iteration (Correct Option)
- Iteration
- None of the given options
- Recursion
Q8. In a threaded binary tree, which nodes have NULL child pointers?
- None of the nodes
- Root Node
- Nodes other than leaf nodes
- All leaf nodes (Correct Option)
Q9. If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
- 57
- 56
- 54
Q10. Which of the following statements is true about the dummy node of a threaded binary tree?
- The left pointer of the dummy node points to the root node of the tree while the right pointer points itself, i.e., to the dummy node. (Correct Option)
- The left pointer of the dummy node points to the itself while the right pointer points to the root of the tree.
- The left pointer of the dummy node points to the root node of the tree while the right pointer is always NULL.
- The right pointer of the dummy node points to itself while the left pointer is always NULL.
Related CS301 files
All CS301 files →- CS301 Final Term Quiz 3 July 2023 by Miss Mehwish Final term PDF 537 KB
- CS301 Final Term Quiz 4 July 2023 Set 2 by Miss Mehwish Final term PDF 538 KB
- CS301 Final Term Quiz 4 File 2 July 2023 by Miss Mehwish Final term PDF 541 KB
- CS301 Final Term Quiz 4 July 2023 by Miss Mehwish Final term PDF 538 KB
- CS301 Highlighted Handouts Lectures 1-45 Highlighted PDF 12 MB
- CS301 Quiz 3 Jan 2026 Quiz PDF 34 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.