VPM Classes - Sample Theory - New Pattern - Ugc Net Comp. Sci

CSIR UGC NET, GATE (ENGINEERING), GATE (Science), IIT-JAM, UGC NET, TIFR, IISc, NIMCET, JEST etc.
UGC NET - COMPUTER SCIENCE

SAMPLE THEORY
RELATIONAL DATABASE
DESIGN
NORMALIZATION
For IIT-JAM, JNU , GATE, NET, NIM CET and Other Entrance Exa m s
1-C-8, Sheela Chowdhary Road, Talwandi, Kota (Raj.) Tel No. 0744-2429714
Web Site www.vpmclasses.com E-mail-vpmclasses@yahoo.com
Phone: 0744-2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297242 Website: www.vpmclasses.com E-Mail: vpmclasses@yahoo.com /info@vpmclasses.com Address: 1-C-8, Sheela Chowdhary Road, SFS, TALWANDI, KOTA, RAJASTHAN, 324005
Page 1
RELATIONAL DATABASE DESIGN

Basic Concepts
A database is a collection of logically related records A relational database stores its data in 2-dimensional tables A table is a two-dimensional structure made up of rows (tuples, records) and columns (attributes, fields) Example: a table of students engaged in sports activities, where a student is allowed to participate in at most one activity
Student
100 150 175 200
Activity
Cricket Hockey Football Hockey
Fee
200 50 50 50
Table Characteristics
Each row is unique and stores data about one entity Each column has a unique attribute name Each column (attribute) description (metadata) is stored in the database Access metadata is stored and manipulated via the Table Design View grid Row and column order is unimportant All entries in a column have the same data type Data type examples: Text(50), Number(Integer), Date/Time Each cell contains atomic data: no lists or sub-tables
Primary Keys
A primary key is an attribute or a collection of attributes whose value(s) uniquely identify each row in a Relation A primary key should be minimal: it should not contain unnecessary attributes
Student
100 150 175 200
Activity
Cricket Hockey Football Hockey
Fee
200 50 50 50
Page 2
We assume that a student is allowed to participate in at most one activity The only possible primary key in the above table is StudentID Sometimes there is more than one possible choice; each possible choice is called a candidate key What if we allow the students to participate in more than one activity?
Student
100 100 175 175 200 200
Activity
Cricket Golf Football Hockey Hockey Golf
Fee
200 65 50 50 50 65
Now the only possible primary key is the combined value of (StudentID, Activity), Such a multi-attribute primary key is called a composite key or concatenated key.
Composite Keys
A table can only have one primary key But sometimes the primary key can be made up of several fields Concatenation means putting two things next to one another: the concatenation of burger and foo is burgerfoo. consider the following table of cars.
License Plate
LVR120 BCX50P LVR120 908HYY UHP33
State
RJ NJ CT MA NJ
Make
Maruti Buick Toyota Ford Tata
Model
Swift Regal Corolla Windstar Nano
Year
2003 1998 2002 2001 2006
Page 3
License Plate is not a possible primary key, because two different cars can have the same license plate number if theyre from different states But if we concatenate LicensePlate and State, the resulting value of (LicensePlate, State) must be unique: Example: LVR120NJ and LVR120CT Therefore, (LicensePlate, State) is a possible primary key (a candidate key) Sometimes we may invent a new attribute to serve as a primary key (sometimes called a synthetic key) If no suitable primary key is available Or, to avoid composite keys In Access, Autonumber fields can serve this Purpose.
Foreign Keys
A foreign key is an attribute or a collection of attributes whose value are intended to match the primary key of some related record (usually in a different table) Example: the STATE and CITY table below
State Table:
State Abbrev
RJ UP WB MP AS
State Name
Rajasthan Uttar Pradesh West Bengal Madhya Pradesh Assam
Union Order
5 26 40 16 28
State Bird
Peacock sparrow white Pigeon Hen Crow
State Population
3,287, 116 9,295,297 696,004 4, 877.185 16, 986, 510
Page 4
City Table:City Population

