Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
Communities Members BookmarksPolls Fresher Jobs Strange Photos Academic 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: prashant       Member Level: Silver       Posted Date: 16 Sep 2008

2007 Jaypee University of Information Technology B.Tech Information Technology maths Question paper



Course: B.Tech Information Technology   University: Jaypee University of Information Technology




JAYPEE UNIVERSITY OF INFORMATION AND TECH.

TEST 3

1. Let A and B be finite sets. Suppose A has m elements and B has n elements. State the relationship which must hold between m and n for each of the following to be true:
(a) there exists a one-one (injection) map from A to B.
(b) there exists an onto (surjection) map from A to B.
(c) there exists a bijection (one-one onto) map from A to B.
2. Define floor, ceiling, integer, absolute value, remainder, exponential and logarithmic functions. Give two examples for each.
3. Let f(x) = x + 2, g(x) = x – 2, and h(x) = 3x for
Find
4. Let where State whether these functions are injective, surjective or bijective.



5. Let a and b be positive integers, and suppose Q is defined recursively as follows:

Find (i) Q (2, 5) (ii) Q (12, 5)
(iii) What does this function Q do? Find Q (5861, 7).
6. Let n denote a positive integer. Suppose a function L is defined recursively as follows:

Find L (25).
7. Consider a recursive function G from set of positive integers to integers,

Is G well defined? Justify.
8. Let x and y be two integers and suppose that g(x, y) is defined recursively by

Find g (2, 7), g (5, 3) and g (15, 2).
11. Suppose
12. Prove that
13. Show that
14. Show that
15. Using generating function solve the recurrence relation
16. Using generating function solve the recurrence relation





Return to question paper search

Next Question Paper: Front-End Design Tools

Previous Question Paper: Engish , Second Paper(Fiction)

Related Question Papers:


  • MATH --DISCRETE MATH


  • CONTROL SYSTEM


  • unix


  • communication system 2


  • test 1


  • 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



    Contact Us    Editors    Privacy Policy    Terms Of Use   

    ISC Technologies. 2006 - 2008 All Rights Reserved.