CS301 GDB Solution Spring 2022
Due Date: 30 Aug 2022
Question
A
university wants a management system that must have the ability to enroll over
50,000 students in a semester. The university needs an application developed
that fulfill the following requirements.
·
Insertion
of student’s information including entry test marks and previous academic
records.
·
The
insertion of information should be efficient and quick.
·
After
insertion of required data, the merit will be populated on the basis of
previous academic grades and entry test marks.
·
Application
will generate and display a merit list in descending order by total obtained
marks.
·
The
student with highest marks will be at the top of the list and lowest marks
achiever will be at the bottom.
·
In
the admission process the most frequent process is the searching for
information about students. So, this is very important requirement should also
be considered and implemented efficiently.
Assume
you are working as an analyst for a software development company named XYZ.inc.
The task assigned to you is to analyze the BST (Binary Search Tree) and Heap
data structures and decide which data structure should be used to develop the requirement
application. Clearly mention which data structure you are selecting and justify
your selection with valid comments.
Note: You are allowed to
introduce new algorithm or propose any changes in existing algorithms
associated with BST and Heap data structures. If you are suggesting any changes
in the algorithms or introducing a new algorithm then clearly mention the
changes or new introduction with reasons.
Solution
The university all will
consider application for affiliation from institutions offering programmes
similar to those offered by the university. The quality assurance system
governing university and the institution must be designed to meet the following
conditions:
One important theory developed for the entity
relational (ER) model involves the notion of functional dependency (FD). The
aim of studying this is to improve your understanding of relationships among
data and to gain enough formalism to assist with practical database design.
Like constraints, FDs are
drawn from the semantics of the application domain. Essentially, functional
dependencies describe how individual attributes are related. FDs are a kind of
constraint among attributes within a relation and contribute to a good
relational schema design. In this chapter, we will look at
Data Structures are a
specialized means of organizing and storing data in computers in such a way
that we can perform o lions on the stored data more efficiently. Data
structures have a wide and diverse scope of usage across the fields of computer
Science and Software Engineering.
DO'T COPY THE SAME