139, 739 14,031
State Abbrev
RJ RJ RJ UP
City Name
Kota Jaipur
Jodhpur
Mathura
8,418
127,321
WB
WB MP AS AS
Tripura
Patna Bhopal Nagaland manipur
6,257
12,906 488,374 465,622 12,224
Primary key in STATE relation: StateAbbrev Primary key in CITY relation: (StateAbbrev, CityName) Foreign key in CITY relation: StateAbbrev Database Anomalies Anomalies are problems caused by bad database design example: ACTIVITY (StudentID, Activity, Fee)
Student
100 100 175 175 200 200
Activity
Fee
200 65 50 50 50 65
Page 5
An insertion anomaly occurs when a row cannot be added to a relation, because not all data are available (or one has to invent dummy data) Example: we want to store that volleyball costs $175, but have no place to put this information until a student takes up volleyball (unless we create a fake student) A deletion anomaly occurs when data is deleted from a relation, and other critical data are unintentionally lost Example: if we delete the record with StudentID = 100, we forget that cricket costs $200 An update anomaly occurs when one must make many changes to reflect the modification of a single datum Example: if the cost of Hockey changes, then all entries with Hockey Activity must be changed too Cause of Anomalies Anomalies are primarily caused by: (1) Data redundancy: replication of the same field in multiple tables, other than foreign keys (2) Functional dependencies whose determinants are not candidate keys, including - Partial dependency - Transitive dependency
Example: ACTIVITY (StudentID, Activity, Fee)
Student
100 100 175 175 200 200
Activity
Fee
200 65 50 50 50 65
Page 6
Activity by itself is not a candidate key, so we get anomalies (in this case, from a partial dependency)
Fixing Anomalies (Normalizing)

Break up tables so all dependencies are from primary (or candidate) keys PARTICIPATING (StudentID, Activity) Activity foreign key to ACTIVITIES ACTIVITY (Activity, Fee)
StudentID
100 100 150 175 175
Activity
Cricket Golf Hockey Football Hockey Hockey Golf
Activity
Cricket Golf Hockey Football Volleyball
Fee
200 65 50 50 200
200
200
Page 7
StudentID
100 100 150 175 175
Activity
Cricket Golf Hockey Football Hockey Hockey Golf
Activity
Cricket Golf Hockey Football Volleyball
Fee
200 65 50 50 200
200
200
The above relations do not have any of the anomalies
Page 8
NORMALIZATION
Normal forms are categories that classify how completely a table has been normalized There are six recognized normal forms (NF):
Functional Dependency(1) Functional Dependency: Is a relationship between or among attributes such that the values of one attribute depend on, or are determined by, the values of the other attribute(s). (2) Partial Dependency: Is a relationship between attributes such that the values of one attribute is dependent on, or determined by the values of another attribute which is part of the composite key. Partial Dependencies are not good due to duplication of data and update anomalies; Examples of Functional Dependencies:
If we know an ISBN, then we know the Book Title and the Author(s)
(1)ISBN Book Title (2)ISBN Author(s)
If we know the VIN, then we know who is the Auto owner

VIN Auto_Owner
If we know Student-ID (SID), then we can uniquely determine his/her Name

SID S_Name
Page 9
Transitive Dependencies
Is a relationship between attributes such that the values of one attribute is dependent on, or determined by,
the values of another attribute which is not a part of the key.
Exist when a nonkey attribute value is functionally dependent upon another nonkey value in the record.
For Example: EMPLOYEE_ID --> JOB_CATEGORY JOB_CATEGORY --> HOURLY_RATE
An employee data table that includes the hourly pay rate would require searching every employee record
to properly update an hourly rate for a particular job category. GOLDEN RULE OF NORMALIZATION: Enter the minimum data necessary, avoiding duplicate entry of information with minimum risks to data integrity. Goals of Normalization: (1)Eliminate redundancies caused by: (a) Fields repeated within a file (b) Fields not directly describing the key entity (c) Fields derived from other fields (2)Avoid anomalies In Updating (Adding, Editing, Deleting) (3)Represent accurately the items being modeled (4)Simplify maintenance and retrieval of info Database Tables and Normalization
Normalization is a process for assigning attributes to entities. It reduces data redundancies and helps
eliminate the data anomalies.
Normalization works through a series of stages called normal forms:

