Test Paper : II

COMPUTER SCIENCE AND Test Booklet Serial No. : _______________________

Test Subject : APPLICATIONS
OMR Sheet No. : _________________________________
Test Subject Code : K-2413
Roll No.
(Figures as per admission card)
Name & Signature of Invigilator/s

Signature: ____________________________________ Signature : ___________________________________

Name : ____________________________________ Name : ___________________________________
Paper : II
Subject : COMPUTER SCIENCE AND APPLICATIONS
Time : 1 Hour 15 Minutes Maximum Marks : 100
Number of Pages in this Booklet : 8 Number of Questions in this Booklet : 50
A»Ü¦ìWÜÚWæ ÓÜãaÜ®æWÜÙÜá Instructions for the Candidates
1. D ±Üâo¨Ü ÊæáàÆᤩ¿áÈÉ J¨ÜXst Óܧ٨ Ü ÈÜ É ¯ÊÜá¾ ÃæãàDž ®ÜíŸÃÜ®áÜ ° ŸÃæÀáÄ. 1. Write your roll number in the space provided on the top of this page.
2. This paper consists of fifty multiple-choice type of questions.
2. D ±Ü£ÅPæ¿áá ŸÖÜá BÁáR Ë«Ü¨Ü IÊÜñÜᤠ±ÜÅÍæ°WÜÙÜ®Üá° JÙÜWæãíw¨æ. 3. At the commencement of examination, the question booklet will
3. ±ÜÄàPæÒ¿á ±ÝÅÃíÜ »Ü¨È Ü É , ±ÜÅÍ° æ ±ÜâÔ¤P¿
æ á®Üá° ¯ÊÜáWæ ¯àvÜÇÝWÜáÊÜâ¨Üá. Êæã¨ÜÆ 5 ¯ËáÐÜWÙÜ È Ü É be given to you. In the first 5 minutes, you are requested to
¯àÊÜâ ±ÜâÔ¤P¿æ á®Üá° ñæÿ æ áÆá ÊÜáñÜᤠPæÙXÜ ®Üíñæ PÜvÝx¿áÊÝX ±ÜÄàQÒÓÆ Ü á PæãàÃÜÇÝX¨æ. open the booklet and compulsorily examine it as below :
(i) ±ÜÅÍ°æ ±ÜâÔ¤PW
æ æ ±ÜÅÊàæ ÍÝÊÜPÝÍÜ ±Üv¿ æ áÆá, D Öæã©Pæ ±Üâo¨Ü Aíb®Ü ÊæáàÈÃÜáÊÜ (i) To have access to the Question Booklet, tear off the paper
±æà±ÜÅ ÔàÆ®Üá° ÖÜÄÀáÄ. ÔrPRÜ Ã… ÔàDž CÆÉ¨Ü ±ÜÅͱ °æ âÜ Ô¤Pæ ÔÌàPÜÄÓܸàæ w. ñæè
æ Ü seal on the edge of this cover page. Do not accept a booklet
±ÜâÔ¤P¿ æ á®Üá° ÔÌàPÜÄÓܸàæ w. without sticker-seal and do not accept an open booklet.
(ii) ±ÜâÔ¤P¿ æ áÈÉ®Ü ±ÜÅÍæW° ÙÜ Ü ÓÜíTæ ÊÜáñÜᤠ±ÜâoWÜÙÜ ÓÜíTæ¿á®Üá° ÊÜááS±Üâo¨Ü ÊæáàÇæ (ii) Tally the number of pages and number of questions
ÊÜáá©Åst ÊÜÞ×£Áãí©Wæ ñÝÙæ ®æãàwÄ. ±ÜâoWÜÙáÜ /±ÜÅÍW°æ ÙÜ áÜ PÝOæ¿Þ¨Ü, in the booklet with the information printed on the
A¥ÜÊÝ ©Ì±ÅÜ £ A¥ÜÊÝ A®ÜáPÜÅÊÜáÊÝXÆÉ¨Ü A¥ÜÊÝ CñÜÃÜ ¿ÞÊÜâ¨æà ÊÜÂñÝÂÓÜ¨Ü cover page. Faulty booklets due to pages/questions
¨æãàÐܱäÜ ÄñÜ ±ÜâÔ¤P¿ æ á®Üá° PÜãvÜÇæ 5 ¯ËáÐÜ¨Ü AÊܗ JÙÜW,æ ÓÜíËàPÜÒPÄÜ í¨Ü ÓÜÄ missing or duplicate or not in serial order or any
CÃÜáÊÜ ±ÜâÔ¤PæWæ Ÿ¨ÜÇÝÀáÔPæãÙÜÛ¸æàPÜá. B ŸÚPÜ ±ÜÅÍæ° ±Ü£ÅPæ¿á®Üá° other discrepancy should be got replaced immediately
Ÿ¨ÜÇÝÀáÓÜÇÝWÜáÊÜâ©ÆÉ , ¿ÞÊÜâ¨æà ÖæaáÜ c ÓÜÊáÜ ¿áÊÜ®ã Ü ° PæãvÜÇÝWÜáÊÜâ©ÆÉ . by a correct booklet from the invigilator within the
period of 5 minutes. Afterwards, neither the Question
4. ±ÜÅ£Áãí¨Üá ±ÜÅÍW°æ ã Ü (A), (B), (C) ÊÜáñÜᤠ(D) Gí¨Üá WÜáÃÜá£Ô¨Ü ®ÝÆáR ±Ü¿Þì¿á
Booklet will be replaced nor any extra time will be given.
EñܤÃÜWÜÚÊæ. ¯àÊÜâ ±ÜÅÍæ°¿á G¨ÜáÃÜá ÓÜÄ¿Þ¨Ü EñܤÃÜ¨Ü ÊæáàÇæ, PæÙÜWæ PÝ~Ô¨Üíñæ
4. Each item has four alternative responses marked (A), (B), (C)
AívÝPÜꣿá®Üá° PܱݳXÓܸàæ PÜá. and (D). You have to darken the oval as indicated below on the
E¨ÝÖÜÃO Ü æ: A B C D correct response against each item.
(C) ÓÜÄ¿Þ¨Ü EñܤÃÜÊÝX¨ÝªWÜ.
Example : A B C D
5. ±ÜÅÍæ° ±Ü£ÅPæ I ÃÜÈÉ PæãqrÃÜáÊÜ OMR EñܤÃÜ ÖÝÙæ¿áÈÉ , ±ÜÅÍæ° ±Ü£ÅPæ I ÊÜáñÜá¤
where (C) is the correct response.
±ÜÅÍæ° ±Ü£ÅPæ II ÃÜÈÉ CÃÜáÊÜ ±ÜÅÍæ°WÜÚWæ ¯ÊÜá¾ EñܤÃÜWÜÙÜ®Üá° ÓÜãbÓÜñÜPÜR¨Üáª. OMR EñܤÃÜ
ÖÝÙæ¿áÈÉ AívÝPÜꣿáÆÉ¨æ ¸æàÃæ ¿ÞÊÜâ¨æà ÓܧÙܨÜÈÉ EñܤÃÜÊÜ®Üá° WÜáÃÜá£Ô¨ÜÃæ, 5. Your responses to the questions are to be indicated in the OMR
Sheet kept inside the Paper I Booklet only. If you mark at any
A¨ÜÃÜ ÊÜåèÆÂÊÜÞ±Ü®Ü ÊÜÞvÜÇÝWÜáÊÜâ©ÆÉ.
place other than in the ovals in the Answer Sheet, it will not be
6. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ Pæãor ÓÜãaÜ®æWÜÙÜ®Üá° hÝWÜÃÜãPÜñæÀáí¨Ü K©Ä. evaluated.
7. GÇÝÉ PÜÃÜvÜá PæÆÓÜÊÜ®Üá° ±ÜâÔ¤Pæ¿á Pæã®æ¿áÈÉ ÊÜÞvÜñÜPÜR¨Ü᪠. 6. Read the instructions given in OMR carefully.
8. ¯ÊÜá¾ WÜáÃÜáñÜ®Üá° Ÿ×ÃÜíWܱÜwÓܟÖÜá¨Ý¨Ü ¯ÊÜá¾ ÖæÓÜÃÜá A¥ÜÊÝ ¿ÞÊÜâ¨æà 7. Rough Work is to be done in the end of this booklet.
bÖæ°¿á®Üá°, ÓÜíWÜñÜÊÝ¨Ü ÓܧÙÜ ÖæãÃÜñÜá ±ÜwÔ, OMR EñܤÃÜ ÖÝÙæ¿á ¿ÞÊÜâ¨æà 8. If you write your name or put any mark on any part of the OMR
Answer Sheet, except for the space allotted for the relevant
»ÝWܨÜÈÉ ŸÃæ¨ÜÃæ, ¯àÊÜâ A®ÜÖÜìñæWæ ¸Ý«ÜÂÃÝXÃÜᣤàÄ.
entries, which may disclose your identity, you will render yourself
9. ±ÜÄàPæÒ¿áá ÊÜááX¨Ü®ÜíñÜÃÜ, PÜvÝx¿áÊÝX OMR EñܤÃÜ ÖÝÙæ¿á®Üá° ÓÜíËàPÜÒPÜÄWæ liable to disqualification.
¯àÊÜâ ×í£ÃÜáXÓܸàæ PÜá ÊÜáñÜᤠ±ÜÄàPÝÒ PæãsÜw¿á ÖæãÃÜWæ OMR ®Üá° ¯Êæã¾í©Wæ 9. You have to return the test OMR Answer Sheet to the invigilators
Pæãívæã¿á PÜãvܨÜá. at the end of the examination compulsorily and must NOT
10. ±ÜÄàPæÒ¿á ®ÜíñÜÃÜ, ±ÜÄàPÝÒ ±ÜÅÍæ° ±Ü£ÅPæ¿á®Üá° ÊÜáñÜᤠ®ÜPÜÆá OMR EñܤÃÜ ÖÝÙæ¿á®Üá° carry it with you outside the Examination Hall.
¯Êæã¾í©Wæ ñæWæ¨ÜáPæãívÜá ÖæãàWܟÖÜá¨Üá. 10. You can take away question booklet and carbon copy of OMR
Answer Sheet soon after the examination.
11. ¯àÈ/PܱÜâ³ ¸ÝDž±ÝÀáíp… ±æ®… ÊÜÞñÜÅÊæà E±ÜÁãàXÔÄ.
11. Use only Blue/Black Ball point pen.
12. PÝÂÆáRÇàæ oÅ A¥ÜÊÝ ÇÝW… pæàŸÇ… CñÝ©¿á E±ÜÁãàWÜ樆 áÜ ° ¯Ðæà—ÓÜÇÝX¨æ. 12. Use of any calculator or log table etc., is prohibited.
13. ÓÜÄ AÆÉ¨Ü EñܤÃÜWÜÚWæ Má| AíPÜ CÃÜáÊÜâ©ÆÉ . 13. There is no negative marks for incorrect answers.

K-2413 1 ±Üâ.£.®æãà./P.T.O.
*K2413* Total Number of Pages : 8

COMPUTER SCIENCE AND APPLICATIONS

Paper – II
Note : This paper contains fifty (50) objective type questions. Each question carries
two (2) marks. All questions are compulsory.
1. Let A = Z+, the positive integers, and R 4. If (S, *) is a semigroup, where S = [1, 2,
be the relation defined by aRb if and only 3, 6, 12] and * is defined by : a * b =
if there exists a K in Z+ so that a = bK (k GCD (a, b). Then, S is appropriately
depends on a and b). Which of the characterized as
following belong to R ?
(A) monoid
(A) (4, 16)
(B) commutative
(B) (1, 7)
(C) commutative monoid
(C) (8, 2)
(D) commutative monoid with identity 12
(D) (2, 8)
5. If e is the (2, 5) encoding function
2. If R = [(a, d), (b, c), (c, a), (d, e)] is a relation
defined by
on A = [a, b, c, d, e], then R is a tree with
e (00) = 00000
root.
e (01) = 00111
(A) a
e (10) = 01110
(B) c
e (11) = 11111
(C) d
then the number of errors detected
(D) b by e is
(A) 1
3. The result of performing a post order
search of the tree with the following (B) 0 or 1
digraph is (C) 2
(D) 2 or fewer

6. A microprocessor has memory location

from 0000 to 3FFF. Each memory
location stores 1 byte. How many bytes
can the memory store ?
(A) xysztuv (A) 4095
(B) xztysuv (B) 16384
(C) yxzstuv (C) 32740
(D) syvutzx (D) 46040

Paper II 2 K-2413
*K2413* Total Number of Pages : 8

7. Which of the following input combinations 13. The library function exit ( ) causes an exit
is not allowed in an SR flip-flop ? from
(A) S = 0 R = 0 (A) the loop in which it occurs
(B) S = 0 R = 1 (B) the block in which it occurs
(C) S = 1 R = 1 (C) the program in which it occurs
(D) None of the above (D) the function in which it occurs

8. How many full address are required to 14. A structure brings together a group of
construct an m – bit parallel adder ? (A) related data types and variables
(A) m/2 (B) m + 1 (B) items of the same data type and
(C) m (D) m – 1 variables
(C) integers with user defined names
9. Which logic family dissipates the (D) variables only
minimum power ?
(A) TTL (B) ECL 15. The most important role of a function is
(C) CMOS (D) DTL (A) provide a name to a block of code
(B) just help in reducing the size of code
10. The remainder obtained from (C) help organise a program into
11011.10 101 is


conceptual units and thereby
(A) 01 (B) 10 possibly to reduce the program size
(C) 11 (D) 00 (D) accept arguments and return a
value
11. A C++ operator that works in a special
16. Classes are useful because they are best
way on a newly defined data type is said known for the following
to be
(A) permit data to be hidden from other
(A) encapsulated (B) classified classes
(C) polymorphed (D) overloaded (B) bring together all aspects of an
entity in one place
12. Consider the following elements 14, ‘d’,
(C) can closely models objects in the
3.268, galaxy, galaxy ( ). In that sequence
real world
they represent
(D) all the above (A, B, C)
(A) constant, ASCII, numeral, variable,
function 17. A specialization with a constraint that a
(B) integer constant, character constant subclass can be a subclass in more than
float point constant, identifier or one class/subclass relationship is
variable, function name referred to as
(C) numeral constant, alpha constant, (A) specialization lattice
numeral variable, function name, (B) specialization hierarchy
mathematical function
(C) total specialization
(D) none of the above (D) none of the above
K-2413 3 Paper II
*K2413* Total Number of Pages : 8

18. The data structures used for indexing in 22. Assume a 2 – d array having m rows and
multiple key access methods are n – columns. It is required to swap ith
column and jth column. Which of the
(A) B – tree following statement is not true ?
+
(B) B – tree (A) A 1 – d array of m elements is
required
(C) hash data structure
(B) A statement such as A (K, i) for
(D) none of the above K

1 to m will be utilised
(C) The computing time is 0 (m)
19. A relation schema R is an 3NF if every
(D) Copy the contents of ith column into
nonprime attribute of R is jth column and vice versa
(A) fully functionally dependent on
23. Assume a square array of size n×n. What
every key of R
should be the algorithmic segment to go
(B) non-transitively dependent on every through lower triangular elements
key of R (A) for i 1 to n do for j


1 to i

(B) for i 1 to n do for j i to n

(C) both (A) and (B)

(C) for i 1 to n do for j 1 to n

(D) partially dependent on primary key

(D) for i

1 to n do for j

n down to i

20. The operation that selects certain 24. If the earliest computing time for an
columns from a relational table and unsuccessful search is 1 then the type of
discards the other columns is search and the corresponding data type
could be
(A) PROJECT (A) binary search in 1 – d array of sorted
(B) SELECT elements
(B) linear search in 1 – d array of
(C) INTERSECTION
unsorted elements
(D) None of the above (C) linear search in 1 – d array of sorted
elements
21. The SQL function that specifies universal (D) in all above mentioned three cases
quantifier in relational calculus is
25. The structure of a heap should be
(A) EXISTS
(A) A tree
(B) NOT EXISTS
(B) A complete binary tree
(C) UNION (C) A graph
(D) DIVISION (D) A binary tree

Paper II 4 K-2413
*K2413*
26. In-order, Pre-order and Post-order
traversals are associated with
(A) any graph having n vertices and
more than n edges
(B) any graph which is connected and
in which there is one and only one
path between any two vertices
(C) any graph which is circuitless and
connected and one vertex is root or
reference vertex
(D) any graph which has n vertices and
less than n edges
27. The total number of pendant vertices in
a full binary tree of n vertices is
(A) (B)
n ( n

2 2
(C) (D)
n n

1
2 2
28. If a binary signal is sent over a 3 KHz
channel whose signal-to-noise ratio is
20 dB. What is the maximum achievable
data rate ?
(A) 3 Kbps (B) 4 Kbps
(C) 5 Kbps (D) 6 Kbps
29. A laser beam 1 mm wide is aimed at a
detector 1 mm wide 100 m away on the
roof of a building. How much of an
angular diversion (in degrees) does the
laser have to have before it misses the
detector ?
(A) 0.00057 degrees
(B) 0.00067 degrees
(C) 0.00077 degrees
(D) 0.00087 degrees
K-2413
Total Number of Pages : 8
30. Which best describes a router ?
(A) Acts as a multi-port repeater and
occupies the center of a star
topology network
(B) Extends the operating distance of a
network by clearing and amplifying
signals
(C) Screens network traffic based on
source and destination MAC
addressing
(D) Forwards packets from one network
to another based on network layer
information
31. What does the twisting of the wires do in
a CAT-5 cable ?
1 )
(A) Reduces noise problems
(B) Make it thinner

1
(C) Make it less expensive
(D) Allow 6 pairs to fit in the space of 4
pairs
32. What happens to packets that are
involved in a collision ?
(A) The packets return to the originator
(B) The packets destroyed bit by bit
(C) The packets continue on to the
target device with corrupt data
(D) None of the above
33. The postfix notation for (8 – 5) + 3 is
(A) 85 – 3 +
(B) 853 – +
(C) 853 + –
(D) none of the above
5 Paper II
*K2413* Total Number of Pages : 8

34. Which of the following tool is referred to 38. Suppose a new process in a system
as parser generator ? arrives at an average of six processes per
(A) LEX minute and each process requires an
(B) TeX average of 8 seconds of service time.
Estimate the fraction of time the CPU is
(C) YACC
busy in a system with a single processor
(D) None of the above
(A) 60% (B) 70%
35. The resolution of external references in (C) 80% (D) 90%
an object module generated by a
compiler is done by 39. A file has several lines of data. How can
(A) loader we get the line of data whose following
line has a string pattern “AAA” in it
(B) compiler
(A) /AAA/ {print j0}
(C) linker
(D) all the above three : (A), (B) and (C) (B) ? AAA/ {print j1}
(C) /AAA ? {print j 0}
36. The automatic garbage collection (D) /AAA/ {print j1}
refers to
(A) allocation of memory to unreachable 40. Thrashing
data (A) is a natural consequence of virtual
(B) deallocation of memory to memory system
unreachable data (B) can always be avoided by swapping
(C) allocation of memory to reachable (C) can be caused by poor paging
data algorithms
(D) deallocation of memory to (D) none of the above
reachable data
41. Addresses in sed can be in one out of
37. In directed acyclic graph for expressions,
how many types
the following is true
(A) one (B) two
(A) leaves correspond to atomic
operands and interior nodes (C) three (D) four
correspond to operators
42. In unix system default permission for a
(B) leaves correspond to operators and
interior nodes correspond to file and directory is
operands (A) 666, 777
(C) operands and operators correspond (B) 555, 666
to alternate nodes on a path (C) 777, 666
(D) none of the above (D) 666, 555

Paper II 6 K-2413
*K2413* Total Number of Pages : 8

43. The linear sequential model in Software 47. Modularity in Software Engineering
Engineering is
(A) is a feature because of top-down
(A) Prototype modeling
design
(B) Waterfall modeling
(B) helps make large programs more
(C) Incremental modeling
understandable
(D) Spiral modeling
(C) both (A) and (B)
44. Top-down divide strategy is employed in (D) neither (A) nor (B)
Software Engineering for
(A) to refine the statement of the 48. A Data-Cube is an example for
problem in terms of decomposed (A) Data Warehouse
partitions of the problem
(B) Data generation
(B) to draw specification requirements
(C) Data transformation
(C) to estimate the software cost
(D) None of the above
(D) to collect the data to test a code

49. Principal components best define the

45. Software metrics enable
following
(A) clarity in understanding the problem
(B) assessing the skill sets of the (A) Data integration
software team involved (B) Data selection
(C) improving the entire software (C) Data transformation
process-planning, tracking and
(D) Data cleaning
controlling
(D) pre-empting the bugs in a software 50. Geographic Information System (GIS)
typically works with
46. Software testing conducted at the
modular interface refers to (A) Historic data of the area

(A) on-site testing (B) Spatial data of the area

(B) white box testing (C) Data of an area gathered through
(C) first release testing questionnaire
(D) black box testing (D) Only (A) and (C)

K-2413 7 Paper II
*K2413* Total Number of Pages : 8
bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ
Space for Rough Work

Paper II 8 K-2413