HOW TO WRITE / PREPARE BEST ASSIGNMENTS / ANSWERS BY YOURSELF

        THERE ARE NO SHORTCUT FOR SUCCESS

IF TODAY , YOU WRITE YOUR ASSIGNMENTS IN YOUR OWN WORDS BY OWN EFFORTS, TOMORROW YOU WILL  WRITE YOUR EXAMINATIONS PAPER FOR THE SAME IN VERY EASY, IMPRESSIVE AND COMPRESSENSIVE WAY. THEN, OFF COURSE YOU WILL GET VERY GOOD MARKS AND A KIND OF SATISFACTION OF YOUR STUDY AND KNOWLEDGE.

IGNOU MCA MCSP-060 PROJECT WORK SOLVED ASSIGNMENTS 2014-2015 VI SIXTH SEMESTER

IGNOU MCA MCSP-060  SOLVED ASSIGNMENTS 2014-2015 VI SIXTH SEMESTER PROJECT WORK

IGNOU MCA MCSP-060 SOLVED ASSIGNMENTS 2014-2015 PROJECT WORK VI  SIXTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself

IGNOU MCA MCSE-011 Parallel Computing SOLVED ASSIGNMENTS 2014-2015

IGNOU MCA MCSE-011 SOLVED ASSIGNMENTS 2014-2015 Parallel Computing V  FIFTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself  

                                     Parallel Computing   MCSE-011

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. The answers are to be given in your own words and not as given in the Study Material.

For all detail question Click here  

IGNOU MCA MCSE-003 Artificial Intelligence and Knowledge Management SOLVED ASSIGNMENTS 2014-2015

IGNOU MCA MCSE-003 SOLVED ASSIGNMENTS 2014-2015 Artificial Intelligence and Knowledge Management V  FIFTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself

  Artificial Intelligence and Knowledge Management  MCSE-003

This assignment has Ten questions 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.

Q.1. a) Explain with suitable examples, significance of each of the following in solving problems
          i) Contextual information
          ii) Simultaneous availability of information

 b) Discuss relations between ‘organisation’, ‘information’ and ‘intelligence’.

Q.2. a) For each of the following formulae, construct a truth-table, and then determine whether it is valid, consistent or inconsistent:
i) (~ C → ~ D) → (D → C)
ii) ((~ C ˅ D) → B) → (~ C → B)

b) Determine whether the following equivalence between the formulae on two sides of ‘=’ holds or not (A → B) → C = (A → B) → (A → C) ?, by reducing each of the formulae on the two sides of ‘=’ to one of the normal forms (DNF or CNF).

Q.3. Translate first statements, given in the following argument into Propositional Logic, and then show that the conclusion logically follows from the premisses (given statements):

 Premisses: Either taxes are increased, or if expenditures rise, then the debt ceiling is raised. If taxes are increased, then the cost of collecting taxes increases. If a rise in expenditures implies that the government borrows more money, then if the debt ceiling is raised, then interest rates increase. If taxes are not increased and the cost of collecting taxes does not increase, then if the debt ceiling is raised, then the government borrows more money. The cost of collecting taxes does not increase. Either interest rates do not increase or the government does not borrow more money.

Conclusion: Either the debt ceiling is not raised or expenditures do not rise.

You may use the symbols:
(T: Taxes are increased. E: Expenditures rise. D: The debt ceiling is raised. C: The cost of collecting taxes increases. G: The government borrows more money. I: Interest rates increase).

Q.4. Transform the following formula first in Prenex Normal Form and then into Skolem Standard Form ( x) ( [( y) ( z) (~ P (x, y) Q (x, z))] → ( u) R (x, y, u) )

Q.5. Translate the following three statements in First Order Predicate Logic, and then deduce (iii) from (i) and (ii):

(You should not use resolution method)
 i) Lord Krishna is loved by everyone who loves someone. ii) No one loves nobody iii) Lord Krishna is loved by everyone.

Q.6. a) Write a recursive function in LISP named power that takes two numeric arguments, n and m, that computes n th power of m (i.e., m n ).

b) Write a PROLOG programme that answers questions about family members and relationships. Include predicates and rules which define sister, brother, father, mother, grandfather, grand-child and uncle. The programme should be able to answer queries such as the following:
? – father (X, mohit)
 ? – grandson (X, Y)
? – uncle (abdul, ruksana)
 ? – mother (mary, X)

Q.7. a) Give Semantic Net representation of the facts given below :

“Ramesh is a 52 year old Professor of Mathematics in Delhi University. The name of his wife, son and daughter are respectively Seema, Yash and Kavita”.

b) Create a frame network for terrestrial motor vehicles (cars, trucks, motorcycles) and give one complete frame in detail for cars which includes the slots for the main component parts, their attributes, and relations between parts. Include an as-needed slot for the gas of each type mileage.

Q.8. a) For the following fuzzy sets: X = {x/7, y/3, z/0, u/1, v/4} and Y = {x/3, y/8, z/6, u/9, v/0} Find (i) X Y (ii) X Y (iii) (X Y)

b) Write a note on Non-monotonic reasoning systems.

c) Discuss briefly various methods/ mechanism for handling incompleteness of a knowledge-base (KB).