(1) First normal form (1NF) (2) Second normal form (2NF) (3) Third normal form (3NF)
The highest level of normalization is not always desirable.
Page 10
Basic Rule for Normalization
The attribute values in a relational table should be functionally dependent (FD) on the primary key value.
(1) A relationship is functionally dependent when one attribute value implies or determines the attribute value for the other attribute. EM_SS_NUM --> EM_NAME
Corollaries
(1) Corollary 1: No repeating groups allowed in relational tables. (2) Corollary 2: A relational table should not have attributes involved in a transitive dependency relationship with the primary key. Normalization Benefits
Facilitates data integration. Reduces data redundancy. Provides a robust architecture for retrieving and maintaining data. Compliments data modeling. Reduces the chances of data anomalies occurring.
The data redundancies yield the following anomalies: (a) Update anomalies. (b) Addition anomalies. (c) Deletion anomalies. Deletion Anomaly
Occurs when the removal of a record results in a loss of important information about an entity.
Example: All the information about a customer is contained in an Order file, if the order is canceled; all the customer information could be lost when the order record is deleted Solution: Create two tables--one table contains order information and the other table contains customer information. Update Anomaly
Occurs when a change of a single attribute in one record requires changes in multiple records
Example: A staff person changes their telephone number and every potential customer that person ever worked with has to have the corrected number inserted. Solution: Put the employees telephone number in one location--as an attribute in the employee table.
Page 11
Insertion Anomaly
Occurs when there does not appear to be any reasonable place to assign attribute values to records in the
database. Probably have overlooked a critical entity. Example: Adding new attributes or entire records when they are not needed. Where do you place information on new Evaluators? Do you create a dummy Lead. Solution: Create a new table with a primary key that contains the relevant or functional dependent attributes.
Conversion to First Normal Form

(a) A relational table must not contain repeating groups. (b) Repeating groups can be eliminated by adding the entry in at least the primary key column(s).
PROJ_ NUM
15
PROJ_NAME
Greenfield
EMP _ NUM 103 101 105
EMP_NUM
Mohan Ram Amit Shyam Puneet
JOB_ CLASS
Elect. Engineer Database Designer Database Designer Programmer Systems Analyst
CHG HOUR
$84.50 $105.00 $105.00 $35.75 $96.75
Hours
23.8 19.4 35.7 12.6 23.8
106
102
Database Table 1. The Evergreen Data
Dependency Diagram
(a) The arrows above the entity indicate that the entities are dependent on the combination of PROJ_NUM and EMP_NUM. (b)The arrows below the dependency diagram indicate less desirable dependencies based on only a part of the primary key -- partial dependencies.
A Dependency Diagram: First Normal Form
Page 12
1NF Definition
(1) The term first normal form (1NF) describes the tabular format in which: (a) All the key attributes are defined. (b)There are no repeating groups in the table.
(c)) All attributes are dependent on the primary key.
(2) Conversion to Second Normal Form (I) Starting with the 1NF format, the database can be converted into the 2NF format by (a) Writing each key component on a separate line, and then writing the original key on the last line (b) Writing the dependent attributes after each new key. PROJECT (PROJ_NUM, PROJ_NAME) EMPLOYEE (EMP_NUM, EMP_NAME, JOB_CLASS, CHG_HOUR) ASSIGN (PROJ_NUM, EMP_NUM, HOURS)
2NF Definition
(1) A table is in 2NF if: (a) It is in 1NF and (b) It includes no partial dependencies; that is, no attribute is dependent on only a portion of the primary key.
Note:
It is still possible for a table in 2NF to exhibit transitive dependency; that is, one or more attributes may be functionally dependent on non key attributes.
Page 13
Conversion to Third Normal Form

