Test Paper : II

Test Booklet Serial No. : _______________________

Test Subject : COMPUTER SCIENCE
AND APPLICATIONS OMR Sheet No. : _________________________________

Test Subject Code : K-2414 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 Óܧ٨ Ü È
Ü É ¯ÊÜá¾ ÃæãàÇ ®ÜíŸÃÜ®áÜ ° ŸÃæÀáÄ. 1. Write your roll number in the space provided on the top of this page.
2. D ±Ü£ÅPæ¿áá ŸÖÜá BÁáR Ë«Ü¨Ü IÊÜñÜᤠ±ÜÅÍæ°WÜÙÜ®Üá° JÙÜWæãíw¨æ. 2. This paper consists of fifty multiple-choice type of questions.
3. ±ÜÄàPæÒ¿á ±ÝÅÃíÜ »Ü¨È Ü É , ±ÜÅÍ° æ ±ÜâÔ¤P¿
æ á®Üá° ¯ÊÜáWæ ¯àvÜÇÝWÜáÊÜâ¨Üá. Êæã¨ÜÆ 5 ¯ËáÐÜWÙÜ È Ü É 3. At the commencement of examination, the question booklet will
¯àÊÜâ ±ÜâÔ¤P¿æ á®Üá° ñæÿ æ áÆá ÊÜáñÜᤠPæÙXÜ ®Üíñæ PÜvÝx¿áÊÝX ±ÜÄàQÒÓÆ Ü á PæãàÃÜÇÝX¨æ. be given to you. In the first 5 minutes, you are requested to
(i) ±ÜÅÍ°æ ±ÜâÔ¤PW
æ æ ±ÜÅÊàæ ÍÝÊÜPÝÍÜ ±Üv¿ æ áÆá, D Öæã©Pæ ±Üâo¨Ü Aíb®Ü ÊæáàÈÃÜáÊÜ open the booklet and compulsorily examine it as below :
±æà±Üà ÔàÆ®Üá° ÖÜÄÀáÄ. ÔrPRÜ Ã ÔàÇ CÆÉ¨Ü ±ÜÅͱ °æ âÜ Ô¤Pæ ÔÌàPÜÄÓܸàæ w. ñæè
æ Ü (i) To have access to the Question Booklet, tear off the paper
±ÜâÔ¤P¿ æ á®Üá° ÔÌàPÜÄÓܸàæ w. seal on the edge of this cover page. Do not accept a booklet
(ii) ±ÜâÔ¤Pæ¿áÈÉ®Ü ±ÜÅÍæ°WÜÙÜ ÓÜíTæ ÊÜáñÜᤠ±ÜâoWÜÙÜ ÓÜíTæ¿á®Üá° ÊÜááS±Üâo¨Ü ÊæáàÇæ without sticker-seal and do not accept an open booklet.
ÊÜáá©Åst ÊÜÞ×£Áãí©Wæ ñÝÙæ ®æãàwÄ. ±ÜâoWÜÙáÜ /±ÜÅÍW°æ ÙÜ áÜ PÝOæ¿Þ¨Ü, (ii) Tally the number of pages and number of questions
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
4. ±ÜÅ£Áãí¨Üá ±ÜÅÍW°æ ã Ü (A), (B), (C) ÊÜáñÜᤠ(D) Gí¨Üá WÜáÃÜá£Ô¨Ü ®ÝÆáR ±Ü¿Þì¿á period of 5 minutes. Afterwards, neither the Question
EñܤÃÜWÜÚÊæ. ¯àÊÜâ ±ÜÅÍæ°¿á G¨ÜáÃÜá ÓÜÄ¿Þ¨Ü EñܤÃÜ¨Ü ÊæáàÇæ, PæÙÜWæ PÝ~Ô¨Üíñæ Booklet will be replaced nor any extra time will be given.
AívÝPÜꣿá®Üá° PܱݳXÓܸàæ PÜá. 4. Each item has four alternative responses marked (A), (B), (C)
E¨ÝÖÜÃO Ü æ: A B C D and (D). You have to darken the oval as indicated below on the
(C) ÓÜÄ¿Þ¨Ü EñܤÃÜÊÝX¨ÝªWÜ. correct response against each item.
5. ±ÜÅÍæ° ±Ü£ÅPæ I ÃÜÈÉ PæãqrÃÜáÊÜ OMR EñܤÃÜ ÖÝÙæ¿áÈÉ , ±ÜÅÍæ° ±Ü£ÅPæ I ÊÜáñÜᤠExample : A B C D
±ÜÅÍæ° ±Ü£ÅPæ II ÃÜÈÉ CÃÜáÊÜ ±ÜÅÍæ°WÜÚWæ ¯ÊÜá¾ EñܤÃÜWÜÙÜ®Üá° ÓÜãbÓÜñÜPÜR¨Üáª. OMR EñܤÃÜ where (C) is the correct response.
ÖÝÙæ¿áÈÉ AívÝPÜꣿáÆÉ¨æ ¸æàÃæ ¿ÞÊÜâ¨æà ÓܧÙܨÜÈÉ EñܤÃÜÊÜ®Üá° WÜáÃÜá£Ô¨ÜÃæ, 5. Your responses to the questions are to be indicated in the OMR
A¨ÜÃÜ ÊÜåèÆÂÊÜÞ±Ü®Ü ÊÜÞvÜÇÝWÜáÊÜâ©ÆÉ. Sheet kept inside the Paper I Booklet only. If you mark at any
6. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ Pæãor ÓÜãaÜ®æWÜÙÜ®Üá° hÝWÜÃÜãPÜñæÀáí¨Ü K©Ä. place other than in the ovals in the Answer Sheet, it will not be
7. GÇÝÉ PÜÃÜvÜá PæÆÓÜÊÜ®Üá° ±ÜâÔ¤Pæ¿á Pæã®æ¿áÈÉ ÊÜÞvÜñÜPÜR¨Ü᪠. evaluated.
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
»ÝWܨÜÈÉ ŸÃæ¨ÜÃæ, ¯àÊÜâ A®ÜÖÜìñæWæ ¸Ý«ÜÂÃÝXÃÜᣤàÄ. Answer Sheet, except for the space allotted for the relevant
9. ±ÜÄàPæÒ¿áá ÊÜááX¨Ü®ÜíñÜÃÜ, PÜvÝx¿áÊÝX OMR EñܤÃÜ ÖÝÙæ¿á®Üá° ÓÜíËàPÜÒPÜÄWæ entries, which may disclose your identity, you will render yourself
¯àÊÜâ ×í£ÃÜáXÓܸàæ PÜá ÊÜáñÜᤠ±ÜÄàPÝÒ PæãsÜw¿á ÖæãÃÜWæ OMR ®Üá° ¯Êæã¾í©Wæ liable to disqualification.
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
11. ¯àÈ/PܱÜâ³ ¸ÝÇ ±ÝÀáíp ±æ® ÊÜÞñÜÅÊæà E±ÜÁãàXÔÄ. Answer Sheet soon after the examination.
12. PÝÂÆáRÇàæ oà A¥ÜÊÝ ÇÝW pæàŸÇ CñÝ©¿á E±ÜÁãàWÜ樆 áÜ ° ¯Ðæà—ÓÜÇÝX¨æ. 11. Use only Blue/Black Ball point pen.
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-2414 1 ±Üâ.£.®æãà./P.T.O.
*k-2414* Total Number of Pages : 8

