UGC NET Computer Science June 2013 Paper II Solutions With explanations

1. COCOMO stands for

    (A) COmposite COst MOdel

    (B) COnstructive COst MOdel

    (C) COnstructive Composite MOdel

    (D) COmprehensive Construction Model

2. Match the following:

    a. Good quality     1. Program does not fail for a specified time in a given environment

    b. Correctness     ii. Meets the functional requirements

    c. Predictable      iii. Meets both functional and non-functional requirements

    d. Reliable          iv. Process is under statistical control

     Codes:

        a   b  c  d

   (A) iii  ii   iv  i

   (B) ii   iii  iv  i  

   (C) i    ii  iv  iii

   (D) i    ii  iii  iv

3. While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to            measure which one of the following?

   ( A) Length of code

   (B) Size of software

   (C) Functionality of software

   (D) None of the above

4. A good software design must have

   (A) High module coupling, High module cohesion

   (B) High module coupling, Low module cohesion

   (C) Low module coupling, High module cohesion

   (D) Low module coupling, Low module cohesion

5. Cyclometric complexity of a flow graph G with n vertices and e edges is

    (A) V(G) = e+n-2

    (B) V(G) = e-n+2

    (C) V(G) = e+n+2

    (D) V(G) = e-n-2

6. When the following code is executed what will be the value of x and y?

     int x = l, y=0;

          y = x++;

    (A) 2,1

    (B) 2,2

    (C) 1,1

    (D) 1,2

7. How many values can be held by an array A(-1,m;1 ,m) ?

    (A) m

    (B) m²

    (C) m(m+l)

    (D) m(m+2)

8. What is the result of the expression

    (1 &2)+(3/4) ?

    (A) 1

    (B) 2

    (C) 3

    (D) 0

9. How many times the word 'print' shall be printed by the following program segment?

    for(i=1, i≤2, i++)

    for(j=1, J≤2, J++)

    for(k=l, k≤2, k++)

    printf("print/n")

    (A) I

    (B) 3

    (C) 6

    (D) 8

10. Which of the following is not a type of Database Management System?

     (A) Hierarchical

     (B) Network

     (C) Relational

     (D) Sequential

11. Manager's salary details are to be hidden from Employee Table. This Technique is called as

      (A) Conceptual level Datahiding

      (B) Physical level Datahiding

      (C) External level Datahiding

      (D) Logical level Datahiding

12. A Network Schema

      (A) restricts to one to many relationship

      (B) permits many to many relationship

      (C) stores Data in a Database

      (D) stores Data in a Relation

13. Which normal form is considered as adequate for usual database design ?

      (A) 2NF

      (B) 3NF

      (C) 4NF

      (D) 5NF

14. If D₁, D₂,…. D_n are domains in a relational model, then the relation is a table, which is a subset of

      (A) D₁+D₂+…. + D_n

      (B) D₁x D₂x… x D_n

      (C) D₁U D₂U….U D_n

      (D) D₁- D₂-….- D_n

15. Which of the following addresses is used to deliver a message to the correct application program       running on a host?

      (A) Port

      (B) IP

      (C) Logical

      (D) Physical

16. In substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.

     (A) polyalphabetic

     (B) monoalphabetic

     (C) transpositional

     (D) multialphabetic

17. In classful addressing, the IF address 190.255.254.254 belongs to

     (A) Class A

     (B) Class B

     (C) Class C

     (D) Class D

18. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy?

    (A) 10 clusters, 24 regions and 20 routers

    (B) 12 clusters, 20 regions and 20 routers

    (C) 16 clusters, 12 regions and 25 routers

     (D) 15 clusters, 16 regions and 20 routers

19. In IPv4 header, the field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to.

     (A) identification

     (B) fragment offset

     (C) time to live

     (D) header checksum

20. Given L1 = L(a*baa*) and L2 = L(ab*)

The regular expression corresponding to language L3 = Ll/L2 (right quotient) is given by

     (A) a*b

     (B) a*baa*

     (C) a*ba*

     (D) None of the above

21. Given the production rules of a grammar GI as

      S₁ à AB | aaB

      A à a | Aa

B à b

and the production rules of a grammar G2 as

S₂ à aS₂bS₂ | bS₂aS₂ | λ

Which of the following IS correct statement?

(A) G1 is ambiguous and G2 is not ambiguous.

(B) GI is ambiguous and G2 is ambiguous.

(C) GI is not ambiguous and G2 is ambiguous.

(D) GI is not ambiguous and G2 is not ambiguous.

22. Given a grammar : S1 à Sc, S àSA | A, A à aSb | ab, there is a rightmost derivation

