This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

Editors' Picks Books

Hand-picked favorites from

our editors

our editors

Editors' Picks Audiobooks

Hand-picked favorites from

our editors

our editors

Editors' Picks Comics

Hand-picked favorites from

our editors

our editors

Editors' Picks Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

)

(5th SEMESTER)

ASSIGNMENTS 2009

(MCS-051, MCS-052, MCS-053, MCSL-054, MCSE-003, MCSE-004, MCSE-011)

SCHOOL OF COMPUTER AND INFORMATION SCIENCES INDIRA GANDHI NATIONAL OPEN UNIVERSITY MAIDAN GARHI, NEW DELHI – 110068

CONTENTS

Course Code Assignment No. Maximum Marks 100 100 100 100 100 100 100 Page No.

MCS-051 MCS-052 MCS-053 MCSL-054 MCSE-003 MCSE-004 MCSE-011

MCA(5)/051/Assign/09 MCA(5)/052/Assign/09 MCA(5)/053/Assign/09 MCA(5)/054/Assign/09 MCA(5)/E003/Assign/09 MCA(5)/E004/Assign/09 MCA(5)/E011/Assign/09

3 4 5 7 9 12 14

**Important Notes Important Notes
**

1.1. 2.2. Viva-voce worth 20 Marks is compulsory for each Viva-voce worth 20 Marks is compulsory for each course.

submission of the assignments.

course.

Please follow guidelines given in the MCA Programme Guide for solving, solving, presentation Please follow thethe guidelines given in the MCA Programme Guide forpresentation format and format and submission of the assignment.

Course Code

:

MCS-051

2

Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : :

**Advanced Internet Technologies
**

MCA(5)/051/Assign/09

100 25% 15th April, 2009 (for January session) 15th October, 2009 (for July session)

There are eight questions in this assignment. Each question carries 10 marks. Rest 20 marks are for viva-voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

Q1: Write a program using Servlet and JDBC for developing an online submission of an examination form. You are required to create a database comprising of the following fields:I. Student Name II. Enrollment No. III. Course Code (s) IV. Regional Center Code V. E-mail Id Q2: Create a table of a medal tally of the Olympic Games as an XML document. The table must have the name of the country, No. of Gold medals, No. of Silver medals, and bronze medals and its total numbers. Q3: Using Servlet, JSP, JDBC and XML create a web application for a courrier company to provide online help in tracking the delivery status of items. Q4: Write a JSP program which displays a webpage containing arrival of new items within a particular month in the different branches of a retail company. Q5: What does an EJB consists of? Explain in brief about its components. Q6: Make a comparison between JSP and ASP in terms of cost, language to web pages, OS platform, supported Web server, supported database, component supported and learning curve. Also discuss pros and cons. Q7: How do you write SSL Client? Take example of SSL Socket Client. Q8: With the help of a sample code describe the use of SSL Authentication of Java clients.

Course Code

:

MCS-052

3

Course Title Assignment Number Maximum Marks Weightage Last Dates of Submission

: : : : :

**Principles of Management and Information Systems
**

MCA(5)/052/Assign/09

100 25% 15th April, 2009 (for January session) 15th October, 2009 (for July session)

This assignment has seven questions. Answer all questions. Each question is of 10 marks except Q(4) which is of 20 marks. Rest 20 marks are for viva voce. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation. Answer to each part of the question should be confined to about 300 words.

Q1: What is Portfolio management? What are the various methods used to create and balance the portfolio from highly strategic to tactical? How do you calculate the expected commercial value of the project? Q2: (a) (b) Q3: Identify new technological trends and its impacts. Also discuss the ethical issues related to technologies advancement. Q4: Make a visit to any organization (Bank, LIC, Municipal Corporation etc) and discuss the following: (i) Draw the organizational structure and identify the reasons for such structure and its shortcomings. (ii) Identify any five business functions and unique characteristics of such organizational structure. (iii) Identify the roles Played by different levels of management in that organization. (iv) How the human information system is maintained in this organization ? Q5: How do conventional application package and ERP differ? How to ensure that the ERP implementation should not fail? Q6: Explain some of the security threats to information systems particularly in a banking system? How does encryption ensure data security? Q7: What are the features of transaction processing system? What are the different types of transaction processing and its major functions and sub-functions? Show the various stages in data warehousing and business analytics and also explain it in brief. What are the important metrics of business performance management?

