Paper 3 has been removed from NET from 2018 (Notification)- now paper 2 and 3 syllabus is included in paper 2. Practice both paper 2 and 3 from past papers.

# NTA NET Computer-Science June-2013 Solved 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

1. SMI approaches 1

2. SMI approaches 0

3. SMI approaches –1

4. None of the above

2. Match the following:

 List-I List-II Watson-Felix model Quick-Fix model Putnam resource allocation model Log arithmetic-Poisson Model Failure intensity Cost estimation Project planning Maintenance
• A
• B
• C
• D
• 2
• 1
• 4
• 3
• 1
• 2
• 4
• 3
• 2
• 1
• 3
• 4
• 2
• 4
• 3
• 1

3. __________ is a process model that removes defects before they can precipitate serious hazards.

1. Incremental model

2. Spiral model

3. Cleanroom software engineering

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

1. White-box testing

2. Black-box testing

3. Orthogonal array testing

4. Stress testing

5. The following three golden rules:

1. Place the user in control

2. Reduce the user's memory load

3. Make the interface consistent are for

1. User satisfaction

2. Good interface design

3. Saving system's resources

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

1. Risk mitigation, monitoring and management

2. Software quality assurance

3. Software cost estimation

4. Defect removal efficiency

7. The “PROJECT” operator of a relational algebra creates a new table that has always

1. More columns than columns in orginal table

2. More rows than original table

3. Same number of rows as the original table

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

1. Average salary of employee more than average salary of the organization.

2. Average salary less than average salary of the organization.

3. Average salary of employee equal to average salary of the organization.

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

1. In 1NF not in 2NF

2. In 2NF not in 3NF

3. In 3NF

4. In 1NF

10. Match the following:

 List-I List-II RAID 0 RAID 1 RAID 2 RAID 3 Bit interleaved parity Non redundant stripping Mirrored disks Error correcting codes
• A
• B
• C
• D
• 4
• 1
• 2
• 3
• 3
• 4
• 1
• 2
• 3
• 1
• 4
• 2
• 3
• 2
• 4
• 1

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

1. less than equal to [n/2h]

2. greater than [n/2h]

3. greater than [n/2h + 1]

4. less than equal to [n/2h + 1]

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

1. 2, 52, 000 bits

2. 2, 64, 000 bits

3. 2, 46, 000 bits

4. 2, 24, 000 bits

13. A vertex cover of an undirected graph G (V, E) is a subset V1 ⊆ V vertices such that

1. Each pair of vertices in V1 is connected by an edge

2. If (u, v) ∈ E then u ∈ V1 and v ∈ V1

3. If (u, v) ∈ E then u ∈ V1 or v ∈ V1

4. All pairs of vertices in V1 are not connected by an edge

Questions: 23, 69

14. In a fully connected mesh network with n devces, there are ________ physical channels to link all devices.

1. n (n–1)/2

2. n (n + 1)/2

3. 2n

4. 2n + 1

15. 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 ________.

1. 3600

2. 100

3. 6/600

4. None of the above

16. Match the following:

 List-I List-II Data link layer Network layer Transport layer Application layer Flow control Node to node delivery Mail services Routing
• A
• B
• C
• D
• 2
• 1
• 4
• 3
• 2
• 4
• 1
• 3
• 2
• 1
• 3
• 4
• 2
• 4
• 3
• 1

17. 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?

1. 196.6 seconds

2. 19.66 seconds

3. 1.966 seconds

4. 0.1966 seconds

18. The ________ measures the relative strengths of two signals or a signal at two different points.

1. Frequency

2. Attenuation

3. Throughput

4. Decibel

19. Which one of the following media is multidrop?

1. Shielded Twisted pair cable

2. Unshielded Twisted pair cable

3. Thick Coaxial cable

4. Fiber Optic cable

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

1. 10 mega baud

2. 20 mega baud

3. 30 mega baud

4. 40 mega baud

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

1. Degenerate solution

2. Unbounded solution

3. Alternative solution

4. Optimal solution

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

