Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Dated:Jul 29, 21

Dear Students!

Graded Discussion Board (GDB) will be launched on Tuesday, August 03, 2021 and it will close on Wednesday, August 04, 2021.

GDB Scenario:

You need to develop a software application for an academic institute that provides online distance learning and follows the annual admission system. Where a huge number of students are enrolled annually. The abundance of routine academic activities are carried out frequently. The thresh hold of routine activities remains very high throughout the year. The processing of the academic activities needs to be managed efficiently. So, by keeping in view the whole system, the application must be capable to carry out all these activities in an optimized / efficient way. The purpose is to make manipulations with data like insertion, deletion and searching smooth. You can design this application by using AVL tree and binary search tree data structures only.

GDB Question:

From AVL and binary search tree data structures which data structure you will choose for performing these operations as desired? Select a data structure and support your answer (suggested data structure) to justify it and mention the reason why you are going to drop the other data structure?


A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Answers, posted on Lesson’s MDB or sent through email will NOT be considered in any case.

Best of Luck!

Views: 101

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service