UGC - NET Solved Computer Science Question Paper (iii) - June 2012

Que 1) Consider the following pseudo code segment : 
                     K:=0
                     for i₁:= 1 to n
                        for i₂:= 1 to i₁
                        : 
                        :
                        :
                           for i_m:= 1 to i_m–1
                     K:= K+1
The value of K after the execution of this code shall be

1.   C(n + m – 1, m)
2.   C(n – m + 1, m)
3.   C(n + m – 1, n)
4.   C(n – m + 1, n)

Que 2)  In Delta Rule for error minimization

1.   weights are adjusted w.r.to change in the output
2.   weights are adjusted w.r.to difference between desired output and actual output
3.   weights are adjusted w.r.to difference between input and output
4.   none of the above

Que 3) The concept of pipe lining is most effective in improving performance if the tasks being performed in different stages

1.   require different amount of time
2.   require about the same amount of time
3.   require different amount of time with time difference between any two tasks being same
4.   require different amount with time difference between any two tasks being different

Que 4) What is Granularity ?

1.   The size of database
2.   The size of data item  
3.   The size of record
4.   The size of file

Que 5) Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’s law is

1.   4.22
2.   3.22
3.   3.32
4.   3.52

  

Que 6)  If two fuzzy sets A and B are given with membership functions
μA(x) = {0.2, 0.4, 0.8, 0.5, 0.1}
μB(x) = {0.1, 0.3, 0.6, 0.3, 0.2}
Then the value of μ  A∩B will be

1.   {0.9, 0.7, 0.4, 0.8, 0.9}
2.   {0.2, 0.4, 0.8, 0.5, 0.2}
3.   {0.1, 0.3, 0.6, 0.3, 0.1}
4.   {0.7, 0.3, 0.4, 0.2, 0.7}

The answer should be {0.9, 0.7, 0.4, 0.7, 0.9}. i.e A∩B  = 1-(min[μA,μB])

Que 7)  Match the following :
(i) OLAP                     (a) Regression
(ii) OLTP                     (b) Data Warehouse
(iii) Decision Tree         (c) RDBMS
(iv) Neural Network    (d) Classification
            (i) (ii) (iii) (iv)

1.   (b) (c) (a) (d)
2.   (b) (c) (d) (a) 
3.   (c) (b) (a) (d)
4.   (c) (b) (d) (a)

Que 8) Which level of Abstraction describes what data are stored in the Database ?

1.   Physical level
2.   View level
3.   Abstraction level
4.   Logical level

Que 9)  The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________.

1.   Temporary Select Problem
2.   Temporary Modify Problem
3.   Dirty Read Problem  
4.   None

Que 10) In an image compression system 16384 bits are used to represent 256 × 256 image with 256 gray levels. What is the compression ratio for this system ?

1.   1
2.   2  
3.   4
4.   8

Que 11)  X.25 is ________ Network.

1.   Connection Oriented Network  
2.   Connection Less Network
3.   Either Connection Oriented or Connection Less
4.   Neither Connection Oriented nor Connection Less

Que 12)Which of the following can be used for clustering of data ?

1.   Single layer perception
2.   Multilayer perception
3.   Self organizing map  
4.   Radial basis function

Que 13) Which of the following is scheme to deal with deadlock ?

1.   Time out  
2.   Time in
3.   Both (A) & (B)
4.   None of the above

Que 14)  If the pixels of an image are shuffled then the parameter that may change is

1.   Histogram
2.   Mean
3.   Entropy
4.   Covariance

Que 15) The common property of functional language and logical programming language :

1.   Both are declarative  
2.   Both are based on λ-calculus
3.   Both are procedural
4.   Both are functional

Que 16)  Given the following statements :
(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?

1.   Both (i) and (ii)
2.   Only (i)  
3.   Only (ii)
4.  Neither (i) nor (ii)

Que 17) Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as (i) ∃y∀xQ(x,y)
(ii)∀x∃yQ(x, y) where x & y are real numbers. Then which of the following is valid ?

1.  (i) is true & (ii) is false.
2.  (i) is false & (ii) is true.
3.  (i) is false & (ii) is also false.
4.  both (i) & (ii) are true.

Que 18) Consider a schema R(A, B, C, D) and functional dependencies A→B and C→D. Then the decomposition R₁(A, B) and R₂(C, D) is

