Master of Computer Application (MCA) Semester IV MC0076 ... · Spring 2012 Master of Computer...

12
Spring 2012 Master of Computer Application (MCA) Semester IV MC0076 Management Information Systems4 Credits (Book ID: B0901) Assignment Set 1 (60 Marks) Each question carries six marks 10 x 6 = 60. 1. What do you understand by Information processes data? 2. How do you retrieve information from manual system? . 3. What are the challenges of information management? 4. Explain the different components of MIS. 5. Mention different characteristics of MRS. 6. List down the Potential External Opportunities, potential internal Weaknesses. 7. What are the technology evaluation factors that need to be considered during ERP selection. 8. What are the common business exposures and risk of using internet by organization. 9. Explain with relevant example the concept of business process. Also mention their elements. 10. Explain the link between MIS and BPR.

Transcript of Master of Computer Application (MCA) Semester IV MC0076 ... · Spring 2012 Master of Computer...

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0076 – Management Information Systems– 4 Credits

(Book ID: B0901)

Assignment Set – 1 (60 Marks)

Each question carries six marks 10 x 6 = 60.

1. What do you understand by Information processes data?

2. How do you retrieve information from manual system? .

3. What are the challenges of information management?

4. Explain the different components of MIS.

5. Mention different characteristics of MRS.

6. List down the Potential External Opportunities, potential internal

Weaknesses.

7. What are the technology evaluation factors that need to be

considered during ERP selection.

8. What are the common business exposures and risk of using

internet by organization.

9. Explain with relevant example the concept of business process.

Also mention their elements.

10. Explain the link between MIS and BPR.

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0076 – Management Information Systems– 4 Credits

(Book ID: B0901)

Assignment Set – 2 (60 Marks)

Each question carries six marks 10 x 6 = 60.

1. Explain the needs for information in the following areas

a) Cost leadership b) Global corporation

c) ERP architecture d) Technology Evaluation Factor

2. How information is selected and organized?

3. Briefly explain components of MIS.

4. Explain with relevant examples the ascertaining the class of

information need for the business execution.

5. How do you define Management Reporting Systems?

6. Explain with relevant examples the concept of business process. Also

mention their elements.

7. What are the uses of Executive Information Systems?

8. Explain various Organizational limits to Relational Decision Making.

9. Explain different components of DSS.

10. Write a note on Ethical and Social issues with E-Commerce.

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0077 – Advanced Database Systems– 4 Credits (Book ID: B0882 )

Assignment Set – 1 (60 Marks)

Each Question carries 10 Marks 6 X 10 = 60

1. Describe the following: o Dimensional Model o Object Database Models o Post – Relational Database Models

2. Describe the following with respect to Database Management Systems:

o Information & Data Retrieval o Image Retrieval Systems o Multiple Media Information Retrieval Systems, MIRS

3. Describe the following:

o New Features in SQL3 o Query Optimization

4. Describe the following with suitable real time examples:

o Data Storage Methods o Data dredging

5. Describe the following with respect to Fuzzy querying to relational databases:

o Proposed Model o Meta knowledge o Implementation

6. Describe the Data Replication concepts

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0077 – Advanced Database Systems– 4 Credits (Book ID: B0882 )

Assignment Set – 2 (60 Marks) 1. Describe the following with suitable examples:

o Cost Estimation

o Measuring Index Selectivity

2. Describe the following with suitable examples:

o Graphic vs. Declarative Data Models

o Structural Semantic Data Model – SSM

3. Discuss the following:

o Query Processing in Object-Oriented Database Systems

o Query Processing Architecture

4. Describe the following:

o Data Mining Functions

o Data Mining Techniques

5. Describe the following:

o Statements and Transactions in a Distributed Database

o Heterogeneous Distributed Database Systems

6. Discuss the following with respect to Distributed Database Systems:

o Problem Areas of Distributed Databases

o Transaction Processing Framework

o Models of Failure

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0078 – Java Programming– 4 Credits (Book ID: B0831 & B0832 )

Assignment Set – 1 (60 Marks)

Each question carries 10 Marks 6 X 10 = 60

1. Discuss various features of Java and its applications.

2. Write a program to perform the basic arithmetic operations:

a) Addition

b) Subtraction

c) Multiplication

d) Division

Use 4 different methods for the above and invoke them as necessary from the main()

method.

3 Write an event driven program to perform the arithmetic operations as shown in the

interface below:

4. Write a complete JDBC based application where in the user supplies the following

table as input and the program should have the facilities of Adding, Modifying, Viewing

and Deleting the Records of the given table.

Stud_No Stud_Name Course Fees Duration

1 Abc MCA 200000 3 Years

5. Explain the process of implementing a CORBA client using a Java programming

