Page:13
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'LECTURER IN COMPUTER SCIENCE COLLEGIATE EDUCATION' And exam conducted in the year 2018. And Question paper code was '073/2018'. Medium of question paper was in Malayalam or English . Booklet Alphacode was 'A'. Answer keys are given at the bottom, but we suggest you to try answering the questions yourself and compare the key along wih to check your performance. Because we would like you to do and practice by yourself.
83.
84.
85,
86.
87.
88,
89.
90.
91.
One of the most important structured analysis and design 00115
(A) DFD (8) Deployment diagram
(೮) Use-case diagram (D) None of the above
Which of the following is a black-box testing strategy ?
(^^) Path testing (B) Equivalence class partitioning
(C) Branch testing (D) None of the above
The UML behavioural modelling consists of which all diagrams ?
(ക) Class and object diagrams (8) Component and deployment diagrams
(C) Activity and interaction diagrams (D) None of the above
Which of the following concurrency control protocols ensure both conflict serializability and
freedom from deadlock ?
1. 2-phase locking
2. Time-stamp ordering
(ಹ) lonly (8) 2only
(C) Neither 1 nor2 (D) 800% 1 धात 2
Which one of the following statements is false ?
(A) Any relation with two attributes is in BCNF.
(B) A prime attribute can be transitively dependent on a key in a 3NF relation.
(C) A prime attribute can be transitively dependent on a key in a BCNF relation.
(D) Any relation with two attributes is in BCNF.
Consider & relational schema R=(A,B,C,D,E,H) on which the following functional dependencies
hold: {A — B, BC - D, E — C, D — A}.What are the candidate keys of R ?
(A) AE, BE,DE (B) AEH, BEH, DEH
(©) AEH, BEH, BCH (D) AE,BE
Given relations r(w, x) and s(y, z) the result of select distinct w, x from r, s is guaranteed to be
same 85 1, provided
(4) rand s have no duplicates
(B) s has no duplicates and r is non-empty
(C) rand s have the same number of tuples
(D) rhas no duplicates and s is non-empty
Which one of the following statements about normal forms is false ?
(^) BCNF is stricter than 3 NF.
(B) Lossless, dependency preserving decomposition into 3NF is always possible.
(C) Lossless, dependency preserving decomposition into BCNF is always possible.
(D) Any relation with two attributes is in BCNF.
Let El and E2 be two entities in an ER diagram with simple single valued attributes. 31 فصد R2 are
two relationships between El and E2, where Rl is one-to-many and R2 is many-to-many. Rl and
R2 do not have any attributes of their own. What is the minimum number of tables required to
represent this situation in the relational model ?
ക) 2 0) 3
(ಲ) 4 D) 5
13 073/2018