1.  Dependency preserving but not lossless join
2.  Dependency preserving and lossless join
3.  Lossless Join but not dependency preserving
4.  Lossless Join

Que 19) The quantiser in an image-compression system is a

1.  lossy element which exploits the psychovisual redundancy
2.  lossless element which exploits the psychovisual redundancy
3.  lossy element which exploits the statistical redundancy
4.  lossless element which exploits the statistical redundancy

Que 20) Data Warehouse provides

1.  Transaction Responsiveness
2.  Storage, Functionality Responsiveness to queries
3.  Demand and Supply Responsiveness
4.  None of the above

Que 21) A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set

1.  g = 1
2.  g = 0
3.  h' = 0
4.  h' = 1

Que 22)  The transform which possesses the highest ‘energy compaction’ property is

1.  Slant transform
2.  Cosine transform
3.  Fourier transform
4.  Karhunen-Loeve transform

Que 23) Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal q ?”

1.  if-else (G, P, q) :- !, call(G), call(P). if-else (G, P, q) :- call(q).
2.  if-else (G, P, q) :- call(G), !, call(P). if-else (G, P, q) :- call(q).
3.  if-else (G, P, q) :- call(G), call(P), !. if-else (G, P, q) :- call(q).
4.  All of the above

Que 24)  The _______ memory allocation function modifies the previous allocated space.

1.  calloc( )
2.  free( )
3.  malloc( )
4.  realloc( )

Que 25) Which is not the correct statement(s) ?
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.

1.  (i) is true, (ii) is false.
2.  (i) is true and (ii) is true.
3.  (i) is false, (ii) is false.
4.  (i) is false and (ii) is true.

Que 26) The mechanism that binds code and data together and keeps them secure from outside world is known as

1.  Abstraction
2.  Inheritance
3.  Encapsulation
4.  Polymorphism

Que 27)  Identify the addressing modes of below instructions and match them :
(a) ADI         (1) Immediate addressing
(b) STA         (2) Direct addressing
(c) CMA       (3) Implied addressing
(d) SUB        (4) Register addressing

1.  a – 1, b – 2, c – 3, d – 4
2.  a – 2, b – 1, c – 4, d – 3
3.  a – 3, b – 2, c – 1, d – 4
4.  a – 4, b – 3, c – 2, d – 1

Que 28) Which one of the following is not a Greibach Normal form grammar ?(i) S → a | bA | aA | bB
    A → a
    B → b
(ii) S → a | aA | AB
     A → a
     B → b
(iii) S → a | A | aA
     A → a

1.  (i) and (ii)
2.  (i) and (iii)
3.  (ii) and (iii)
4.  (i), (ii) and (iii)

Que 29)  Which of the following IP address class is a multicast address ?

1.  Class A
2.  Class B
3.  Class C
4.  Class D

Que 30) While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is

1.  atleast greater than 0.9
2.  equal to 0.9
3.  atmost 0.81
4.  atleast 1/0.81

Que 31) The upper bound of computing time of m coloring decision problem is

1.  O(nm)
2.  O(n^m)
3.  O(nmⁿ)
4.  O(n^mmⁿ)

Que 32)  The equivalent grammar corresponding to the grammar G : S → aA, A → BB, B → aBb | ∈ is

1.  S → aA, A → BB, B → aBb
2.  S → a|aA, A → BB, B → aBb | ab
3.  S → a | aA, A → BB | B, B → aBb
4.  S → a | aA, A → BB | B, B → aBb | ab

Que 33) Which one of the following statements is incorrect ?

1.  The number of regions corresponds to the cyclomatic complexity.
2.  Cyclometric complexity for a flow graph G is V(G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph.
3.  Cyclometric complexity for a flow graph G is V(G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.
4.  Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.

Que 34)  Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ?

1.  Weight (u, v) < 12
2.  Weight (u, v) = 12
3.  Weight (u, v) > 12
4.  Weight (u, v) > 12

Que 35) Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

1.  n states
2.  n + 1 states
3.  n + 2 states
4.  2ⁿ states

Que 36) Number of binary trees formed with 5 nodes are

1.  32
2.  36
3.  120
4.  42

Que 37) Are we building the right product ? This statement refers to

1.  Verification
2.  Validation
3.  Testing
4.  Software quality assurance

