ComputerSciencepaper III june-2013

UGC NET Previous Year Papers


Paper III  – June-2013

1.    The Software Maturity Index (SMI) is defined as

SMI = [Mf – (Fa + Fc + Fd)] / Mf


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

Ans: (A)


2. Match the following:

a. Watson- Felix model

b. Quick-Fix model

c. Putnam resource allocation model

d. Logarithmetic-Poisson Model

i. Failure intensity

ii. Cost estimation

iii. Project planning

iv. Maintenance


           a        b          c          d

(A)      ii         i          iv         iii

(B)      i         ii          iv         iii

(C)      ii        i          iii         iv

(D)      ii        iv         iii          i

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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.

Ans: (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

Ans: (A)


10. Match the following:

a. RAID 0

b. RAID 1

c. RAID 2

d. RAID 3

i. Bit interleaved parity

ii. Non redundant stripping

iii. Mirrored disks

iv. Error correcting 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

Ans: (Marks given to all)


11. The golden ratio  φ and its conjugate φ bar both satisfy the equation

(A) x3 – x – 1 = 0                      

(B) x3 + x – 1 = 0

(C) x2 – x – 1 = 0                     

(D) x2 + x – 1 = 0

Ans: (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)

Ans: (D)


13. In any n-element heap, the number of nodes of height h is

(A) less than equal to [n/(2)h]

(B) greater than [n/(2)h]

(C) greater than [n/(2)h+1]

(D) less than equal to [n/(2)h+1]

Ans: (D)


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
in thousand
45 13 12 16 9 5

 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

Ans: (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

Ans: (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

Ans: (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

Ans: (A)


18. Match the following:

a. Data link layer

b. Network layer

c. Transport layer  

d. Application layer

i. Flow control

ii. Node to node delivery

iii. Mail services

iv. Routing


           a        b          c          d

(A)      ii         i          iv         iii

(B)      ii        iv          i          iii

(C)      ii         i          iii         iv

(D)      ii        iv         iii          i

Ans: (B)


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) 196.6 seconds                  

(B) 19.66 seconds

(C) 1.966 seconds                  

(D) 0.1966 seconds

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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

Ans: (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)

Ans: (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.

Ans: (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

Ans: (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}

Ans: (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

Ans: (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

Ans: (D)


39. Match the following:

a. Context sensitive language

b. Regular grammar

c. Context free grammar

d. Unrestricted grammar

i. Deterministic finite automation

ii. Recursive enumerable

iii. Recursive language

iv. Pushdown automation


              a        b          c          d

(A)        ii         i          iv         iii

(B)        iii       iv          i          ii

(C)        iii        i          iv         ii

(D)        ii        iv          i          iii

Ans: (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.

Ans: (B)


41. Which one of the following is not an addressing mode?

(A) Register indirect   

(B) Auto increment

(C) Relative indexed  

(D) Immediate operand

Ans: (C)


42. Computers can have instruction formats with

(A) only two address and three address instructions

(B) only one address and two address instructions

(C) only one address, two address and three address instructions

(D) zero address, one address, two address and three address instructions

Ans: (D)


43. Which is not a typical program control instruction?

(A) BR 


(C) SHL 


Ans: (C)


44. Interrupt which arises from illegal or erroneous use of an instruction or data is

(A) Software interrupt            

(B) Internal interrupt

(C) External interrupt             

(D) All of the above

Ans: (B)


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)

(B) (W’ + X’) (Y’ + Z’) (X’ + Z’)

(C) (W’ + X’) (Y’ + Z) (X’ + Z)

(D) (W’ + X’) (Y + Z’) (X’ + Z)

Ans: (A)


46. Match the following:

a. TTL

b. ECL

c. MOS


i. High component density

ii. Low power consumption

iii. Evolution of “diodetransistor-logic”

iv. High speed digital circuits


               a        b          c          d

(A)         iii       ii           i          iv

(B)          i        iv         iii         ii

(C)         iii       iv          i          ii

(D)         i        ii          iii         iv

Ans: (C)


47. Match the following:

a. Foreign keys

b. Private key

c. Event control action model

d. Data security

i. Domain constraint

ii. Referential integrity

iii. Encryption

iv. Trigger


            a        b          c          d

(A)       iii       ii           i          iv

(B)       ii        i           iv         iii

(C)       iii       iv          i          ii

(D)       i        ii          iii         iv

Ans: (B)


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.

(B) The function cannot change values in the original array.

(C) Results in compilation error.

(D) Results in runtime error.

Ans: (A)


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) Circular linked list

(B) Doubly linked list

(C) Linked list              

(D) Dequeue

Ans: (B)


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) Syntax error           

(B) hello w

(C) hello                                   

(D) o world

Ans: (Marks given to all)


51. Trace the error:

void main( )


int *b, &a;

*b = 20

printf(“%d, %d”, a, *b)


(A) No error                  

(B) Logical error

(C) Syntax error          

(D) Semantic error

Ans: (C)


52. Match the following:

a. calloc( )

b. free( )

c. malloc( )

d. realloc( )

i. Frees previously allocated space

ii. Modifies previously allocated space

iii. Allocates space for array

iv. Allocates requested size of space


            a        b          c          d

(A)       iii        i          iv         ii

(B)        iii       ii           i          iv

(C)       iii       iv          i          ii

(D)       iv       ii          iii          i

Ans: (A)


53. Binary symmetric channel uses

(A) Half duplex protocol        

(B) Full duplex protocol

(C) Bit oriented protocol        

(D) None of the above

Ans: (A)


54. Hamming distance between 100101000110 and 110111101101 is

(A) 3      

(B) 4

(C) 5      

(D) 6

Ans: (D)


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        

(B) 11100010100

(C) 1110001010          

(D) 111000101

Ans: (A)


56. The number of distinct binary images which can be generated from a given binary image of right M × N are

(A) M + N          

(B) M × N

(C) 2M + N           

(D) 2MN

Ans: (D)


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

(A) Finite                                  

(B) Infinite

(C) Neither finite nor infinite

(D) None of the above

Ans: (A)


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) 19.25 milliseconds                       

(B) 18.25 milliseconds

(C) 19.5 milliseconds             

(D) 18.5 milliseconds

Ans: (B)


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:


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 7       

(B) 7 and 6

(C) 9 and 8       

(D) 8 and 6

Ans: (C)


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 section1;                       critical section 2;

 signal(S) ;                                 signal(Q) ;

   signal(Q) ;                                 signal(S) ;

Their execution may sometimes lead to an undesirable situation called

(A) Starvation              

(B) Race condition

(C) Multithreading      

(D) Deadlock

Ans: (D)


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.

(B) State 1 is safe and state 2 is unsafe.

(C) Both, state 1 and state 2 are safe.

(D) Both, state 1 and state 2 are unsafe.

Ans: (A)


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

(B) T1 > T2

(C) T1 = T2

(D) Nothing can be said about the relation between T1 and T2.

Ans: (A)


63. Working set model is used in memory management to implement the concept of

(A) Swapping              

(B) Principal of Locality

(C) Segmentation       

(D) Thrashing

Ans: (B)


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) 30 GB         

(B) 64 GB

(C) 16 GB         

(D) 1 GB

Ans: (C)


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 scheduling and accounting information for each thread.

(B) OS maintains only CPU registers for each thread.

(C) OS does not maintain a separate stack for each thread.

(D) OS does not maintain virtual memory state for each thread.

Ans: (B)


66. The versions of windows operating system like windows XP and window Vista uses following file system:

(A) FAT-16                               

(B) FAT-32

(C) NTFS (NT File System)   

(D) All of the above

Ans: (D)


67. Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?

(A)  not(G):– !, call(G), fail.


(B)  not(G):– call(G), !, fail.


(C)  not(G):– call(G), fail, !.


(D) not(G):– call(G), fail.

 not(G):– !.

Ans: (B)


68. Which one of the following is not an informed search technique?

(A) Hill climbing search         

(B) Best first search

(C) A* search                           

(D) Depth first search

Ans: (D)


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) Simplification        

(B) Unification

(C) Skolemization       

(D) Resolution

Ans: (C)


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) 3      

(B) 4

(C) 5      

(D) 7

Ans: (D)


71. The map colouring problem can be solved using which of the following technique?

(A) Means-end analysis        

(B) Constraint satisfaction

(C) AO* search                        

(D) Breadth first search

Ans: (B)


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

(A) Semantic network

(B) Frames

(C) Scripts                    

(D) Conceptual Dependency

Ans: (C)


73. 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 minimum operator.

(A) Support      

(B) α-cut

(C) Convex      

(D) Concave

Ans: (C)


74. 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 μ(AB) (x) will be

(A) {0.9, 0.5, 0.6, 0.8, 0.8}

(B) {0.6, 0.2, 0.1, 0.7, 0.5}

(C) {0.1, 0.5, 0.4, 0.2, 0.2}

(D) {0.1, 0.5, 0.4, 0.2, 0.3}

Ans: (C)


75. Consider a single perception with weights as given in the following figure:

The above perception can solve

(A) OR problem           

(B) AND problem

(C) XOR problem        

(D) All of the above

Ans: (B)