## Tuesday, 11 November 2014

### UGC NET Computer Science Solved Questions December 2013 Paper 3 - Part 1

1.       If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have
(A) feasible solution
(B) alternative solution
(C) no feasible solution at all
(D) no bounded solution at all
2.       Given the problem to maximize f(x), X=(x1,x2,...xn) subject to m number of inequality constraints.
gi(x)≤bi, i=1,2.....,m
including the non-negativity constraints x≥0.
Which one of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x’ ?
(A) ∂L(X’, λ’, S’)/∂xj = 0, j = 1, 2,...m
(B) λi’[gi(X’)-bi] = 0, i = 1, 2,...m
(C) gi(X’)≤bi, i = 1, 2...m
(D) All of these
3.       The following Linear Programming problem has:
Max                    Z = x1+x2
Subject to          x1-x2≥0
3x1-x2≤-3
and x1, x2≥0
(A) Feasible solution
(B) No feasible solution
(C) Unbounded solution
(D) Single point as solution
4.       Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be
(A) 4, 5   (B) 5, 4
(C) 3, 1   (D) 13, 8
5.       Function points can be calculated by
(A) UFP*CAF   (B) UFP*FAC
(C) UFP*Cost   (D) UFP*Productivity
Explanation:
Function Point FP = UFP*CAF
6.       Match the following:
List-I                              List-II
a. Data coupling          i. Module A and Module B have
shared data
b. Stamp coupling       ii. Dependency between modules
is based on the fact they communicate
by only passing of data.
c. Common coupling  iii. When complete data structure is
passed from one module to another.
d. Content coupling    iv. When the control is passed from
one  module to the middle of another.
Codes:
a  b  c   d
(A) iii  ii   i   iv
(B) ii  iii   i   iv
(C) ii  iii   iv  i
(D) iii  ii   iv  i
7.       A process which defines a series of tasks that have the following four primary objectives is known as
1. to identify all items that collectively define the software configuration.
2. to manage changes to one or more of these items.
3. to facilitate the construction of different versions of an application.
4. to ensure that software quality is maintained as the configuration evolves over time.
(A) Software Quality Management Process
(B) Software Configuration Management Process
(C) Software Version Management Process
(D) Software Change Management Process
8.       One weakness of boundary value analysis and equivalence partitioning is
(A) they are not effective.
(B) they do not explore combinations of input circumstances.
(C) they explore combinations of input circumstances
(D) none of the above
9.       Which one of the following is not a software myth?
(A) Once we write the program and get it to work, our job is done.
(B) Project requirements continually change, but change can be easily accommodated     because software is flexible.
(C) If we get behind schedule, we can add more programmers and catch up.
(D) If an organization does not understand how to control software projects internally, it    will invariably struggle when it outsources software projects.
10.    Match the following with respect to relationship between objects and classes:
List-I                                          List-II
a. State diagram                       i. Useful for both abstract modelling
and for designing actual program.
b. Object diagram                     ii. Describes object classes.
c. Class diagram                      iii. Useful for documenting test cases.
d. Instance diagram                iv. Describing the behaviour of a
single class of objects.
Codes:
a   b  c  d
(A) iv   i   ii  iii
(B) ii   iii  iv  i
(C) iii  iv  ii  i
(D) ii   iv  i  iii
11.    Match the following style rules for reusability:
List-I                                                      List-II
a. Keep methods coherent                i. Write a method to get the
last element of a list.
b. Keep methods small                       ii. Maintain parallel structure
when possible.
c. Keep methods consistent              iii. Breaking a method into
smaller parts.
d. Provide uniform coverage             iv. Perform a single function or
a group of closely related functions.
Codes:
a   b   c  d
(A) iv  iii   ii   i
(B) ii   i    iv  iii
(C) iii  iv  ii    i
(D) ii  iii   iv   i
12.    Which is the protocol for performing RPCs between applications in a language and system independent way?
(A) Hyper Text Transmission Protocol (HTTP)
(B) Simple Network Management Protocol (SNMP)
(C) Simple Object Access Protocol (SOAP)
(D) Simple Mail Transfer Protocol (SMTP)
13.    The document that is used by XSLT to indicate, how to transform the elements of the XML document to another format is
(A) HTML page             (B) DOC type procedure
(C) Style sheet             (D) Stored procedure
14.    Which of the following concepts means adding new concepts to a program as it runs?
(C) Dynamic typing     (D) Dynamic binding
(A) Virtual polymorphism
(B) Transient polymorphism
(D) Pseudo polymorphism
16.    Match the following with respect to programming languages:
List-I                                                                  List-II
a. Structured Language                                 i. JAVA
b. Non-structured Language                         ii. BASIC
c. Object oriented Programming Language            iii. PASCAL
d. Interpreted Programming Language       iv. FORTRAN
Codes:
a  b   c   d
(A) iii  iv   i   ii
(B) iv  iii  ii   i
(C) ii  iv   i   iii
(D) ii  iii   iv  i
17.    The compiler converts all operands upto the type of the largest operand is called
(A) Type Promotion     (B) Type Evaluation
(C) Type Conversion  (D) Type Declaration
18.    C++ actually supports the following two complete dynamic allocation systems:
(A) One defined by C++ and the other not defined by C.
(B) One defined by C and one specific to C++.
(C) Both are specific to C++
(D) Both of them are improvements of C.
19.    Important advantage of using new and delete operation in C++ is
(A) Allocation of memory
(B) Frees the memory previously allocated
(C) Initialization of memory easily
(D) Allocation of memory and frees the memory previously allocated.
20.    Match the following control strategies of prolog:
List-I                                                      List-II
a. Forward movement                         i. Variable can be done with a
constant, another variable
or a function
b. Unification                                        ii. The entire conjunctive goal is
executed.
c. Deep backtracking                          iii. Previous sub goal to find
alternative solutions.
d. Shallow backtracking                     iv. Choose sub goal with possible
unifier.
Codes:
a   b  c   d
(A) iv   i   ii   iii
(B) ii   iv  i    iii
(C) iii  i   iv   ii
(D) ii  iii  iv   i
21.    Given the following statements:
S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not  equivalent.
S2:  The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct
(C) S1 is not correct and S2 is correct
(D) Both S1 and S2 are not correct.
22.    What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below:
(A) 11     (B) 10
(C) 01     (D) 00
23.    High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences?
(A) Morphological        (B) Syntactic
(C) Semantic                (D) Pragmatic
24.    The objective of .................. procedure is to discover at least one ............... that causes two literals to match.
(A) unification, validation
(B) unification, substitution
(C) substitution, unification
(D) minimax, maximum
25.    If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if
(A) h* us equal to h
(B) h* overestimates h
(C) h* underestimates h
(D) none of these
26.    The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called
(A) backward planning           (B) goal stack planning
27.    In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only.
(A) alpha, beta             (B) beta, alpha
(C) alpha, alpha           (D) beta, beta
28.    If A and B are two fuzzy sets with membership functions
µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9}
µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8}
Then the value of µA∩B will be
(A) {0.2, 0.5, 0.6, 0.7, 0.9}
(B) {0.2, 0.5, 0.2, 0.1, 0.8}
(C) {0.1, 0.5, 0.6, 0.1, 0.8}
(D) {0.1, 0.5, 0.2, 0.1, 0.8}
Explanation:
μA∩B(x) = min [μA(x), μB(x)]
29.    The height of h(A) of a fuzzy set A is defined as
h(A) = sup A(x)
xϵA
Then the fuzzy set A is called normal when
(A) h(A) = 0       (B) h(A) < 0
(C) h(A) = 1       (D) h(A) < 1
30.    An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output.
(A) Σ wi                   (B) Σ xi
(C) Σ wi + Σ xi     (D) Σ wi . Σ xi
31.    Consider the formula in image processing
RD = 1 - (1/CR) Where CR = n1/n2
CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set.
(A) Data Compression                        (B) Data Redundancy
(C) Data Relation                    (D) Data Representation
32.    Find the false statement:
(A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption.
(B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product.
(C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.
(D) Public key algorithms use two different keys for Encryption and Decryption.
33.    The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is
(A) 110010011001
(B) 11001001
(C) 110010011001001
(D) 11001001011
34.    ................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.
(A) 2n-2
(B) n + floor(lg n) - 2
(C) floor(3n/2) - 2
(D) 2 lg n – 2
35.    Let A and B be two n x n matrices. The efficient algorithm to multiply the two matrices has the time complexity
(A) O(n3)            (B) O(n2.81)
(C) O(n2.67)        (D) O(n2)
36.    The recurrence relation T(n)=mT(n/2)an2 is satisfied by
(A) O(n2)            (B) O(nlg m)
(C) O(n2 lg n)    (D) O(n lg n)
37.    The longest common subsequence of the sequences X=<A, B, C, B, D, A, B>  and Y=<B, D, C, A, B, A> has length
(A) 2       (B) 3
(C) 4       (D) 5
38.    Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is
(A) O(n)             (B) O(n lgn)
(C) O(n lgm)      (D) O(n+m)
39.    A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively.
(A) minimal, maximal              (B) minimal, minimal
(C) maximal, maximal             (D) maximal, minimal
40.    Pumping lemma of the context-free languages states:
Let L be an infinite context free language. Then there exists some positive integer m such that wϵL with |w|≥m can be decomposed as w=uv xy Z with |vxy| ................. and |vy| ................ such that uvz’xyz’ , ZϵL for all z’ = 0,1, 2,...
(A) ≤m, ≤1         (B) ≤m, ≥1
(C) ≥m, ≤1         (D) ≥m, ≥1