4

Course Code Course Title Assignment Number Maximum Marks Weightage Last Dates of Submission

: : : : : :

**MCS-053 Computer Graphics and Multimedia
**

MCA(5)/053/ Assign /09

100 25% 15th April, 2009 (for January session) 15th October, 2009 (for July session)

There are four questions in this assignment. Answer all the questions. 20 Marks are for viva-voce. You may use illustrations and diagrams to enhance explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

Q1: a) Explain the following terms in the context of Computer Graphics: (i) Raster Scan (ii) Frame Buffer (iii) Bit planes (iv) Graphics Tablet (v) CAD Applications (5 marks)

b) c)

Digitise a line with endpoints (0, 1) and (11, 16) using (i) DDA algorithm and (ii) Bresenham Algorithm. Which of two lines is of better quality? Explain your answer. (5 Marks) A clipping window ABCD has the coordinates - A(10,10), B(110, 10), C(110, 110) and D(10, 110). Consider the following line segments: EF with endpoints (25, 75) and (90, 100); GH with endpoints (125, 35) and (110, 120); and IJ with endpoints (50,50) and (120,120). Use the Sutherland-Cohen clipping Algorithm to find the visible portions of the three line segments in the clipping window. (5 Marks) Explain the following two algorithms with the help of an example each: i) Scan line polygon fill algorithm ii) Sutherland – Hodgman Algorithm for polygon clipping (5 Marks)

d)

Q2: a) Assume that a triangle ABC has the coordinates A(0, 0), B(3,2), C(1,1). Find the transformed coordinates when the triangle ABC is subjected to the anticlockwise rotation of 45° about the origin. You should represent the transformation using Homogeneous Coordinate System. (5 Marks) b) A polygon has 4 vertices located at A (0, 0) B (5, 10), C (15, 10), D (10, 0). Illustrate the effect of (i) x-shear and (b) y-shear on the given polygon. You may assume the shear factor a = 3 and b = 4 (5 Marks) Explain the transformation for Isometric projection with the help of an example. Obtain the Isometric projection of cuboid that is lying on the origin and have the size 15×12×9. (5 Marks)

c)

5

d)

Explain the properties of the Perspective Projections. Also explain the concept of a vanishing point in this context. Obtain a transformation matrix for the perspective projection for a given object projected onto x=4 plane as viewed from coordinates (8,0,0). (5 Marks)

Q3: a) Explain the use of Bezier Curves with the help of an example. Draw a Bezier curve having the control points as P1 (0, 0), P2 (5, 10), P3 (30, 9), P4 (40, 10). Calculate the coordinates of the points on the curve corresponding to the parameter t = 0.2, 0.4, 0.6. Draw a rough sketch of the curve and show coordinates of various points on it? (5 Marks) Define the concept of the visible-surface detection. Explain z-buffer method along with the algorithm for the visible-surface detection with the help of an example. List the advantages and disadvantages of this method. (5 Marks) Explain the following terms in the context of computer Graphics using suitable diagram and /or mathematical equations. (6 Marks) (i) Illumination model and its classification (ii) Specular Reflection (iii) Ray tracing and Find the equation of plane that passes through point P(0,0,0) and the normal to plane is given by N (2,0,-1) (4 Marks) Q4: a) b) Explain the steps required to design an animation sequence. How many key frames will be needed to create a 2 minute film sequence with no duplication? (3 Marks) How can you simulate positive acceleration in animation scenes? Graphically discuss the mathematical function used to produce positive acceleration in any animation? Suggest a possible application of positive acceleration animation simulation. (3 Marks) Explain the following terms with the help of an example: (i) Morphing (ii) Cel Animation (iii) Features of an animation software (iv) Use of animation in Forensics (4 Marks)

