google-site-verification: google1d0d38b2a769d149.html IGNOU/GTU/GU Dotcom Books: Assignment July - 2016 & January - 2017 MCS-023 Introduction to Database Management Systems

Sunday, 4 September 2016

Assignment July - 2016 & January - 2017 MCS-023 Introduction to Database Management Systems

MCS-023

1.     List and describe briefly all the possible applications of a database management system in any IGNOU’s Regional Centre? (15 Marks)

2.     Identify all the associated entities for a Regional Centre Management System, their corresponding attributes, relationships and cardinality and design an Entity-Relationship (ER) diagram for it. (20 Marks)

3.     Consider the E-R diagram of Question 2 and design the tables. Perform and show the Normalization till the required normal form. Implement the database using MS-Access and submit the screenshots along with your assignment response for this question. (20 Marks)

4.     Consider a “Library Management System” which has the following tables:
        Book(isbn_no, book_title, author1, author2, author3, publisher, edition, year_of_copyright, cost)
        Book_Accession(accession_no, isbn_no, date_of_purchase) Member(m_id, m_name, m_address, m_phone) Issue_return (accession_no, m_id, expected_date_of_return, actual_date_of_return) Please note that a member can be issued a book for a period of 15 days. The actual_date_of_return is kept blank for the books that have not been returned. Write and run the following SQL queries on the tables:

        (i)    Find the m_id and m_name of the members who have got maximum number of un_returned books.
        (ii)   List the book details whose year_of_copyright is 2014.
        (iii)  Find the names of all those students who have got all the books issued to him of the author named “ABC” .
        (iv)  Find the books whose cost is less than Rs.500/- and date_of_purchase is 2014.
        (v)   Find those members who have not got any book issued to him/her during last six months.

        Note: Make suitable assumptions, if any.

5.     Consider the Relation R={A, B, C, D, E, F, G, H } and the set of functional dependencies.

        A→C              B→CG                   AD→EH                C→DF                   A→H

        What is the key for R? Decompose R into 2NF, 3NF and finally in BCNF relation.




 *****************************************************************
Note: Answer with Dotcom Books
www.dotcombooks4u.com
(Last 5 year solved question paper with Assignment solutions)
 ****************************************************************












No comments:

Post a Comment