Tuesday 12 November 2013

UGC NET june-13 PAPER-III

1.The Software Maturity Index (SMI) is defined as SMI = [Mf – (Fa + Fc + Fd)] / M 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

2.Match the following :
(A)
a. Watson-Felix model - Cost estimation
b. Quick-Fix model - Maintenence
c.Putnam resource allocation model-Project planning
d.Logarithmetic-Poisson Model - Failure intensity

3.__________ is a process model that removes defects before they can precipitate serious hazards.
(A) Cleanroom software engineering

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)  Black-box testing

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) Good interface design

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) Software quality assurance

7.The “PROJECT” operator of a relational algebra creates a new table that has always
 (A)  Same number of rows as the original table

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 male employees in a department is more than average salary of the organization.

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

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

11.The golden ratio φ and its conjugate– φ both satisfy the equation
(A) x2 – x – 1 = 0

12.The solution of recurrence relation, T(n) = 2T(floor ( n)) + logn is
(A) O(logn log logn)

13.In any n-element heap, the number of nodes of height h is
(A) less than equal to n/[2to the power of h + 1]

14.A data file of 1,00,000 characters
contains only the characters g-l, with
the frequencies as indicated in table :
           g   h  i  j k l
Frequency  45 13 12 16 9 5
in thousand using the variable-length code by Huffman codes, the file can be encoded with
(A)  2,24,000 bits

15.A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that
(A) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

16.In a fully connected mesh network with n devices, there are ________ physical channels to link all devices.
(A) n(n–1)/2

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

18. Match the following :
(A)
a. Data link             -Node to node delivery
b. Network layer          -Routing layer
c. Transport layer       -Flow layer control
d. Application             -Mail services   

19.An image is 1024∗800 pixels with  3 bytes/pixel. Assume the image is uncompressed. How long does it take to transmit it over a 10-Mbps Ethernet ?
(A) 1.966 seconds

20.The ________ measures the relative strengths of two signals or a signal at two different points.
(A) decibel

21.Which one of the following media is multidrop ?
(A) Thick Coaxial cable

22.What is the baud rate of the standard 10 Mbps Ethernet ?
(A) 20 megabaud

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) Alternative solution

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

25.he total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is
        W1        W2         W3         W4         W5     Supply
F1        4         2         3           2         6         8
F2         5         4         5          2         1          12
F3        6        5         4          7         3       14
Demand     4        4         6          8         8
(A) 80

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

27.Bresenham line drawing algorithm is attractive because it uses
(A) Integer arithmetic only

28.The refresh rate above which a picture stops flickering and fuses into a steady image is called _________.
(A) Critical fusion frequency

29.In homogenous coordinate system (x, y, z) the points with z = 0 are called
(A) Point at infinity

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

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

32.Arrays in C language can have _________ with reference to memory representation.
(A)only one subscript

33.Refer the points as listed below :
(a) What are the precedence rules ?
(b) What are the 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), (c) and (d)

34.Horn clauses are special kinds of propositions which can be described as
(A) A single atomic proposition on left side or an empty left side.

35.Which of the following is/are the fundamental semantic model(s) of parameter passing ?
(A) all of the above

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}

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) Both s1 and s2

38.For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to
  (A) |w|3

39.Match the following :
(A)
a. Context sensitive language - Recursive language                 
b. Regular grammar               - Deterministic finite automation   
c. Context free grammar       - Pushdown automation                  
d. Unrestricted grammar       - Recursive enumerable            

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) s1 is correct and s2 is not correct.

41.Which one of the following is not an addressing mode ?
(A) Relative indexed

42.Computers can have instruction formats with
(A) zero address, one address, two address and three address instructions

43.Which is not a typical program control instruction ?
(A) SHL

44.Interrupt which arises from illegal orerroneous use of an instruction or data is
(A) Internal interrupt

45.The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is
(A) (W' + X') (Y' + Z') (X' + Z)

46.Match the following :
(A)
a. TTL        -Evolution of “diode-transistor-logic”    
b. ECL         -High speed digital circuits              
c. MOS      -High component density                      
d. CMOS     -Low power consumption                        

47.Match the following :
(A)
a. Foreign keys                 -Referential integrity
b. Private key                    -Domain constraint
c. Event control action model    -Trigger
d. Data security                -Encryption

48.When an array is passed as a parameter to a function which of the following statements is correct ?
(A) The function can change values in the original array.

49.Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation ?
(A) Doubly linked list

50.What will be the output of the
following segment of the program ?
main()
{
char *s = “hello world”;
int i = 7;
printf(“%, *s”, i, s);
}
(A)%, *s

51.Trace the error :
void main( )
{
int *b, &a;
*b = 20
printf(“%d, %d”, a, *b)
}
(A) Syntax error

52.Match the following :
a. calloc( )    -Allocates space for array 
b. free( )      -Frees previously allocated space 
c. malloc( )    -Allocates requested size of space
d. realloc( )      -Modifies previously allocated space

53.Binary symmetric channel uses
(A) Half duplex protocol

54.Hamming distance between 100101000110 and 110111101101 is
(A) 6

55.Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is
(A) 11100010101

56.The number of distinct binary images which can be generated from a given binary image of right M × N are
(A) 2to the power of MN

57.If f(x, y) is a digital image, then x, y and amplitude values of f are
(A) Finite

58.Consider the following processes with time slice of 4 milliseconds (I/O
requests are ignored) :
Process         A        B          C      D 
Arrival time     0        1        2      3
CPU cycle        8       4       9     5
The average turn around time of these processes will be
(A) 18.25 milliseconds

59.A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order :
ABACABDBACD
Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
(A) 9 and 8

60.Suppose S and Q are two semaphores
initialized to 1. P1 and P2 are two
processes which are sharing resources.
P1 has statements P2 has statements
wait(S) ;    wait(Q) ;
wait(Q) ;    wait(S) ;
critical-    critical-
section 1;    section 2;
signal(S) ;    signal(Q) ;
signal(Q) ;    signal(S) ;
Their execution may sometimes lead
to an undesirable situation called
(A) Deadlock

61.An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows :
State 1 Processes P1   P2   P3
Devices
allocated         2    3    4
State 2 Processes P1   P2   P3
Devices
allocated           0    2    4
Which of the following is correct ?
(A) State 1 is unsafe and state 2 is safe.

62.Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct ?
(A) T1 < T2

63.Working set model is used in memory management to implement the concept of
(A) Principal of Locality

64.A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry ?
(A) 16 GB

65.A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct ?
(A) OS maintains only CPU registers for each thread

66.The versions of windows operating system like windows XP and window Vista uses following file system :
(1) FAT-16
(2) FAT-32
(3) NTFS (NT File System)
(A) All of the above

67.Which one of the following is a correct implementation of the meta-predicate “not” in PROLOG (Here G represents a goal) ?
(A) not(G):– call(G), !, fail. not(G).

68.Which one of the following is not an informed search technique ?
(A) Depth first search

69.If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as
(A) Skolemization

70.Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be
(A) 7

71.The map colouring problem can be solved using which of the following technique ?
(A) Constraint satisfaction

72.Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation ?
(A) Scripts

73.If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} ––––– Then the value of μA ∪ B(x) will be
(A){0.1, 0.5, 0.4, 0.2, 0.2}

74.A fuzzy set A on R is ________ iff A(λx1 + (1 – λ)x2) ≥ min [A(x1),A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimumoperator.
(A) Convex









































































































No comments:

Post a Comment

Oracle Reserved Words

Oracle  Reserved Words The following words are reserved by Oracle. That is, they have a special meaning to Oracle and so cannot be redefi...