b)

c)

d)

c)

d)

Explain the following terms in the context of Multimedia giving one example wherever applicable/ needed. (10 Marks) (i) Hypermedia (ii) The three types of links used in Hypermedia (iii) Vector Graphics (v) GIF file compression (vi) Digital sound creation (vii) Lossy Audio formats (viii) Variables in digital video (ix) Features of Authoring tools (x) Features of 3-D modelling tools

6

Course Code Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : : :

MCSL-054 Laboratory Course MCA(5)/054/Assign/09 100 25% 30th April, 2009 (for January session) 31st October, 2009 (for July session)

This assignment has two parts A and B (Advanced Internet Technologies and Computer Graphics & Multimedia) and each part is for 20 marks. Answer all the questions. Lab record for all the respective sessions (given in the MCSL-054 Lab Manual) for each course carries 20 Marks each. Rest 20 marks are for viva voce. Please go through the guidelines regarding assignments given in the MCA Programme Guide for the format of presentation. If any assumptions made, please state them.

PART-I: MCS-051 (Advanced Internet Technologies) Q1: Develop a web page using Servlet for session tracking which ask for your name and address and print a message of welcome along with the number of times you have visited the page. If you are visiting the page first time the message “ Welcome! For the first visit” to be displayed on the page. (5 Marks) Q2: Write a JSP Program, which displays a web page containing two web links. When one click on Link for getting current date and time it goes to a JSP page which display current date and time and by clicking on link for schedule of your practical sessions of MCSL 54 another JSP page will open to show the schedule. (5 Marks) Q3: Write a program using JDBC and JSP to display the names and addresses of all those MCA students at your study centre who have completed/submitted their theory assignments of all the courses of IV Semester. (5 Marks) Q4: Create an XML document for catalogue of Computer Science Book in a Library. PART-II: MCS-053 (Computer Graphics and Multimedia) Q1: Write a program in C/C++ using OpenGL to draw a triangle of green colour on a background of yellow colour. (5 Marks) Q2: (5 Marks)

7

Write a program in C or C++ to implement Scan-Line Polygon Filling Algorithm.

(5 Marks)

Q3: Write a program in C/C++ using OpenGL to draw a hard wire house as shown in figure given below. Use basic primitives of openGL. (5 Marks)

120 40

40 Figure: House Q4:

100

Write a program in C/C++ to implement Cohen-Sutherland line clipping algorithm. In this implementation, consider two cases of a line: totally visible, totally invisible, against the rectangular clipping window. (5 Marks)

8

Course Code Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : : :

MCSE-003 Artificial Intelligence and Knowledge Management MCS(5)/E003/Assign/09 100 25% 30th April, 2009 (for January session) 31st October, 2009 (for July session)

This assignment has ten questions in all and carries 80 marks. The rest of the 20 marks are for viva-voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

