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. Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT.

Which of the following is not true ?

I. The beam-penetration is used with random scan monitors.

II. Shadow-mask is used in rasterscan systems.

III. Beam-penetration method is better than shadow-mask method.

IV. Shadow-mask method is better than beam-penetration method.

(A) I and II

(B) II and III

(D) IV only

Ans: (C)

2. Line caps are used for adjusting the shape of the line ends to give them a better appearance. Various kinds of line caps used are

(A) Butt cap and sharp cap

(B) Butt cap and round cap

(D) Butt cap, round cap and projecting square cap

Ans: (D)

3. Given below are certain output primitives and their associated attributes. Match each primitive with its corresponding attributes :

Ans: (C)

4. Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and
(4, 5), if clipped against this window will connect the points

(A) (0, 1) and (2, 3)

(B) (0, 1) and (3, 3)

(D) (0, 1) and (3, 2)

Ans: (A)

5. Which of the following color models are defined with three primary colors ?

(A) RGB and HSV color models

(B) CMY and HSV color models

(D) RGB and CMY color models

Ans: (D)

6. In a digital transmission, the receiver clock is 0.1 percent faster than the sender clock. How many extra bits per second does the receiver receive if the data rate is 1 Mbps ?

(A) 10 bps

(B) 100 bps

(D) 10000 bps

Ans: (C)

7. Given U = {1, 2, 3, 4, 5, 6, 7}

A = {(3, 0.7), (5, 1), (6, 0.8)}

then A will be : (where ~ → complement)

(A) {(4, 0.7), (2, 1), (1, 0.8)}

(B) {(4, 0.3), (5, 0), (6, 0.2) }

(D) {(3, 0.3), (6.0.2)}

Ans: (C)

8. Consider a fuzzy set old as defined below

Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)}

Then the alpha-cut for alpha = 0.4 for the set old will be

(A) {(40, 0.4)}

(B) {50, 60, 70, 80}

(D) {(20, 0), (30, 0), (40, 1),

(50, 1), (60, 1), (70, 1), (80, 1)}

Ans: (D)

9. Perceptron learning, Delta learning and LMS learning are learning methods which falls under the category of

(A) Error correction learning – learning with a teacher

(B) Reinforcement learning – learning with a critic

(D) Competitive learning – learning without a teacher

Ans: (A)

10. Code blocks allow many algorithms to be implemented with the following parameters :

(A) clarity, elegance, performance

(B) clarity, elegance, efficiency

(D) execution, clarity, performance

Ans: (B)

11. Match the following with respect to the jump statements :

Ans: (A)

12. The control string in C++ consists of three important classifications of characters

(A) Escape sequence characters, Format specifiers and Whitespace characters

(B) Special characters, White-space characters and Non-white space characters

(D) Special characters, White-space characters and Format specifiers

Ans: (C)

13. Match the following with respect to I/O classes in object oriented programming :

Ans: (A)

14. Which one of the following describes the syntax of prolog program ?

I. Rules and facts are terminated by full stop (.)

II. Rules and facts are terminated by semicolon (;)

III. Variables names must start with upper case alphabets.

IV. Variables names must start with lower case alphabets.

Codes :

(A) I, II

(B) III, IV

(D) II, IV

Ans: (C)

15. Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the even-numbered positions and even(L) = {even (W) | W ∈L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by

Chop(L) = {W | ν W ∈ L, with | n | = 2}. If L is regular language then

(A) even(L) is regular and Chop(L) is not regular.

(B) Both even(L) and Chop(L) are regular.

(D) Both even(L) and Chop(L) are not regular.

Ans: (B)

16. Software testing is

(A) the process of establishing that errors are not present.

(B) the process of establishing confidence that a program does what it is supposed to do.

(D) the process of executing a program with the intent of finding errors.

Ans: (D)

17. Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be

(A) 5 failures/CPU hr

(B) 10 failures/CPU hr.

(D) 40 failures/CPU hr.

Ans: (B)

18. Consider a project with the following functional units :

Number of user inputs = 50

Number of user outputs = 40

Number of user enquiries = 35

Number of user files = 06

Number of external interfaces = 04

Assuming all complexity adjustment factors and weighing factors as average, the function points for the project will be

(A) 135

(B) 722

(D) 672

Ans: (D)

19. Match the following :

Ans: (A)

20. Which one of the following is not a definition of error ?

(A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value.

(B) It refers to the actual output of a software and the correct output.

(D) It refers to human action that results in software containing a defect or fault.

Ans: (C)

21. Which one of the following is not a key process area in CMM level 5 ?

(A) Defect prevention

(B) Process change management

(D) Technology change management

Ans: (C)

22. Consider the following relational schemas for a library database :

Book (Title, Author, Catalog_no, Publisher, Year, Price)

Collection(Title, Author, Catalog_no) with the following functional dependencies :

I. Title, Author → Catalog_no

II. Catalog_no → Title, Author, Publisher, Year

III. Publisher, Title, Year → Price

Assume (Author, Title) is the key for both schemas. Which one of the following is true ?

(A) Both Book and Collection are in BCNF.

(B) Both Book and Collection are in 3NF.

(D) Both Book and Collection are in 2NF.

Ans: (C)

23. Specialization Lattice stands for

(A) An entity type can participate as a subclass in only one specialization.

(B) An entity type can participate as a subclass in more than one specialization.

(D) An entity type that can participate in one generalization.

Ans: (B)

24. Match the following :

Ans: (A)

25. Consider the schema

(A) not in 2NF

(B) in 2NF but not in 3NF

(D) in both 2NF and 3NF

Ans: (D)

26. Which one of the following is not a Client-Server application ?

(A) Internet chat

(B) Web browser

(D) Ping

Ans: (B)

27. Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock :

I. 2-phase locking

II. Time phase ordering

(A) Both I & II

(B) II only

(D) Neither I nor II

Ans: (B)

28. Match the following :

Ans: (D)

29. STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?

(A) SHAKEY

(B) SRI

(D) None of these

Ans: (C)

30. Slots and facets are used in

(A) Semantic Networks

(B) Frames

(D) All of these

Ans: (B)

31. Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ?

(A) A* algorithm

(B) AO* algorithm

(D) Iterative A* algorithm

Ans: (C)

32. ________predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions.

(A) Zero-order

(B) First-order

(D) High-order

Ans: (B)

33. ________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.

(A) Best first search

(B) Goal stack planning

(D) Min-max search

Ans: (C)

34. Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ?

(A) 80 %

(B) 50 %

(D) 30 %

Ans: (B)

35. Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory
for the pages. The page reference string is :

1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1

The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) :

(A) 9 and 6

(B) 10 and 7

(D) 10 and 6

Ans: (B)

36. Which of the following statements is not true about disk-arm scheduling algorithms ?

(A) SSTF (shortest seek time first) algorithm increases performance of FCFS.

(B) The number of requests for disk service are not influenced by file allocation method.

(D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Ans: (B)

37. _________ maintains the list of free disk blocks in the Unix file system.

(A) I-node

(B) Boot block

(D) File allocation table

Ans: (C)

38. A part of Windows 2000 operating system that is not portable is

(A) Device Management

(B) Virtual Memory Management

(D) User Interface

Ans: (B)

39. Match the following with reference to Unix shell scripts :

Ans: (C)

40. The advantage of _______ is that it can reference memory without paying the price of having a full
memory address in the instruction.

(A) Direct addressing

(B) Indexed addressing

(D) Register Indirect addressing

Ans: (D)

41. The reverse polish notation equivalent to the infix expression

((A + B) * C + D)/(E + F + G)

(A) A B + C * D + EF + G + /

(B) A B + C D * + E F + G + /

(D) A B + C * D + E + F G + /

Ans: (A)

42. The output of a sequential circuit depends on

(A) present input only

(B) past input only

(D) past output only

Ans: (C)

43. A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of

(A) 3m bits

(B) m + n bits

(D) 3m + n + 30 bits

Ans: (D)

44. Which of the following flip-flops is free from race condition ?

(A) T flip-flop

(B) SR flip-flop

(D) None of the above

Ans: (D)

45. One of the main features that distinguish microprocessor from micro-computers is

(A) words are usually larger in microprocessors.

(B) words are shorter in microprocessors.

(D) None of the above.

Ans: (C)

46. The output generated by the LINUX command :

$ seq 1 2 10 will be

(A) 1 2 10

(B) 1 2 3 4 5 6 7 8 9 10

(D) 1 5 10

Ans: (C)

47. All the classes necessary for windows programming are available in the module :

(A) win.txt

(B) win.main

(D) MFC

Ans: (A)

48. Windows 32 API supports

(A) 16-bit Windows

(B) 32-bit Windows

(D) All of the above

Ans: (D)

49. Superficially the term “objectoriented”, means that, we organize software as a

(A) collection of continuous objects that incorporates both data structure and behaviour.

(B) collection of discrete objects that incorporates both discrete structure and behaviour.

(D) collection of objects that incorporates both discrete data structure and behaviour.

Ans: (C)

50. The “part-whole”, or “a-part-of”, relationship in which objects representing the components of something associated with an object representing the entire assembly is called as

(A) Association

(B) Aggregation

(D) Generalisation

Ans: (B)

51. The pure object oriented programming language with extensive metadata available and modifiable at run time is

(A) Small talk

(B) C++

(D) Eiffel

Ans: (A)

52. Match the following interfaces of Java. Servlet package :

Ans: (D)

53. The syntax of capturing events method for document object is

(A) CaptureEvents()

(B) CaptureEvents(Orgs eventType)

(D) CaptureEvents(eventVal)

Ans: (C)

54. Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the ________ attribute and the second with the _________ attribute.

(A) NAME & LINK

(B) LINK & HREF

(D) TARGET & VALUE

Ans: (C)

55. Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires _______ of storage space if the image is not compressed.

(A) one Terabyte

(B) one Megabyte

(D) 8 Terabytes

Ans: (B)

56. Match the following cryptographic algorithms with their design issues :

Ans: (C)

57. Consider a code with five valid code words of length ten :

0000000000, 0000011111, 1111100000, 1110000011, 1111111111

Hamming distance of the code is

(A) 5

(B) 10

(D) 9

Ans: (A)

58. Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?

(A) Alternate optimality

(B) Infeasibility

(D) All of the above

Ans: (A)

59. The given maximization assignment problem can be converted into a minimization problem by

(A) subtracting each entry in a column from the maximum value in that column.

(B) subtracting each entry in the table from the maximum value in that table.

(D) adding maximum value of the table to each entry in the table.

Ans: (B)

60. The initial basic feasible solution of the following transportion problem :

then the minimum cost is

(A) 76

(B) 78

(D) 82

Ans: (A)

61. Given the following equalities :

Which of the following is true ?

(A) E₁ is correct and E₂ is correct.

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

(D) E₁ is not correct and E₂ is not correct.

Ans: (B)

62. Consider the fractional knapsack instance n = 4, (p₁, p₂, p₃, p₄) = (10, 10, 12, 18), (w₁, w₂, w₃, w₄) = (2, 4, 6, 9) and M = 15. The maximum profit is given by

(Assume p and w denotes profit and weight of objects respectively)

(A) 40

(B) 38

(D) 30

Ans: (B)

63. The solution of the recurrence relation of is

(A) O(n²)

(B) O(nlg n)

(D) O(l g n)

Ans: (C)

64. If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is

(A) less than 1

(B) less than lg n

(D) greater than lg n

Ans: (A)

65. Given the following statements :

S₁ : The subgraph-isomorphism problem takes two graphs G₁and G₂ and asks whether G₁ is a subgraph of G₂.

S₂ : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A and such that

(A) S1 is NP problem and S2 is P problem.

(B) S1 is NP problem and S2 is NP problem.

(D) S1 is P problem and S2 is NP problem.

Ans: (B)

66. Suppose that the splits at every level of quicksort are in the proportion (1 – α) to α, where 0 < a ≤ ½ is a
constant. The minimum depth of a leaf in the recursion tree is approximately given by

Ans: (C)

67. Ten signals, each requiring 3000 Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that the guard bands are 300 Hz wide.

(A) 30,000

(B) 32,700

(D) None of the above

Ans: (B)

68. A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ?

(A) 4

(B) 8

(D) 28

Ans: (B)

69. Which of the following is used in the options field of IPv4 ?

(A) Strict source routing

(B) Loose source routing

(D) All of the above

Ans: (D)

70. Which layers of the OSI reference model are host-to-host layers ?

(A) Transport, Session, Presentation, Application

(B) Network, Transport, Session, Presentation

(D) Physical, Data-link, Network, Transport

Ans: (A)

71. A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ?

(A) 1024

(B) 2048

(D) 8192

Ans: (C)

72. Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?

(A) 4

(B) 8

(D) 16

Ans: (C)

73. Given the following two grammars :

Which statement is correct ?

(A) G₁ is unambiguous and G₂ is unambiguous.

(B) G₁ is unambiguous and G₂ is ambiguous.

(D) G₁ is ambiguous and G₂ is ambiguous.

Ans: (D)

74. Match the following :

Ans: (C)

75. Given the following two languages :

Which statement is correct ?

(A) Both L₁ and L₂ are not deterministic.

(B) L₁is not deterministic and L₂ is deterministic.

(D) Both L₁ and L₂ are deterministic.

Ans: (D)

Latest Govt Job & Exam Updates:

UGC NET Exam June 2014 Computer Science & Application Paper-3 Question Paper With Answer Key

View Full List ...