Attempt all the problems.
problem1) describe the rules for deriving relations which represent strong entity types, weak entity types, one-to-one binary relationship types, one-to-many relationship types, multi-valued attributes, and super class / subclass relationships.
problem2) describe the difference between hashing and indexing? What type of data structure might be implemented to support index-based search ensuring fast retrieval of information in a uniform fashion?
problem3) For each of the following application areas, describe why a relational database system will be inadequate. List all specific system components that would be need to modify.
i) Computer Aided Design
ii) Multimedia Database.
problem4) Consider following relations:
Faculty (F_id, F-name, F-designation) [The table contains several tuples having f-id as primary key]
Patient (P_id, P_name, p_address, date of admission) [The table contains several tuples and is stored on P_id]
Consultation date (C_date, F_id, P_id)
prepare the following queries:
(i) Find details of the whole faculty whose designation is a senior doctor and have got consultation date in July 2007.
(ii) Name the details of all patients who have got consultation dates fixed between 15th August to Sept. 2007
Let us assume that XYZ University's Administration Office needs a database to handle student’s transcript data. The following are the requirements:
a) The database keeps track of each student's name, enrollment no. (E. No.), communication address and phone no., permanent address and phone no., date of birth, sex, class, department, college, major subjects (a 4-char code).
b) Some applications need to refer individually to the city, state (2-char abbrv.) and zip code (some use 5-digit, some use 9) of the student’s address. Some applications need to refer to student’s first and last names separately. Enrollment no. should be unique number for each student.
c) Each department has a name, a 3-char code, location (main building and room number), office phone, college, and a list of instructors. Many colleges are affiliated to the University. Department names and code are unique, within university.
d) Each instructor has his/her enrolment no., first name and last name.
e) The course catalog contains the list of courses that XYZ University offers. Each course has a number (e.g. 543), name, description, credit hours and department. Course numbers are unique within a department, but not unique across the university (so taken together, they are unique). Not every course is offered every semester.
f) Each section has a single instructor (first and last names - no team-taught class), semester (1-4) year (2-digit), course number and section number.
g) A grade report contains student's name, E. No, course number and section, letter grade (A, B,C, D, E).
Note: If the above user requirements leave out any significant detail, suppose that it is handled the way XYZ does things in the real world.
Answer the following problems based on the above requirements and specifications:
(i) Draw E-R diagram of the above. Name all the accompanying attributes/domains (including constraints).
(ii) Convert your E-R diagram to the relational schema:
• Use naming as specified in the E-R diagram.
• Use format as shown in the ex below, including:
• Table name in caps
• List of attributes with primary key underlined
• Foreign key specified with table/attribute it references (with .. cascade, it suitable)