Q1: Discuss state space representation for the following well-known problems: (i) (ii) (iii) Q2: Describe what ‘Physical Symbol System Hypothesis’ is. Further, critically examine its validity, relevance and significance. (7 Marks) Q3: Evaluate the following: (i) (ii) (iii) (iv) Q4: (setq X ’(B C)) (defun foo (x) (setq x (+ x 7)) (+ x 5)) (mapcar #’not (nil nil t nil t)) (reverse ’((a b c) d e)) Travelling Salesman Problem Water-Jug Problem Human Cannibal River-Crossing Problem.

(12 Marks)

(4 Marks) (15 Marks)

Consider the two-player game described below:

A

B

1 2 3 4 The Figure given above shows the starting position of the game involving two players, say A and B. Player A moves first. The two players take turns moving, and each player must move his token to an open adjacent space in either direction. If the opponent occupies an adjacent space, then a player may jump over the

9

opponent to the next open space, if any. (For example, if A is on 3 and B is on 2, then A may move back to 1.) The game ends when one player reaches the opposite end of the board. If player A reaches space 4 first, then the value of thegame to A is +1; if player B reaches space 1 first, then the value of the game to A is –1. a. Draw the complete game tree, using the following conventions: • • • Write each state as (sA, sB) where sA and sB denote the token locations. Put each terminal state in a square boxes and write its game value in a circle. Put loop states (states that already appear on the path to the root) in double square boxes. Since it is not clear how to assign values to loop states, annotate each with a “?” in a circle.

b. c. Q5:

Now, mark each node with its backed-up minimax value (also in a circle). Explain how you handled the “?” value and why. This 4-square game can be generalised to n squares for any n > 2. Prove that A wins if n is even and loses if n is odd.

For each of the following statements, state whether it is true or false: (10 marks) (i) A problem in artificial intelligence (AI) is one which is so complex that it can not be solved using normal algorithm. (ii) Exhaustive search is an important tool for solving problems in AI. (iii) The understanding of the world around us, to the computer is almost as good as that of an average human being. (iv) Knowledge plays very important role in solving AI problem. (v) FORTRAN is an important AI language, i.e., a language convenient to code the solutions for AI problems. (vi) The value of the LISP expression (member ‘c’(a c d)) is (c d). (vii) In LISP, the expression (Cons ‘a ’(b c)) returns the list (a (b c)) (viii) Three major components of an expert system are (i) the knowledge of the concerned domain elicited from domain experts, (ii) inference mechanism/engine, and (iii) the explanation subsystem. (ix) In the initial stages of backward reasoning mode, reasoning starts with the goal and rules are selected if they have the goal in their right hand. (x) The Modus Ponens rule of inference states: If each of P → Q and P is true then Q is also true. Q6: Write a LISP function that converts temperature in Centigrade to equivalent temperature in Fahrenheit. (3 Marks) Q7: (a) (b) Discuss briefly limitations of an Expert System. Give Frame-Based Representation for the following facts: Zakir is a 52-year-old Professor of Mathematics in Delhi University. The name of his wife, son and daughter are respectively Sakina, Yusuf and Jamila.

10

(c)

Give Semantic Net representation (instead of Frame-based representation) of the facts given in part (b) of this question. (9 Marks)

Q8: Explain each of the following w.r.t. the discipline of AI: (i) Learning (ii) Understanding (iii) The Turing Test (iv) Uncertainty (v) AI problem (vi) Combinatorial explosion Q9: (a) (b) Write a LISP function that finds the factorial of a given natural number. Write a LIST function that counts the number of atoms in a list. Marks) (10 (10 Marks)

11

Course Code Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : : :

MCSE-004 Numerical and Statistical Computing MCA(5)/E004/Assign/09 100 25% 30th April, 2009 (for January session) 31st October, 2009 (for July session)

This assignment has five questions in all and carries 80 marks. The rest of the 20 marks are for viva-voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

Q1: (a) Find the unique polynomial of degree 2 or less, such that f(-2) = 46, f(-1) = 4, f(3) = 156, f(4) = 484 using the Lagrange interpolation? Write a program in C evaluating the polynomial using Lagrange interpolation. (10 Marks)

12

(b)

Compute the integral

I=

**∫ x dx by applying Gauss’s Quadrature formula.
**

5

1

(5 Marks)

(c)

Using Runge-kutta method obtain y when x=1.1, given that y=1.2 when x=1 any y satisfies the equation. dy/dx=3x2+y2. (5 Marks)

Q2: (a) Given the solution of a problem as x a = 35.25 with the relative error in the solution at most 2%. Find, to four decimal digits, the range of values within which the exact value of the solution must lie. (2 Marks) If

(b)

π=

**22 is approximated as 3.14, find the absolute error, relative error and relative percentage 7
**

(2 Marks)

error. (c)

Write a program in C to find a root using bisection method. Perform the five iterations of the bisection method to obtain the smallest positive root of the equation f ( x ) = x 3 + 4 x − 1 = 0 , verify your answer with the program written by you. (6 Marks)

Q3: (a) Write a program in C to find a root using Secant Method. Perform the five iterations to obtain the smallest positive root of the equation f(x) = cos x + 2sin x + x2 verify your answer with the

12

program written by you. (b)

(10 Marks)

Out of the three methods i.e. Secant method, Regula Falsi method and the Newton Raphson method which method is more efficient and why? Determine the efficiency or the order of these three methods? (10 Marks)

Q4: (a) Find the probability of getting between 3 and 6 heads inclusive in 10 tosses of a fair coin by using (i) the binomial distribution, (ii) the normal approximation to the binomial distribution. (5 Marks) b) Five pennies were simultaneously tossed 1000 times, and at each toss the number of heads was observed. The numbers of tosses during which 0, 1, 2, 3, 4, and 5 heads were obtained are shown in the Table 1 below (a) Graph the data. (b) Construct a table showing the percentage of tosses resulting in a number of heads less than 0, 1, 2, 3, 4, 5 or 6. (c) Graph the data of the table in (b). (5 Marks)

