SESSION FEB/MAR 2022
PROGRAM Masters of COMPUTER APPLICATION (MCA)
SEMESTER- III
course CODE & NAME- DCA8142&OPEN SOURCE DB SYSTEMS
Assignment Set – 1
1 a. Explain the components of the database system.
Ans: Database Management System (DBMS) is a complex set of software programs that enables users to create and maintain a database. In this section, we discuss the types of software components that constitute a DBMS. The following fig 1 illustrates the typical DBMS components.
The figure is divided into two halves. The top half of the figure refers to the various users of the database environment and their
b. Explain ACID properties in transaction management.
Ans: The transaction is an operation that reads or writes a value on the database. Every transaction must adhere to four properties. Taking their initials letters collectively known as ACID properties. These properties are,
1. Atomicity: A Its Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
2 a. Briefly explain the various models of open-source software model.
Ans: The Open-Source Software (OSS) model is an alternate software engineering technique applied to modern commercial developmental models. The definite advantage of the Open- Source model is its expansion and
b. What is forking? Explain forking in brief.
Ans: ‘Forking’ is one of the main concepts in software development. Forking happens when developers take a copy of source code from one software package and start developing it independently. It creates a separate and distinct piece of the software. A successful fork code can reduce development
3. Explain relational model concepts and Relational algebra operations in detail.
Ans: The relational model is a data model. In the relational model, we can represent the database as a collection of relations. Relations are represented as tables. Each table consists of a set of values or records. The figure 1 shows an example of a relational model database.
In the given example,
Assignment Set – 2nd
4 a. Explain different data types used in PHP.
Ans: The most commonly used PHP data structures are Arrays, strings, Files, etc.
a) PHP Arrays
The array is a collection of similar types of data using the common name. In an array, each array value is accessed by index. There are mainly three types of arrays. These are given below:
• Numeric Array
b. Explain the SQL Language and its’ advance features.
Ans: This section describes how PostgreSQL is providing SQL support. As we know PostgreSQL is a relational database management system (RDBMS). This means that the data is stored in the form of Relations (tables). Usually in an RDBMS data is stored in the form of tables. There are
5 a. Define Indices. Explain different Index types.
Ans: Indices are a special type of database object. The use of Indices will greatly increase database performance and also it enables faster execution of statements involving comparative criteria. An index helps to find the targeted rows more efficiently by tracking the data on one or more columns in a table. In this section we are going to discuss the different types of indices available, and when we can
6. Explain different datatypes used in PHP. Also Explain the PHP control structures.
Ans: PHP Data Types
Variables can store data of different types, and different data types can do different things.
PHP supports the following data types:
- String
SESSION FEB/MARCH-2022
PROGRAM- MCA
SEMESTER- III
COURSE CODE NAME DCA7104 Analysis and Design of Algorithms
SET-I
Questions Mark
1. A. What are the properties of an algorithm? Explain branch and bound algorithm with an example.
Ans: Properties of algorithms
An algorithm may have zero or more inputs externally and it should produce one or more output. Also, an algorithm must terminate after a finite number of steps. Properties of the algorithm include:
• Correctness – It should provide correct and accurate output for all legitimate input.
• Definiteness – Each Its Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
B. What is the general plan to analyse the efficiency of recursive algorithms?
Ans: Analyzing efficiency of recursive algorithms Let us see the general plan for analyzing the efficiency of recursive algorithms. The steps are as follows:
1) Decide the size of the input based
2. Differentiate between bottom-up and top-down heap construction with example.
Ans:
Bottom-up heap construction
It initializes the essentially complete binary tree with n nodes by placing keys in the order given and then “heapifies” the tree as follows. Starting with the last parental node and ending with the root, the algorithm checks whether the parental
3. A. How is Divide and Conquer a better method for sorting?
Ans: Insertion sort is a simple algorithm that implements the decrease and conquers methodology. Insertion sort executes in O(n2) time, but it’s about twice as fast as the bubble sort and somewhat faster than the selection sort in norm
SET-II
Questions Mark
4. A. Explain distribution counting with an example.
Ans: Distribution counting is an input enhancement method wherein a separate array is used to store the information generated during the sorting process and these arrays enhance the sorting process. Horspool’s and Boyer-Moore algorithms are string matching algorithms where in the pattern is compared with the text
B. Explain the algorithm to solve the Knapsack problem using the dynamic programming method.
Ans: Given a knapsack with following:
M-capacity of the knapsack
n-number of ojects
w- an array consisting of weights w1,w2…wn
p- an array consisting of
5. Explain the dynamic programming approach to find binomial coefficients
Ans: Let us use dynamic programming approach to solve this problem. Let a1, a2…an be the distinct elements given in ascending order and let p1, p2…pn be the probabilities of searching the elements. Let c[i,j] be the smallest average number of comparisons made in a binary search tree elements ai….aj,
6. A. Describe greedy choice property.
Ans: Greedy Choice Property
o In greedy algorithms a globally optimal solution is arrived by making a locally optimal (greedy) choice. That is to say when considering which choice to make, the choice that looks best in the current problem, without
B. Explain the sorting problem with the help of a decision tree
Ans: Decision tree means to represent a program in the form of tree with branches. Here each node represents a decision. First the root node is tested and then the control is passed to one of its subtrees, depending on the result of the test. This flow is continued till the leaf node with the element of interest is reach
PROGRAM MASTER OF COMPUTER APPLICATION (MCA)
SEMESTER III
COURSE CODE & NAME DCA8143 – CRYPTOGRAPHY AND NETWORK SECURITY
Assignment Set – 1
1. Discuss the five X.800 security services.
Ans: X.800 divides security services into five categories. They are:
1. Authentication
2. Access control
3. Data confidentiality
4. Data Integrity
5. Non-repudiationIts Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
2. What is Symmetric-key cryptography? Explain the following substitution techniques:
(a) Caesar cipher
(b) Playfair
(c) Polyalphabetic ciphers
Ans: The sender and receiver share the same key in the symmetric-key cryptography encryption method. A single key is used for both encryption and decryption. The sender uses the key (or some set of rules) to encrypt the plaintext and sends this ciphertext to the receiver. The receiver uses the same key (or group of rules
3. Discuss the Data Encryption Standard (DES) algorithm and its strength in detail along with avalanche effect.
Ans: Data Encryption Standard (DES) was the main encryption scheme that was used until recently. The National Bureau of Standards, now called the National Institute of Standards and Technology (NIST), adopted this standard. Since DES is now considered to be insecure for many applications, it has been replaced
Assignment Set – 2
4. Discuss the RSA algorithm by taking a suitable example
Ans: RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described the algorithm in 1977. The letters RSA are the initials of their surnames. RSA is one of the first practicable public-key cryptosystems and is widely used for securing data transmission. In this type of cryptosystem, the
5. What do you mean by digital signature? What is the difference between a digital certificate and a digital signature? Explain.
Another important application is the digital signature. Here the hash value of a message is encrypted with a user’s private key. Anyone who knows the user’s public key can verify the integrity of the message that is associated with
6. Write detailed notes on:
a) Internet Protocol Security (IPsec)
IPsec (Internet Protocol Security) is a suite of protocols and algorithms for securing data transmitted over the internet or any public network. The Internet Engineering Task Force, or IETF, developed the IPsec protocols in the mid-1990s to provide security at the IP layer through authentication and encryption of IP
PROGRAM MASTERS OF COMPUTER APPLICATION (MCA)
SEMESTER III
COURSE CODE & NAME DCA7103 & ADVANCED SOFTWARE ENGINEERING
Assignment Set – 1
1. a. What is software engineering? Explain principles of software engineering.
Ans: Software engineering is the application of principles used in the field of engineering, which usually deals with physical systems, to the design, development, testing, deployment and management of software systems.
Alan Davis (1994) is one of the earlier authorities to bring forward a set of principles of software engineeri
Its Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
2. a. Explain software process, project, and product in detail.
Ans: The following points are noted about software processes:
• Processes use resources subject to given constraints and produce intermediate and final products.
• Processes are
3. Briefly explain all models of the Software Life-Cycle Model.
Ans: Prototyping Model In prototyping model, the requirement gathering is done initially. Developer and customer define overall objectives, identify areas which needs more requirement gathering. Then a quick design is prepared. This quick design represents what will be input by user and the output
Assignment Set – 2
4. a. Describe the three phases of an object-oriented design process.
Ans:
The Object Oriented Design Using Unified Approach
In the OOAD design approach as shown in figure, we have three phases.
The first phase deals with the designing of classes and applying the design axioms to it. Here we have to create the UML diagrams, define class associations and hierarchy.
In the second phase, we have to create the mirror classes for access layer corresponding to every class created in the first phase. We have to eliminate the redundant classes and use method classes to refine the class structure.
5. a. Explain the software reengineering process model.
Ans: To implement these principles, we apply software reengineering process model that defines six activities, shown in Figure. In some cases, these activities occur in a linear sequence, but this is not always the case. For e.g., it may be that reverse engineering may have to occur before document restructuring can
b. Describe the software quality assurance.
Ans: Software quality assurance is defined as a planned and systematic approach to the evaluation of the quality and adherence to software product standards, processes and procedures. SQA includes the process of assuring that standards and procedures are established and are followed throughout the software
6. Explain different types of software testing.
Ans: Types of Testing:-
1. Unit Testing
It focuses on the smallest unit of software design. In this, we test an individual unit or group of interrelated units. It is often done by the programmer by using sample input and observing its corresponding outputs.
Example:
a) In a program we
DCA7102 – PROGRAMMING IN JAVA
PROGRAM MCA (SEMESTER III)
Assignment Set – 1
1. a. Discuss the architecture of Java with the help of suitable diagram. Explain their entire technicality in detail.
Ans:
Architecture of JavaFX API
In JavaFX, the GUI Applications were coded using a Scene Graph. A Scene Graph is the starting point of the construction of the GUI Application. It holds the (GUI) application primitives that are termed as nodes.
A node is a visual/graphical object and it may include −
• Geometrical (Graphical) objects − (2D and 3D) such as circle, rectangle, polygon, etc.
• UI controls − such as Button, Checkbox, Choice box, Text Area, etc.
• Containers − (layout panes)
Its Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
b. What is Unicode? Explain. Discuss the various data types available in java programming in detail.
Ans: UNICODE. Universal Character Encoding. UNICODE. Unique, Universal, and Uniform character enCoding.
Data Types in Java
Data types
2. a. Explain the various utilities of ‘super’ keyword in context to inheritance? Explain each utility with the help of java program.
Ans: The super keyword in Java is a reference variable which is used to refer immediate parent class object.
Whenever you create the instance of subclass, an instance of parent class is created implicitly which is referred
b. How java handles exceptions? Discuss the utility of ‘try’ and multiple ‘catch’ statement with the help of java program.
Ans: The term exception in Java means the occurrence of an exceptional event. It is defined as an abnormality that occurs while the program is in execution which hinders the successful execution of the program, which means the way the program is meant to produce the result it doesn’t do so
3. What are streams in java? Discuss their various types. Explain at least 5 pre-defined methods and their functionality used through stream classes.
Ans: Java handles all input and output in the form of streams. A stream is a sequence of bytes traveling from a source to a destination over a communication path. If a program writes into a stream, it is the
Assignment Set – 2
1. a. Explain the collection hierarchy with the help of diagram.
The comprehensive collection framework hierarchy comprises four fundamental interfaces: Collection, List, Set, Map, and two specific interfaces for sorting called SortedSet and SortedMap. The Java.util package contains all of the collection framework’s interfaces and classes.
b. Discuss java annotation, and java custom annotation in detail with the help of java example.
Ans: Java annotations are used to provide meta data for Java code. Being meta data, Java annotations do not directly affect the execution of the code, although some types of annotations can actually be used for that
2. a. Discuss any 5 component classes of swing. Demonstrate a program which shows their utility.
Ans: 1. ImageIcon
The ImageIcon component creates an icon sized-image from an image residing at the source URL.
Example:
b. What is multithreading? Discuss its life cycle with the help of suitable diagram.
Ans: Java supports multithreaded programming, which allows you to write programs to meet the real-world requirement for creating interactive as well as networked programs. Java supports multithreading which is not
3. How Java Server Pages can be created? Discuss all the steps involved along with suitable java example.
Ans: Java Server pages are on the whole, text files that combine standard HTML and new scripting tags. JSPs look like HTML, but they get compiled into Java Servlets the first time they are invoked. The resulting servlet is a combination of the HTML from the JSP file and embedded dynamic
PROGRAM MCA
SEMESTER III
COURSE CODE & NAME DCA7101 – PROBABILITY AND STATISTICS
SET-I
1. Bag I contain 3 red and 4 black balls and Bag II contain 4 red and 5 black balls. One ball is transferred from Bag I to Bag II and then a ball is drawn from Bag II. The ball so drawn is found to be red. Find the probability that the transferred ball is black.
Solution: Step -1: Consider all possible events for transferring balls.
Given that,
Bag I contains 3 red and 4 black balls.
Bag II contains 4 red and 5 black balls.
Let E1, E2, E3, E, be
Its Half solved only
Buy Complete from our online store
MUJ Fully solved assignment available for session Feb/March 2022,
Lowest price guarantee with quality.
Charges INR 200 only per assignment. For more information you can get via mail or Whats app also
Mail id is aapkieducation@gmail.com
Our website www.smuassignment.in
After mail, we will reply you instant or maximum
1 hour.
Otherwise you can also contact on our
whatsapp no 8791490301.
2. A random variable has the following probability distribution
X | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
P(X=x) | 0 | a | 2a | 2a | 3a | a^2 | 2a^2 | 7a^2 + a |
Find (i) the value of ‘a’
(ii) P [1.5<X<4.5/ X>2]
(iii) E(X)
Solution: (i) Sum of all probabilities must be equal to 1
So we get a+2a+2a+3a+a^2+2a^2+7a^2 +a =1
⇒10a^2 + 9a =1
⇒a = −1,
3. The daily earning of a vendor for a period of 43 days are given below
Daily earning (Rs.) | 118- 126 | 127- 135 | 136- 144 | 145- 153 | 154- 162 | 163- 171 | 172- 180 |
No. of days | 3 | 8 | 9 | 12 | 5 | 4 | 2 |
Calculate Standard Deviation and coefficient of variation.
Solution:
SET-II
4. Suppose that a manufactured product has 2 defects per unit of product inspected. Using Poisson’s distribution, calculate the probabilities of finding a product without any defect, 3 defects, and 4 defects. (Given)
Solution:
Given:
A manufactured product has 2 defects per unit of product inspected
To find:
The probabilities of finding a product with
- out any defect
- 3 defects
5. Compute the regression equation of Y on X and regression equation of X on Y on the basis of the following information
X | Y | |
Mean | 40 | 45 |
Standard Deviation | 10 | 9 |
The correlation coefficient between X and Y is 0.50. Also estimate the value of Y for X = 48, using the appropriate regression equation.
Answer:
Given that,
6. The following data relate to the prices and quantities of 4 commodities in the years 1982 and 1983. Construct the following index numbers of price for the year 1983 by using 1982 as base year.
(i) Laspeyre’s Index
(ii) Paasche’s Index
(iii) Fisher’s Index
Commodit Y | 1982 | 1983 | ||||
Price | Quantity | Price | Quantity | |||
A | 5 | 100 | 6 | 150 | ||
B | 4 | 80 | 5 | 100 | ||
C | 2.5 | 60 | 5 | 72 | ||
D | 12 | 30 | 9 | 33 | ||
Solution:
Commodit Y | 1982 | 1983 | P1q0 | P0q0 | P1q1 | P0q1 | ||
Price(P0) | Quantity(Q0) | Price(P1) | Quantity(Q1) | |||||
A | 5 | 100 | 6 | 150 | 600 | 500 | 900 | 750 |
B | 4 | 80 | 5 | 100 | 400 | 320 | 500 | 400 |
C | 2.5 | 60 | 5 | 72 | 300 | 150 | 360 | 180 |
SESSION | Feb/March-2022 |
PROGRAM | MCA |
SEMESTER | III |
course CODE & NAME | DCA7104Analysis and Design of Algorithms |
CREDITS | 4 |
nUMBER OF ASSIGNMENTS & Marks | 02 &30 Marks each |
Note:
- There will be two sets of assignments for every course and all questions are compulsory in both sets.
- Average of both assignments’ marks scored will be considered as Internal Assessment Marks.
- Answers for 10 marks questions should be approximately of 400-500 words.
Set-I | ||||
Q.No | Questions | Marks | Total Marks | |
1. | What are the properties of an algorithm? Explain branch and bound algorithm with an example. | 5 | 10 | |
What is the general plan to analyse the efficiency of recursive algorithms? | 5 | |||
2. | Differentiate between bottom-up and top-down heap construction with example. | 10 | 10 | |
3. | How is Divide and Conquer a better method for sorting? | 5 | 10 | |
What are the best, worst and average cases in an insertion sort? | 5 | |||
Set-II | ||||
Q.No | Questions | Marks | Total Marks | |
4. | A. | Explain distribution counting with an example. | 5 | 10 |
B. | Explain the algorithm to solve the Knapsack problem using the dynamic programming method. | 5 | ||
5. | Explain the dynamic programming approach to find binomial coefficients | 10 | 10 | |
6. | A. | Describe greedy choice property. | 5 | 10 |