UGC NET Solved Question Paper III in Computer Science and Applications { 2013 June }

2013 June UGC NET Solved Question Paper in Computer Science and Applications, Paper III

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

(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. Log arithmetic- Poisson Model iv. Maintenance

Codes:

a b c d

(A) ii i iv iii

(B) i ii iv iii

(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

(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

(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

(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

(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

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

(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

(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

(D) iii ii iv i

Answer: (-)

11.

Answer: (C)

12.

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]

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

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 bits

(B) 2,64,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

(D) All pairs of vertices in V1 are not connected by an edge

Answer: (C)

Questions: 23, 69

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

(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

(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

(D) ii iv iii i

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

(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

(D) Decibel

Answer: (D)

21. Which one of the following media is multidrop?

(A) Shielded Twisted pair cable

(B) Unshielded Twisted pair cable

(D) Fiber Optic cable

Answer: (C)

22. What is the baud rate of the standard 10 Mbps Ethernet?

(A) 10 mega baud

(B) 20 mega baud

(D) 40 mega baud

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

(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

(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

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

(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

(D) 60 times

Answer: (A)

27. Bresenham line drawing algorithm is attractive because it uses

(A) Real arithmetic only

(B) Integer arithmetic only

(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

(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

(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

(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

(D) 1024 MB

Answer: (B)

32. Arrays in C language can have _________ with reference to memory representation.

(A) n-subscripts

(B) two-subscripts

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

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

(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 propositions on left 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

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

(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

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

(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

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

(D) Both s1 and s2 are not correct.

Answer: (B)

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

(A) Register indirect

(B) Auto increment

(D) Immediate operand

Answer: (C)

42. Computers can have instruction formats with

(A) Only two address and three address instructions

(B) Only one address and two address instructions

(D) Zero address, one address, two addresses and three address instructions

Answer: (D)

43. Which is not a typical program control instruction?

(A) BR

(B) JMP

(D) TST

Answer: (C)

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

(A) Software interrupts

(B) Internal interrupt

(D) All of the above

Answer: (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')

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

Answer: (A)

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

(D) i ii iii iv

Answer: (C)

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

(D) i ii iii iv

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

(D) Results in runtime error.

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

(D) Dequeue

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

(D) o world

Answer: (Wrong question)

51. Trace the error :

void main( )

{

int *b, &a;

*b = 20

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

}

(A) No error

(B) Logical error

(D) Semantic error

Answer: (C)

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

(D) iv ii iii i

Answer: (A)

53. Binary symmetric channel uses

(A) Half duplex protocol

(B) Full duplex protocol

(D) None of the above

Answer: (A)

54. Hamming distance between 100101000110 and 110111101101 is

(A) 3

(B) 4

(D) 6

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

(D) 111000101

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

(D) 2MN

Answer: (D)

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

(A) Finite

(B) Infinite

(D) None of the above

Answer: (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 123

CPU cycle 8 495

The average turnaround time of these processes will be

(A) 19.25 milliseconds

(B) 18.25 milliseconds

(D) 18.5 milliseconds

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

(B) 7 and 6

(D) 8 and 6

Answer: (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 section 1; 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

(D) Deadlock

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

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

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

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

Answer: (A)

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

(A) Swapping

(B) Principal of Locality

(D) Thrashing

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

(D) 1 GB

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

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

Answer: (B)

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

(A) FAT-16

(B) FAT-32

(D) All of the above

Answer: (D)

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):– call(G), !, fail. not(G).

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

Answer: (B)

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

(A) Hill climbing search

(B) Best first search

(D) Depth first search

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

(D) Resolution

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

(D) 7

Answer: (D)

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

(A) Means-end analysis

(B) Constraint satisfaction

(D) Breadth first search

Answer: (B)

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

(A) Semantic network

(B) Frames

(D) Conceptual Dependency

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

(D) Concave

Answer: (C)

74. If A and B are two fuzzy sets with membership functions

Answer: (C)

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

Answer: (B)

TNPSC Master

UGC NET Solved Question Paper III in Computer Science and Applications { 2013 June }

Related Posts

Post a Comment

Labels

Popular

Followers