1. (a) Describe how fixed length record I/O and variable length I/O are implemented in UNIX system. (b) Design an algorithm and draw a corresponding flow chart to generate the fibonacci series. (c) Write a shell program that counts the number of words and lines in a given tex file. (d) What is meant by [...]
IGNOU MCA Assignments
MCS-051 Advanced Internet Technologies Jan – June 2012
Question 1: Write an application to create a XML document from a university employee database .The XML document should contain the following: i) Employee code ii) Employee Name iii) Designation iv) Address v) Department vi) The last twelve month performance summary Question 2: Assume there is a student database in Oracle with the following fields: [...]
MCSL-036 Laboratory Course Jan – June 2012
SECTION 1: MCS-032 Question 1: A desktop publishing s/w is required to be developed. The system will support text and graphics .Graphics include lines, square, polygons, circles and ellipse. Internally a circle is represented as a special case of a ellipse and square as in case of box i) Draw at least two use case [...]
MCS-034 Software Engineering Jan – June 2012
Question 1: Assume that you are assigned responsibility of developing a Library Information System for a University (LIS) . There are 5 libraries within the University. LIS needs to be University wide and needs to cater to all the 5 libraries in a network mode. So, any staff member or a student will be able [...]
MCS-032 Object Oriented Analysis and Design Jan – June 2012
Question 1 : What is Object Orientation? Explain advantages of Object Oriented approach of system design over Structured approach of system design. Question 2 : Briefly explain , need of different UML Diagrams. Question 3 : Explain how class diagrams are designed in an object oriented system, with the help of an example. Question 4 [...]
MCS-031 Design and Analysis of Algorithms Jan – June 2012
Question 1: (a) What is Randomized Quicksort? Analyse the expected running time of Randomized Quicksort, with the help of a suitable example. (b) Explain the Greedy Structure algorithm. Give an example in which the Greedy technique fails to deliver an optimal solution. (c) Describe the two properties that characterise a good dynamic programming Problem. (d) [...]
MCSL-017 C and Assembly Language Programming Jan – June 2012
Section 1: C Programming Lab Question 1: Write an interactive program in C language to manage the Clinic Information with menu options like Patient’s details, Doctor’s details, Doctor’s and Patient’s visits, Laboratory details, Bills, Payments etc. using the file handling concepts. The application should be designed user-friendly. Note: You must execute the program and submit [...]
Recent Comments