COMPUTER SCIENCE & APPLICATIONS

Paper – III

Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory.

1. If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have

(A) feasible solution

(B) alternative solution

(D) no bounded solution at all

Ans: (C)

2. Given the problem to maximize f(x), X = (x₁, x₂,……x_n)

Ans: (D)

3. The following Linear Programming problem has :

(A) Feasible solution

(B) No feasible solution

(D) Single point as solution

Ans: (B)

4. Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be

(A) 4, 5

(B) 5, 4

(D) 13, 8

Ans: (B)

5. Function points can be calculated by

(A) UFP ∗ CAF

(B) UFP ∗ FAC

(D) UFP ∗ Productivity

Ans: (A)

6. Match the following :

Ans: (B)

7. A process which defines a series of tasks that have the following four primary objectives is known as

1. to identify all items that collectively define the software configuration.

2. to manage changes to one or more of these items.

3. to facilitate the construction of different versions of an application.

4. to ensure that software quality is maintained as the configuration evolves over time.

(A) Software Quality Management Process

(B) Software Configuration Management Process

(D) Software Change Management Process

Ans: (B)

8. One weakness of boundary value analysis and equivalence partitioning is

(A) they are not effective.

(B) they do not explore combinations of input circumstances.

(D) none of the above.

Ans: (B)

9. Which once of the following is not a software myth ?

(A) Once we write the program and get it to work, our job is done.

(B) Project requirements continually change, but change can be easily accommodated because software is flexible.

(D) If an organization does not understand how to control software projects internally, it will invariably struggle when it outsources software projects.

Ans: (D)

10. Match the following with respect to relationship between objects and classes :

Ans: (A)

11. Match the following style rules for reusability :

Ans: (A)

12. Which is the protocol for performing RPCs between applications in a language and system independent way ?

(A) Hyper Text Transmission Protocol (HTTP)

(B) Simple Network Management Protocol (SNMP)

(D) Simple Mail Transfer Protocol (SMTP)

Ans: (C)

13. The document that is used by XSLT to indicate, how to transform the elements of the XML document to another format is

(A) HTML page

(B) DOC type procedure

(D) Stored procedure

Ans: (C)

14. Which of the following concepts means adding new concepts to a program as it runs ?

(A) Data hiding

(B) Dynamic loading

(D) Dynamic binding

Ans: (B)

15. Which of the following correctly describes overloading of functions ?

(A) Virtual polymorphism

(B) Transient polymorphism

(D) Pseudo polymorphism

Ans: (C)

16. Match the following with respect to programming languages :

Ans: (A)

17. The compiler converts all operands upto the type of the largest operand is called

(A) Type Promotion

(B) Type Evaluation

(D) Type Declaration

Ans: (A)

18. C++ actually supports the following two complete dynamic systems :

(A) One defined by C++ and the other not defined by C.

(B) One defined by C and one specific to C++

(D) Both of them are improvements of C

Ans: (B)

19. Important advantage of using new and delete operators in C++ is

(A) Allocation of memory

(B) Frees the memory previously allocated

(D) Allocation of memory and frees the memory previously allocated.

Ans: (D)

20. Match the following control strategies of prolog :

Ans: (A)

21. Given the following statements :
S₁ : The grammars S → asb | bsa | ss | a and S → asb | bsa | a are not equivalent.

S2 : The grammars S → ss | sss | asb | bsa | λ and S → ss | asb | bsa | λ are equivalent.

Which of the following is true ?

(A) S₁ is correct and S₂ is not correct.

(B) Both S₁ and S₂ are correct.

(D) Both S₁ and S₂ are not correct.

Ans: (B)

22. What are the final values of Q₁ and Q₀after 4 clock cycles, if initial values are 00 in the sequential circuit shown
below :

(A) 11

(B) 10

(D) 00

Ans: (D)

23. High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences ?

(A) Morphological

(B) Syntactic

(D) Pragmatic

Ans: (D)

24. The objective of ________ procedure is to discover at least one ________ that causes two literals to match.

(A) unification, validation

(B) unification, substitution

(D) minimax, maximum

Ans: (B)

25. If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if

(A) h* is equal to h

(B) h* overestimates h

(D) none of these

Ans: (C)

26. The mean-end analysis process centers around the detection of differences between the current state and goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator can not be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the
precondition of operators is called

(A) backward planning

(B) goal stack planning

(D) operator overloading

Ans: (C)

27. In alpha-beta pruning, _________ is used to cut off the search at maximizing level only and _________ is used to cut off the search at minimizing level only.

(A) alpha, beta

(B) beta, alpha

(D) beta, beta

Ans: (B)

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

μ_A(x) = {0.2, 0.5, 0.6, 0.1, 0.9}

μ_B(x) = {0.1, 0.5, 0.2, 0.7, 0.8}

Then the value of μ_{A ∩ B} will be

