CS301P Final Term Quiz by VU Sparky
- Type
- Final term past paper
- Course
- CS301P Data Structures (Practical)
- Size
- PDF 4.7 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 5, 6 of 15. Download the file for all 15 pages.
What will be the balance factor of node 6 if node 5 is deleted from the given tree ?
A binary tree will not be considered an AVL tree if the difference between left and right subtree of each node is not more than : a. 3 b. 2
d. 0 The ASCII value for character ‘A’ is: a. 66 b. 68
d. 67 Which of the following represents frequency of all characters in Huffman Encoding tree? a. Root Node b. Right Branch c. Left Branch
If the tree becomes unbalance after deleting a node then we use ____________ to rebalance it.
b. Stack c. Heap d. Insertions What is the total frequency of character ‘B’ in the given Huffman encoding tree?
Related CS301P files
All CS301P files →- CS301P Final Term Quiz by Sana Sheikh Final term PDF 824 KB
- CS301P Final Term Quiz 2 by Sana Sheikh Final term PDF 776 KB
- CS301P Final Term Quizzes July 2023 by Sana Sheikh Final term PDF 598 KB
- CS301P Final Term MCQs by Miss Mehwish Final term PDF 1.9 MB
- CS301P Final Term Quiz 8 July 2023 by Miss Mehwish Final term PDF 531 KB
- CS301P Quiz June 16 2025 by Lucky Quiz PDF 319 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.