Que 38) The following postfix expression is evaluated using a stack 823^/23* + 51* – The top two elements of the stack after first * is evaluated
 6, 1
 5, 7
 3, 2
 1, 5

Que 39) The following CFG
S → aB | bA, A → a | as | bAA,
B → b | bs | aBB
generates strings of terminals that have

1.  odd number of a’s and odd number of b’s
2.  even number of a’s and even number of b’s
3.  equal number of a’s and b’s
4.  not equal number of a’s and b’s

Que 40) Consider the following pseudo-code :
If (A > B) and (C > D) then
         A = A + 1
         B = B + 1
Endif
The cyclomatic complexity of the pseudo-code is

1.  2
2.  3
3.  4
4.  5

Que 41) Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol) ?

1.  Transport layer
2.  Data link layer
3.  Network layer
4.  Application layer

Que 42) Which one of the following binary search tree is optimal, if probabilities of successful search and  unsuccessful search are same ?

Answer: (D)

43. The regular expression for the following DFA is

1.  ab*(b + aa*b)*
2.  a*b(b + aa*b)*
3.  a*b(b* + aa*b)
4.  a*b(b * + aa*b)*

Que 44) Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one another ?

1.  Object diagram
2.  Class diagram
3.  Instance diagram
4.  Analysis diagram

Que 45) A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ?

1.  Efficient implementation of multiuser support is no longer possible.
2.  The processor cache can be made more efficient.
3.  Hardware support for memory management is not needed.
4.  CPU scheduling can be made more efficient.

Que 46) The feasible region represented by the constraints
x₁- x₂ ≤1, x₁ + x₂ ≥ 3, x₁ ≥ 0, x₂ ≥ 0 of the objective function
Max Z = 3x₁+ 2x₂ is

1.  A polygon
2.  Unbounded feasible region
3.  A point
4.  None of these

Que 47) The colour of an object is largely determined by its diffuse reflection coefficient. If K_d = (0.8, 0.4, 0), then what shall be the colour of the object, if the light used is blue and magenta ?
 White and Red
 Red and Blue
 Black and White
 Black and Red

Que 48)  If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

1.  i + j/k
2.  i + j * k
3.  (i + j)/k
4.  (i + j) * k

Que 49) In any simplex table, if corresponding to any negative Δj, all elements of the column are negative or zero, the solution under the test is
 degenerate solution
 unbounded solution
 alternative solution
 non-existing solution

Que 50) How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?

1.  2^n(n+1)/2 and 2ⁿ.3^n(n–1)/2
2.  3^n(n–1)/2 and 2^n(n–1)
3.  2^n(n+1)/2 and 3^n(n–1)/2
4.  2^n(n+1)/2 and 2^n(n–1)/2

Que 51) The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

1.  Minmax strategy
2.  Alpha-beta pruning strategy
3.  Constraint satisfaction strategy
4.  Static max strategy

Que 52)  Match the following :
(i) Regular Grammar                    (a) Pushdown automaton
(ii) Context free Grammar            (b) Linear bounded automaton
(iii) Unrestricted Grammar            (c) Deterministic finite automaton
(iv) Context Sensitive Grammar    (d) Turing machine
      (i)  (ii) (iii) (iv)

1.  (c) (a) (b) (d)
2.  (c) (a) (d) (b)
3.  (c) (b) (a) (d)
4.  (c) (b) (d) (a)

Que 53) Consider the below circuit and find the output function f(x, y, z).

1.  XZ+ XY +YZ
2.  XZ+ XY +Y Z
3.  XZ + XY +Y Z
4.  XZ + XY + YZ

Que 54) What is the size (in terms of bits) of Header length field in IPV4 header ?

1.  2
2.  4
3.  8
4.  16

Que 55)  Match the following with respect to java.util.* class methods :
(a) Bit Set             (i) Time zone getTimezone( )
(b) Calendar         (ii) int hashcode( )
(c) Time zone        (iii) int nextInt( )
(d) Random          (iv) Void setID(String tzName)
            (a)  (b)  (c) (d)

1.  (ii)  (i)   (iv) (iii)
2.  (iii)  (iv) (i)   (ii)
3.  (iv) (iii)  (ii)  (i)
4.  (ii)   (i)  (iii) (iv)

Que 56)  ______ is sometimes said to be object oriented, because the only way to manipulate kernel objects is by invoking methods on their handles.