(A) {0.2, 0.5, 0.6, 0.7, 0.9}

(B) {0.2, 0.5, 0.2, 0.1, 0.8}

(D) {0.1, 0.5, 0.2, 0.1, 0.8}

Ans: (D)

29. The height h(A) of a fuzzy set A is defined as

h(A) = sup A(x)

x ∈ A

Then the fuzzy set A is called normal

when

(A) h(A) = 0

(B) h(A) < 0

(D) h(A) < 1

Ans: (C)

30. An artificial neuron receives n inputs x₁, x₂,…., x_n with weights w₁, w₂,…., w_nattached to the input links. The
weighted sum ________ is computed to be passed on to a non-linear filter Φ called activation function to release
the output.

(A) Σ w_i

(B) Σ x_i

(D) Σ w_i ⋅ x_i

Ans: (D)

31. Consider the formula in image processing

C_R is called as compression ratio n₁ and n₂ denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative _________ of the first data set.

(A) Data Compression

(B) Data Redundancy

(D) Data Representation

Ans: (B)

32. Find the false statement :

(A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption.

(B) The symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product.

(D) Public key algorithms use two different keys for Encryption and Decryption.

Ans: (C)

33. The message 11001001 is to be transmitted using the CRC polynomial x³ + 1 to protect it from errors. The message that should be transmitted is

(A) 110010011001

(B) 11001001

(D) 11001001011

Ans: (D)

34. _________ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.

Ans: (C)

35. Let A and B be two n × n matrices. The efficient algorithm to multiply the two matrices has the time complexity

(A) O(n³)

(B) O(n^2.81)

(D) O(n²)

Ans: (B)

36. The recurrence relation is satisfied by

(A) O(n²)

(B) O(n^{1g m})

(D) O(n 1g n)

Ans: (B)

37. The longest common subsequence of the sequences X = <A, B, C, B, D, A, B> and Y = <B, D, C, A, B, A> has length

(A) 2

(B) 3

(D) 5

Ans: (C)

38. Assuming there are n keys and each key is in the range [0, m – 1]. The run time of bucket sort is

(A) O(n)

(B) O(n lgn)

(D) O(n + m)

Ans: (D)

39. A _________ complete subgraph and a _________ subset of vertices of a graph G = (V, E) are a clique and a
vertex cover respectively.

(A) minimal, maximal

(B) minimal, minimal

(D) maximal, minimal

Ans: (D)

40. Pumping lemma for context-free languages states :

Let L be an infinite context free language. Then there exists some positive integer m such that any w ∈ L with |w| ≥ m can be decomposed as w = uv xy Z with |vxy| _________ and |vy| _________ such that Z ∈ L for all

(A) ≤ m, ≤ 1

(B) ≤ m, ≥ 1

(D) ≥ m, ≥ 1

Ans: (B)

41. The Greibach normal form grammar for the language L = {aⁿ b^{n + 1} | n ≥ 0} is

(A) S → a SB, B → bB | λ

(B) S → a SB, B → bB | b

(D) S → a Sb | b

Ans: (C)

42. Given the following statements :

S1 : Every context-sensitive language L is recursive.

S2 : There exists a recursive language that is not context sensitive.

Which statement is correct ?

(A) S₁ is not correct and S₂ is not correct.

(B) S₁ is not correct and S₂ is correct.

(D) S₁ is correct and S₂ is correct.

Ans: (D)

43. What is the bit rate for transmitting uncompressed 800 × 600 pixel colour frames with 8 bits/pixel at 40 frames/second ?

(A) 2.4 Mbps

(B) 15.36 Mbps

(D) 1536 Mbps

Ans: (C)

44. In IPV 4, the IP address 200.200.200.200 belongs to

(A) Class A

(B) Class B

(D) Class D

Ans: (C)

45. Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network ?

(A) Physical

(B) Data-link

(D) Application

Ans: (C)

46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case
delay in response to a request ? (Note that the speed of light in air is 3,00,000 km/second).

(A) 133.33 m sec

(B) 266.67 m sec

(D) 533.33 m sec

Ans: (D)

47. The start and stop bits are used in serial communication for

(A) error detection

(B) error correction

(D) slowing down the communication

Ans: (C)

48. _________ is a type of transmission impairment in which the signal looses strength due to the resistance of the transmission medium.

(A) Attenuation

(B) Distortion

(D) Decibel

Ans: (A)

49. Match the following :

Ans: (C)

50. Which of the following is a design criteria for instruction formats ?

(A) The size of instructions

(B) The number of bits in the address fields

(D) All of these

Ans: (D)

51. Synchronization is achieved by a timing device called a ________ which generates a periodic train of ________.

(A) clock generator, clock pulse

(B) master generator, clock pulse

(D) master clock generator, clock pulse

Ans: (D)

52. Serial access memories are useful in applications where

(A) Data consists of numbers

(B) Short access time is required

(D) None of these

Ans: (D)

53. What will be the output of the following logic diagram ?

(A) x OR y

(B) x AND y

(D) x XNOR y

Ans: (C)

54. The essential difference between traps and interrupts is

(A) traps are asynchronous and interrupts are synchronous with the program.

(B) traps are synchronous and interrupts are asynchronous with the program.

(D) None of these.

Ans: (B)

55. Consider the following ER diagram :

The minimum number of tables required to represent M, N, P, R₁, R2 is

(A) 2

(B) 3

(D) 5

Ans: (A)

56. Consider the following schemas :

Branch = (Branch-name, Assets, Branch-city)

Customer = (Customer-name, Bank name, Customer-city)

Borrow = (Branch-name, loan number, customer account-number)

Deposit = (Branch-name, Accountnumber, Customer-name, Balance)

Using relational Algebra, the Query that finds customers who have balance more than 10,000 is _______

Ans: (A)

57. Find the false statement :

(A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999)

(B) A weak relationship occurs when two relationship types are linked by either Event- Precedent sequence or Condition-Precedent sequence.

(D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario’s and vignette’s.

Ans: (C)

58. Consider the table Student (stuid, name, course, marks).

Which one of the following two queries is correct to find the highest marks student in course 5 ?

Q.1. Select S.stuid From student S Where not exists (select ∗ from student e where e course = ‘5’ and e marks ≥ s marks)

Q.2. Select s.stu.id From student S Where s ⋅ marks > any (select distinct marks from student S where s ⋅ course = 5)

(A) Q. 1

(B) Q. 2

(D) Neither Q. 1 nor Q. 2

Ans: (B)

59. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies :

Ans: (D)

60. Match the following :

Ans: (D)

61. Which of the following is not true with respect to a trackball and/or spaceball ?

I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom.

II. Unlike the trackball a spaceball does not actually move.

III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom.

(A) I & II

(B) II & III

(D) III only

Ans: (D)

62. Which of the following statement(s) is (are) true ?

I. Two successive translations are additive.

II. Two successive rotations are additive.

III. Two successive scaling operations are multiplicative.

(A) I and II

(B) I and III

(D) All the above

Ans: (D)

63. Given below are three basic rules :

I. Squash and Stretch

II. Slow-in and Slow-out

III. To stage the action properly These rules are applied in case of

(A) Rendering

(B) Morphing

(D) All the above

Ans: (C)

64. Which of the following points lies on the same side as the origin, with reference to the line 3x + 7y = 2 ?

(A) (3, 0)

(B) (1, 0)

(D) (0.5, 0)

Ans: (D)

65. The transformation matrix required for conversion of CMY colour model to RGB colour model is given as :

Ans: (C)

66. What steps shall be required to rotate an object about the point P₁ (as shown in fig. 1) and its placement such that
what was at P₁ is now reduced and is at P₂ (as shown in fig. 2) ?

I. Translate P₁ to origin

II. Scale as required

III. Rotate

IV. Translate to the final position P₂.

(A) I, II and III

(B) II, III and IV

(D) All of the above

Ans: (D)

67. In Unix, how do you check that two given strings a and b are equal ?

(A) test $a –eq $b

(B) test $a –equal $b

(D) Sh –C test $a = = $b

Ans: (C)

68. In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called

(A) NTFS file system

(B) Hardware abstraction layer

(D) Process Manager

Ans: (B)

69. To place a sound into a word document, following feature of windows is used :

(A) Clip board

(B) Task switching

(D) OLE

Ans: (D)

70. Translation Look-aside Buffer (TLB) is

(A) a cache-memory in which item to be searched is compared one-by-one with the keys.

(B) a cache-memory in which item to be searched is compared with all the keys simultaneously.

(D) an associative memory in which item to be searched is compared with all the keys simultaneously.

Ans: (D)

71. Simplest way of deadlock recovery is

(A) Roll back

(B) Preempt resource

(D) Kill one of the processes

Ans: (D)

72. The directory structure used in Unix file system is called

(A) Hierarchical directory

(B) Tree structured directory

(D) Graph structured directory

Ans: (C)

73. Which statement is not true about process O in the Unix operating system ?

(A) Process O is called init process.

(B) Process O is not created by fork system call.

(D) Process O is a special process created when system boots.

Ans: (A)

74. Which of the following commands would return process_id of sleep command ?

(A) Sleep 1 and echo $?

(B) Sleep 1 and echo $#

(D) Sleep 1 and echo $!

Ans: (D)

75. Possible thread states in Windows 2000 operating system include :

(A) Ready, running and waiting

(B) Ready, standby, running, waiting, transition and terminated

(D) Standby, running, transition and terminated

Ans: (B)

Latest Govt Job & Exam Updates:

UGC NET Exam December 2013 Computer Science & Application Paper-3 Question Paper With Answer Key

View Full List ...