UGC NET/ JRF December 2005 Question Paper II: Computer Applications

Jan 18, 2013 12:31 IST

    The University Grant Commission (UGC) conducts the National Eligibility Test (UGC NET/ JRF) for Junior Research Fellowship and Eligibility for Lectureship twice in the Month of December. Here you find question papers from the Computer Applications for the benefit of the aspirants. The question paper will help in the practice and thereby further the preparation procedure of the students.

    1. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

    (A) T is a tree

    (B) T contains no cycles

    (C) Every pairs of vertices in T is connected by exactly one path

    (D) All of these

    2. If the proposition 7 P => Q is true, then the truth value of the proportion 7 Pv (P=Q) is:

    (A) True

    (B) Multi - Valued

    (C) Flase

    (D) Can not determined

    5. Regular expression a + b denotes the set:

    (A) {a}

    (B) {€, a, b}

    (C) {a, b}

    (D) None of these

    Click Here to find Computer Applications (December 2005) complete question paper

    Register to get FREE updates

      All Fields Mandatory
    • (Ex:9123456789)
    • Please Select Your Interest
    • Please specify

    • ajax-loader
    • A verifcation code has been sent to
      your mobile number

      Please enter the verification code below


    Register to view Complete PDF