Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities 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.

website counter



Download Model question papers & previous years question papers

Posted By: SRIMATHI       Member Level: Diamond       Posted Date: 27 Apr 2008

2005 Indira Gandhi National Open University (IGNOU) M.C.A Discrete Mathematics Question paper



Course: M.C.A   University: Indira Gandhi National Open University (IGNOU)




2005 Indira Gandhi National Open University (IGNOU)
M.C.A Computer Science
MCS-013 : Discrete Mathematics Question paper

MCA (Revised)
Term-End Examination

December, 2005

MCS-013 : DISCRETE MATHEMATICS

Time: 2 hours
Maximum Marks: 50

Note : Question number 1 is compulsory. Answer any three questions from the rest.
1. (a) Write the negation of the following statements : (2+2)
(i) For all x, x2 < x. (ii) There exists x such that x2 = 2.

(b) Construct the circuit that produces the following ourput :
x' ^ (y v z')'. (4)

(c) Let A = {1, 2, 3, 4, 5}. Construct a relation B from A to A such that R is reflexive and symmetric but not transitlve. (4)

(d) Prove by induction that n3 - n is divisible by 3 for all positive integers. (4)

(e) Determine all the integer solutions to x1 +x2 + x3+ x4= 9, where x = 1 , i = 1, 2, 3, 4. (4)

2. (a) A sequence of ten bits (0's and 1's) is randomly generated. What is the probability that at least one of the bits is 0 ? (5)

Find the number of permutations of the word ATTENDANT. (3)

Write the contrapositive of the statement 'If x is a positive real number, there is a number y such that y2 = x.' (2)

3. (a) Given five points inside a square whose side has length 2, prove that two are within a distance of v2 of each other. (5)

(b) Prove that ((p v q ? r) ^ (~P)) ? (q ? r) is a tautology. (5)

4. (a) A committee of three individuals decides a proposal. Each individual votes elther yes or no. The proposal is passed if it receives at least two yes votes. Design a circuit that determines whether the proposal passes. (5)

(b) Find the domain and range of the function v1+x/1-x, where x takes real values. (3)

(c) State whether the following statement is true or false, Give reasons for your answer. (2)
"For any 3 sets A, B and C, and functions f: A ? B, g: B ? C such that g o f is surjective, their f and g must be surjective."

5. (a) How many boolean functions of n variables are there ? Give reasons for your answer. (4)

(b) Check whether the following argument is valid, using a truth table. (6)
"lf Shalini leaves home before 9.00 AM or if she takes a taxi, she will reach office in time. She did leave after 10.00 AM and she did reach office in time. Therefore, Shalini must have taken a taxi.






Return to question paper search

Next Question Paper: SYSTEMS ANALYSIS AND DESIGN

Previous Question Paper: COMPUTER ORGANISATION & ASSEMBLY LANGUAGE PROGRAMMING

Related Question Papers:


  • MS9 Managerial Economics June 2005


  • Foundation Course in Mathematics in Computing


  • CS-70 : INTRODUCTION TO S/W ENGINEERING, JUNE - 2006


  • CS - 73: THEORY OF COMPUTER


  • Data communications and networking


  • 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.



    Watch TV Channels
  • Watch Asianet TV online
  • Kairali TV in Internet
  • Surya TV online
  • Amritha TV Channel

  • Contact Us    Privacy Policy    Terms Of Use   

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