Create a separate table with attributes in a transitive functional dependence relationship. PROJECT (PROJ_NUM, PROJ_NAME) ASSIGN (PROJ_NUM, EMP_NUM, HOURS) EMPLOYEE (EMP_NUM, EMP_NAME, JOB_CLASS) JOB (JOB_CLASS, CHG_HOUR)
3NF Definition
A table is in 3NF if: (a) It is in 2NF and (b) It contains no transitive dependencies.
Summary of one conversion form to another
Page 14
1. Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that: (A) A B (B) A C (C) A (B, C). (D) (B, C) A. 2. In the relational model, relationships between relations or tables are created by using: (A) Composite keys. (B) Determinants. (C) Candidate keys. (D) Foreign keys 3. A tuple is a(n): (A) Column of a table. (B) Two dimensional table. (C) Row of a table (D) Key of a table. 4. Which of the following is not a restriction for a table to be a relation? (A) The cells of the table must contain a single value. (B) All of the entries in any column must be of the same kind. (C) The columns must be ordered (D) No two rows in a table may be identical. 5. For some relations, changing the data can have undesirable consequences called: (A) Referential integrity constraints. (B) Modification anomalies (C) Normal forms. (D) Transitive dependencies.
Page 15
Hints & Solutions

1. (A), 2. (D), 3.(C), 4. (C), 5 (B)
1. (A) Because only value of A will match with B. 2. (D) Because a foreign key is an attribute or a collection of attributes whose value are intended to match the primary key of some related record (usually in a different table) 3.(C) A table is a two-dimensional structure made up of rows (tuples, records) and columns (attributes, fields). 4.(C) Column order is unimportant in Relational database design. 5.(B) An update anomaly occurs when one must make many changes to reflect the modification of a single datum.
Please find the details in Table below of the UGC NET JUNE 2012 COMPUTER SCIENCE:
UGC NET (JUNE 2012) COMPUTER SCIENCE

UGC NET (JUNE 2012) COMPUTER SCIENCE (course details)
20 volumes of theory covering all topics of UGC NET Computer Science (10 for Paper 2 & 10 for Paper 3) 10 Topic wise Unit Test papers covering the syllabus of PAPER I-Teaching and Research Aptitude
COURSE A
COURSE B
COURSE C
COURSE D
Rs. 8,300/YES YES
Rs. 7,300/YES -
Rs. 6,300/YES
Rs. 5,300/-
Page 16
20 Topic wise Unit Test papers covering the syllabus of PAPER II 20 Topic wise Unit Test papers covering the syllabus of PAPER III 12 Full length Mock Test Papers (including Paper I, Paper II and Paper III) on the NEW PATTERN of UGC NET Computer Science Solved Question Bank of 2 Previous available papers (June 10 & Dec 10) of UGC NET (including Paper I, Paper II and Paper III) No of SOLVED Papers Provided
YES YES YES YES 64 Around 3600 YES
No of SOLVED Questions Provided Hints and solutions will be provided with all test papers
NOTE: Students who are Interested for Paper III only, Please find the details below:
TABLE 2 : UGC NET (JUNE 2012)

COMPUTER SCIENCE - PAPER III Rs. 4,300/10 volumes of theory covering the syllabus of PAPER III 20 Topic wise Unit Test papers covering the syllabus of PAPER III
Page 17
6 Full length Mock Test Papers on the actual pattern of UGC NET Computer Science for Paper I, II & III SOLVED Question Bank of 2 Previous available papers (June 10 & Dec 10) of UGC NET for Paper I, II & III
Overall 28 Test Papers having around 1700 SOLVED Questions covering all aspects of UGC NET Computer Science
Hints and solutions will be provided with all test papers
NOTE: All prices include service tax.
For more information, please call us at 0744-2427711 or 9001297111 or email us at info@vpmclasses.com/ vpmclasses@yahoo.com / query@vpmclasses.com
HOW TO APPLY
Mode of Payment of fee: Option 1 - Demand Draft For the course you want to get enrolled with us, please prepare a Demand Draft (D.D.) of an amount equal to the fee mentioned against your course of interest. Please prepare the D.D. in favor of "VPM Classes" payable at any bank at Kota, Rajasthan.
Page 18
Items to send: 1) Duly filled application form. 2) D.D. for the course you wish to get enrolled in 3) Xerox copy of 10th, Bachelor degree & Master Degree (if applicable) mark sheets 4) 2 additional passport sized photographs 5) Your application / roll nos. of the various exams (IIT JAM / NET / GATE / TIFR / IISc etc.) you are appearing for (when applicable).
Please send the above items to: VPM Classes 1-C-8, Sheela Chowdhary Road, SFS, Talwandi, Kota, Rajasthan PIN - 324005. (Tel No.: 0744-2429714 or 09001297111 | E-mail: info@vpmclasses.com/ vpmclasses@yahoo.com / query@vpmclasses.com)
Option 2 : Direct Payment in VPM Classes Account
Please deposit the fee by cash/cheque in any of the 2 VPM Classes a/c nos. mentioned below:
Money can be transferred from ANY bank in India to the above account numbers using the following information: Details VPM CLASSES account no. RTGS/NEFT IFSC Code Branch Name
Punjab National Bank (PNB) 4148001800000019

