TS SET 2012: Paper III, Computer Scienceand Applications
Text of page 1
Test Paper : III Test Booklet Serial No. : ______________________
OMR Sheet No. : ________________________________
Test Subject : COMPUTER SCIENCE
AND APPLICATIONS Hall Ticket No.
Test Subject Code : A-04-03 (Figures as per admission card)
Name & Signature of Invigilator
Name : ____________________________________ Signature : ___________________________________
Paper : III
Subject : COMPUTER SCIENCE AND APPLICATIONS
Time : 2 Hours 30 Minutes Maximum Marks : 150
Number of Pages in this Booklet : 16 Number of Questions in this Booklet : 75
Instructions for the Candidates A¿æýÅÆæÿ$¦ËMæü$ çÜ*^èþ¯èþË$
1. Write your Hall Ticket Number in the space provided on the top
1. D ç³#r ò³O ¿êVæü ÌZ CÐèþÓºyìþ¯èþ çÜ¦Ë ÌZ Ò$ çàÌý sìýMðüsý ¯èþ ºÆæÿ$ Æ>Äæý$ yìþ.
of this page.
2. This paper consists of seventy five multiple-choice type of 2. D {ç³Ôèý² ç³{èþÐèþ$$ yðþ¿ñýOI§æþ$ ºçßý$âñýO_eMæü {ç³Ôèý²Ë¯èþ$ MæüÍW E ¨.
questions. 3. ç³Èæü {´ëÆæÿ ¿æýÐèþ$$¯èþ D {ç³Ôé²ç³{èþÐèþ$$ Ò$Mæü$ CÐèþÓºyæþ$èþ$ ¨. Ððþ$$§æþsìý I§æþ$
3. At the commencement of examination, the question booklet will °Ñ$çÙÐèþ$$ËÌZ D {ç³Ôé²ç³{èþÐèþ$$¯èþ$ ðþÇ_ Mìü §æþ ðþÍí³¯èþ A Ôé˯èþ$ èþç³µ°çÜÇV>
be given to you. In the first 5 minutes, you are requested to open çÜÇ^èþ*çÜ$Mø yìþ.
the booklet and compulsorily examine it as below : (i) D {ç³Ôèý² ç³{èþÐèþ$$¯èþ$ ^èþ*yæþyé°Mìü MæüÐèþÆÿõ³h A ^èþ$¯èþ E¯èþ² M>Wèþç³# ïÜË$¯èþ$
(i) To have access to the Question Booklet, tear off the paper _ ^èþ yìþ. íÜtMæüPÆÿ ïÜË$Ìôý° Ðèþ$ÇÄæý$$ C¨ÐèþÆæÿMóü ðþÇ_ E¯èþ² {ç³Ôé²ç³{èþÐèþ$$¯èþ$
seal on the edge of this cover page. Do not accept a booklet Ò$Ææÿ$ A XMæüÇ ^èþÐèþ§æþ$ª.
without sticker-seal and do not accept an open booklet. (ii) MæüÐèþÆæÿ$ õ³h ò³O Ðèþ$${¨ _¯èþ çÜÐèþ*^éÆæÿ {ç³M>Ææÿ D {ç³Ôèý²ç³{èþÐèþ$$ÌZ° õ³iË
(ii) Tally the number of pages and number of questions in çÜ Qůèþ$ Ðèþ$ÇÄæý$$ {ç³Ôèý²Ë çÜ Qůèþ$ çÜÇ^èþ*çÜ$Mø yìþ. õ³iË çÜ QÅMæü$
the booklet with the information printed on the cover çÜ º «¨ _ V>± Ìôý§é çÜ*_ _¯èþ çÜ QÅÌZ {ç³Ôèý²Ë$ ÌôýMæü´ùÐèþ#r Ìôý§é °f{ç³
page. Faulty booklets due to pages/questions missing M>Mæü´ùÐèþ#r Ìôý§é {ç³Ôèý²Ë$ {MæüÐèþ$糧æþ®ÌZ ÌôýMæü´ùÐèþ#r Ìôý§é HÐðþO¯é óþyéË$ yæþ$r
or duplicate or not in serial order or any other Ðèþ sìý §øçÙç³NÇèþÐðþ$O¯èþ {ç³Ôèý² ç³{é°² Ððþ r¯óþ Ððþ$$§æþsìý I§æþ$ °Ñ$ÚëÌZÏ ç³È>
discrepancy should be got replaced immediately by a ç³ÆæÿÅÐóþæüMæü$°Mìü ÇW C_aÐóþíÜ §é°Mìü º§æþ$Ë$V> çÜÇV>Y E¯èþ² {ç³Ôèý²ç³{é°² ¡çÜ$Mø yìþ.
correct booklet from the invigilator within the period èþ§æþ¯èþ èþÆæÿ {ç³Ôèý²ç³{èþÐèþ$$ Ðèþ*Ææÿaºyæþ§æþ$ A§æþ¯èþç³# çÜÐèþ$Äæý$ CÐèþÓºyæþ§æþ$.
of 5 minutes. Afterwards, neither the Question Booklet
(iii) ò³O Ñ«§æþ V> çÜÇ^èþ*çÜ$Mö¯èþ² èþÆ>Óèþ {ç³Ôé²ç³{èþ çÜ Qůèþ$ OMR ç³{èþÐèþ$$ ò³O
will be replaced nor any extra time will be given.
A§óþÑ«§æþ V> OMR ç³{èþÐèþ$$ çÜ Qůèþ$ D {ç³Ôé²ç³{èþÐèþ$$ ò³O °ÇªçÙt çÜ¦Ë ÌZ Æ>Äæý$ÐèþÌñý¯èþ$.
(iii) After this verification is over, the Test Booklet Number
should be entered in the OMR Sheet and the OMR Sheet
4. {ç³ {ç³Ôèý²Mæü$ ¯éË$Væü$ {ç³éÅÐèþ*²Äæý$ {ç³çܵ §æþ¯èþË$ (A), (B), (C) Ðèþ$ÇÄæý$$ (D)
Number should be entered on this Test Booklet.
Ë$V> CÐèþÓºyézÆÿ$$. {ç³{ç³Ôèý²Mæü$ çÜÆðÿO¯èþ {ç³çܵ §æþ¯èþ¯èþ$ G¯èþ$²Mö° Mìü §æþ ðþÍí³¯èþ Ñ«§æþ V>
4. Each item has four alternative responses marked (A), (B), (C) OMR ç³{èþÐèþ$$ÌZ {ç³ {ç³Ôé² çÜ QÅMæü$ CÐèþÓºyìþ¯èþ ¯éË$Væü$ Ðèþé¢ÌZÏ çÜÆðÿO¯èþ
and (D). You have to darken the circle as indicated below on the {ç³çܵ §æþ¯èþ¯èþ$ çÜ*_ ^óþ Ðèþ颰² »êÌý ´ëÆÿ$$ sý ò³¯þø Mìü §æþ ðþÍí³¯èþ Ñ«§æþ V>
correct response against each item. ç³NÇ ^éÍ.
Example : A B C D
E§éçßýÆæÿ×ý : A B C D
(C) çÜÆðÿO¯èþ {ç³çܵ §æþ¯èþ AÆÿ$$óþ
where (C) is the correct response.
5. {ç³Ôèý²ËMæü$ {ç³çܵ §æþ¯èþ˯èþ$ D {ç³Ôèý²ç³{èþÐèþ$$ø CÐèþÓºyìþ¯èþ OMR ç³{èþÐèþ$$ ò³O¯èþ
5. Your responses to the items are to be indicated in the OMR Sheet CÐèþÓºyìþ¯èþ Ðèþé¢ÌZϯóþ ç³NÇ _ Væü$Ç¢ ^éÍ. AÌêM>Mæü çÜÐèþ*«§é¯èþ ç³{èþ ò³O ÐóþÆöMæü ^ør
given to you. If you mark at any place other than in the circle in Væü$Ç¢õÜ¢ Ò$ {ç³çܵ §æþ¯èþ Ðèþ$*ÌêÅ Mæü¯èþ ^óþÄæý$ºyæþ§æþ$.
the Answer Sheet, it will not be evaluated. 6. {ç³Ôèý² ç³{èþÐèþ$$ ÌZç³Ë C_a¯èþ çÜ*^èþ¯èþ˯èþ$ gê{Væüèþ¢V> ^èþ§æþÐèþ yìþ.
6. Read instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
7. _èþ$¢ç³°° {ç³Ôèý²ç³{èþÐèþ$$ _ÐèþÆæÿ C_a¯èþ RêäçܦËÐèþ$$ÌZ ^óþÄæý*Í.
8. If you write your name or put any mark on any part of the OMR 8. OMR ç³{èþÐèþ$$ ò³O °È~èþ çÜ¦Ë ÌZ çÜ*_ ^èþÐèþËíܯèþ ÑÐèþÆ>Ë$ èþí³µ _ CèþÆæÿ çÜ¦Ë ÌZ
Answer Sheet, except for the space allotted for the relevant Ò$ Væü$Ç¢ ç³#¯èþ$ ðþÍõ³ Ñ«§æþ V> Ò$ õ³Ææÿ$ Æ>Äæý$yæþ V>± Ìôý§é CèþÆæÿ _à²Ë¯èþ$ ò³rtyæþ
entries, which may disclose your identity, you will render yourself V>± ^óþíܯèþrÏÆÿ$$óþ Ò$ A¯èþÆæÿáèþMæü$ Ò$Æóÿ »ê«§æþ$ÅËÐèþ#éÆæÿ$.
liable to disqualification. 9. çç³Èæü ç³NÆæÿ¢Æÿ$$¯èþ èþÆ>Óèþ Ò$ {ç³Ôèý²ç³{é°² Ðèþ$ÇÄæý$$ OMR ç³{é°² èþç³µ°çÜÇV>
9. You have to return the test question booklet and OMR Answer ç³Èæüç³ÆæÿÅÐóþæüMæü$yìþMìü CÐéÓÍ. Ðésìý° ç³Èæü Væü¨ ºÄæý$rMæü$ ¡çÜ$Mæü$ÐðþâæýÏMæü*yæþ§æþ$.
Sheet to the invigilators at the end of the examination compulsorily 10. ±Í/¯èþËÏ Ææÿ Væü$ »êÌý ´ëÆÿ$$ sý ò³¯þ Ðèþ*{èþÐóþ$ Eç³Äñý*W ^éÍ.
and must not carry it with you outside the Examination Hall.
11. ÌêVæüÇ£æþÐþ$ sôýº$ÌýÞ, M>ÅÍMæü$ÅÌôýrÆÿË$, GË[M>t°Mü ç³ÇMæüÆ>Ë$ Ððþ$$§æþËVæü$¯èþÑ ç³ÈæüVæü¨ÌZ
10. Use only Blue/Black Ball point pen.
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 ç³# Ìôý§æþ$.
IIIá 1 A-04-03
Text of page 2
*A0403* IIIá 2 A-04-03
Text of page 3
*A0403*
COMPUTER SCIENCE AND APPLICATIONS
Paper – III
1. A method of providing security to transport 4. The simplified form of the boolean
e-mails is expression ( x + y′ + z) ( x + y′ + z′)
( x + y + z)
(A) TLS
(A) x′y + z
(B) PGP
(B) xy + z
(C) IP-sec
(C) x + y′z
(D) BGP (D) x′ + y′z
2. A combinational circuit is designed to take 5. Arrange the following IP addresses in the
4 bit input. The number from 0 to 9 are order of Class A, Class B, Class C and
given as input in the binary form. The circuit Class D.
outputs ‘1’ if 5,6,7 or 9 are given input. I. 193. 200. 151. 2
For all other numbers the circuit outputs II. 189. 51. 21. 200
‘0’. The circuit is designed only using AND,
III. 225. 2. 2. 200
OR, NOT gates. What is the minimum
IV. 126. 8. 2. 200
number of gates required ?
(A) I, IV, II, III
(A) 2
(B) III, II, IV, I
(B) 3
(C) IV, II, I, III
(C) 4 (D) II, III, IV, I
(D) 5
6. Addressing modes of the following 8085
3. The MAC protocol used in Ethernet is instructions in the same order.
LDA, LXI, ADD r1, r2, MOV A,M
(A) ALOHA
(A) Implicit, Indirect, Direct, Register
(B) Token ring
(B) Implicit, Indirect, Register, Immediate
(C) CSMA/CD (C) Direct, Indirect, Immediate, Register
(D) Token bus (D) Direct, Immediate, Register, Indirect
IIIá 3 A-04-03
Text of page 4
*A0403*
7. The concatenation of two lists is to be 9. Search algorithms are Judged on the basis
of
performed in 0(1) time. Which of the
I. Completeness
following implementation of a list should II. Optimality
be used ? III. Time complexity
IV. Space complexity
(A) Singly linked list
(A) I and II
(B) I, II and III
(B) Doubly linked list
(C) II, III and IV
(C) Circularly doubly linked list (D) All of the above
(D) Array implementation of list 10. Choose the answer from the following
register(s) that store the address of a
memory location.
8. Match the following : I. Program counter
II. Accumulator
I. Non vectored interrupt 1. ISR
III. MAR
II. Non Maskable interrupt 2. RST2 IV. BC Register pair
(A) I and II are correct
III. Program for interrupt 3. TRAP
(B) II and III are correct
(C) I and IV are correct
IV. Software Interrupt 4. INTR
(D) I and III are correct
I II III IV
11. If G be a complete undirected graph on
6 vertices. If vertices of G are labeled then
(A) 4 3 1 2 the number of distinct cycles of length 4 in
G is equal to
(B) 2 3 4 1 (A) 15
(B) 30
(C) 1 4 3 2
(C) 90
(D) 2 1 3 4 (D) 360
IIIá 4 A-04-03
Text of page 5
*A0403*
12. The number of vectored interrupts in 16. An Abstract Data Type (ADT) is
8085 is
(A) same as an abstract class
(A) 4
(B) a data type that cannot be instantiated
(B) 5
(C) a data type for which only the
(C) 6
operations defined on it can be used
(D) 3
(D) all of the above
13. The Java compiler translates source code
17. In a paged memory the page hit ratio is
into
0.35. The time required to access a page
(A) Machine Code
in secondary memory is equal to 100 nsec.
(B) Assembly Code
The time required to access a page in
(C) Byte Code
primary memory is 10 nsec. The average
(D) All of the above time required to access a page is
14. Object-Modelling Technique was (A) 55 nsec.
proposed by
(B) 68 nsec.
(A) Booch
(C) 68.5 nsec.
(B) Rambaugh
(D) 78.5 nsec.
(C) Jacobson
18. ______________ abstraction is a named
(D) All of the above
sequence of instructions that has a specific
15. The following scheduling algorithm is
and limited function.
inherently pre emptive
(A) Procedural
(A) FCFS
(B) Data
(B) SJF
(C) LJF (C) Control
(D) Round Robin (D) Physical
IIIá 5 A-04-03
Text of page 6
*A0403*
19. A process executes the code 21. The overlay tree for a program is given
below. What will be the size of the physical
fork ( ) ; memory partition required to load and run
the program ?
fork ( ) ;
fork ( ) ;
fork ( ) ;
8KB
The total number of child processes
(A) 8 KB (B) 20 KB
created is
(C) 12 KB (D) 14 KB
(A) 4
22. The complexity of inter connection among
(B) 15 modules is described by
(C) 7 (A) Cohesion
(B) Temporal cohesion
(D) 5
(C) Logical cohesion
(D) Coupling
20. If A = { 0, 1 }, then the number of possible
23. A 1000 K byte memory is managed using
strings of length ‘n’ is
variable partitions but to compaction. It
currently has two partitions of sizes 200 K
(A) n !
bytes and 340 K bytes respectively. The
(B) n × n smallest allocation request in K bytes that
could be denied is for
n
(C) n
(A) 380 (B) 520
(D) 2n (C) 481 (D) 461
IIIá 6 A-04-03
Text of page 7
*A0403*
24. The grammar guaranteed by production 27. The algorithm used for searching AND-OR
rules graph is
S → a SBc , CB → BC , aB → aa is (A) A*
(A) an bn cn, n ≥ 1 (B) AO*
n n n (C) Iterative deepening A*
(B) a b c , n ≥ 0
(D) Iterative deepening AO*
(C) an bn cn, n > 0
28. The PROJECT operator of a relational
(D) an bn cn, n ≤ 0
algebra creates a new table that has
always
25. The following page replacement
algorithms suffer from Belady’s anomaly. (A) More number of columns than original
table
I. Optimal replacement
(B) More number of rows than the original
II. LRU
table
III. FIFO
(C) Same number of rows as the original
IV. MRU table
(A) I and IV correct (B) I and III correct (D) Same number of columns as the
(C) II and III correct (D) II and IV correct original table
26. Given the basic ER and relational models, 29. The Natural Language sentence will be
represented in NLP with
which of the following is INCORRECT ?
I. ATN
(A) An attribute of an entity can have more
than one value II. RTN
(B) An attribute of an entity can be III. FPL
composite IV. FRAMES
(C) In a row of a relational table, an (A) III, IV
attribute can have more than one value (B) IV, I
(D) In a row of a relational table, an (C) I, II
attribute can have exactly one value
(D) II, III
or a NULL value
IIIá 7 A-04-03
Text of page 8
*A0403*
30. The file organization in which the physical 32. Which of the sorting algorithm is the
location of a record is determined by a slowest ?
Mathematical function that maps the key
(A) Bubble sort
to address of the record is
(B) Quick sort
(A) Hashed file organization
(C) Shell sort
(B) B Tree file organization
(D) Heap sort
(C) B′ Tree file organization
33. The approach used in top-down analysis
(D) Sequential file organization
and design is
31. Consider the following statements about (A) to identify the top level functions by
the cyclomatic complexity of the control combining many smaller components
flow graph of a program module. Which of into a single entity
these are TRUE ? (B) to identify a top level function and then
i. The cyclomatic complexity of a module create a hierarchy of lower level
is equal to the maximum number of modules and components
linearly independent circuits in the (C) to prepare flowcharts after
graph. programming has been completed
ii. The cyclomatic complexity of a module (D) all of the above
is the number of decisions on the
module plus one. Where a decision is 34. Match the following :
effectively any conditional statement I. Flow control 1. Token Bucket
in the module. II. Error control 2. Sliding window
iii. The cyclomatic complexity can also be III. Congestion control 3. Manchester
used as a number of linearly encoding
independent paths that should be
IV. Synchronization 4. Parity bit
tested during path coverage testing
I II III IV
(A) i and ii
(A) 2 4 1 3
(B) ii and iii (B) 3 4 2 1
(C) i and iii (C) 4 2 1 3
(D) i, ii and iii (D) 1 4 2 3
IIIá 8 A-04-03
Text of page 9
*A0403*
35. Slow start is a technique used by the TCP 38. What is difference between a Java applet
to reduce and a Java application ?
(A) Number of buffers
(A) An application can in general be
(B) Number of timers
trusted whereas an applet can’t
(C) Number of TCP connections
(B) An applet must be executed in a
(D) Number of timeouts of segments
browser environment
36. A B-Tree used as an index for a large
database table has four levels including (C) An applet is not able to access the
root node. If a new key is inserted in this files of the computer it runs on
index, then the maximum number of nodes
(D) All of the above
that could be newly created in the process
are 39. The following machine will accept the
(A) 5 string
(B) 4
(C) 3 (A) aaab
(D) 2 (B) aabab
37. Consider the following proportional (C) baaab
statements
(D) bab
P1 : ((A ∧ B) → C ) ≡ ((A → C) ∧ (B → C))
P2 : ((A ∨ B) → C ) ≡ ((A → C) ∨ (B → C)) 40. Types of validation testing
Which one of the following are true ? (A) Alpha and Beta Testing
(A) P1 is tautology, but not P2
(B) Top down and Bottom up testing
(B) P2 is tautology, but not P1
(C) P1 and P2 are tautologies (C) Recovery and Integrity testing
(D) Both P1 and P2 are not tautologies (D) All the above
IIIá 9 A-04-03
Text of page 10
*A0403*
41. Choose the correct answer, the protocols 44. In UNIX, when the read system call
which returns IP address.
encounters EOF, it returns
I. ARP
II. RARP (A) Some positive integer
III. HTTP
IV. DNS (B) Positive integer related to error code
(A) I and II correct (C) 0
(B) All correct
(C) I, II, III correct (D) –1
(D) II and IV correct
45. Which of the following regular expression
42. Assuming P ≠ NP, which of the following
is TRUE ? identities are true ?
(A) NP – complete = NP
1
(A) (r′) = r
(B) NP – complete nP = φ
(C) NP – hard = NP (B) (r′s′)1 = (r + s)1
(D) P = NP – Complete
(C) (r + s)1 = r′ + s′
43. What is the appropriate pairing of items in
the two columns, listing various activities (D) r′s′ = r′ + s′
encountered in a software life cycle ?
P. Requirements 1. Module
capture Development 46. The message 11001001 is to be transmitted
and Integration
using the CRC polynomial x3 + 1 to protect
Q. Design 2. Domain
analysis it from errors. The message that should be
R. Implementation 3. Structural transmitted is
Behavioural
Modelling (A) 11001001000
S. Maintenance 4. Performance
Tuning (B) 11001001011
(A) P – 3, Q – 2, R – 4, S – 1
(B) P – 2, Q – 3, R – 1, S – 4 (C) 11001010
(C) P – 3, Q – 2, R – 1, S – 4
(D) 110010010011
(D) All of the above
IIIá 10 A-04-03
Text of page 11
*A0403*
47. _______________ is black box testing 51. Neural Networks are models of
method.
(A) Decision making system
(A) Boundary value analysis
(B) Data processing system
(B) Basic path analysis
(C) Control systems
(C) Code validation analysis
(D) Biological nervous systems
(D) All of the above
Question No.’s 52 and 53
48. If the hamming distance is ‘m’ then the
Disk requests come to a disk drive for
number of errors that can be corrected is
cylinders 10, 22, 20, 2, 40, 6 and 36 in
(A) Equal to ‘m’
that order at a time when the disk drive is
(B) Less than m/2 reading from cylinder 20. The seek time is
(C) Equal to 2 m 6 ms per cylinder. The disk can be rotated
either clockwise or counter clockwise.
(D) Greater than 2 m
52. The total seek time if the disk arm
49. What is the maximum number of I/O scheduling algorithm is first-cum-first-
devices that can be interfaced to 8085 ? served.
(A) 64 (B) 8 (A) 360 msec.
(C) 32 (D) 256 (B) 850 msec.
(C) 876 msec.
50. Compression Ratio is defined as
(D) 900 msec.
(A) 1 – (compressed size/uncompressed
size) 53. If the scheduling algorithm is closest
cylinder next, then the total will be
(B) compressed size/uncompressed size)
(A) 360 msec.
(C) 1 – (compressed data rate/ (B) 876 msec.
uncompressed data rate)
(C) 900 msec.
(D) All of the above (D) 330 msec.
IIIá 11 A-04-03
Text of page 12
*A0403*
Question No.’s 54, 55 and 56 58. Inference Engine consists of
I. Facts
The next three questions are based on
Huffman’s coding for the symbol A with II. User Interface
probability 0.3, B with 0.15, C with 0.1, III. Search
D with 0.25 and E with 0.2. IV. Domain Expert
54. The minimum number of bits required to (A) I, II
represent B is (B) II, III
(A) 1 (B) 2 (C) I, III
(C) 3 (D) 4 (D) II, IV
55. The minimum number of bits required to 59. With regarding to exceptions following is
represent all the symbols together is TRUE
(A) 14 (A) Raised by program
(B) 11 (B) Raised by user
(C) 12 (C) Raised by OS
(D) 15 (D) Raised by program and OS
56. The average code length of the given
60. Which of the following concurrency control
problem is
protocols ensure both conflict
(A) 2 serializability and freedom from dead
(B) 2.25 deadlock
(C) 2.45 I. 2 – phase locking
(D) 3 II. Time-stamp ordering
57. Character Recognition is application of (A) I only
(A) Fuzzy Logic (B) II only
(B) Neural Networks
(C) Both I and II
(C) Genetic Algorithm
(D) Neither I nor II
(D) Logic
IIIá 12 A-04-03
Text of page 13
*A0403*
61. The following system calls are related to 63. Search engine is a ____________ agent.
file operations in UNIX (A) Learning
I. Signal (B) Negotiation
II. Kill (C) Intelligent
III. Seek (D) Business
IV. Unlink
64. The commonly used UNIX commands like
(A) I and III correct
date, ls, cut etc. are stored in
(B) III and IV correct
(A) / dev directory
(C) II and III correct
(B) / sys directory
D) II and IV correct
(C) / unix directory
62. HTML (Hyper Text Markup Language) has (D) / bin and /usr/bin directory
language elements which permit certain
65. ADO stands for
actions other than describing the structure
of the web document. Which one of the (A) Active × Data Object
following actions is not supported by pure (B) Active × Dynamic Object
HTML (without any server or client side
(C) Active × Downloadable Object
scripting) pages ?
(D) Active × Durability Object
(A) Embed web objects from different
sites into the same page 66. If f is a linear transformation from the plane
to the real numbers and if f(1, 1) = 1 and
(B) Refresh the page automatically after
f(–1, 0) = 0 then f (3, 5) =
a specified interval
(A) – 6
(C) Automatically redirect to another page
(B) – 5
upon download
(C) 0
(D) Display the client time as part of the
(D) 9
page
IIIá 13 A-04-03
Text of page 14
*A0403*
67. Fuzzy Logic is proposed by 70. Class C is inherited from Class A and
Class B, Class D is inherited from Class C
(A) MAMDHANI
Which of the following is true ?
(B) ZADEH I. Class C inherits Class A attributes
(C) MUZIMITO II. Class C inherits Class B attributes
(D) TANAKA III. Class D inherits Class B attributes only
IV. Class D inherits Class A attributes only
68. If the inorder and postorder traversal
(A) I, II
results of a binary tree are A, C, B, F, E, D,
G and A, B, C, E, G, D, F respectively. (B) I, II, III, IV
Identify the root node of it. (C) I, III
(A) A (D) None of the above
(B) D 71. Which of the following is an assertion ?
(C) C (A) P is true, P and Q are true and K or
not (Q) is true implies K is true
(D) F
(B) P is true, P and Q are true and K or
69. NLP includes problems not (Q) is true implies K is false
(C) P is true, P and Q are false and K or
(A) in which the objective function is
not (Q) is true implies K is true
linear but some constraints are not
(D) P is true
linear
72. In 8085, the addressing mode used for
(B) in which the constraints are linear but
LDAX rp instruction is
the objective function is not linear
(A) Direct
(C) in which both the objective function (B) Indirect
and all the constraints are not linear
(C) Register
(D) all of the above (D) Immediate
IIIá 14 A-04-03
Text of page 15
*A0403*
73. Given an arbitrary Non-deterministic Finite 75. Which of the following statements are
TRUE about an SQL query ?
Automation (NFA) with N states, the
maximum number of states in an P : An SQL query can contain a HAVING
equivalent minimized DFA is atleast clause even if it doesnot have a
2
(A) N GROUP by clause.
(B) 2N Q : An SQL query can contain a HAVING
clause only if it has GROUP by
(C) 2N
clause.
(D) N!
R : All attributes used in the GROUP by
74. The maximum packet size of IPV4 is clause must appear in the SELECT
clause.
(A) 1500 bytes
S : Not all attributes used in the GROUP
(B) 2 MB
by clause need to appear in the
(C) 65535 bytes SELECT clause.
(D) 48 bytes (A) P and R (B) P and S
(C) Q and R (D) Q and S
___________________
IIIá 15 A-04-03
Text of page 16
*A0403*
Space for Rough Work
IIIá 16 A-04-03Official key not published for this paper.
Page 1 of 16
Source: Telangana State Eligibility Test. Question paper published by Telangana State Eligibility Test.