S1 => Sc => SAC => SaSbc Thus, SaSbc is a right sentential form, and its handle is

(A) SaS

(B) bc

(C) Sbc

(D) aSb

23. The equivalent production rules corresponding to the production rules

      S à Sα₁ | Sα₂ | β₁ | β₂  is

(A) S à β₁ | β₂, A à α₁A | α₂A | λ

(B) S à β₁ | β₂ | β₁A | β₂A,

      Aà α₁A | α₂A

(C) Sàβ₁ | β₂, A à α₁A | α₂A

(D) S à β₁ | β₂ | β₁A | β₂A,

      A à α₁A | α₂A | λ

24. Given a Non-detenninistic Finite Automation (NFA) with states p and r as initial and final states respectively transItion table as given below

	a	b
p	-	q
q	r	s
r	r	s
s	r	s

The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is

(A) 5

(B) 4

(C) 3

(D) 2

25. Which is the correct statement(s) for Non Recursive predictive parser?

S1: First(α) = {t | α => * t β for some string β } => *tβ

S2: Follow(X) = { a | S => * αXa β for some strings α and β }

(A) Both statements S1 and S2 are incorrect.

(B) S1 is incorrect and 52 IS correct.

(C) S1 is correct and S2 IS incorrect.

(D) Both statements S I and S2 are correct. 

26. Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is
(A) Atmost  1/α 1n (1-α/α) 

(B) Atmost  1/α 1n (1/1-α)

(C) Atleast  1/α 1n (1/1-α)

(D) Atleast  1/α 1n (α/1-α)

27. For a B-tree of height h and degree t, the total CPU time used to insert a node is

(A) O(h log t)

(B) O(t log h)

(C) O(t_²h)

(D) O(th)

28. The time complexity to build a heap with a list of n numbers is

(A) O(log n)

(B) O(n)

(C) O(n log n)

(D) O(n²)

29. The value of postfix expression:

     8 3 4 + - 3 8 2 / + * 2 $ 3+ is

(A) 17

(B) 131

(C) 64

(D) 52

30. Consider the following statements for priority queue:

S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct?

(A) Both S1 and S2 are incorrect.

(B) S1 is correct and S2 is incorrect.

(C) SI is incorrect and S2 is correct.

(D) Both S1 and S2 are correct.

31. Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as

(A) Data mining

(B) Meta data

(C) Data warehousing

(D) Database

32. The task of correcting and pre processing data is called as

(A) Data streaming

(B) Data cleaning

(C) Data mining

(D) Data storming

33. Using data p=3, q=11, n=pq, d=7  in RSA algorithm find the cipher text of the given plain text SUZANNE

(A) BUTAEEZ

(B) SUZANNE

(C) XYZABCD

(D) ABCDXYZ

34. The relation "divides" on a set of positive integers is _________

(A) Symmetric and transitive

(B) Anti symmetric and transitive

(C) Symmetric only

(D) Transitive only

35. Give as good a big-Q estimate as possible for the following functions:

(nlogn+n²)(n³+2) and (n!+2ⁿ) (n³+log(n²+ 1))

(A) O(n⁵+2n²) & O(n³*n!)

(B) O(n⁵) & O(n³*2 ⁿ)

(C) O(n⁵) & O(n³* n!)

(D) O(n⁵+2n²) & O(n³*2 ⁿ)

36. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.

(A) ¹⁰⁰_P2    (B) ¹⁰⁰_C2     (C) 2100     (D) 3¹⁰⁰ 

37. Which of the following connected simple graph has exactly one spanning tree?

(A) Complete graph

(B) Hamiltonian graph

(C) Euler graph

(D) None of the above

38. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

(A) M+N-C

(B) M-N-C

(C) M-N+C

(D) M+N+C

39. Which of the following shall be a compound proposition involving the propositions p, q and r. that is true when exactly two of the p. q and rare true and is false otherwise?

(A) (p∨q∧˥r) ∨ (p∨q∧r)  ∧ (˥p∧q∨r)

(B) (p∧q∨r)   ∧ (p∧q∧r)  ∨ (˥q∨˥p∧˥r)

(C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)

(D) (p∨r∧q)  ∨ (p∧q∧r)   ∨ (˥p∧q∧r) 

40. The truth value of the statements:

