Subject :Information Management 1 9:09 60HzG all ll 80%Case Study 1 (Cc-105).pdfCASE STUDY #1 (CC – 105)Instructions: Based from the given data dictionary below, answer the following questions:DATABASE NAME: ENROLLMENTTABLE NAMEATTRIBUTE NAMEРK or FKDATA TYPECHAR(13)VARCHAR(50)VARCHAR(50)YEAR(4)CHAR(13)CHAR(15)CHAR(40)CONTENTSREQUIRED FIELDSTUDENTSTUD_NUMStudent's ID NumberYPKSTUD FNAMEStudent's First NameYSTUD LNAMEStudent's Last NameYYR_ADMITYear AdmittedYCOURSECOURSE_IDCourse IDYPKCOURSE_NAMECourse Name in Abbreviated FormYCourse Major (if any)Subject _IDSubject NameSubject UnitsCOURSE MAJORNSUBJ_IDSUBJ_NAMESUBJECTCHAR(15)VARCHAR(60)CHAR(6)YPKYSUBJ_UNITSY1. How many entities are there within the entire database?2. How many attributes are there for each entity?3. Give at least four (4) constraint within each of the entities.

Entities are the real world objects. Attributes are the characteristics. Constraints are the…

Instructions: Based from the given data dictionary below, answer the following questions: DATABASE NAME: ENROLLMENT TABLE NAME ATTRIBUTE NAME CONTENTS REQUIRED FIELD PK or FK STUD_NUM STUD_FNAME STUD LNAME DATA TYPΕ CHAR(13) VARCHAR(50) VARCHAR(50) YEAR(4) STUDENT Student's ID Number Y PK Student's First Name Y Student's Last Name Y YR_ADMIT Year Admitted Y COURSE COURSE_ID PK CHAR(13) CHAR(15) Course ID Y COURSE_NAME Course Name in Abbreviated Form Y Course Major (if any) Subject _ID Subject Name Subject Units COURSE MAJOR CHAR(40) N SUBJ_ID CHAR(15) VARCHAR(60) SUBJECT Y PK SUBJ_NAME Y SUBJ UNITS CHAR(6) Y 1. How many entities are there within the entire database? 2. How many attributes are there for each entity? 3. Give at least four (4) constraint within each of the entities.

Instructions: Based from the given data dictionary below, answer the following questions: DATABASE NAME: ENROLLMENT TABLE NAME ATTRIBUTE NAME CONTENTS REQUIRED FIELD PK or FK STUD_NUM STUD_FNAME STUD LNAME DATA TYPΕ CHAR(13) VARCHAR(50) VARCHAR(50) YEAR(4) STUDENT Student's ID Number Y PK Student's First Name Y Student's Last Name Y YR_ADMIT Year Admitted Y COURSE COURSE_ID PK CHAR(13) CHAR(15) Course ID Y COURSE_NAME Course Name in Abbreviated Form Y Course Major (if any) Subject _ID Subject Name Subject Units COURSE MAJOR CHAR(40) N SUBJ_ID CHAR(15) VARCHAR(60) SUBJECT Y PK SUBJ_NAME Y SUBJ UNITS CHAR(6) Y 1. How many entities are there within the entire database? 2. How many attributes are there for each entity? 3. Give at least four (4) constraint within each of the entities.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 27SA

See similar textbooks

Similar questions

1. Given the data below, construct a Pandas program to generate and display a DataFrame with index labels df = pd.DataFrame( {'ord_no':[70001,np.nan,70002,70004,np.nan,70005,np.nan,70010,70003,70012,np.nan,70013], 'purch_amt':[150.5,270.65,65.26,110.5,948.5,2400.6,5760,1983.43,2480.4,250.45, 75.29,3045.6], 'ord_date': ['2012-10-05','2012-09-10',np.nan,'2012-08-17','2012-09-10','2012-07-27','2012-09-10','2012-10-10','2012-10-10','2012-06-27','2012-08-17','2012-04-25'], 'customer_id':[3002,3001,3001,3003,3002,3001,3001,3004,3003,3002,3001,3001], 'salesman_id':[5002,5003,5001,np.nan,5002,5001,5001,np.nan,5003,5002,5003,np.nan]}) 2. Write a Pandas program to detect missing values of a given DataFrame. Display True or False.3. Remove all the columns and rows that has missing values.
Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of record. Suppose the key balues range from 1 to 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node poiinter, or data record pointer) takes 10 bytes. What is the total number of blocks required by the B+-tree?
Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of record. Suppose the key balues range from 1 to 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node poiinter, or data record pointer) takes 10 bytes. How many data block accesses on the average are needed to fetch a record by using linear search?
113. Banker's algorithm for resource allocation deals with a. deadlock prevention b. deadlock avoidance c. deadlock recovery d. mutual exclusion
What is the working set page replacement algorithm? How does the working set algorithm work? Explain locality of reference with respect to memory references and how this applies to the working set page replacement algorithm.
Which of these describes how an item in a doubly linked data structure is accessed? a.immediately accessed via a base address and offset b.accessed by starting at one end and following the links until the item is reached c.immediately accessed via an index d.accessed via a binary search
167. The file organization which allows us to read records that would satisfy the join condition by using one block read is a. Heap file organization b. Sequential file organization c. Clustering file organization d. Hash file organization
Question 1 A) Divide and Conquer (Mergesort) sorting Start 45 31 78 69 98 20 55 30 B) SHELL sorting (Tokokan 4,2,1) Start 45 31 78 69 98 20 55 30
Does the growth of file entries induce clustering?
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectively
8. Matrix algebra is a theoretical way of manipulating a database. 9. The union of tables A and B is a table containing all rows that are in either table A or table B or in both table A and table B. 10. The intersection of two tables A and B is the set of all rows that are in table A but that are not in table B.
Explain with examples best fit, worst fit, first fit memory allocation methods. Can there be special provisions made internally in data structures while doing memory management so that both best fit and first fit approach become equivalent? Explain.