Q.9. Translate the following argument into FOPL and then using Deductive Rules of Inference (given in Unit 2 of Block 2) prove/ refute the following argument.
No man who is a candidate will be defeated if he is a good campaigner. Any man who runs for office is a candidate. Any candidate who is not defeated will be elected. Every man who is elected is a good campaigner. Therefore, any man who runs for office will be elected if and only if he is a good campaigner.
You may use the notation
 (Mx, Cx, Dx, Gx, Rx, Ex)

Q.10. a) Describe briefly each of the components of an expert system shell.
         b) What is an agent? Discuss briefly different (at least four) types of agents.

IGNOU MCA MCSL-54 Laboratory Course (Advanced Internet Technologies & Computer Graphics and Multimedia) SOLVED ASSIGNMENTS 2014-2015

IGNOU MCA MCSL-054 SOLVED ASSIGNMENTS 2014-2015 Laboratory Course (Advanced Internet Technologies & Computer Graphics and Multimedia) V FIFTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself

Laboratory Course (Advanced Internet Technologies & Computer Graphics and Multimedia)
                       MCSL-054

This assignment has two parts A (Advanced Internet Technologies) and B (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. Write proper comments while programming. Please go through the guidelines regarding assignments given in the MCA Programme Guide for the format of presentation. Made assumptions if any while solving the problems and state them clearly.

                                  PART-I: Lab for MCS-051 (Advanced Internet Technologies)

Q.1. Write a Program using Servlet and JDBC for developing online application for students attendance management for MCA –V semester students of a computer science department. Make necessary assumptions and create appropriate databases.

Q.2. Write a JSP Program, to manage saving account of a bank with basic feature including opening new account, cash deposit & withdrawal, providing account details and closing of accounts.

Q.3. Write an XML document to represent the medicines in a medical store. This document should include generic medicines, restricted medicines and life saving drugs.

                       PART-II: Lab for MCS-053 (Computer Graphics and Multimedia )

Q.1. a) Write a program in C/C++ using OpenGL to perform a 3- Dimensional transformation, such as translation, rotation and reflection, on a given triangle.

b) Write a program in C/C++ using OpenGL to implement the Cohen Sutherland line clipping algorithm.

Q.2. Write a program in C/C++ using OpenGL to draw a polygon having 4 vertices A (4, 2) B (8, 2), C (4, 12), D (8, 12), it is reflected about the line y = 2.Using homogeneous coordinate system this program should find the coordinates of the reflected vertices.

Q.3. Write a program in C/C++ using OpenGL to draw Bezier curves, make necessary assumption and take required input from console.

IGNOU MCA MCSE-004 Numerical and Statistical Computing SOLVED ASSIGNMENTS 2014-2015

IGNOU MCA MCSE-004 SOLVED ASSIGNMENTS 2014-2015 Numerical and Statistical Computing V  FIFTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself

        Numerical and Statistical Computing  MCSE-004

  This assignment has seven 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.



For all questions Click here

IGNOU MCA MCS-053 Computer Graphics and Multimedia SOLVED ASSIGNMENTS 2014-2015

IGNOU MCA MCS-053 SOLVED ASSIGNMENTS 2014-2015 OPERATING SYSTEMS V  FIFTH SEMESTER 

Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself

             Computer Graphics and Multimedia   MCS-053

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.

Q.1. Write a program in C/C++ to generate line segment between two points, by using DDA line generation Algorithm. Your program should map each and every step of pseudo algorithm, in the form of comments. What are the advantages and disadvantages of using DDA algorithm for line generation? List the steps of the algorithm. Use this algorithm to draw a line with endpoints (2, 3) and (9, 8).

Q.2. Write the Bresenham Circle Generation Algorithm and use it to draw a circle with radius r = 10, determine positions along the circle octants in 1st Quadrant from x = 0 to x = y.

Q.3. What is line clipping? Compare Cohen Sutherland Line Clipping Algorithm with the Cyrus Beck line clipping algorithm. Explain the Cyrus Beck line clipping algorithm with the help of an example. How Cyrus Back line clipping algorithm, clips a line segment, if the window is non-convex?

Q.4. Explain the Homogeneous Coordinate System with the help of an example. Assume that a triangle ABC has the coordinates A(0, 0), B(5,8), C(4,2). Find the transformed coordinates when the triangle ABC is subjected to the clockwise rotation of 45° about the origin and then translation in the direction of vector (1, 0). You should represent the transformation using Homogeneous Coordinate System.

Q.5. What are Bezier Curves? Briefly discuss their properties, with the help of the proof for each of the property. How Bezier surfaces contributes to the world of computer games and simulations? Given p0(1, 1); p1(2, 3); p2(4, 3); p3(3, 1) as vertices of Bezier Curve. Determine 3 points on Bezier Curve.

Q.6. Why do you need to use visible-surface detection in Computer Graphics? Explain Scan Line method along with the algorithm for the visible-surface detection with the help of an example. How scan line method is different to z-buffer method?

Q.7. Explain the following terms in the context of computer Graphics using suitable diagram and /or mathematical equations or one example.
i) Depth Buffer Method
ii) Area Subdivision Method
 iii) Basic Ray Tracing Algorithm
 iv) Projections and its Types

Q.8. Compare and contrast the following:
 i) Interlaced and progressive scan
 ii) Compression and decompression in digital video
iii) Hypermedia and hypertext
iv) Types of Bitmap and Vector graphics
v) Ray tracing and Ray casting