Members BookmarksPolls Fresher Jobs Funny Photos B.Tech Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

Paid Surveys


website counter




Download Model question papers & previous years question papers

Posted By: S.Yamini       Member Level: Diamond       Posted Date: 08 May 2008

2005 Indira Gandhi National Open University (IGNOU) MCA Problem solving and programming Question paper



Course: MCA   University: Indira Gandhi National Open University (IGNOU)





Test Papers / Previous Question Papers of IGNOU MCS11 Problem Solving and Programming December 2005
MCA (Revised)
Term-End Examination

December, 2005

MCS-011 (S) : PROBLEM SOLVING AND PROGRAMMING

Time: 3 hours
Maximum Marks: 100
(Weightage 75%)

Note : Question number 1 is compulsory. Answer any three questions from the rest.
1. (a) Write an algorithm and draw a corresponding flow chart to print the sum of the digits ol a given number. (10)

(b) Write a recursive program to find the G.C.D. of the two given numbers. (10)

(c) Write a program in 'C' to print fhe following format: (10)
I
I G
I G N
I G N O
I G N O U
I G N O
I G N
I G
I

(d) Write a program in 'C' to add the given number of days to the current date and print the (final) resultant date. (for e.g. adding 12 days to 22/08/2005 will result in 03/09/2005] (10)

2. (a) Write a program in 'C' to find all Armstrong numbers in the range of 0 and 999. (10)
Hint : An Armstrong number is an integer whose sum of the cubes of its digits is equai to the number itsetf.

(b) Write a program to count the number of vowels, consonants and spaces in a given string. (10)

3. (a) Explain the important features of 'C' language. Mention the types of applications which can be developed using C. List any three 'C' compilers. (10)

(b) Write a program in 'C' to perform multiplication of two matrices A and B. (10)

4. (a) There are 70 records in a file with the following structure.
Struct {
Char itemcode [6];
Char itemname [20];
int qty;
} item;
Write a program to read these records and arrange them in ascending order with respect to qty. (10)

(b) Write the functions to perform the following : (10)
(i) To find mn where m, n = 0
(ii) To swap two variables

5. (a) Write a program in 'C' to find and display the minimum and maximum values of an array of integers. (5)
Note : You should use "pointers" concept only.

(b) Write the syntax and explain the purpose of the following functions : (6)
(i) Fseek( )
(ii) Fclose( )
(iii) Fprintf( )

(c) Write a symbolic constant or a macro definition for each of the following : (9)
(i) Define a macro called AREA, which will calculate area of circle in terms of radius. Use the constant PI in calculation.
(ii) Rewrite the macro described in preceding problem so that radius is expressed as an argument.
(iii) Write a macro called "MAX" that utilizers conditional operator (?: ) to determine maximum of 'a' and 'b', two integers.






Return to question paper search

Next Question Paper: VISUAL PROGRAMMING

Previous Question Paper: computer organisaton & assembly language programming

Related Question Papers:


  • IGNOU - Master of Arts in Economics (MEC)-2006


  • CS03 (S) File Structure and Programming in Cobol - December 2005


  • Managerial Economics


  • MCS-022 (S) : OPERATING SYSTEM CONCEPTS AND NETWORKING MANAGEMENT


  • Computer fundamentals


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.


    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.