CS301 GDB 1 Solution 2021 | Spring 2021

CS301 GDB no 1 Spring 2021

Dear Students, Here you can read or download CS301 - Data Structure GDB 1 Solution of Semester Spring 2021. CS301 GDB 1 Solution Spring 2021 | Spring 2020 File and Sample Preview have also been added below. Previously we shared CS301 Short Notes.

CS301 GDB 1 Solution Spring 2021

CS301 GDB Question:

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 manually. The abundance of routine academic activities is carried out frequently. The thresh hold of routine activities remain very high throughout the year. The processing of the academic activities needs to be managed efficiently. So, by keeping in the 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 search smooth. You can design this application by using AVL tree and binary search tree data structures only.

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