COMPUTER SCIENCE AND APPLICATIONS

Paper – II
Note : This paper contains (50) fifty objective type questions, each question carrying
two (2) marks. Attempt all the questions.

1. Let R denote the set of real numbers. 4. If L1, L2 ⊆ Σ * , L1 ∈ P and L2 is neither 0

Let f : R × R → R × R be bijective
nor Σ * then
function defined by f(x, y) = (x + y, x – y)
(A) L ≤ PL
inverse function of f is given by 1 2
(B) L2 ≤ PL1
⎡ 1 1 ⎤
(A) f −1(x, y) = ⎢ , ⎥ (C) Both (A) and (B) of above
⎣x + y x − y⎦ (D) None of the above
(B) f −1(x, y) = ( x − y, x + y ) 5. The Language
−1 ⎡x + y x − y⎤
(C) f (x, y) = ⎢ , {
L = anbmcnbm n ≥ 1,m ≥ 1 }
⎣ 2 2 ⎥⎦
(A) Is context free
(D) f −1(x, y) = ⎡ 2 ( x − y ) , 2 ( x + y ) ⎤
⎣ ⎦ (B) Is not context free
(C) Abstract problem of checking
2. Let f : R → R be defined by
number of formal and actual
⎧x + 2 (x ≤ − 1) parameters
⎪⎪
f(x) = ⎨ x 2 (−1 ≤ x ≤ 1) (D) Both (B) and (C) of above
⎪
⎪⎩ 2 − x (x ≥ 1) 6. Which of the following consume
minimum power ?
Then value of f( –1.75) + f(0.5) + f(1.5) is (A) TTL
(A) 0 (B) 2 (B) CMOS
(C) 1 (D) –1 (C) DTL
3. Let R1 and R2 be 2 equivalence (D) RTL
relations on a set consider the following
7. The output of a JK flip-flop with
assertions :
asynchronous preset and clear input is
I : R1 ∪ R2 is an equivalence relation. ‘1’. The output can be changed to ‘0’
II : R1 ∩ R2 is an equivalence relation with one of the following conditions
Which of the following is correct ? (A) By applying J = 0, K = 0 and using a
(A) Both assertions are true clock
(B) Assertion I is true but assertion II is (B) By applying J = 1, K = 0 and using a
not true clock
(C) Assertion II is true but Assertion I is (C) By applying J = 1, K = 1 and using a
not true clock
(D) Neither I nor II is true (D) By applying a synchronous preset
input
Paper II 2 K-2414
*k-2414* Total Number of Pages : 8
8. How many two input AND and OR gates 12. Identify the most appropriate sentence
are required to realize Y = CD + EF + G to describe union.
(A) 2, 2 (B) 2, 3 (A) Unions are like structures
(C) 3, 3 (D) 2, 1
(B) Unions contains members of
9. Values of X1 and X2, where different data types which share the
X1 = (23.6)10, X2 = (65.535)10, may be same storage area in the memory
represented as
(C) Unions are less frequently used in
(A) (10111.100100)2 and (41.88 F5)16
the program
(B) (10111.11001)2 and (41.88 F5C)16
(D) Unions are used for set operations
(C) (10111.1001100)2 and
(41.88 F5E)16 13. Suppose DATA array contains
(D) (10111.10011)2 and 1000000 elements using binary
(41.88 F5C28)16 search algorithm one requires only n
10. A combination circuit has 3 inputs A, B, compositions to find location of an
C and output F. F is true for following item in DATA array, then n is
input combination. (A) 60
A is false, B is true
(B) 45
A is false, C is true
(C) 20
A, B, C are false
(D) None of these
A, B, C are true
(i) F = A + B C (ii) F = A + B C 14. The maximum combined length of
command line arguments including
(iii) F = (A
BC (iv) F = (A
BC) the space between adjacent
(A) All (i), (ii), (iii), (iv) are possible arguments is
(B) Only (i) is possible (A) 128 characters
(C) Only (i) and (iv) are possible
(B) 256 characters
(D) Only (i) and (iii) are possible
(C) 67 characters
11. What will be the output of the following (D) It may very from one operating
program
system to another
main ( )
{ 15. Which of the following is not a type of
static char a [ ] = "BOMBAY" ; constructor ?
char * b = "BOMBAY" ; (A) Copy constructor
printf("\n%d % d" size of (a), size of (b)); (B) Friend constructor
}
(C) Default constructor
(A) a = 7, b = 7 (B) a = 7, b = 2
(D) Parameterized constructor
(C) a = 2, b = 7 (D) a = 7, b = 0

K-2414 3 Paper II
*k-2414*
16. Evaluate the set of SQL statements :
CREATE TABLE dept
(deptho NUMBER (2),
dname VARCHAR 2(14),
loc VARCHAR 2(131) ;
ROLLBACK ;
DESCRIBE DEPT
What is true about the set ?
(A) The DESCRIBE DEPT statement
displays the structure of the DEPT
table
(B) The ROLLBACK statement frees the
storage space occupies by the
DEPT table
(C) The DESCRIBE DEPT statement
returns an error, object DEPT does
not exist
(D) The DESCRIBE DEPT statement
displays the structure of the DEPT
table only if there is a COMMIT
statement introduced before the
ROLLBACK statement
17. Evaluate the SQL statement
SELECT ROUND (TRUNC
(MOD(1600, 10), –1), 2)
FROM dual ;
What will be displayed ?
(A) 0 (B) 1
(C) 0.00 (D) 1.00
18. In a SELECT statement that includes a
WHERE clause, where is the GROUP
By clause placed in the SELECT
statement ?
(A) Before the WHERE clause
(B) After the ORDER BY clause
(C) Immediately after the SELECT
clause
(D) After the WHERE clause
Paper II
Total Number of Pages : 8
19. In which case would you use a FULL
OUTER JOIN ?
(A) Both tables have NULL values
(B) You want all unmatched data from
both tables
(C) One of the tables has more data
than the other
(D) You want all unmatched data from
one table
20. What is necessary for your query on an
existing view to execute successfully ?
(A) The underlying table must have
data
(B) The underlying tables must be in the
same schema
(C) You need SELECT privileges on the
view
(D) You need SELECT privileges only
on the underlying tables
21. In a row-major 2 dimensional array of
size m×n, the address of element a(i, j)
is obtained by the general equation
(A) base address + (j*m*size) +
(i*n*size)
(B) base address + (i*n*size) +
(j*m*size)
(C) base address + (i*n*size) + (j*size)
(D) base address + (i*size) + (j*m*size)
22. The postfix of the infix expression
((((a/b) – c) + (d*c)) – a *c)
(A) a/bc – de * + ac * –
(B) ab/c – de + * ac * –
(C) ab/c – de * + ac – *
(D) ab/c – de * + ac * –
4 K-2414
*k-2414* Total Number of Pages : 8
23. The total number of nodes in a complete 28. In a banyan switch, for 8 inputs and
binary tree of height n is 8 outputs, we have ________ stages.
(A) 2n
(A) 8
(B) 2n – 1 – 1
(B) 4
(C) 2n – 1
(D) 2n + 1 (C) 3
(D) 2
24. In the process of depth first search in a
graph, the adjacency list is maintained 29. X.25 recommendation makes
in a references to different standards.
(A) Stack Match these standards :
(B) Tree
(i) X.1 (a) Categories of access
(C) Graph
(ii) X.2 (b) Reference connections
(D) Queue
for packets
25. The Indices of an Index sequential file
(iii) X.10 (c) User classes of
maintains the details of
services
(A) Record structure
(B) Storage structure (iv) X.92 (d) User facilities
(C) Address of records based on key (A) i – b, ii – c, iii – a, iv – d
field (B) i – c, ii – d, iii – a, iv – b
(D) None of the above
(C) i – b, ii – d, iii – a, iv – c
26. IP addresses are converted to (D) i – a, ii – d, iii – b, iv – c
(A) A binary string
(B) Alphanumeric string 30. Use RSA algorithm, with p = 3, q = 11,
(C) A hierarchy of domain names and e = 7, the public and private keys
(D) A hexadecimal string will be
(A) (7, 33) (3, 33)
27. Among services available on the World
Wide Web are (B) (7, 11) (3, 22)
(i) Encryption (C) (3, 33) (11, 37)
(ii) HTTP (D) (7, 11) (3, 33)
(iii) HTML
31. Run-time is
(iv) Firewalls
(A) (i) and (ii) (A) Static policy
(B) (ii) and (iii) (B) Dynamic policy
(C) (iii) and (iv) (C) Hybrid policy
(D) (i) and (iv) (D) Mixed policy

K-2414 5 Paper II
*k-2414* Total Number of Pages : 8

32. In the statement, which is the key 37. “Throughput” of a system is

word ? (A) Number of programs processed by
(A) 100 it per unit time
(B) DO (B) Number of times the program is
(C) I invoked by the system
(D) 25 (C) Number of requests made to a
program by the system
33. Which is compilation order ? (D) Number of programs loaded in the
I. Lex first memory
II. Yacc second
38. For the following page reference string
III. Lex second
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 with frame
IV. Yacc first size is equal to 3 find out number of
(A) II and III page faults with FIFO ?
(B) III and IV (A) 8
(C) I and II (B) 9
(D) IV and I (C) 10
(D) 11
34. Which is interpreter ?
(A) C 39. Suppose file 1 contains the following
(B) Pascal 1 one
(C) PL 2 two
(D) Perl 3 three
and file 2 contains
35. VHDL is related to
1 11
(A) Software
2 22
(B) Firmware
3 33
(C) Hardware
issuing the command
(D) Internet

join – j 1 file 1 file 2
36. A critical section is a program results
segment (A) 1 one 11
(A) Which should run in a certain 2 two 22
specified amount of time 3 three 33
(B) Which avoids deadlocks (B) 1 one 11 two 22 three 33
(C) Where shared resources are (C) One 11
accessed two 22
(D) Which must be enclosed by a pair three 33
of semaphore operations P and V (D) One 11 two 22 three 33

Paper II 6 K-2414
*k-2414* Total Number of Pages : 8

40. If you want to find all the lines in a file 46. In Loopback address, first byte
called slnolist that begin with a number equal to
(A)
grep *[0 – 9] slnolist (A) 127
(B)
grep @[0 – 9] slnolist (B) 128
(C)
grep ![0 – 9] slnolist (C) 255
(D)
grep ∧ [0 – 9] slnolist (D) 126

41. Which one of the below is not a software 47. e-mail auto-replies are created using
development model ? (A) e-mail rules
(A) Prototyping (B) web rules
(B) Incremental (C) message rules
(C) Cocomo (D) internet rules
(D) Spiral
48. What does SSL stands for
42. RAD stands for (A) System Socket Layer
(A) Rapid And Design (B) Superuser System Login
(B) Rapid Aided Development (C) Secure System Layer
(C) Rapid Application Design (D) Secure Socket Layer
(D) Rapid Application Development
49. DNS is
43. Debugging is the process of (A) The distributed hierarchical naming
(A) Checking for errors system
(B) Locating errors (B) The vertical naming system
(C) Correcting errors (C) The horizontal naming system
(D) Finding syntax errors (D) The client server system
44. Software maintenance is required for 50. Imagery that you can see in Google
(A) Enhancement Earth.
(B) Changes (A) Represents one snapshot in time
(C) Corrections from when the image was acquired
(D) All of the above (B) Is updated via a live link to a Google
Satellite in orbit
45. Which one is not considered in (C) Represents the current satellite
software quality ? image from when you start Google
(A) Maintenance earth
(B) Feasibility (D) Is not updated – you must use
(C) User friendly (usability) Keyhole viewer program to the
(D) Portability current imagery
____________

K-2414 7 Paper II
*k-2414* Total Number of Pages : 8

bñÜᤠŸÃÜÖÜPÝRX ÓܧÙÜ

Space for Rough Work

Paper II 8 K-2414
 KSET -2014
KEY - Paper - II

Subject: COMPUTER SCIENCE AND APPLICATIONS Code: 24

Q.No Ans Q.No Ans Q.No Ans
1 C 21 C 41 C
2 C 22 # 42 D
3 C 23 # 43 B&C
4 A 24 A 44 D
5 B 25 C 45 B
6 B 26 C 46 A
7 C 27 B 47 C
8 A 28 C 48 D
9 D 29 B 49 A
10 D 30 A 50 A
11 B 31 B
12 B 32 B
13 C 33 C
14 D 34 D
15 B 35 C
16 A 36 C
17 A 37 A
18 D 38 B
19 B 39 A
20 C 40 D
 KSET -2014
KEY - Paper - III
Subject:COMPUTER SCIENCE & Code: 24
APPLICATIONS
Q.No Ans Q.No Ans Q.No Ans
1 A 26 C 51 D
2 A 27 A 52 #
3 B 28 B 53 A
4 D 29 A 54 B
5 A 30 D 55 A
6 D 31 C 56 B
7 A 32 D 57 A
8 C 33 B 58 C
9 B 34 A 59 C
10 B 35 A 60 A
11 C 36 D 61 D
12 D 37 C 62 D
13 A 38 B 63 C
14 B 39 C 64 B
15 B 40 A 65 #
16 D 41 A 66 A
17 B 42 B 67 B
18 A 43 D 68 A
19 D 44 C 69 A
20 C 45 C 70 A
21 C 46 D 71 B
22 A 47 C 72 C
23 D 48 B 73 A
24 C 49 C 74 A
25 C 50 A 75 C