1. Degenerate

2. Non-degenerate

3. Unbounded

4. Unbalanced

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

1. 76

2. 80

3. 90

4. 96

24. An actor in an animation is a small program invoked _______ per frame to determine the characteristics of some object in the animation.

1. Once

2. Twice

3. 30 times

4. 60 times

25. Bresenham line drawing algorithm is attractive because it uses

1. Real arithmetic only

2. Integer arithmetic only

3. Floating point arithmetic

4. Real and integer arithmetic

26. The refresh rate above which a picture stops flickering and fuses into a steady image is called _________.

1. Crucial fusion frequency

2. Current frequency fusion

3. Critical fusion frequency

4. Critically diffused frequency

27. In homogenous coordinate system (x, y, z) the points with z = 0 are called

1. Cartesian points

2. Parallel points

3. Origin point

4. Point at infinity

28. If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is

1. 40 line-pairs per inch

2. 80 line-pairs per inch

3. 1600 lines per inch

4. 40 lines per inch

29. Images tend to be very large collecton 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

1. n × 8 MB

2. n/8 MB

3. (1024 × 1024)/8 MB

4. 1024 MB

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

1. n-subscripts

2. two-subscripts

3. Only one subscript

4. Three subscripts only

31. Refer the points as listed below:

1. What are the operator precedence rules?

2. What are the operator associativity rules?

3. What is the order of operand evaluation?

4. Are there restrictions on operand evaluation side effects?

Which of the above must be considered as primary design issues for arithmetic expressions?

1. 1, 2 and 3

2. 1, 3 and 4

3. 1, 2 and 4

4. 1, 2, 3 and 4

32. Horn clauses are special kinds of propositions which can be described as

1. Single atomic proposition on left side.

2. Single or multiple atomic propositions on left side.

3. A single atomic proposition on left side and a single atomic proposition on right side.

4. A single atomic proposition on left side or an empty left side.

33. Which of the following is/are the fundamental semantic model (s) of parameter passing?

1. In mode

2. Out mode

3. in-out mode

4. all of the above

34. The grammar with production rules S → aSb |SS|λ generates language L given by:

1. L = {w∈ {a, b} * | na (w) = nb (w) and na (v) ≥ nb (v) where v is any prefix of w}

2. L = {w∈ {a, b} * | na (w) = nb (w) and na (v) ≤ nb (v) where v is any prefix of w}

3. L = {w∈ {a, b} * | na (w) ≠ nb (w) and na (v) ≥ nb (v) where v is any prefix of w}

4. L = {w∈ {a, b} * | na (w) ≠ nb (w) and na (v) ≤ nb (v) where v is any prefix of w}

35. 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 ∈ σ

1. Only s1

2. Only s2

3. Both s1 and s2

4. Neither s1 nor s2

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

1. ln|w|

2. |w|

3. |w|2

4. |w|3

37. Match the following:

 List-I List-II Context sensitive language Regular grammar Context free grammar Unrestricted grammar Deterministic finite automation Recursive enumerable Recursive language Pushdown automation
• A
• B
• C
• D
• 2
• 1
• 4
• 3
• 3
• 4
• 1
• 2
• 3
• 1
• 4
• 2
• 2
• 4
• 1
• 3

38. 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?

1. Both s1 and s2 are correct.

2. s1 is correct and s2 is not correct.

3. s1 is not correct and s2 is correct.

4. Both s1 and s2 are not correct.

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

1. Register indirect

2. Auto increment

3. Relative indexed

4. Immediate operand

40. Computers can have instruction formats with

41. Which is not a typical program control instruction?

1. BR

2. JMP

3. SHL

4. TST

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

1. Software interrupts

2. Internal interrupt

3. External interrupts

4. All of the above

43. The simplified function in product of sums of Boolean function F (W, X, Y, Z) = σ (0, 1, 2, 5, 8, 9, 10) is