1.  Windows NT
2.  Windows XP
3.  Windows VISTA
4.  Windows 95/98

Que 57)  A user level process in Unix traps the signal sent on a Ctrl + C input and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl + C input is given to this process, what is the mode in which the signal handling routine executes ?

1.  User mode
2.  Kernel mode
3.  Superuser mode
4.  Privileged mode

Que 58) A CPU generally handles an interrupt by executing an interrupt service routine

1.  as soon as an interrupt is raised
2.  by checking the interrupt register at the end of fetch cycle
3.  by checking the interrupt register after finishing the executing the current instruction
4.  by checking the interrupt register at fixed time intervals

Que 59) The perspective projection matrix, on the view plane z = d where the centre of projection is the origin (0, 0, 0) shall be








 Answer: (B)

Que 60) Radio signals generally propagate according to the following mechanisms:

1.  Modulation, Amplification, Scattering
2.  Reflection, Diffraction, Scattering
3.  Amplification, Diffraction, Modulation
4.  Reflection, Amplification, Diffraction

Que 61)  Identify the devices given below with their IC numbers :
(i) USART                       (a) 8251
(ii) Micro controller          (b) 8051
(iii) Interrupt controller    (c) 8259
(iv) DMA controller         (d) 8257
           (i) (ii) (iii) (iv)

1.  (a) (b) (c) (d)
2.  (b) (a) (d) (c)
3.  (c) (d) (a) (b)
4.  (d) (a) (b) (c)

Que 62)  The optimal solution of the following assignment problem using Hungarian method is

  
           (A) (B) (C) (D)

1.  (I) (II) (III) (IV)
2.  (I) (III) (II) (IV)
3.  (I) (III) (IV) (II)
4.  (I) (IV) (II) (III)

63. If a and b are the end points of a line, then which one of the following is true ?

1.  If both end points are left, right, above or below the window, the line is invisible.
2.  If both end points are left, right, above or below the window, the line is completely visible.
3.  If both end points are left, right, above or below the window, the line is trivially visible.
4.  If both end points are left, right, above or below the window, the line is trivially invisible.

Que 64) Match the following with link quality measurement and handoff initiation :
(a) Networked- Controlled Handoff (NCHO)         (i) MS connect to BS
(b) Mobile- Assisted Handoff (MAHO)                 (ii) Process via channel the target BS
(c) Forward Handoff                                             (iii) First Generation Analog Cellular System
(d) Hard Handoff                                                  (iv) Second Generation Digital Cellular System
           (a) (b) (c) (d)

1.  (iii) (iv) (ii) (i)
2.  (ii) (iii) (i) (iv)
3.  (ii) (i) (iv) (iii)
4.  (iv) (iii) (i) (ii)

Que 65) Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned,
               P1                                 P2                       critical section                    critical section
while (S1 = = S2);           while (S1 = = S2);                S1 = S2;                             S1 = S2;

Which one of the following statements describes the properties achieved ?

1.  Mutual exclusion but not progress
2.  Progress but not mutual exclusion
3.  Neither mutual exclusion nor progress
4.  Both mutual exclusion and progress

Que 66)  If the period of a signal is 1000 ms, then what is its frequency in kilohertz ?

1.  10^–3 KHz
2.  10^–2 KHz
3.  10^–1 KHz
4.  1 KHz

Que 67) Let a * H and b * H be two cosets of H.
(i) Either a * H and b * H are disjoint
(ii) a * H and b * H are identical Then,

1.  only (i) is true
2.  only (ii) is true
3.  (i) or (ii) is true
4.  (i) and (ii) is false

Que 68)  HTML is defined using SGML – an _______ standard, information processing-text and office systems (SGML) for text information processing.

1.  ISO – 8878
2.  ISO – 8879
3.  ISO – 8880
4.  ISO – 8881

Que 69) What is the meaning of ‘Hibernate’ in Windows XP/Windows 7 ?

1.  Restart the computers in safe mode.
2.  Restart the computers in normal mode.
3.  Shutdown the computer terminating all the running applications.
4.  Shutdown the computer without closing the running applications.

For Rest Of The Questions Kindly Visit 
http://www.thequizlab.com/quiz/ugc-net-computer-science-solved-paper-iii-june2012.html

Do You Like This? Please take 5 seconds to share with your firends.