example and the steps involved. 6. Write a program using iostreams to take as input two multi-dimensional arrays and print their sum as output (Matrix Addition) in Matrix format.

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0078 – Java Programming– 4 Credits (Book ID: B0831 & B0832 )

Assignment Set – 2 (60 Marks)

Each question carries 10 Marks 6 X 10 = 60

1. With the help of a simple program demonstrate the compilation and execution of Java Programs. 2. Write a complete program for each of the following:

Decision Making Statements

Looping Statements 3. Write a program to demonstrate the concept of various possible exceptions arising in a Java Program and the ways to handle them. 4. Write a program to show the various ways of creating and running threads in Java. 5. Write a simple program in Java to display a string message using Servlets. List out the steps involved in Compiling and Running Servlets. 6. Write a program in Java to demonstrate the complete life cycle of a Servlet.

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0079 – Computer Based Optimization Methods(Statistics \ Applied OR)– 4 Credits (Book ID: B0902)

Assignment Set – 1 (60 Marks)

Answer All Questions 6 X 10 = 60 Marks

1. Explain the structure of Mathematical model in OR.

2. Explain briefly the graphical method of analyzing a linear programming problem. Can a LPP

have unbounded solution?

3. Apply simplex procedure to solve the L.P.P. maximize z = 3x1 + 4x2 subject to 5x1 + 4x2

200; 3x1 + 5x2 150; 5x1 + 4x2 100; 8x1 + 4x2 80, x1 0, x2 0.

4. Solve the following transportation problem

Destination

A B C D

21 16 25 13 11

17 18 14 23 13

32 27 18 41 19

6 10 12 15 43

5. Explain Project Management (PERT).

6. Explain the use of finite queuing tables

Availability

Source I

II

III

Requirement

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0079 – Computer Based Optimization Methods(Statistics \ Applied OR)– 4 Credits (Book ID: B0902)

Assignment Set – 2 (60 Marks)

Answer All Questions 6 X 10 = 60 Marks

1. A furniture manufacturing company plans to make two products chairs and tables from

its available resources, which consists of 400 board feet of wood and 450 man-hours.

To make a chair it requires 5 board feed and 10 man-hours and yields a profit of Rs.45.

Each table uses 20 board feet and 15 man-hours and has a profit of R's.80. How

many chairs and tables, the company can make so that it gets maximum profit. (i)

Formulate the mathematical model; (ii) Solve this problem by graphical method.

2. Use Two-Phase method to solve the following L.P.P.

Maximize Z = 3x1 + 2x2+ 2x3

Subject to Constraints

5x1 + 7x2 + 4x3 7;

-4x1 + 7x2 + 5x3 -2;

3x1 + 4x2 -6x3 29/7.

x1 , x2, x3 0.

3. Solve the following transportation problem

To

From

4. A solicitor’s firm employs typists on hourly piece-rate basis for their daily work. There

are five typists and their charges and speed are different. According to an earlier

understanding, only one job is given to one typist and the typist is paid for a full hour

even when he works for a fraction of an hour. Find the least cost allocation for the

following data:

Typist

Rate/hour (Rs.)

Number of

PageTypist/ho

ur

Job No. of Pages

A 5 12 P 199

B 6 14 Q 175

C 3 8 R 145

D 4 10 S 298

E 4 11 T 178

5. Write down the basic difference between PERT and CPM.

6. Explain Erlang family of distributions of service times

9 12 9 6 9 10 5

7 3 7 7 5 5 6

6 5 9 11 3 11 2

6 8 11 2 2 10 9

4 4 6 2 4 2 22

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0080 – Analysis and design of algorithms– 4 Credits (Book ID: B0891)

Assignment Set – 1 (60 Marks) BKID: B0891 1. Describe the following:

o Well known Sorting Algorithms

o Divide and Conquer Techniques

2. Explain in your own words the different Asymptotic functions and notations. 3. Describe the following:

o Fibonacci Heaps o Binomial Heaps

4. Discuss the process of flow of Strassen’s Algorithm and also its limitations. 5. How do you formulize a greedy technique ? Discuss the different steps one by one? 6. Briefly explain the Prim’s algorithm.

Spring 2012

Master of Computer Application (MCA) – Semester IV

MC0080 – Analysis and design of algorithms– 4 Credits (Book ID: B0891)

Assignment Set – 2 (60 Marks)

BKID: B0891

1. Briefly explain the concept of Djikstra’s Algorithm. 2. Describe the following with suitable examples for each:

o Binary Search Trees o Red Black Trees

3. Define and explain a context free grammar. 4. Explain in your own words the concept of Turing machines. 5. Describe Matrix Chain Multiplication Algorithm using Dynamic Programming. 6. Show that the clique problem is a N.P. complete problem.