PUNB0414800 PNB, Nagar Nigam
HDFC 18462560000284
HDFC0001846 HDFC, Talwandi Branch,
Page 19
branch, Kota, Rajasthan
Kota, Rajasthan
Please
scan
and
e-mail
the
following
items
to
vpmclasses@yahoo.com
info@vpmclasses.com . / query@vpmclasses.com)
1) The Deposit slip in the name of VPM Classes received from the bank, bearing amount, date, bank details (bank name, branch, and bank seal). 2) The completely filled VPM Classes Application form. 3) Your application / roll nos. of the various exams (IIT JAM / NET / GATE / TIFR / IISc etc.) you are appearing this year (when applicable). Your 1st dispatch will be sent within 3 working days of us receiving this e-mail with all the details.
( Note: In case of payment by cheque, the 1st dispatch will be subject to realization of the cheque).
Then please send the following items by speed post as well:
1) Duly filled application form. 2) Xerox of bank deposit slip. 3) Xerox copy of 10th, Bachelor degree & Master Degree (if applicable) mark sheets 4) 2 additional passport sized photographs
Please send the above items to: VPM Classes 1-C-8, Sheela Chowdhary Road, SFS, Talwandi, Kota, Rajasthan PIN - 324005. (Tel No.: 0744-2429714 or 09001297111 | E-mail: vpmclasses@yahoo.com/
Page 20
info@vpmclasses.com . / query@vpmclasses.com ). Ideally these documents should reach us within 1 week of making the deposit in the bank a/c. Please visit our website www.vpmclasses.com for more information. If there are any other questions, please feel free to send an e-mail or call us (Tel No.: 0744-2429714 or
09001297111).
Thanks & Best of Luck, VPM Classes
Page 21

VPM Classes - Sample Theory - New Pattern - Ugc Net Comp. Sci

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

VPM Classes - Sample Theory - New Pattern - Ugc Net Comp. Sci

Caricato da

Copyright:

Formati disponibili

CSIR UGC NET, GATE (ENGINEERING), GATE (Science), IIT-JAM, UGC NET, TIFR, IISc, NIMCET, JEST etc.

UGC NET - COMPUTER SCIENCE

Web Site www.vpmclasses.com E-mail-vpmclasses@yahoo.com

RELATIONAL DATABASE DESIGN

City Table:City Population

Example: ACTIVITY (StudentID, Activity, Fee)

Fixing Anomalies (Normalizing)

The above relations do not have any of the anomalies

If we know the VIN, then we know who is the Auto owner

If we know Student-ID (SID), then we can uniquely determine his/her Name

Normalization works through a series of stages called normal forms:

The highest level of normalization is not always desirable.

Basic Rule for Normalization

Conversion to First Normal Form

EMP _ NUM 103 101 105

Database Table 1. The Evergreen Data

A Dependency Diagram: First Normal Form

(c)) All attributes are dependent on the primary key.

Conversion to Third Normal Form

Summary of one conversion form to another

Hints & Solutions

UGC NET (JUNE 2012) COMPUTER SCIENCE

Rs. 8,300/YES YES

YES YES YES YES 64 Around 3600 YES

YES YES YES YES 54 Around 3500 YES

YES YES YES YES 64 Around 3600 YES

YES YES YES YES 54 Around 3500 YES

TABLE 2 : UGC NET (JUNE 2012)

NOTE: All prices include service tax.

Option 2 : Direct Payment in VPM Classes Account

Punjab National Bank (PNB) 4148001800000019

branch, Kota, Rajasthan

Then please send the following items by speed post as well:

Potrebbero piacerti anche