Skip to main content

MCA312- ADVANCED DATABASE MANAGEMENT SYSTEM


For Assignment Solution Contact
Niraj kumar
Call and whatsapp 
(9899682018)
Mail:-Nirajkumar294@gmail.com 


ASSIGNMENT

DRIVE
SPRING 2019
PROGRAM
MASTER OF COMPUTER APPLICATION
SEMESTER
III
SUBJECT CODE & NAME
MCA312- ADVANCED DATABASE MANAGEMENT SYSTEM
BK ID
B1649
NUMBER OF ASSIGNMNETS,
CREDITS & MARKS
2, 4 CREDITS, 30 MARKS EACH

Note –The Assignment is divided into 2 sets. You have to answer all questions in both sets. Average of both assignments score scored by you will be considered as your IA score. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.


Q.No
Assignment Set -1
Questions
Marks
Total
Marks
1
Differentiate between Two-Tier client/server databases and Multi-tier client/server databases.
5+5
10
2
Describe the most important classes of parallel machines.
10
10
3
Differentiate between Serialisability and Recoverability.
10
10




Q.No
Assignment Set -2
Questions
Marks
Total
Marks
1
What are the major design issues of parallel system?
4+6
10
2
Differentiate between homogeneous and heterogeneous
Database.
10
10
3
What are the storage methods in ORDBMS? Briefly
describe.
10
10











Comments

Popular posts from this blog

MCA212 – ADVANCED DATA STRUCTURE BK ID B1476

ASSIGNMENT   DRIVE SPRING- 2018 PROGRAM MASTER OF COMPUTER APPLICATION SEMESTER II SUBJECT CODE & NAME MCA212 – ADVANCED DATA STRUCTURE BK ID B1476 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits, and 30 marks each    ASSIGNMENT SET -1 Q.1. List and explain any Five types of graph.                                      10 Answer: - There are various types of graphs depending upon the number of vertices, number of edges, interconnectivity, and their overall structure. We will discuss only a certain few important types of graphs in this chapter. Null Graph A graph having no edges is called a Null Graph. Example (9899682018 What’s App and call) YOU CAN CONTACT US 10 A.M TO 8 P.M CHARGES – ASSIGNMENTS PER SEM 600, PER PAPER 150
should be approximately of 400 words. Each question is followed by evaluation scheme. Q.No Assignment Set -1 Questions Marks Total Marks 1 List and explain any Five types of graph. [5*2] 10 2 Explain 1. Fixed block storage allocation. 2. Variable block storage allocation [5+5] 10 3 What is the use of external Storage Devices? Explain any two external storage devices [4+3+3] 10 Q.No Assignment Set -2 Questions Marks Total Marks 1 Define algorithm and write a note on Complexity and Time- Space Tradeoff with example [2+4+4] 10 2 Define Queue and explain a. Array implementation of queue b. Linked list implementation of queue [2+4+4] 10 3 List the Advantages and Disadvantages of Linear and linked representation of tree. [5+5] 10

MCA315- Advanced Computer Networks

  For Assignment Solution Contact Niraj kumar Call and whatsapp  (9899682018) Mail:-Nirajkumar294@gmail.com   ASSIGNMENT Drive Spring 2019 PROGRAM Master of Computer Application SEMESTER III SUBJECT CODE & NAME MCA315- Advanced Computer Networks BK ID B1650 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits, 30 marks Each Note – The Assignment is divided into 2 sets. You have to answer all questions in both sets. Average of both assignments score scored by you will be considered as your IA score. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme. Q.No Assignment Set -1 Questions Marks Total Marks 1 Describe OSI Model. List and explain its seven layers. 3+7 10 2 Describe about DWDM. Explain the components of a basi...