Saturday, 8 November 2014

UGC NET/JRF Computer Science Paper III June 2013 Solved Mcqs - Part 1

1.       The Software Maturity Index (SMI) is defined as
SMI = [Mf – (Fa + Fc + Fd)] / Mf
Where
Mf = the number of modules in the current release.
Fa = the number of modules in the current release that have been added.
Fc = the number of modules in the current release that have been changed.
Fd = the number of modules in the current release that have been deleted.
The product begins to stabilize when
(A) SMI approaches 1            
(B) SMI approaches 0
(C) SMI approaches -1          
(D) None of the above
Answer: A
2.       Match the following:
a. Watson-Felix model                                    i. Failure intensity
b. Quick-Fix model                                          ii. Cost estimation
c. Putnam resource allocation model          iii. Project planning
d. Logarithmetic- Poisson Model                  iv. Maintenance
Codes:
      a   b   c   d
(A) ii    i   iv   iii
(B) i    ii   iv   iii
(C) ii   i    iii   iv
(D) ii   iv  iii    i
Answer: D
3.       ............... is a process model that removes defects before they can precipitate serious hazards.
(A) Incremental model
(B) Spiral model
(C) Cleanroom software engineering
(D) Agile model
Answer: C
4.       Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived.
(A) White-box testing                         
(B) Black-box testing
(C) Orthogonal array testing             
(D) Stress testing
Answer: B
5.       The following three golden rules:
(i) Place the user in control
(ii) Reduce the user’s memory load
(iii) Make the interface consistent are for
(A) User satisfaction                          
(B) Good interface design
(C) Saving system’s resources        
(D) None of these
Answer: B
6.       Software safety is a ................... activity that focuses on the identification and assessment of potential hazards that may affect software negatively and cause an entire system to fail.
(A) Risk mitigation, monitoring and management
(B) Software quality assurance
(C) Software cost estimation
(D) Defect removal efficiency
Answer: B
7.       The “PROJECT” operator of a relational algebra creates a new table that has always
(A) More columns than columns in original table
(B) More rows than original table
(C) Same number of rows as the original table
(D) Same number of columns as the original table
Answer: C
8.       The employee information of an Organization is stored in the relation:
Employee (name, sex, salary, deptname)
Consider the following SQL query
Select deptname from Employee Where sex = ‘M’ group by deptname having avg (salary) > {select avg (salary) from Employee}
Output of the given query corresponds to
(A) Average salary of employee more than average salary of the organization.
(B) Average salary less than average salary of the organization.
(C) Average salary of employee equal to average salary of the organization.
(D) Average salary of male employees in a department is more than average salary of the organization.
Answer: D
9.       For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation
(A) In 1NF not in 2NF             (B) In 2NF not in 3NF
(C) In 3NF                                 (D) In 1NF
Answer: A
10.    Match the following:
a. RAID 0          i. Bit interleaved parity
b. RAID 1          ii. Non redundant stripping
c. RAID 2           iii. Mirrored disks
d. RAID 3          iv. Error correcting codes
Codes:
      a   b   c    d
(A) iv   i    ii    iii
(B) iii   iv   i    ii
(C) iii   i    iv   ii
(D) iii   ii   iv   i
Answer: Marks given to all
11.    The golden ratio ϕ and its conjugate ϕ’ both satisfy the equation
(A) x3 – x – 1 = 0                       (B) x3 + x – 1 = 0
(C) x2 – x – 1 = 0                      (D) x2 + x – 1 = 0
Answer: C
12.    The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is
(A) O(n log log logn)               (B) O(n log logn)
(C) O(log logn)                         (D) O(logn log logn)
Answer: D
13.    In any n-element heap, the number of nodes of height h is
(A) less than equal to [n/2h]
(B) greater than [n/2h]
(C) greater than [n/2h+1]
(D) less than equal to [n/2h+1]
Answer: D
14.    A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:
using the variable-length code by Huffman codes, the file can be encoded with
(A) 2,52,000 bits           (B) 2,64,000 bits
(C) 2,46,000 bits          (D) 2,24,000 bits
Answer: D
15.    A vertex cover of an undirected graph G(V, E) is a subset V1 V vertices such that
(A) Each pair of vertices in V1 is connected by an edge
(B) If (u, v) E then u V1 and v V1
(C) If (u, v) E then u V1 or v V1
(D) All pairs of vertices in V1 are not connected by an edge
Answer: C
16.    In a fully connected mesh network with n devices, there are ................ physical channels to link all devices.
(A) n(n–1)/2      (B) n(n+1)/2
(C) 2n                (D) 2n+1
Answer: A
17.    The baud rate of a signal is 600 baud/second. If each signal unit carries 6 bits, then the bit rate of a signal is .................
(A) 3600                        (B) 100
(C) 6/600           (D) None of the above
Answer: A
18.    Match the following:
a. Data link layer                      i. Flow control
b. Network layer                       ii. Node to node delivery
c. Transport layer                     iii. Mail services
d. Application layer                 iv. Routing
Codes:
      a   b    c   d