**Number of Heads 0 1 2 3 4 5 Total
**

c) d)

**Number of Tosses (frequency) 30 140 340 280 160 50 1000
**

(5 Marks)

Fit a binomial distribution to the data of Question 2(b). Use the chi-square test to determine the goodness of fit of the data in Question 2(c).

Table 1

(5 Marks) e) Table 2 below shows the respective heights x and y of a sample of 12 fathers and their oldest sons. (i) Construct a scatter diagram. (ii) Find the least-squares regression line of y on x. (iii) Find the least-squares regression line of x and y. (5 Marks) Solve the equations:

Q5:

20 x1 − 2 x 2 + 4 x3 − x1 − 10 x 2 + x3

=8 = −3

(5 Marks)

2 x1 + 3 x 2 + 20 x3 = 7

using the LU decomposition method.

13

Course Code Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : : :

MCSE-011 Parallel Computing MCA(5)/E011/Assign/09 100 25% 30th April, 2009 (for January session) 31st October, 2009 (for July session)

This assignment has eight questions in all and carries 80 marks. The rest of the 20 marks are for viva-voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

Q1: Define Array processing. Why are array processors called as SIMD array computers? With the help of a block diagram, explain the architecture of an SIMD array processor. (8 Marks) Q2: (i) (ii) Obtain Perfect Shuffle Permutation network of 32 nodes Discuss, along with diagrams, clos network with 4x4 cross point switches.

(8 Marks) Q3: Define cluster computing. Explain the memory organisation in a cluster computing. Give details of any of the important projects based on cluster computing. (8 Marks) Q4: Define following asymptotic notations used for analysing functions: (i) Theta notation (ii) Big-O notation (iii) O notation Q5: Explain Bens network. Show the interconnection of Bens network for the following permutation:

(8 Marks)

14

(8 Marks) Q6: Discuss relative merits and demerits of various laws for measuring speed up performance vis-à-vis to a parallel computer algorithm system. (8 Marks)

Q7: Identify the types of the following vector processing instructions: (i) (ii) (iii) (iv) (v) Q8: What are the problems faced by superscalar architecture? How are these problems removed in VLIW architecture? (8 Marks) Q9: Draw the structure and explain the following interconnection networks: (i) Fat tree (ii) Systolic array Marks) Q10: Define Bitonic sequence. Discuss a Bitonic sorting algorithm. Further, using the algorithm, sort the following sequence: (8 Marks) 15,17,19,20,25,27,29,34,37,18,16,13,10,8,7,6,2 (8 C(I) : A(I) AND B(I) C(I) : MAX (A(I), B(I)) B(l) : A(t) / S (S is a scalar) B(l) : SIN (A(l)) C(l) : SIN (A(t)) / CoS (A(r))

(8 Marks)

15

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue listening from where you left off, or restart the preview.

scribd