NPTEL SWAYAM COMPILER DESIGN ASSIGNMENT ANSWERS WEEK 9

Compiler Design
In this video, we're going to unlock the answers to the Compiler Design questions from the NPTEL 2024 Jan-Apr assignment.
If you're looking to unlock the answers to the Compiler Design questions from the NPTEL 2024 Jan-Apr assignment, then watch this video! By the end of this video, you'll know all the answers to the questions you were struggling with.
So if you're looking to crack the NPTEL 2024 Jan-Apr assignment, watch this video and learn how to unlock the answers!

[@Shaikhkhaif]

Sir please week 10 assignment upload karona

[@thangamarid8724]

check 3 question
i think answer is B
In the worst case scenario, the lookup time for a tree-based symbol table, such as a binary search tree (BST), is
O(n), where
n is the number of elements in the tree.
This worst-case scenario occurs when the tree is unbalanced, resulting in a linear chain-like structure. In such a situation, each lookup operation may require traversing through all n nodes of the tree, leading to a time complexity linearly proportional to the number of elements in the tree.

[@TrinityCollegeforWomen]

yes mam option B is coreect

[@kekabandyopadhyay1059]

When week 10 assignment answers will be uploaded?