(A) ii    i    iv   iii
(B) ii   iv    i    iii
(C) ii    i    iii   iv
(D) ii   iv   iii    i
Answer: B
19.    An image is 1024800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it take to transmit it over a 10-Mbps Ethernet ?
(A) 196.6 seconds                   (B) 19.66 seconds
(C) 1.966 seconds                   (D) 0.1966 seconds
Answer: C
20.    The .............. measures the relative strengths of two signals or a signal at two different points.
(A) frequency               (B) attenuation
(C) throughput             (D) decibel
Answer: D
21.    Which one of the following media is multidrop?
(A) Shielded Twisted pair cable
(B) Unshielded Twisted pair cable
(C) Thick Coaxial cable
(D) Fiber Optic cable
Answer: C
22.    What is the baud rate of the standard 10 Mbps Ethernet ?
(A) 10 megabaud         (B) 20 megabaud
(C) 30 megabaud        (D) 40 megabaud
Answer: B
23.    At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any non-basic variable Xj is obtained as zero, the solution under the test is
(A) Degenerate solution        
(B) Unbounded solution
(C) Alternative solution         
(D) Optimal solution
Answer: C
24.    A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1.
(A) degenerate             (B) non-degenerate
(C) unbounded                        (D) unbalanced
Answer: A
25.    The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is
(A) 76     (B) 80
(C) 90     (D) 96
Answer: B
26.    An actor in an animation is a small program invoked ............... per frame to determine the characteristics of some object in the animation.
(A) once            (B) twice
(C) 30 times      (D) 60 times
Answer: A
27.    Bresenham line drawing algorithm is attractive because it uses
(A) Real arithmetic only         
(B) Integer arithmetic only
(C) Floating point arithmetic 
(D) Real and integer arithmetic
Answer: B
28.    The refresh rate above which a picture stops flickering and fuses into a steady image is called ..................
(A) Crucial fusion frequency
(B) Current frequency fusion
(C) Critical fusion frequency
(D) Critically diffused frequency
Answer: C
29.    In homogenous coordinate system (x, y, z) the points with z = 0 are called
(A) Cartesian points    (B) Parallel points
(C) Origin point                        (D) Point at infinity
Answer: D
30.    If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is
(A) 40 line-pairs per inch      
(B) 80 line-pairs per inch
(C) 1600 lines per inch          
(D) 40 lines per inch
Answer: A
31.    Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is
(A) n × 8 MB                             (B) n / 8 MB
(C) (1024 × 1024) / 8 MB        (D) 1024 MB
Answer: B
32.    Arrays in C language can have ................. with reference to memory representation.
(A) n-subscripts                       (B) two-subscripts
(C) only one subscript                        (D) three subscripts only
Answer: C
33.    Refer the points as listed below:
(a) What are the operator precedence rules ?
(b) What are the operator associativity rules ?
(c) What is the order of operand evaluation ?
(d) Are there restrictions on operand evaluation side effects ?
Which of the above must be considered as primary design issues for arithmetic expressions ?
(A) (a), (b) and (c)
(B) (a), (c) and (d)
(C) (a), (b) and (d)
(D) (a), (b), (c) and (d)
Answer: D
34.    Horn clauses are special kinds of propositions which can be described as
(A) Single atomic proposition on left side.
(B) Single or multiple atomic proposition on left side.
(C) A single atomic proposition on left side and a single atomic proposition on right side.
(D) A single atomic proposition on left side or an empty left side.
Answer: D
35.    Which of the following is/are the fundamental semantic model(s) of parameter passing?
(A) in mode                   (B) out mode
(C) in-out mode            (D) all of the above
Answer: D
36.    The grammar with production rules S → aSb |SS|λ generates language L given by:
(A) L = {w{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
(B) L = {w{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
(C) L = {w{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
(D) L = {w{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
Answer: A
37.    A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q Q, a Σ {λ} and b Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c Σ
(A) only s1                    (B) only s2
(C) both s1 and s2       (D) neither s1 nor s2
Answer: C
38.    For every context free grammar (G) there exists an algorithm that passes any w L(G) in number of steps proportional to
(A) ln|w|             (B) |w|
(C) |w|2               (D) |w|3
Answer: D
39.    Match the following:
a. Context sensitive language          i. Deterministic finite automation
b. Regular grammar                            ii. Recursive enumerable
c. Context free grammar                     iii. Recursive language
d. Unrestricted grammar                     iv. Pushdown automation
Codes:
      a   b    c   d
(A) ii    i    iv   iii
(B) iii   iv   i    ii
(C) iii   i    iv   ii
(D) ii    iv   i   iii
Answer: C
40.    The statements s1 and s2 are given as:
s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.
Which of the following is correct statement?
(A) Both s1 and s2 are correct.
(B) s1 is correct and s2 is not correct.
(C) s1 is not correct and s2 is correct.
(D) Both s1 and s2 are not correct.
Answer: B

  Part 1   Part 2 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App