∃!xP(x) à ∃xP(x) and ∃!x˥P(x) à ˥∀xP(x), (where the notation ∃!xP(x) denotes the proposition "There exists a unique x such that P(x) is true'') are :

(A) True and False

(B) False and True

(C) False and False

(D) True and True

41. How many different Boolean functions of degree 4 are there?

(A) 2^4

(B) 2^8

(C) 2^12

(D) 2^16

42. A Boolean operator Ө  is defined as follows:

1 Ө 1 =1, 1 Ө 0 = 0, 0 Ө 1= 0 and 0 Ө 0 = 1

What will be the truth value of the expression (x Ө y) Ө z = x Ө (y Ө z)?

(A) Always false

(B) Always true

(C) Sometimes true

(D) True when x, y, z are all true

43. Which one of the following IS decimal value of a signed binary number 1101010, if it IS in  2's complement form ?

(A) -42

(B) - 22

(C) - 21

(D) -106

44. A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pairwise basis; that is

      P1 || P2 || P3 || ..... || Pk if and only if:

(A) Pi || Pj for all i ≠ j

(B) Pi || Pj for all i = j+1

(C) Pi || Pj for all i ≤ j

(D) Pi || Pj for all i ≥ j

45. When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______

(A) handoff

(B) mobile switching

(C) mobile routing

(D) cell switching

46. A virtual memory based memory management algorithm partially swaps out a process. This is an example of

(A) short term scheduling

(B) long term scheduling

(C) medium term scheduling

(D) mutual exclusion

47. Assuming that the disk head IS located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124,65,67 :

(A) 310

(B) 324

(C) 320

(D) 321

48. Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ?

(A) 21 ns

(B) 23 ns

(C) 30 ns

(D) 31 ns

49. Consider the following UNIX command:

sort <in> temp; head -30 <temp; rm temp

Which of the following functions shall be performed by this command?

(A) Sort, taking the input from "temp", prints 30 lines from temp and delete the file temp

(B) Sort the file "temp", removes 30 lines from temp and delete the file temp

(C) Sort, taking the input from "in" and writing the output to "temp" then prints 30 lines from temp on terminal. Finally "temp" is removed.

(D) Sort, taking the input from '1emp" and then prints 30 lines from "temp" on terminal. Finally "temp" is removed.

50. The mv command changes

(A) the inode

(B) the inode-number

(C) the directory entry

(D) both the directory entry and the inode

UGC CS JUNE 2013  PAPER III 

1. The Software Maturity Index (SMI) is defined as
SMI = [M_f -(F_a + F_c + F_d )] / M_f   Where 
M_f  = the number of modules in the current release.
F_a  = the number of modules in the current release that have been added.
F_c  = the number of modules in the current release that have been changed.
F_d = 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

2. Match the following:
a. Watson- Felix model intensity                        i. Failure
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

3. ________is a process model that removes defects before they can precipitate serious hazards.
(A) Incremental model
(B) Spiral model
(C) Clean room software engineering
(D) Agile model

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 amIy testing
(D) Stress 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) User satisfaction
(B) Good interface design
(C) Saving system's resources
(D) None of these

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

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

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.

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 INF not in 2NF
(B) In 2NF not in 3NF
(C) In 3NF
(D) In INF

10. Match the following:
a. RAID 0          i. Bit interleaved parity
b. RAID 1         ii. Non nedundant 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
11. The golden ratio φ and its conjugate  φ both satisfy the equation
(A) x³-x-l = 0
(B) x³+x-l = 0    
(C) x²-x-l = 0
(D) x²+x-l = 0

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)

13. In any n-clement 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]

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 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 hits

(8) 2,64,000 bits

(C) 2,46,000 hits

(D) 2,24,000 bits

15. A vertex cover of an undirected graph G(V, E) is a subset V₁ ⊆ V vertices such that
(A) Each pair of vertices in  V₁connected by an edge
(B) If (u, v) ∈ E then u ∈  V₁ and v ∈ V₁
(C) If (u, v) ∈ E then u ∈ V₁ or v ∈ V₁
(D) All pairs of vertices in V₁ are not connected by an edge

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

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

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

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

20. The ______ measures the relative strengths of two signals or a signal at two different points.
(A) frequency
(B) attenuation
(C) throughput
(D) decibel

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

22. What is the baud rate of the standard 10 Mbps Ethernet?
(A) 10 megabaud (B) 20 megabaud
(C) 30 megabaud (D) 40 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) Degenerate solution
(B) Unbounded solution
(C) Alternative solution
(D) Optimal 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
(B) non-degenerate
(C) unbounded
(D) unbalanced

25. The 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) 76       (B) 80  (C) 90       (D) 96

26. An actor in an animation is a small  program invoked _______ per frame to detennine the characteristics of some object in the animation.
(A) once    (B) twice      (C) 30 times       (D) 60 times

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

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

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

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 x 8 MB
(B) n/ 8MB
(C) (1024x 1024)/8MB
(D) 1024MB

31. 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

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)

34. Hom 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.

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
36. The grammar with production rules 

