IGNOU BCA third semester, MCA second, PGDCA MCS 023 term-end exam notes, upcoming guess papers, important questions, questions papers, old/previous years term-end exam papers with solutions free download. IGNOU BCA/MCA all semester new revised (1st semester, 2nd semester, 3rd semester, 4th semester, 5th semester and 6th semester) solved assignments, term-end exam notes, study materials, important questions, books/blocks (June-December) free download.
IGNOU BCA third semester, MCA second, PGDCA MCS 023 Term-End Examination (INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS) term-end exam notes-upcoming guess papers-important questions-study materials download.
IGNOU BCA third semester, MCA second, PGDCA MCS 023 Term-End Examination (INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS) term-end exam notes-upcoming guess papers-important questions-study materials download.
MCS-023 term-end exam notes, upcoming guess papers, important questions, questions papers, old/previous years term-end exam papers (June 2014 to Dec. 2019) with solutions download.
|
S. No. |
Topic with Solution |
|
1. |
Basic Concepts |
|
2. |
Relational and E-R Models |
|
3. |
Database Integrity and Normalization |
|
4. |
File Organization in DBMS |
|
5. |
Transactions and Concurrency Management |
|
6. |
SQL |
|
7. |
Distributed Database |
|
8. |
Database Recovery and Security |
|
9. |
Old/Previous
papers with solutions (June 2014 to Dec. 2019) |
|
10 |
Guess Questions |
|
|
Notes -1
1. (a) What is a join in DBMS ? Explain three types of join with the help of an example for each.
(b) What is data independence ? Explain two types of data independence with the help of an example for each.
(c) What is DDL ? How it is different from DML ? Briefly explain guidelines for creation of table.
(d) Explain distributed transaction with the help of an example.
(e) What are integrity constraints ? Explain two types of integrity constraint with the help of an example.
(f) What is Functional Dependency (FD) ? Find the valid FD's in the following relation :
A B C
i 1 2
i 1 3
j 1 4
j 1 3
k 2 5
1 4 7
(g) Explain briefly advantages and disadvantages of Distributed Database Management Systems.
2. (a) Draw an ER diagram for the situation given below :
Library consists of many books in different subject areas where books are written by different authors and are published by different publishers. A book is published by only one publisher. There are inside - members and outside - members who gets books issued for their uses. The
issuing and return operation of the books are managed by the librarian.
(b) What is database recovery ? Explain with an example, how system log is used for database
recovery.
(c) Explain 3NF. Also justify the statement "BCNF is stronger than 3NF" with the help of an example.
3. (a) Explain ANSI SPARC 3 - Level Architecture of DBMS, with the details of languages associated at different levels and the type of data independence involved in between different levels.
(b) What is the need of Indexing in DBMS ? Explain the significance of primary Index with the help of an example.
(c) What is data redundancy in DBMS ? How data redundancies are removed ? Explain whether the following relation named student is in 2NF or not with proper justification.
STUDENT (Name, Course, Age, Sex)
4. (a) What is Data Fragmentation ? Explain differences between Horizontal Fragmentation and vertical Fragmentation with the help of suitable example of each.
(b) What are nested queries ? explain with the help of an example.
(c) Consider the following relations
STUDENT (Name, Roll_Number,
Teacher_ID, Programme, Semester, Subject)
DEPARTMENT (Dep_ID, Programme,Teacher_ID)
TEACHER(Teacher_ID,Dep_ID,Name, Subject)
Write the following queries using SQL :
(i) List name of all the teachers who belong to Dep_ID ='4' and take"Graph Theory", subject.
(ii) List names of all the students who study in Semester-II of BCA programme and are taught by Teacher_ID = '1'.
(iii) Find the name of all the teachers who teaches to the student whose ROLL Number ='101'.
(iv) Find the name of all the students who are in Is' semester of MCA programme and are taught by Prof. Ajay.
5. (a) A file has r = 10,000 Bank Account records of fixed length. Each record has the following fields :
Name (20 bytes), Account_No(8 bytes),address (40 bytes), Balance (15 bytes) and Branch- Code (5 bytes).
The file is stored on a disk with the following characteristics :
Block Size = 512 bytes, Inter Block Gap = 128 bytes, number of block per track = 15, Number of tracks per sector =300.
A disk pack consist of 15 double side disks.
(i) Calculate record size R in bytes.
(ii) Calculate the blocking factor (bfr) and the number of file blocks b, assuming an unspanned organization.
(iii) Calculate the average time it takes to find a record doing a linear search on the file , in which file blocks are not stored contiguously.
(iv) Assume that the file is ordered by"Branch-Code", calculate the time it takes to search for a record given its"Branch_Code", by using a binary search..
(b) Write short note on the following:
(i) Concurrency Control
(ii) Database Views
Notes-2
1. (a) Give the limitations of file based system.How can they be overcome using DBMS ?
(b) Discuss the 3-level architecture of DBMS.Explain how it leads to data independence.
(c) A bookshop has a huge collection of books to sell them online and therefore requires a database to track its sales. For each book they store the Title, Author(s) • name,Publisher, Volume, ISBN No., Price, Stock (no. of copies), Year of publication, etc. To help the customers to search the book, they require that each book is assigned to one or more categories such as Engineering,Sciences, Fiction, Literature, Applications,etc. If at all, any discounts that are there
for certain books, need to be notified on the site (best-buy offer). To buy a book, a customer needs to register on the site. Also it maintains the profile of the user and also their earlier purchases. The bookshop also sends "Newsletter" to all the registered users to update them about the publications.Identify the entities, relationships,constraints and cardinality and construct an ER diagram for the above mentioned specifications.
(d) Discuss briefly about Sparse and Dense Indexes with the help of an example.
(e) What is a view ? What are the major advantages of views ? Explain with the help of an example.
2. (a) Discuss the use of B-Tree as a structure for creating index, with the help of an example in support.
(b) Explain the Log-based recovery scheme with the help of an example.
(c) Explain 2-phase locking protocol.
3. (a) Consider the following relation EMP. Create queries for it :
empno ename job sal depno
116 NAND Manager 29,750 40
118 KAPOOR Analyst 30,000 10
119 HARISH President 50,000 20
112 ANAND Analyst 30,000 20
115 BOBBY Clerk 15,000 20
(i) Get details of employee having minimum salary (sal).
(ii) Display employee whose job title (job) is same as that of employee 116 and sal > sal of employee 118.
(iii) Find average sal.
(iv) Find the ename, depno, sal of employee drawing maximum sal.
(b) Explain the data models, used to structure the data in the database systems.
4. (a) Explain the need of Distributed DBMS over Centralized DBMS. Also give the structure of Distributed DBMS.
(b) List and explain the 4 basic properties of a Transaction with the help of appropriate examples.
5. Write short notes on the following :
(a) Locks
(b) Deadlock and its prevention
(c) Database Errors
(d) Data fragmentation in Distributed databases
IGNOU BCA/MCA MCS-023 Term-End Examination (INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS) term-end exam notes Download
Also
available:-
BCA
all semester new solved assignments Download
MCA all semester new solved assignments Download
MCA all semester new revised books/blocks, study
materials Download
BCA all semester term-end exam notes, important
questions, guess papers (june-december) Download
MCA all semester term-end exam notes, important
questions, guess papers (june-december) Download
BCA/MCA
asp.net project Download
