WB SET Exam 2017: 20th SET, Paper II, Computer Science And Application
Text of page 1
Signature of Invigilators
Roll No.
1. _______________________________
(Write Roll Number from left side
exactly as in the Admit Card) 2. _______________________________
Question Booklet Series X
2217
PAPER–II Question Booklet No.
(Identical with OMR
Subject Code : 22 Answer Sheet Number)
COMPUTER SCIENCE & APPLICATION
Time : 1 Hour 15 Minutes Maximum Marks: 100
Instructions for the Candidates
1. Write your Roll Number in the space provided on the top of this page as well as on the OMR Sheet provided.
2. At the commencement of the examination, the question booklet will be given to you. In the first 5 minutes, you
are requested to open the booklet and verify it:
(i) To have access to the Question Booklet, tear off the paper seal on the edge of this cover page.
(ii) Faulty booklet, if detected, should be get replaced immediately by a correct booklet from the invigilator
within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra
time will be given.
(iii) Verify whether the Question Booklet No. is identical with OMR Answer Sheet No.; if not, the full set to be
replaced.
(iv) After this verification is over, the Question Booklet Series and Question Booklet Number should be entered
on the OMR Sheet.
3. This paper consists of fifty (50) multiple-choice type questions. All the questions are compulsory. Each question
carries two marks.
4. Each Question has four alternative responses marked: A B C D . You have to darken the circle as
indicated below on the correct response against each question.
Example: A B C D , where C is the correct response.
5. Your responses to the questions are to be indicated correctly in the OMR Sheet. If you mark your response at
any place other than in the circle in the OMR Sheet, it will not be evaluated.
6. Rough work is to be done at the end of this booklet.
7. If you write your Name, Roll Number, Phone Number or put any mark on any part of the OMR Sheet, except
the space allotted for the relevant entries, which may disclose your identity, or use abusive language or employ
any other unfair means, such as change of response by scratching or using white fluid, you will render yourself
liable to disqualification.
8. Do not tamper or fold the OMR Sheet in any way. If you do so, your OMR Sheet will not be evaluated.
9. You have to return the Original OMR Sheet to the invigilator at the end of the examination compulsorily and
must not carry it with you outside the Examination Hall. You are, however, allowed to carry question booklet
and duplicate copy of OMR Sheet after completion of examination.
10. Use only Black Ball point pen.
11. Use of any calculator or mobile phone etc. is strictly prohibited.
12. There are no negative marks for incorrect answers.
[Please Turn Over]
Text of page 3
X–3 2217–II
COMPUTER SCIENCE & APPLICATION
PAPER II
1. P = {try, not, union} 4. Consider X as a n bit number which is a power (k)
Q = { and, bitand, complex} of 2. Then sum of X and X – 1 contain j zeros where,
X = {auto, goto, if} (A) j = n – k – 1
Z = {int, void, not} (B) j = n – k
Which one is correct? (C) j = n – k + 1
(A) Elements in P are C++ keywords. (D) j = 0
(B) Elements in Q are C++ keywords.
(C) Elements in X are C keywords only, but
5. Consider the following Trees:
those in Z are not.
(D) Elements in X and also in Z are C keywords. 50 50
2. For a DBMS to be used, it must minimally
support 27
5 27
5
(i) SELECT, UNION, INTERSECT
(ii) SELECT, UNION, JOIN
10 15 10 15
(iii) SELECT, PROJECT, JOIN
T1 T2
(iv) SELECT, PROJECT, UNION 55
Which one is correct?
(A) (iv)
17 35
(B) (iii)
(C) (ii)
(D) (i) 10 8 30
25
T3
3. Consider
Which one is correct?
L1 PP R / P 0, 1
*
(A) T1, T2, T3 are heaps.
(B) T2, T3 are heaps.
L2 0n 1n / n 1 (C) T1 is a heap, but not T2 and T3.
L3 PP / P 0, 1
*
(D) T1, T3 are heaps.
L4 a n b m c m d n / n, m 0
6. In mixed-mode arithmetic operation, an integer
and machines M1, M2, M3, M4 recognizing the Languages
is converted to floating-point form in the following
L1, L2, L3, L4 respectively. Which one is correct?
phase of a typical compiler:
(A) M1 and M2 are PDAs, but M3 and M4 are not. (A) Lexical analysis
(B) M2 and M3 are PDAs, but M1 and M4 are not. (B) Parsing
(C) All of M1, M2, M3 and M4 are PDAs. (C) Semantic analysis
(D) L1, L2, L4 are PDAs. (D) Intermediate code generation
Text of page 4
2217–II X–4
7. Front end of a typical compiler is constituted with 11. Floating-point multiplication requires
(A) Lexical, Syntax and Semantic analysis (A) a fixed-point multiplication of the mantissa
phases. and a fixed-point addition of the exponent.
(B) Lexical, Semantic and Code generation (B) a fixed-point multiplication of the mantissa
phases. and floating-point addition of the exponent.
(C) Intermediate code generation, code (C) a floating-point multiplication of the
optimization and code generation phases. mantissa and fixed-point addition of the
(D) Syntax, Semantic and Code optimization exponent.
phases. (D) a floating-point multiplication of the
mantissa and a floating-point addition of the
exponent.
8. Limitations of Banker’s algorithm of resource
distribution are as follows: 12. In a JK Flip-flop, toggle means
(A) It can handle more than two processes. (A) No change of output.
(B) The number of resources are static. (B) Set Q = 1 and Q = 0
(C) The number of processes are static. (C) Set Q = 0 and Q = 1
(D) Both (B) and (C) (D) Changing the output to the opposite state.
13. In C, arguments are passed to functions by
9. Parallelism is related to
(A) value
(A) Pipelining
(B) reference
(B) Multiple-Processor systems
(C) value-result
(C) Vector computers
(D) Both (A) and (B)
(D) All of the above
14. The following statements are given:
10. One of the following is not related to www: (A) BCNF is also in 3 NF.
(A) HTML (B) 3 NF is not necessarily in BCNF.
(B) URL (C) BCNF is stronger than 3 NF.
(C) UML (D) 3 NF must be in BCNF.
(D) HTTP Find out the false one.
Text of page 5
X–5 2217–II
15. In a B+ tree 19. How many Hamiltonian circuits are there in a
(A) Data pointers can be stored at any level of complete graph with n vertices?
(A) n 1
the tree.
(B) Data pointers can be stored only at the leaf 2
nodes of a tree. (B) n 1
(C) The searching time is same for any key. (C) n
(D) The leaf nodes contain the search field and
n 1
data pointer. (D)
2
Find out the incorrect one.
16. Which one of the following is not related to
20. Bipolar RAM usually makes use of
Mobile IP?
(A) TTL high speed circuit
(A) 2X
(B) DTL circuit
(B) Triangle routing
(C) RTL high speed circuit
(C) Dog-Leg routing
(D) None of the above
(D) Peer to Peer
17. SSL is designed to provide
21. Which of the following is the process by which a
(A) security and compression services to data
user’s privileges are ascertained?
generated from application layer.
(A) Authorization
(B) security and compression services to data
generated from network layer. (B) Authentication
(C) security and compression to data generated (C) Access Control
from physical layer. (D) None of the above
(D) security and compression to data generated
from transport layer.
22. Linked lists are not suitable data structures for
18. Data mining is related to which of the following problems?
(A) Knowledge Discovery (A) Insertion sort
(B) Classification (B) Polynomial multiplication
(C) Clustering (C) Radix sort
(D) All of the above (D) Binary search
Text of page 6
2217–II X–6
23. Consider a hashing function that resolves collision 27. Round Robin scheduling behaves like FCFS
by quadratic probing. Assume the address space is scheduling when
indexed from 1 to 8. Which of the following locations (A) the time slice is less than the average CPU
will never be probed if a collision occurs at position 4? burst.
(A) 4 (B) the time slice is less than the smallest CPU
(B) 5 burst.
(C) 7 (C) the time slice is greater than the average
(D) 2 CPU burst.
(D) the time slice is greater than the largest CPU
burst.
28. Verification and Validation are components of
24. Which of the protocols uses both TCP and UDP?
(A) Software Documentation
(A) FTP
(B) Total Quality Management
(B) SMTP
(C) Software Quality Assurance
(C) Telnet
(D) Testing
(D) DNS
29. The number of binary relations on a set with p
elements is
2
25. When you issue ping command, what protocol (A) p
are you using? (B) 2 p
(A) DNS 2
(C) 2 p
(B) DHCP
3
(C) ICMP (D) 2 p
(D) ARP
30. Let A and B be sets with number of elements a and
b respectively. Then for a < b, the number of one-to-one
mappings from A to B is
(A) a b
26. Shadow paging technique maintains
(A) two-page tables (B) a Pb
(B) three-page tables
(C) aCb
(C) four-page tables
(D) five-page tables (D) bPa
Text of page 7
X–7 2217–II
31. Which of the following statements is not true? 35. The operation of a relation X, produces Y such
(A) A tree with n vertices has (n – 1) edges. that Y contains only selected attributes of X. Such an
operation is
(B) Any connected graph with n vertices and
(n – 1) edges is a tree. (A) Projection
(C) A tree with n vertices has n edges. (B) Intersection
(D) A graph is a tree if and only if it is minimally (C) Union
connected. (D) Difference
32. Average-case complexity of sequential search if
the element that is searched is not in the list is
36. 2 NF is based on
p p
(A) n 1 (A) Partial dependency
2 2
(B) Transitive dependency
p p
(B) n 1 (C) Full functional dependency
2 2
(D) Non-trivial functional dependency
n p
(C)
2
pn 1
(D)
2
37. Which of the following traversal techniques lists
the nodes of Binary Search Tree in ascending order?
33. Which of the following statements do not satisfy (A) Postorder
the principles of structured programming? (B) Inorder
(A) The use of loop statements (C) Preorder
(B) The use of go to statements (D) None of the above
(C) The use of sequential program statements
(D) The use of if then else statements
34. A Base Class is inherited by 38. Telephone network works in
(A) a Derived Class (A) Simplex mode transmission
(B) Inline function (B) Half-duplex mode transmission
(C) Constructor (C) Full-duplex mode transmission
(D) None of the above (D) Arbitrary mode transmission
Text of page 8
2217–II X–8
39. In TCP/IP protocol suite, layers are arranged 43. The UNIX command “cat abc def > xyz”
from bottom to up as follows: (A) tests whether the variables abc and def are
(A) Physical, Data link, Application, Transport, both greater than xyz.
Network (B) merges two files abc and def with all values
greater than xyz.
(B) Physical, Network, Data link, Transport,
(C) merges the two files abc and def and stores
Application
it in xyz.
(C) Physical, Data link, Network, Transport, (D) is syntactically not correct.
Application
(D) Physical, Transport, Network, Data link, 44. If the base register holds 300040 and the limit
Application register is 120900, then the program can legally access
(A) all addresses from 300040 through 420939
(inclusive).
(B) all addresses from 300041 through 420940.
40. Tokens are identified during (C) all addresses from 300039 through 420939
(A) Lexical Analysis (inclusive).
(D) all addresses from 300039 through 420940.
(B) Syntax Analysis
(C) Semantic Analysis
45. For the following grammar:
(D) Code optimization
S A/ B
AC Ab/ a
BCBa/b
41. In function point analysis, number of complexity First (A) First (B ) is
adjustment factors are (A) a
(A) 10 (B) b
(B) 20 (C) ab
(D) c
(C) 14
(D) 12
46. For 0,1 , the regular expression
0 * 10 * 10 * 10 denotes
(A) all the binary strings possessing exactly three
42. Cyclomatic complexity is given by
1’s.
(A) V(G) = E – N + 2
(B) all the nonempty binary strings.
(B) V(G) = P + 1
(C) all the binary strings including empty string.
(C) The number of regions
(D) all the binary strings possessing more than
(D) All of the above two 1’s.
Text of page 9
X–9 2217–II
47. Mutation testing is related to 49. The general Caesar Cipher Substitution function
(A) Fault seeding for encryption is given by
(B) Functional testing (A) C = (p + k) mod 26
(C) Genetic algorithm (B) C = p mod 26
(D) Fault cracking (C) C = k mod 26
(D) C = (p – k) mod 26
where p is plaintext letter and k takes on a value in the
range 1 to 25.
48. Program volume of a software product is
50. The nearest value of 113 16 3·6 8 is
(A) V N log 2 n
(A) (11010·1)2
(B) V N / 2 log 2 n
(B) (1030·2)10
(C) V 2 N log 2 n (C) (111·8)16
(D) V N log 2 n 1 (D) (467·4)8
Text of page 10
2217–II X–10
ROUGH WORK
Text of page 11
X–11 2217–II ROUGH WORK
Text of page 12
2217–II X–12
ROUGH WORKOfficial key not published for this paper.
Page 1 of 12
Source: West Bengal College Service Commission. Question paper published by West Bengal College Service Commission.