S à aSb|SS|_λ    generates language L given by :

(A) L = {w ∈{a,b}*| n_a (w)= n_b (w) and n_a (v) ≥ n_b (v) where v is any prefix of w}

(B) L = {w ∈{a,b}*| n_a (w)= n_b (w) and n_a (v) ≤ n_b (v) where v is any prefix of w} 

(C) L = {w ∈{a,b}*| n_a (w)≠ n_b (w) and n_a (v) ≥ n_b (v) where v is any prefix of w} 

(D) L = {w ∈{a,b}*| n_a (w)≠n_b (w) and n_a (v) ≤ n_b (v) where v is any prefix of w}

37. A pushdown automation M = (Q, Σ, Γ, δ, q_{0, z,}  F) is a set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a∈Σ U{ _λ } and b ∈Γ  

(s1) δ(q, a_, b) contains at most  one element

(s2) if δ(q, _λ, b) is not empty than δ(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

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

(A) |n|w|       (B) |w|        (C) |w|²        (D) |w|³ 

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   iii

(C)   iii  i   iv   iii

(D)   ii   iv  i    iii

  40. The statements s1 and s2 are given as :
sl : 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) sl is not correct and s2 is correct.
(D) Both s1 and s2 are not correct.

41. Which one of the following is not an addressing mode?
(A) Register indirect
(B) Autoincrement
(C) Relative indexed
(D) Immediate operand

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

43. Which is not a typical program control instruction?
(A) BR   (B) JMP    (C) SHL      (D) TST

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 ofthe above

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)

46. Match the following:
a. TTL          i  High component density
b. ECL         ii Low power consumption
c. MOS        iii Evolution of  "diode-transistor-logic"
d.CMOS      iv High speed digital circuits

codes:

        a   b    c   d

(A)   iii   ii    i    iv

(B)   i    iv    i    ii

(C)   iii  iv   iv   ii

(D)   i   ii    iii    iv

47. Match the following:
a. Foreign keys                                  i. Domain constraint
b. Private key                                    ii. Referential integrity
c. Event control action model             iii. Encryption
d. Data security                                 iv. Trigger

codes:

        a   b    c   d

(A)   iii   ii    i    iv

(B)   ii    i    iv   iii

(C)   iii  iv    i    ii

(D)   i   ii    iii    iv

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

49. Suppose you want todelete 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

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

51. Trace the error:
void main()
(
int  *b, &a;
 *b=20
printf("%d, o/od", a, *b)
}
(A) No error
(B) Logical error
(C) Syntax error
(D) Semantic error

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

codes:

        a   b    c   d

(A)   iii   i    iv    ii

(B)   iii    ii    i    iv

(C)   iii  iv    i    ii

(D)   iv   ii    iii    i

53. Binary symmetric channel uses
(A) Half duplex protocol
(B) Full duplex protocol
(C) Bit otiented protocol
(D) None ofthe above

54. Hamming distance between 100101000110 and 110111101101 is
(A) 3    (B) 4   (C) 5     (D) 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        (B) 11100010100          (C) 1110001010         (D) 111000101

56. The number of distinct binary images which can be generated from a given binary image oftight M x N are
(A) M + N       (B) M x N         (C) 2^M+N          (D) 2^MN

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 ofthe above

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 tum around time of these processes will be
(A) 19.25 milliseconds
(B) 18.25 milliseconds
(C) 19.5 milliseconds
(D) 18.5 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 mam 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

60. Suppose S and Q are two semaphores initialized to 1. PI 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-
section1;                                        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
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 I          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 I is safe and state 2 is unsafe.
(C) Both, state I and state 2 are safe.
(D) Both, state I and state 2 are unsafe.

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

63. Working set model ii used in memory management to implement the concept of
(A) Swapping
(B) Principal of Locality
(C) Segmentation
(D) Thrashing

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

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.

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

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).
(B) not(G):- cal1(G), !, fail.not(G).
(C) not(G):- cal1(G), fail, !. not(G).
(D) not(G):- cal1(G), fail. not(G):- !.

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

69. If we convert
∃u ∀v ∀x ∃y (Pf(u),v,x,y) --->  Q(u,v,y)) to ∀v ∀x (Pf(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

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 mlntrnum number of states to measure 4 litres water will be
(A) 3 (B) 4  (C) 5 (D) 7

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

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

73. A fuzzy set A on R is ________ iff A(λx₁ + (1- λ)x₂) ≥  min [A(x₁),A(x₂)]
for all x1, x2 ∈R and all λ ∈ [0,1], where min denotes the minimum operator

(A)Support

(B)α-cut
(C)Convex 
(D)Concave

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  μAUB(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}

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