Develop a simple database of student records, Database Management System

Assignment Help:

In this programming assignment, you will develop a simple database of student records. Here are the requirements:

1) A student record contains a name and a number. We assume that all the student numbers different. You should use struct data type for student records.

2) The database uses a list data structure.

3) The following four operations over the database should be supported by the application.

a. The application can read a student record from the user and add the record into the database.

b. The application can read a student number from the user, search the database using the student number, and display the student name in the found student record.

c. The application can read a student number from the user, search the related student record in database using the student number, and delete the student record from the database. You should note that the record to be deleted can be anywhere in the database.

d. The application can list all the student records in the database.

4) The application should use a text-based user interface to get commands from the user, which use the four operations in 3).

5) You should not assume that only a fixed number of student records can be added into the database. The database should be able to dynamically shrink or grow with the user commands, such as, 3.a and 3.c.

When you test the application, you should add at least 5 student records first, test all the other database operations, add 5 more student records again, and test all the other operations again. You should use the user interface, not hard coded test statements.


Related Discussions:- Develop a simple database of student records

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Describe the types of inheritance, Describe the types of Inheritance ...

Describe the types of Inheritance 1.  Single inheritance 2.  Multiple inheritance 3.  Hierarchical inheritance 4.  Multilevel inheritance

Explain the query processing, Explain the Query Processing  Data Query ...

Explain the Query Processing  Data Query Processing permits a user to report or analyze structured and unstructured data pulled from multiple data sources.

Differentiate between primary and secondary storage, Differentiate between ...

Differentiate between Primary and secondary storage? Primary and secondary storage - Primary storage device stores the data temporarily. Primary storage is commonly used thro

Explain the term- inheritance, What is inheritance? Inheritance is an ...

What is inheritance? Inheritance is an object orientation concept that allows reusability of code / design. Basic sense of inheritance is that if one class is predefined than a

What is data block, What is data block? Data Block - In oracle the data...

What is data block? Data Block - In oracle the data blocks are referred to as tablespaces. A tablespace is an fields of disk consisting of one or more disk files. A tablespace

What is the meaning of redundant associations, Adding Redundant Association...

Adding Redundant Associations for Efficient Access The expression redundant association means using "duplicate association for proficient access". While analysis, it is not a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd