TS SET 2013: Paper II, Computer Science and Applications
Text of page 1
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBJECT CODE SUBJECT PAPER
A-04-02 COMPUTER SCIENCE AND APPLICATIONS II
HALL TICKET NUMBER
QUESTION BOOKLET NUMBER
OMR SHEET NUMBER
DURATION MAXIMUM MARKS NUMBER OF PAGES NUMBER OF QUESTIONS
1 HOUR 15 MINUTES 100 16 50
This is to certify that, the entries made in the above portion are correctly written and verified.
Candidates Signature Name and Signature of Invigilator
Instructions for the Candidates A¿æýÅÆæÿ$¦ËMæü$ çÜ*^èþ¯èþË$
1. Write your Hall Ticket Number in the space provided on the 1. D ç³#r ò³O ¿êVæü ÌZ CÐèþÓºyìþ¯èþ çÜ¦Ë ÌZ Ò$ çàÌý sìýMðüsý ¯èþ ºÆæÿ$ Æ>Äæý$ yìþ.
top of this page.
2. D {ç³Ôèý² ç³{èþÐèþ$$ Äæý*¿ñýO ºçßý$âñýO_eMæü {ç³Ôèý²Ë¯èþ$ MæüÍW E ¨.
2. This paper consists of fifty multiple-choice type of questions.
3. At the commencement of examination, the question booklet will 3. ç³Èæü {´ëÆæÿ ¿æýÐèþ$$¯èþ D {ç³Ôé²ç³{èþÐèþ$$ Ò$Mæü$ CÐèþÓºyæþ$èþ$ ¨. Ððþ$$§æþsìý I§æþ$
be given to you. In the first 5 minutes, you are requested to °Ñ$çÙÐèþ$$ËÌZ D {ç³Ôé²ç³{èþÐèþ$$¯èþ$ ðþÇ_ Mìü §æþ ðþÍí³¯èþ A Ôé˯èþ$ èþç³µ°çÜÇV>
open the booklet and compulsorily examine it as below : çÜÇ^èþ*çÜ$Mø yìþ.
(i) To have access to the Question Booklet, tear off the paper (i) D {ç³Ôèý² ç³{èþÐèþ$$¯èþ$ ^èþ*yæþyé°Mìü MæüÐèþÆÿõ³h A ^èþ$¯èþ E¯èþ² M>Wèþç³# ïÜË$¯èþ$
seal on the edge of this cover page. Do not accept a booklet _ ^èþ yìþ. íÜtMæüPÆÿ ïÜË$Ìôý° Ðèþ$ÇÄæý$$ C¨ÐèþÆæÿMóü ðþÇ_ E¯èþ² {ç³Ôé²ç³{èþÐèþ$$¯èþ$
without sticker-seal and do not accept an open booklet. Ò$Ææÿ$ A XMæüÇ ^èþÐèþ§æþ$ª.
(ii) Tally the number of pages and number of questions
in the booklet with the information printed on the (ii) MæüÐèþÆæÿ$ õ³h ò³O Ðèþ$${¨ _¯èþ çÜÐèþ*^éÆæÿ {ç³M>Ææÿ D {ç³Ôèý²ç³{èþÐèþ$$ÌZ° õ³iË çÜ Qůèþ$
cover page. Faulty booklets due to pages/questions Ðèþ$ÇÄæý$$ {ç³Ôèý²Ë çÜ Qůèþ$ çÜÇ^èþ*çÜ$Mø yìþ. õ³iË çÜ QÅMæü$ çÜ º «¨ _ V>±
missing or duplicate or not in serial order or any other Ìôý§é çÜ*_ _¯èþ çÜ QÅÌZ {ç³Ôèý²Ë$ ÌôýMæü´ùÐèþ#r Ìôý§é °f{ç³ M>Mæü´ùÐèþ#r Ìôý§é
discrepancy should be got replaced immediately by a {ç³Ôèý²Ë$ {MæüÐèþ$糧æþ®ÌZ ÌôýMæü´ùÐèþ#r Ìôý§é HÐðþO¯é óþyéË$ yæþ$r Ðèþ sìý §øçÙç³NÇèþÐðþ$O¯èþ
correct booklet from the invigilator within the period {ç³Ôèý² ç³{é°² Ððþ r¯óþ Ððþ$$§æþsìý I§æþ$ °Ñ$ÚëÌZÏ ç³È> ç³ÆæÿÅÐóþæüMæü$°Mìü ÇW C_aÐóþíÜ
of 5 minutes. Afterwards, neither the Question Booklet §é°Mìü º§æþ$Ë$V> çÜÇV>Y E¯èþ² {ç³Ôèý²ç³{é°² ¡çÜ$Mø yìþ. èþ§æþ¯èþ èþÆæÿ {ç³Ôèý²ç³{èþÐèþ$$
will be replaced nor any extra time will be given. Ðèþ*Ææÿaºyæþ§æþ$ A§æþ¯èþç³# çÜÐèþ$Äæý$ CÐèþÓºyæþ§æþ$.
(iii) After this verification is over, the Test Booklet Number
should be entered in the OMR Sheet and the OMR Sheet (iii) ò³O Ñ«§æþ V> çÜÇ^èþ*çÜ$Mö¯èþ² èþÆ>Óèþ {ç³Ôé²ç³{èþ çÜ Qůèþ$ OMR ç³{èþÐèþ$$ ò³O
Number should be entered on this Test Booklet. A§óþÑ«§æþ V> OMR ç³{èþÐèþ$$ çÜ Qůèþ$ D {ç³Ôé²ç³{èþÐèþ$$ ò³O °ÇªçÙtt çÜ¦Ë ÌZ Æ>Äæý$ÐèþÌñý¯èþ$.
4. Each item has four alternative responses marked (A), (B), (C) 4. {ç³ {ç³Ôèý²Mæü$ ¯éË$Væü$ {ç³éÅÐèþ*²Äæý$ {ç³çܵ §æþ¯èþË$ (A), (B), (C) Ðèþ$ÇÄæý$$ (D)
and (D). You have to darken the circle as indicated below on the Ë$V> CÐèþÓºyézÆÿ$$. {ç³{ç³Ôèý²Mæü$ çÜÆðÿO¯èþ {ç³çܵ §æþ¯èþ¯èþ$ G¯èþ$²Mö° Mìü §æþ ðþÍí³¯èþ Ñ«§æþ V>
correct response against each item. OMR ç³{èþÐèþ$$ÌZ {ç³ {ç³Ôé² çÜ QÅMæü$ CÐèþÓºyìþ¯èþ ¯éË$Væü$ Ðèþé¢ÌZÏ çÜÆðÿO¯èþ
Example : A B C D {ç³çܵ §æþ¯èþ¯èþ$ çÜ*_ ^óþ Ðèþ颰² »êÌý ´ëÆÿ$$ sý ò³¯þø Mìü §æþ ðþÍí³¯èþ Ñ«§æþ V>
where (C) is the correct response.
ç³NÇ ^éÍ.
E§éçßýÆæÿ×ý : A B C D
5. Your responses to the items are to be indicated in the OMR
Answer Sheet given to you. If you mark at any place other than (C) çÜÆðÿO¯èþ {ç³çܵ §æþ¯èþ AÆÿ$$óþ
in the circle in the Answer Sheet, it will not be evaluated. 5. {ç³Ôèý²ËMæü$ {ç³çܵ §æþ¯èþ˯èþ$ D {ç³Ôèý²ç³{èþÐèþ$$ø CÐèþÓºyìþ¯èþ OMR ç³{èþÐèþ$$ ò³O¯èþ
6. Read instructions given inside carefully. CÐèþÓºyìþ¯èþ Ðèþé¢ÌZϯóþ ç³NÇ _ Væü$Ç¢ ^éÍ. AÌêM>Mæü çÜÐèþ*«§é¯èþ ç³{èþ ò³O ÐóþÆöMæü ^ør
7. Rough Work is to be done in the end of this booklet. Væü$Ç¢õÜ¢ Ò$ {ç³çܵ §æþ¯èþ Ðèþ$*ÌêÅ Mæü¯èþ ^óþÄæý$ºyæþ§æþ$.
8. If you write your name or put any mark on any part of the OMR 6. {ç³Ôèý² ç³{èþÐèþ$$ ÌZç³Ë C_a¯èþ çÜ*^èþ¯èþ˯èþ$ gê{Væüèþ¢V> ^èþ§æþÐèþ yìþ.
Answer Sheet, except for the space allotted for the relevant 7. _èþ$¢ç³°° {ç³Ôèý²ç³{èþÐèþ$$ _ÐèþÆæÿ C_a¯èþ RêäçܦËÐèþ$$ÌZ ^óþÄæý*Í.
entries, which may disclose your identity, you will render yourself 8. OMR ç³{èþÐèþ$$ ò³O °È~èþ çÜ¦Ë ÌZ çÜ*_ ^èþÐèþËíܯèþ ÑÐèþÆ>Ë$ èþí³µ _ CèþÆæÿ çÜ¦Ë ÌZ
liable to disqualification. Ò$ Væü$Ç¢ ç³#¯èþ$ ðþÍõ³ Ñ«§æþ V> Ò$ õ³Ææÿ$ Æ>Äæý$yæþ V>± Ìôý§é CèþÆæÿ _à²Ë¯èþ$
9. The candidate must handover the OMR Answer Sheet to ò³rtyæþ V>± ^óþíܯèþrÏÆÿ$$óþ Ò$ A¯èþÆæÿáèþMæü$ Ò$Æóÿ »ê«§æþ$ÅËÐèþ#éÆæÿ$.
the invigilators at the end of the examination compulsorily
9. ç³Èæü ç³NÆæÿ¢Æÿ$$¯èþ èþÆ>Óèþ Ò$ OMR ç³{é°² èþç³µ°çÜÇV> ç³Èæü ç³ÆæÿÅÐóþæüMæü$yìþMìü CÐéÓÍ.
and must not carry it with you outside the Examination Hall. The
candidate is allowed to take away the carbon copy of OMR Ðésìý° ç³Èæü Væü¨ ºÄæý$rMæü$ ¡çÜ$Mæü$ÐðþâæýÏMæü*yæþ§æþ$. ç³Èæü ç³NÆæÿ¢Æÿ$$¯èþ èþÆæÿ$Ðéèþ A¿æýÅÆæÿ$¦Ë$
Sheet and used Question paper booklet at the end of the {ç³Ôèý² ç³{é°², OMR ç³{èþ Äñý$$MæüP M>Ææÿ¾¯þ M>ï³° ¡çÜ$Mæü$ÐðþâæýÏÐèþ^èþ$a.
examination. 10. ±Í/¯èþËÏ Ææÿ Væü$ »êÌý ´ëÆÿ$$ sý ò³¯þ Ðèþ*{èþÐóþ$ Eç³Äñý*W ^éÍ.
10. Use only Blue/Black Ball point pen. 11. ÌêVæüÇ£æþÐþ$ sôýº$ÌýÞ, M>ÅÍMæü$ÅÌôýrÆÿË$, GË[M>t°Mü ç³ÇMæüÆ>Ë$ Ððþ$$§æþËVæü$¯èþÑ ç³ÈæüVæü¨ÌZ
11. Use of any calculator or log table etc., is prohibited. Eç³Äñý*W ^èþyæþ °õÙ«§æþ .
12. There is no negative marks for incorrect answers. 12. èþç³ çÜÐèþ*«§é¯éËMæü$ Ðèþ*Ææÿ$PË èþWY ç³# Ìôý§æþ$.
II 1 A-04-02
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
Text of page 2
*A0402*
HE
RE
WR
ITE
NO
T
DO
II 2 A-04-02
Text of page 3
*A0402*
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
4. How many derangements are there of a
1. The number of anti-symmetric relations
on a set A with k elements is set with seven elements ?
(A) 2 *
k (3k – 1)/2
(A) 3708
k
(B) 2
(B) 1854
2
(C) k
(C) 1856
(D) k
(D) 5040
2. How many vertices does a regular graph
of degree 4 with 10 edges have? 5. Which of the following Boolean function
(A) 3 (B) 16 F(x,y) is self dual ?
(C) 4 (D) 5 (A) xy + x′v′
3. Consider the following Statements : (B) x + y
I. Every group of prime order is cyclic (C) xy + yx′ + x′
II. A cyclic group of prime order p has
(D) x
p-1 generators.
6. A Boolean Function F(x,y) that can be
Which of the following is true ?
represented by a threshold gate is termed
(A) Statement I is correct and Statement II
is incorrect as Threshold function. Which of the
(B) Statement I is incorrect and following is Not a threshold function ?
Statement II is correct (A) xy
(C) Both the Statements I and II are
(B) x + y
correct
(C) x XOR Y
(D) Both the Statements I and II are
(D) All the above
incorrect
II 3 A-04-02
Text of page 4
*A0402*
7. Floating point numbers in a computer are 9. What is output ?
represented using a 10-bit mantissa
(including a sign bit) and a 7-bit exponent short* a = 0;
(including a sign bit). What is the
void main(){a+=2; printf(“%d”,a);}
approximate value of the maximum
number, which can be represented ? (A) 2 (B) 4
Assume that the mantissa is stored in the
(C) 8 (D) 0
normalised form, that is, without leading
zeroes. 10. How is memory, pointing to an int-
128
(A) 2
127
variable, correctly allocated ?
(B) 2
64 (A) int* pi = (int*)malloc(4);
(C) 2
63
(D) 2
(B) int* pi = new int;
8. “static” in the following program excerpt
(C) int* pi = new sizeof(int);
(file prog.cpp) means that :
void myfunc() (D) None of the above
{ 11. In C++, which of the following operators
static int a;
cannot be overloaded ?
...}
(A) ?:
(A) The function is not reentrant
(B) a is allocated on the stack of the (B) []
function myfunc
(C) – –
(C) a is visible only in the file prog.cpp
(D) =
(D) a is a constant
II 4 A-04-02
Text of page 5
*A0402*
12. Which is the correct tag to display a 15. Which of the following is False ?
(A) BCNF Partially eliminates
picture?
redundancy due to FDs
(A) <imgsrc = “Picture.jpg” >
(B) 4NF eliminates redundancy due to
(B) <imgcrs = “Picture.jpg” > MVDs.
(C) <imgscr = “Picture.jpg” > (C) 3NF preserves FDs
(D) Binary relation is always in BCNF
(D) <img source = “Picture.jpg” >
16. Consider the relation scheme R(A,B,C)
13. If storage class is missing in the array
with the functional dependencies AB C
definition, by default it will be taken to be and C A , then the scheme is in
(A) automatic (A) Third normal form but not in BCNF
(B) external (B) Second normal form but not in 3NF
(C) Boyce-Codd Normal Form
(C) static
(D) Only in Second Normal Form
(D) either automatic or external
17. Which of the following statements about
depending on the place of
the view concept in SQL is INVALID ?
occurrence
(A) The definition of a view should not
14. Which of the following is suitable for have an ORDER BY clause in it
(B) All views are not updatable
converting a weak entity set into a strong
(C) The views are instantiated at the time
entity set in ER Modelling ?
they are referenced and not when
(A) Using Generalization they are defined
(B) Using aggregation (D) The views may be referenced in an
(C) Add suitable attributes SQL statement wherever tables are
(D) All the above referenced
II 5 A-04-02
Text of page 6
*A0402*
18. A hash function f defined as f(key) = key mod 7, 21. Create AVL tree for the nodes 70, 60, 80,
with linear probing, is used to insert the 50, 65 and 68. How many leaves are there
keys 37, 38, 72, 48, 98, 11, 56 into a table
in the resultant tree ?
indexed from 0 to 6. What will be the
(A) 2
location of key 11?
(B) 3
(A) 0 (B) 2
(C) 3 (D) 5 (C) 4
19. Average successful search time taken by (D) 5
binary search on a sorted array of 10 items
22. Assume that the operators +, –, x are left
is
associative and ^ is right associative. The
(A) 2.9 (B) 2.8
(C) 2.7 (D) 2.6 order of precedence (from highest to
20. Inverted list organization lowest) is ^, x, +, –. The postfix expression
(A) means storing records in contiguous corresponding to the infix expression
blocks according to a key a + b x c – d ^ e ^ f is
(B) stores records sequentially but uses
(A) abc x + def ^ ^ –
an index to locate records
(B) abc x + de ^ f ^
(C) uses an index for each key type
(D) has records placed randomly (C) ab + c x d – e ^ f ^
throughout the file (D) – + a x bc ^ ^ def
II 6 A-04-02
Text of page 7
*A0402*
23. A program reads in 500 integers in the 25. The routing algorithm takes the decision
range (0, 100) representing the marks of to change the route when
500 students. It then prints the frequency (A) router changes
of each mark above 50. What be the best (B) transmission time does not change
way for the program to store the (C) topology changes
(D) user changes
frequencies ?
(A) An array of 550 numbers 26. In Public key cryptography, which of the
following statements is/are correct
(B) An array of 100 numbers
I. Everybody(public) can decrypt the
(C) An array of 50 numbers
message without help
(D) A dynamically allocated array of
II. One has to get the public key from CA
500 numbers
for decrypting
24. In OSI, Flow control is an issue for
III. Sender uses public key to encrypt
(A) physical layer
(A) I only
(B) application layer
(B) II only
(C) network layer
(C) II and III only
(D) transport layer
(D) all of these
II 7 A-04-02
Text of page 8
*A0402*
27. The interrupt that is generated when 30. A grammar with productions E E + E |E *E
division by zero is termed as is
(A) Program interrupt (A) Unambiguous
(B) User interrupt (B) Regular
(C) I/O interrupt (C) Ambiguous
(D) Timer interrupt
(D) None of the above
28. When exceptional situation occurs outside
31. It is possible for Belady’s anomaly to
CPU, the hardware signal given is that
occur in __________ page replacement
(A) RESET
method.
(B) INTERRUPT
(A) Optimal
(C) HOLD
(B) FIFO
(D) EXIT
(C) LIFO
29. In a two-pass assembler, adding literals
(D) LRU
to literal table and address resolution of
32. The module that gives control of the CPU
local symbols are done during
to the process selected by the short-term
(A) First pass and second pass
scheduler is
respectively
(B) Second pass (A) Context Switcher
(C) Second pass and first pass (B) Compiler
respectively (C) Dispatcher
(D) First pass (D) Monitor
II 8 A-04-02
Text of page 9
*A0402*
33. In Unix Operating System, an image is 35. Kernel comprises of
defined as an execution environment. (A) Secondary routines of Operating
Appropriate order of the three Systems
components of the image are (B) Monitoring routines of the Operating
Systems
(A) text segment, code segment and map
(C) The set of primitive functions upon
segment
which rest of the operating system
(B) program text segment, data segment
functions are built
and stack segment
(D) Supervisory routines of Operating
(C) text segment, map segment and data Systems
segment
36. Semaphore variables can be edited by
(D) code segment, function segment and (A) User processes only
data segment (B) User processes and supervisory
processes
34. Expansion of SPOOL
(C) Supervisory processes only
(A) Simultaneous Processor Operation
(D) None of the above
On Line
37. For a software, mean time to failure is
(B) Simultaneous Peripheral Operation
equal to mean time to repair. What is the
On Line
availability of the software ?
(C) Simultaneous Peripheral Operation
(A) 90%
Off Line (B) 80%
(D) Simultaneous Processor Operation (C) 70%
Off Line (D) 50%
II 9 A-04-02
Text of page 10
*A0402*
38. By computing the Cyclomatic Complexity 40. Acceptance testing is
of a graph G having 13 vertices, 4 decision
(A) running the system with line data
vertices, 1 connector, find the number of
edges in G.
by the actual user
(A) 13
(B) 10 (B) making sure that the new
(C) 9
programs process certain
(D) 8
transactions according to
39. What is the appropriate pairing of items in
the two columns listing various activities specifications
in a software life cycle ?
Group 1 Group 2 (C) checking the logic of one or more
P) Requirements 1. Module
programs in the candidate systems
Analysis development and
integration (D) testing changes made in an
Q) Design 2. Domain Analysis
existing or a new program
R) Implementation 3. Performance
Tuning
41. ________ is wireless protocol used to
S) Maintenance 4. Structural and
Behavioral communicate for short distances.
Modelling (A) Blue Tooth
(A) P-4, Q-2, R-3, S-1
(B) Firewire
(B) P-3, Q-4, R-1, S-2
(C) Ethernet
(C) P-2, Q-3, R-1, S-4
(D) P-2, Q-1, R-3, S-4 (D) IEEE 802.3
II 10 A-04-02
Text of page 11
*A0402*
42. _______ transmission is good for homes 44. Large Companies have limit to use data
and small businesses because they warehousing due to high cost of
development. In such situations,
receive mode data than they send.
companies use a lower cost, scaled
(A) DSL
down version of data warehouse. The
(B) SDSL
name of such data warehouse is termed
(C) ADSL
as
(D) UTP
(A) Distributed database
43. Data Warehouse Design is based upon (B) Operational data store
the concept of ______, which is a retrieval (C) Dependent data mart
based model that supports high volume (D) Independent data mart
query access.
45. Apriori Algorithm is used for
(A) Entity Relationship modelling (A) Forming clusters
(B) Dimension Modelling (B) Classifying the objects
(C) OLAP (C) Association
(D) OO data model (D) None of the above
II 11 A-04-02
Text of page 12
*A0402*
46. ID3 algorithm uses _______ measure. 49. Which of the following Statements are
correct ?
(A) Loss
I. Windows uses priority based
(B) Gini index
pre-emptive scheduling
(C) Gain ratio
II. Unix uses priority based
(D) Gain
pre-emptive scheduling
47. Asynchronous Transfer Mode (ATM) has III. Windows uses round robin based
which of the following features ? pre-emptive scheduling
I. It is connection oriented IV. UNIX uses round robin based
pre-emptive scheduling
II. It can reach high speeds (10 gbps)
(A) I and II
III. It uses fixed 53 byte cells
(B) III and IV
(A) I and II
(C) I and IV
(B) II and III (D) II and III
(C) All of these
50. With respect to GPRS, identify correct
(D) I and III statement(s)
I. It is a scheme for third Generation
48. SAP and Oracle are examples of
mobile telephony
(A) Large Enterprise ERP
II. It is an overlay packet network on
(B) Medium Business ERP
top of GSM
(C) Small Business ERP
(A) I and II only (B) I only
(D) Non-ERP Database Companies
(C) II only (D) None
II 12 A-04-02
Text of page 13
*A0402*
Space for Rough Work
II 13 A-04-02
Text of page 14
*A0402*
Space for Rough Work
II 14 A-04-02
Text of page 15
*A0402*
Space for Rough Work
II 15 A-04-02
Text of page 16
*A0402*
Space for Rough Work
II 16 A-04-02Official key not published for this paper.
Page 1 of 16
Source: Telangana State Eligibility Test. Question paper published by Telangana State Eligibility Test.