1. (W ‘+ X’ ) (Y ‘+ Z’ ) (X' + Z)

2. (W ‘+ X’ ) (Y ‘+ Z’ ) (X ‘+ Z’ )

3. (W ‘+ X’ ) (Y ‘+ Z) (X’ + Z)

4. (W ‘+ X’ ) (Y + Z ‘) (X’ + Z)

44. Match the following:

 List-I List-II TTL ECL MOS CMOS High component density Low power consumption Evolution of “diode transistor-logic” High speed digital circuits
• A
• B
• C
• D
• 3
• 2
• 1
• 4
• 1
• 4
• 3
• 2
• 3
• 4
• 1
• 2
• 1
• 2
• 3
• 4

45. Match the following:

 List-I List-II Foreign keys Private key Event control action model Data security Domain constraint Referential integrity Encryption Trigger
• A
• B
• C
• D
• 3
• 2
• 1
• 4
• 2
• 1
• 4
• 3
• 3
• 4
• 1
• 2
• 1
• 2
• 3
• 4

46. When an array is passed as a parameter to a function which of the following statements is correct?

1. The function can change values in the original array.

2. The function cannot change values in the original array.

3. Results in compilation error.

4. Results in runtime error.

47. 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?

4. Dequeue

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

1. Syntax error

2. hello w

3. hello

4. o world

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

1. No error

2. Logical error

3. Syntax error

4. Semantic error

50. Match the following:

 List-I List-II calloc () free () malloc () realloc () Frees previously allocated space Modifies previously allocated space Allocates space for array Allocates requested size of space
• A
• B
• C
• D
• 3
• 1
• 4
• 2
• 3
• 2
• 1
• 4
• 3
• 4
• 1
• 2
• 4
• 2
• 3
• 1

51. Binary symmetric channel uses

1. Half duplex protocol

2. Full duplex protocol

3. Bit oriented protocol

4. None of the above

52. Hamming distance between 100101000110 and 110111101101 is

1. 3

2. 4

3. 5

4. 6

53. Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is

1. 11100010101

2. 11100010100

3. 1110001010

4. 111000101

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

1. M + N

2. M × N

3. 2M + N

4. 2MN

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

1. Finite

2. Infinite

3. Neither finite nor infinite

4. None of the above

56. Consider the following processes with tme 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

1. 19.25 milliseconds

2. 18.25 milliseconds

3. 19.5 milliseconds

4. 18.5 milliseconds

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

1. 9 and 7

2. 7 and 6

3. 9 and 8

4. 8 and 6

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

1. Starvation

2. Race condition

59. 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?

1. State 1 is unsafe and state 2 is safe.

2. State 1 is safe and state 2 is unsafe.

3. Both, state 1 and state 2 are safe.

4. Both, state 1 and state 2 are unsafe.

60. 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?

1. T1 < T2

2. T1 > T2

3. T1 = T2

4. Nothing can be said about the relation between T1 and T2

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

1. Swapping

2. Principal of Locality

3. Segmentation

4. Thrashing

62. 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?

1. 30 GB

2. 64 GB

3. 16 GB

4. 1 GB

63. 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?

1. OS maintains only scheduling and accounting information for each thread.

2. OS maintains only CPU registers for each thread.

3. OS does not maintain a separate stack for each thread.

4. OS does not maintain virtual memory state for each thread.

64. 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)

4. All of the above

65. Which one of the following is a correct implementation of the meta-predicate “not” in PROLOG (Here G represents a goal)?

1. not (G): – call (G), fail. Not (G).

2. not (G): – call (G), fail. Not (G).

3. not (G): – call (G), fail, Not (G).

4. not (G): – call (G), fail. Not (G): –

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

1. Hill climbing search

2. Best first search

3. A * search

4. Depth first search

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

1. Simplification

2. Unification

3. Skolemization

4. Resolution

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

1. 3

2. 4

3. 5

4. 7

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

1. Means-end analysis

2. Constraint satisfaction

3. AO * search

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

1. Semantic network

2. Frames

3. Scripts

4. Conceptual Dependency

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

1. Support

2. α-cut

3. Convex

4. Concave