WB SET Exam 2017: 20th SET, Paper III, Computer Science And Application
Text of page 1
SET-17-ComputerSc.-III(A)-E
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–III Question Booklet No.
(Identical with OMR
Subject Code : 22 Answer Sheet Number)
COMPUTER SCIENCE & APPLICATION
Time : 2 Hours 30 Minutes Maximum Marks: 150
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 seventy-five (75) 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-III
COMPUTER SCIENCE & APPLICATION
PAPER III
1. Vectored and non-maskable interrupt in 8085 is 4. Which is related to animation?
(A) RST 5·5 (A) Multiple frames
(B) RST 6·5 (B) Raster operations
(C) RST 7·5
(C) Morphing
(D) TRAP
(D) All of the above
2. HOLD/HLDA is related to
(A) Cycle Stealing
(B) Handshaking
(C) DMA
5. Actual
(D) Reading from and Writing to RAM X
Formal
Y
3. The following two tables are given:
R S The above diagram represents
A B A
(A) call-by-value
a1 b1 a1
a2 b1 a2 (B) call-by-name
a3 b1 a3
a4 b1 (C) call-by-reference
a4 b2 (D) None of the above
a5 b1
a1 b3
a2 b3
a3 b3
Find R ÷ S from the following options:
B B
(A) b1 (C) b1 6. In coroutines
b3 b2
(A) Master-Slave relationship strictly exists.
B (B) Master-Slave relationship can be switched.
B
b1 (C) Master-Slave relationship can not be defined.
(B) (D) b2
b2
b3
b3 (D) None of the above
Text of page 4
2217-III X-4
7. Point out the false one: 10. Find out the false one:
(A) ‘IF’ is always a two-way branching. (A) An Object is an instance of a Class.
(B) More than one Object can be created from a
(B) Switch-case can be implemented using IF.
Class.
(C) Switch-case is multiway-branching.
(C) From a Class another Class can be created.
(D) Unconditional GOTO is encouraged in
(D) Class is executable.
structured programming.
11. Which of the following software testing
methods tests on each smallest unit of software design?
(A) Smoke testing
(B) Integration testing
8. A linear queue has the following characteristics:
(C) Regression testing
(A) The queue has to be emptied at regular
interval of time. (D) Unit testing
(B) Requires two pointers.
(C) The empty condition is front = rear.
12. Under RR-CPU scheduling, we have the
(D) All of the above following table:
Process Burst Time
P1 20
P2 3
P3 3
9. The searching technique that takes O(1) time to Time quantum = 3 miliseconds. Calculate the
find an item is average waiting time.
(A) Tree search (A) 6·99 miliseconds
(B) Binary search (B) 5·00 miliseconds
(C) Linear search (C) 4·50 miliseconds
(D) Hashing (D) None of the above
Text of page 5
X-5 2217-III
13. In propositional logic, the following rule: 16. All of the information in a sinusoidal image can
be captured by
[(A → B) & (B → C)] → [(A → C)] represents
(A) The spatial frequency
(A) Modus Ponens
(B) The magnitude (+ve or –ve)
(B) Modus Tollens
(C) The Phase
(C) Hypothetical Syllogism
(D) All of the above
(D) Disjunctive Syllogism
14. PROLOG has following characteristics: 17. Regarding UNIX, which one is not true?
(A) AI Programming Language (A) It is multiuser.
(B) Built-in Inference Engine (B) Everything in UNIX is either a file or a
process.
(C) Automatic Backtracking
(C) It has no communication facility.
(D) All of the above
(D) It is portable.
15. A context-free grammar G = (V, Σ, R, S) is said
to be in Chomsky normal form if 18. Example of Meta Language—
(A) R ⊇ (V – Σ) × V
2
(A) BNF
(B) R ⊆ (V – Σ) × V
2
(B) CBL-Syntax
(C) R ⊆ (V – Σ) × V
3
(C) Pascal Syntax diagram
(D) R ⊇ (V – Σ) × V
3
(D) All of the above
Text of page 6
2217-III X-6
19. What is the transmission time for a 2·5 KB 22. Consider a database schema with attributes
message if the bandwidth of the network is 1Gbps? ABCDEF. One of the given sets of functional
dependencies is
(A) 0·030 ms
A → BC
(B) 0·020 ms
From A → BC, we can get A → C. This is done by
(C) 0·050 ms
(A) Augmentation
(D) 0·010 ms
(B) Transitive Rule
(C) Decomposition
20. Amplitude
(D) Union
20V 123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234
123456789012345678901234 Frequency
20KHz 120KHz 220KHz 23. Depth sort on priority algorithm is also called
The above signal is
(A) Direct Clipping
(A) non-periodic, composite, peak amplitude
(B) Canonical Clipping
20V.
(C) Painter’s Algorithm
(B) non-periodic, single, peak amplitude 20V.
(D) Orthographic Algorithm
(C) periodic, composite, peak amplitude 20V.
(D) periodic, non-composite, peak amplitude
20V.
24. If L1 and L2 are languages recognised by
machines M1 and M2 with n and m states respectively,
21. The Cache memory concept is based on the then the machine M that recognises L1. L2 will contain
principle of the following number of states:
(A) Memory-Mapped I/O (A) n
(B) Locality of Reference (B) m
(C) I/O mapped I/O (C) n + m
(D) Look ahead carry (D) nm
Text of page 7
X-7 2217-III
25. The regular expression for the set of strings 28. A student develops a technique to multiply
generated by the following CFG: two 2×2 matrices. The technique requires six
multiplications. The complexity of the module that
S → SaS/b is given by
combines the module is O(n2). Then the recursive
(A) b(ab)*
equation depicting the complexity of the algorithm is
(B) b(a + b)*
(A) T(n) = 6T(n/3) + O(n2 )
(C) a(a + b)*
(B) T(n) = 6T(n/2) + O(n2 )
(D) a(ab)*
(C) T(n) = 6T(2n ) + O(n2 )
(D) T(n) = T(n/2) + 6 O(n2 )
26. First (A)
(A) is the set of terminals that can start a string
that is derivable from A.
(B) is the set of terminals that can follow an
29. The binding that binds a function call at runtime
occurrence of A.
is called
(C) is the set of terminals that can be derived in
(A) Runtime binding
zero or more steps.
(B) Early binding
(D) is the set of non-terminals that is nullable.
(C) Late binding
(D) Binding by call
27. The mean Bit Error Rate (BER) of a digital
channel is
(A) the probability of a binary bit being
corrupted during its transmission across the
channel over a defined time interval.
30. What is the reason of cohesion in modules?
(B) is a measure of the average number of packets
(A) Intermodule Relationship
with binary bits.
(B) Intra-module Relationship
(C) the probability of a received packet
containing one or more bit errors. (C) Functional Relationship
(D) None of the above (D) Common Relationship
Text of page 8
2217-III X-8
31. Legacy systems are 34. A knowledge base is
(A) Legal softwares. (A) repository of the domain-specific
knowledge captured from the human expert.
(B) Systems used for long time.
(B) repository of the conceptual knowledge in
(C) Systems that have been developed in a long
the related field.
time span.
(C) repository of the knowledge derivation rules.
(D) Virus-affected system.
(D) None of the above.
32. A module p calls module q and q passes a flag
that means “I am unable to complete my task;
accordingly write error message ABC123”, then p and
q are
35. The power of Turing Machine is equivalent to
(A) Data coupled the language of the following grammar:
(B) Content coupled (A) Regular grammar
(C) Common coupled (B) Context-free grammar
(D) Control coupled (C) Unrestricted grammar
(D) Context sensitive grammar
33. Consider the following page trace:
4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
The percentage number of page faults that would
occur if FIFO page replacement algorithm is used with 36. The number of basic variables in an m × n
number of frames = 3, is transportation table are
(A) 63% (A) m + n – 1
(B) 75% (B) m + n
(C) 83% (C) m – n + 1
(D) 94% (D) mn
Text of page 9
X-9 2217-III
37. In UNIX, hidden files can be listed by using 1
40. The Fuzzy function μ A ( x ) = is referred
1 + e −γ x
(A) ls – lp
to as
(B) ls – lt (A) Gaussian Function
(C) ls – tt (B) Logistic Function
(D) None of the above (C) Unimodal Function
(D) Bimodal Function
38. The capacity of the memoryless channel 41. Let f be a flow in a flow network G with source s
capacity specfied by and sink t and let (S, T) be a cut of G. Then the netflow
⎡1 1 1 ⎤ across (S, T) is
⎢2 0⎥
4 4
⎢ ⎥ (A) f (S, T) = | f |
⎢1 1 1 1⎥
⎢4 4 4 4⎥ is given by (B) f (S, T) = | f +Δf |
⎢ ⎥
⎢0 0 1 0⎥
(C) f (S, T) = | f (S) + f (T) |
⎢1 1⎥
⎢ 0 0 ⎥
⎣2 2⎦ (D) None of the above
(A) 3/2 bits/symbol
(B) 5/2 bits/symbol
42. The hex contents of two CPU registers in a
(C) 7/2 bits/symbol 16-bit processor are
(D) 9/2 bits/symbol R0 = 7654
R1 = EDCB
The following instructions are executed to
transfer the contents of these registers to main
memory M:
STORE R0, ADDR
39. Fuzzy intersection of two Fuzzy sets A and B STORE R1, ADDR + 4
where A(x) = 0·6 and B(x) = 0·4 is M is byte-addressable. Give the contents of the
memory locations ADDR+2 and ADDR+6 affected by
(A) 0·4 the above code if the computer is Big-endian.
(B) 0·6 (A) 6, D
(B) 5, E
(C) 0·5
(C) 4, B
(D) None of the above (D) 7, C
Text of page 10
2217-III X-10
43. Consider the following zero-address 45. Which one of the following is true?
instructions of a zero-address machine:
(A) Distributed database provides faster
PUSH X
response to queries compared with
PUSH Y centralized database.
Divide
(B) Centralized database provides faster response
PUSH C to queries compared with distributed
PUSH C databases.
Multiply (C) The delay in distributed database response to
ADD queries may be unpredictable.
POP X (D) Availability is more in centralized database
What does the above program compute? than in distributed database.
(A) Y = (X/Y) + C
(B) X = ((X + C)Y)C
2 46. Consider the matrices:
(C) Y = X + C
⎡1 0 0 ⎤
(D) X = (X/Y) + C2
M 1 = ⎢⎢ 0 −1 0⎥⎥
⎢⎣ 0 0 1 ⎥⎦
⎡ −1 0 0⎤
M 2 = ⎢⎢ 0 1 0⎥⎥
44. The ER model is expressed in terms of ⎢⎣ 0 0 1⎥⎦
(i) entities
⎡−1 0 0⎤
M1 = ⎢⎢ 0 −1 0⎥⎥
(ii) relationship among entities
(iii) the attributes of the entities ⎢⎣ 0 0 1⎥⎦
(iv) functional relationship What is correct from the following?
Which of the following is correct? (A) Matrix M3 for reflection relative to an axis
perpendicular to the xy plane that passes
(A) (i), (ii) and (iii)
through the co-ordinate origin.
(B) (i), (ii) and (iv) (B) M2 for reflection about the line y = 0.
(C) (i), (iii) and (iv) (C) M1 for reflection relative to the line x = 0.
(D) (i) and (ii) (D) None of the above
Text of page 11
X-11 2217-III
47. Which of the following creates infinite loop in 50. Consider the Tower of Hanoi problem with 3
C languages? discs. Assuming notation A → B indicates that the top
most disc from tower A is moved to the top of tower B.
(A) while ( ; ; ) Which of the following sequence solves the problem?
(B) for ( ; ; ) (A) A → C, A → B, A → C, C → B, C → A,
B → C, C → A.
(C) when ( ; ; )
(B) A → B, A → C, B → C, C → A, B → C,
(D) if ( ; ; ) C → A, A → C.
(C) A → C, C → A, A → B, A → C, B → C,
48. Granularity measures C → A, B → C.
(D) A → C, A → B, C → B, A → C, B → A,
(A) relative amount of time spent in
B → C, A → C.
computation and communication in
parallel system.
51. What is meant by Weak method in AI?
(B) relative amount of time spent in (A) Non-search methods
communcation and computation. (B) Methods not exploiting domain knowledge
(C) amount of time spent in computation on a (C) Methods requiring less time
parallel system. (D) Methods not able to solve all problem
instances
(D) None of the above
52. Consider the following graph for depth-first
49. A queue of characters currently contains: a, b, search starting from node 3. Neighbours of a given
node are examined in increasing order. Which of the
c, d. The following sequence of operations are following is the correct sequence in this search?
performed on the queue: 1
One deletion, addition of x, one deletion,
addition of y. 3
4
2
The content of the queue is then put in a CPU register.
It is given left circular shift by two characters. What 5
6
would be the content of the register? 7
8
(A) cxyd
(A) 31245678
(B) xydc
(B) 32145876
(C) cdxy (C) 32145678
(D) xycd (D) 36785412
Text of page 12
2217-III X-12
53. What is the number of nodes to be accessed for 56. Consider the following MAX-MIN game tree in
finding a given key in a B-tree with branching factor 32 which the heuristic evalution scores (in the nodes of the
and the number of keys equal to 1048575? last level) are all from the first player’s (MAX) point of
(A) 7 view. What is the next move that should be chosen by
the first player?
(B) 4
A
(C) 10
(D) 6
B C D
54. An attribute Z is transitively dependent on X if
E F G H I J K
(A) X → Y, Y → Z.
4 3 2 7 4 7 4 9 4 3 9 8 6 6 5
(B) X → Y, Y → Z, but Y → X does not hold. L M N Q R S T U V W X Y Z Z′ Z′′
6 5
O P
(C) X → Y, Y → Z, but Z → Y does not hold.
(A) Node B
(D) Both (A) and (B)
(B) Node C
55. Consider the search problem represented in the
(C) Node D
following figure, where a is start node and e is the goal
node. The pair [f, h] at each node indicates the value of (D) None of the above
the f (total estimated cost of reaching a goal from the
start node via this node) and h (heuristic function:
estimated cost of reaching a goal from this node) 57. Match List I and List II and find the correct
functions for the path ending at the node. If A* search is answer using the codes given below the lists:
used, given this information, what is the cost of
edge c – f ? List I List II
a. Lexical analysis i. Finite automata
a [3, 3]
b. Code optimization ii. DAG’s
c. Code Generation iii. Syntax trees
b [4, 3] c [3, 1]
d. Parsing Programming iv. Pushdown automation
Codes:
d [5, 3] e [3, 0] f [5, 2]
a b c d
(A) 1 (A) iv ii i iii
(B) 2 (B) i ii iii iv
(C) 3 (C) iii ii i iv
(D) 4 (D) iv i ii iii
Text of page 13
X-13 2217-III
58. What is a SPOOLER? 62. Using public key cryptography, X adds a digital
(A) It is a hardware component. signature to message M, encrypts and sends it to Y,
where it decrypts. Which of the following sequences of
(B) It is a command interpreter.
keys is used for the operations?
(C) It is a part of a compiler.
(A) Encryption: X’s private key followed by
(D) It is a software component under O.S.
Y’s private key; Decryption: X’s public key
followed by Y’s public key.
59. In a syntax directed definition, terminals are
assumed to have synthesized attributes only because (B) Encryption: X’s private key followed by Y’s
public key; Decryption: X’s public key
(A) the definition does not provide any
followed by Y’s private key.
semantic rules for terminals.
(B) the definition and declaration does not (C) Encryption: X’s public key followed by Y’s
provide any expression for non-terminals. private key; Decryption: Y’s public key
followed by X’s private key.
(C) values for attributes of terminals are usually
supplied by lexical analyzer. (D) Encryption: X’s private key followed by Y’s
(D) None of the above public key; Decryption: Y’s private key
followed by X’s public key.
60. In Bresenham’s algorithm error term is initialized to
(A) 0
(B) 1
(C) – 1/2
63. Which of the following is NOT true with respect
(D) None of the above
to a transparent bridge and a router?
(A) Both bridge and router selectively forward
61. What is noise in terms of a software
data packets.
development?
(A) Writing irrelevant statement to the software (B) A bridge uses IP addresses while a router
development in the SRS document. uses MAC addresses.
(B) Adding contradictory requirements in SRS (C) A bridge builds up its routing table by
document. inspecting incoming packets.
(C) Writing over-specific requirements. (D) A router can connect between a LAN and
(D) None of the above WAN.
Text of page 14
2217-III X-14
64. The minimum number of non-basic cells in an 67. One of the compression techniques in MPEG
8×9 transportation problem is uses the fact that in most pictures, there is considerable
(A) 64 correlation between consecutive frames. This
(B) 16 compression is known as
(C) 17 (A) Spatial compression
(D) 56 (B) Temporal compression
(C) Random compression
65. In solving a maximizing type LPP at some
iteration the simplex tableau is found as follows: (D) Dynamic compression
Cj 5 4 6
CB B XB b a1 a2 a3
6 a3 X3 5 –5 0 1
4 a2 X2 8 –5/4 1 0
Zj – Cj – 40 0 0
68. Binary Huffman coding is a
Then the given LPP
(A) has no feasible solution. (A) Suffix condition code
(B) has an unbounded solution. (B) Prefix condition code
(C) has alternative optimal solution.
(C) Both (A) and (B)
(D) is inconclusive
(D) None of the above
66. Consider two variables x and y defined on
X = {x1, x2, x3} and Y = {y1, y2} respectively and a
proposition
“If x is A then y is B” where the fuzzy sets A and B
are given by A = 0·5/x1 + 1/x2 + 0·6/x3 and B =1/y1 + 0·4/y2.
If a given fact is expressed by the proposition “y is 'B”
where 'B = 0·5/y1 + 0·7/y2, then considering Lukasiewicz’s 69. Wavelet series equation is sum of
rule of implication a conclusion x is 'A is given by (A) Scaling coefficient
(A) 'A = 0·5/x1 + 0·5/x2 + 0·5/x3
(B) Detail coefficient
' = 0·7/x1 + 0·7/x2 + 0·7/x3
(B) A
' = 0·7/x1 + 0·5/x2 + 0·7/x3 (C) Span coefficient
(C) A
(D) 'A = 0·5/x1 + 0·7/x2 + 0·5/x3 (D) Both (A) and (B)
Text of page 15
X-15 2217-III
70. A single-layer perception can solve 73. The running time of an algorithm T(n), where n
is the input size is given by
(A) only linearly separable problems.
T(n) = 8T(n/2) + qn, if n > 1
(B) only non-linearly separable problems.
= p, if n = 1
(C) both linearly and non-linearly separable
where p,q are constants. The order of the
problems.
algorithm is
(D) some of the non-linearly separable problems. (A) n2
(B) nn
71. A CPU has 32 bit-memory address and each
word has size of 1 byte. Block size is 16 bytes. The size (C) n3
of the cache memory is 256 KB. The cache is organized (D) n
as a 4-way set associative manner. What is the total
amount of extra memory (in bytes) required for the tag 74. A schedule S is recoverable if for each pair of
bits? transactions Ti and Tj such that Tj reads an object
previously written by Ti, then
(A) 220
(A) commit operation Ti appears before the
(B) 2 15
commit operation Tj.
(C) 232 (B) commit operation Ti appears after the commit
operation Tj.
(D) 224
(C) commit sequence is immaterial.
72. Suppose a memory system contains the cache, (D) commit sequence depends upon the context
main memory and virtual memory access times as of the schedule.
5 nanoseconds, 100 nanoseconds and 10 miliseconds,
respectively. If cache hit rate is 0·8 and main memory 75. In which case, it is mandatory to provide a
hit rate is 0·995, then what is the average memory destructor in a Class
access time? (A) for which constructor is defined.
(A) 10024 ns (B) for which two or more than two objects will
be created.
(B) 100024 ns
(C) for which copy constructor is defined.
(C) 124 ns
(D) whose objects will be created dynamically.
(D) 1024 ns
Text of page 16
2217-III X-16
ROUGH WORKOfficial key not published for this paper.
Page 1 of 16
Source: West Bengal College Service Commission. Question paper published by West Bengal College Service Commission.