KSET 2020 Question Paper Computer Science and Applications

Paper : II

Booklet SERIAL No.
Subject : Computer Science and Applications
Subject Code : 24

Roll No.
(Figures as per admission card)

OMR Sheet No. : ____________________

Name & Signature of Invigilator/s
Signature : _________________________________
Name : _________________________________
Time : 2 Hours Maximum Marks : 200
Number of Pages in this Booklet : 16 Number of Questions in this Booklet : 100
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 Ë«Ü¨Ü ®ÜãÃÜá (100) ±ÜÅÍæ°WÜÙÜ®Üá° JÙÜWæãíw¨æ. 2. This paper consists of Hundred multiple-choice type of questions.
3. ±ÜÄàPæÒ¿á ±ÝÅÃÜí»Ü¨È
Ü É, ±ÜÅÍæ° ±ÜâÔ¤P¿
æ á®Üá° ¯ÊÜáWæ ¯àvÜÇÝWÜáÊÜâ¨Üá. Êæã¨ÜÆ 5 ¯ËáÐÜWÜÙÜÈÉ 3. At the commencement of examination, the question booklet will be
¯àÊÜâ ±ÜâÔ¤Pæ¿á®Üá° ñæÃæ¿áÆá ÊÜáñÜᤠPæÙÜX®Üíñæ PÜvÝx¿áÊÝX ±ÜÄàQÒÓÜÆá PæãàÃÜÇÝX¨æ. given to you. In the first 5 minutes, you are requested to open the booklet
(i) ±ÜÅÍæ°±ÜâÔ¤PæWæ ±ÜÅÊæàÍÝÊÜPÝÍÜ ±Üvæ¿áÆá, D Öæã©Pæ ±Üâo¨Ü Aíb®Ü ÊæáàÈÃÜáÊÜ and compulsorily examine it as below :
±æà±ÜÃ… ÔàÆ®Üá° ÖÜÄÀáÄ. ÔrPÜRÃ… ÔàÇ… CÆÉ¨Ü A¥ÜÊÝ ñæÃæ¨Ü ±ÜâÔ¤Pæ¿á®Üá° (i) To have access to the Question Booklet, tear off the paper seal
on the edge of the cover page. Do not accept a booklet without
ÔÌàPÜÄÓܸæàw.
sticker seal or open booklet.
(ii) ±ÜâÔ¤Pæ¿áÈÉ®Ü ±ÜÅÍæ°WÜÙÜ ÓÜíTæ ÊÜáñÜᤠ±ÜâoWÜÙÜ ÓÜíTæ¿á®Üá° ÊÜááS±Üâo¨Ü ÊæáàÇæ
(ii) Tally the number of pages and number of questions in the
ÊÜáá©Åst ÊÜÞ×£Áãí©Wæ ñÝÙæ ®æãàwÄ. ±ÜâoWÜÙÜá/±ÜÅÍæ°WÜÙÜá PÝOæ¿Þ¨Ü A¥ÜÊÝ
booklet with the information printed on the cover page. Faulty
©Ì±ÜÅ£ A¥ÜÊÝ A®ÜáPÜÅÊÜáÊÝXÆÉ¨Ü A¥ÜÊÝ CñÜÃÜ ¿ÞÊÜâ¨æà ÊÜÂñÝÂÓÜ¨Ü ¨æãàÐܱÜäÄñÜ booklets due to pages/questions missing or duplicate or not in
±ÜâÔ¤Pæ¿á®Üá° PÜãvÜÇæ 5 ¯ËáÐÜ¨Ü AÊܘ JÙÜWæ, ÓÜíËàPÜÒPÜÄí¨Ü ÓÜÄ CÃÜáÊÜ ±ÜâÔ¤PæWæ serial order or any other discrepancy should be got replaced
Ÿ¨ÜÇÝÀáÔPæãÙÜÛ¸æàPÜá. B ŸÚPÜ ±ÜÅÍ氱ܣÅPæ¿á®Üá° Ÿ¨ÜÇÝÀáÓÜÇÝWÜáÊÜâ©ÆÉ, immediately by a correct booklet from the invigilator within
¿ÞÊÜâ¨æà ÖæaÜác ÓÜÊÜá¿áÊÜ®Üã° PæãvÜÇÝWÜáÊÜâ©ÆÉ. the period of 5 minutes. Afterwards, neither the Question
4. ±ÜÅ£Áãí¨Üá ±ÜÅÍæ°WÜã (A), (B), (C) ÊÜáñÜᤠ(D) Gí¨Üá WÜáÃÜá£Ô¨Ü ®ÝÆáR ±Ü¿Þì¿á Booklet will be replaced nor any extra time will be given.
EñܤÃÜWÜÚÊæ. ¯àÊÜâ ±ÜÅÍæ°¿á G¨ÜáÃÜá ÓÜÄ¿Þ¨Ü EñܤÃÜ¨Ü ÊæáàÇæ, PæÙÜWæ PÝ~Ô¨Üíñæ 4. Each item has four alternative responses marked (A), (B), (C) and (D).
AívÝPÜꣿá®Üá° PܱݳXÓܸæàPÜá. You have to darken the circle as indicated below on the correct response
E¨ÝÖÜÃÜOæ : A B C D against each item.
(C) ÓÜÄ¿Þ¨Ü EñܤÃÜÊÝX¨ÝªWÜ. Example : A B C D
5. D ±ÜÅÍæ° ±Ü£ÅPæ¿á hæãñæ¿áÈÉ PæãqrÃÜáÊÜ OMR EñܤÃÜ ÖÝÙæ¿áÈÉ ¯ÊÜá¾ EñܤÃÜWÜÙÜ®Üá° where (C) is the correct response.
ÓÜãbÓÜñÜPÜR¨Üáª. OMR ÖÝÙæ¿áÈÉ AívÝPÜꣿáÆÉ¨æ ¸æàÃæ ¿ÞÊÜâ¨æà Óܧ٨
Ü È
Ü É EñܤÃÊ
Ü ®Ü áÜ ° 5. Your responses to the questions are to be indicated in the OMR Sheet
WÜáÃÜá£Ô¨ÜÃæ, A¨ÜÃÜ ÊÜåèÆÂÊÜÞ±Ü®Ü ÊÜÞvÜÇÝWÜáÊÜâ©ÆÉ. kept inside this Booklet. If you mark at any place other than in the circles
6. OMR EñܤÃÜ ÖÝÙæ¿áÈÉ Pæãor ÓÜãaÜ®æWÜÙÜ®Üá° hÝWÜÃÜãPÜñæÀáí¨Ü K©Ä. in the OMR Sheet, it will not be evaluated.
6. Read the instructions given in OMR carefully.
7. GÇÝÉ PÜÃÜvÜá PæÆÓÜÊÜ®Üá° ±ÜâÔ¤Pæ¿á Pæã®æ¿áÈÉ ÊÜÞvÜñÜPÜR¨Üáª.
7. Rough Work is to be done in the end of this booklet.
8. ¯ÊÜá¾ WÜáÃÜáñÜ®Üá° Ÿ×ÃÜíWܱÜwÓÜŸÖÜá¨Ý¨Ü ¯ÊÜá¾ ÖæÓÜÃÜá A¥ÜÊÝ ¿ÞÊÜâ¨æà bÖæ°¿á®Üá°, 8. If you write your name or put any mark on any part of the OMR
ÓÜíWÜñÜÊÝ¨Ü ÓܧÙÜ ÖæãÃÜñÜá ±ÜwÔ, OMR EñܤÃÜ ÖÝÙæ¿á ¿ÞÊÜâ¨æà »ÝWܨÜÈÉ ŸÃæ¨ÜÃæ, Answer Sheet, except for the space allotted for the relevant entries,
¯àÊÜâ A®ÜÖÜìñæWæ ¸Ý«ÜÂÃÝWÜᣤàÄ. which may disclose your identity, you will render yourself liable to
9. ±ÜÄàPæÒ¿áá ÊÜááX¨Ü®ÜíñÜÃÜ, PÜvÝx¿áÊÝX OMR EñܤÃÜ ÖÝÙæ¿á®Üá° ÓÜíËàPÜÒPÜÄWæ disqualification.
¯àÊÜâ ×í£ÃÜáXÓܸæàPÜá ÊÜáñÜᤠ±ÜÄàPÝÒ PæãsÜw¿á ÖæãÃÜWæ OMR®Üá° ¯Êæã¾í©Wæ 9. You have to return the OMR Answer Sheet to the invigilators at the
end of the examination compulsorily and must not carry it with you
Pæãívæã¿áÂPÜãvܨÜá. outside the Examination Hall.
10. ±ÜÄàPæÒ¿á ®ÜíñÜÃÜ, ±ÜÄàPÝÒ ±ÜÅÍ氱ܣÅPæ¿á®Üá° ÊÜáñÜᤠ®ÜPÜÆá OMR EñܤÃÜ ÖÝÙæ¿á®Üá° 10. You can take away question booklet and carbon copy of OMR Answer
¯Êæã¾í©Wæ ñæWæ¨ÜáPæãívÜá ÖæãàWÜŸÖÜá¨Üá. Sheet after the examination.
11. ¯àÈ/PܱÜâ³ ¸ÝÇ…±ÝÀáíp… ±æ®… ÊÜÞñÜÅÊæà E±ÜÁãàXÔÄ. 11. Use only Blue/Black Ball point pen.
12. PÝÂÆáRÇæàoÃ…, ˨Üá®ݾ®Ü E±ÜPÜÃÜ| A¥ÜÊÝ ÇÝW… pæàŸÇ… CñÝ©¿á 12. Use of any calculator, electronic gadgets or log table etc., is
E±ÜÁãàWÜÊÜ®Üá° ¯Ðæà˜ÓÜÇÝX¨æ. prohibited.
13. There is no negative marks for incorrect answers.
13. ÓÜÄ AÆÉ¨Ü EñܤÃÜWÜÚWæ Má| AíPÜ CÃÜáÊÜâ©ÆÉ .
14. In case of any discrepancy found in the Kannada translation of a
14. PܮܰvÜ ÊÜáñÜᤠCíXÉàÐ… BÊÜ꣤WÜÙÜ ±ÜÅÍ氱ܣÅPæWÜÙÜÈÉ ¿ÞÊÜâ¨æà Äࣿá ÊÜÂñÝÂÓÜWÜÙÜá question booklet the question in English version shall be taken as
PÜívÜáŸí¨ÜÈÉ, CíXÉàÐ… BÊÜ꣤WÜÙÜÈÉÃÜáÊÜâ¨æà Aí£ÊÜáÊæí¨Üá ±ÜÄWÜ~ÓܸæàPÜá. final.
K – 2420 1 ±Üâ.£.®æãà./P.T.O.

Computer Science and Applications
Paper – II

Note : This paper contains hundred (100) objective type questions. Each question
carries two (2) marks. All questions are compulsory.

1. ______ is the logical translation of the 5. Which one of the following languages
statement, “None of the solutions are over the alphabet {0, 1} is described by
correct”. the regular expression
(A) ∃x(S(x)∧¬C(x)) (0+1)*0(0+1)*0(0+1)* ?
(B) ∃x(¬S(x)∧C(x)) (A) The set of all strings containing the
(C) ∃x(¬S(x)∧¬C(x)) substring 00
(D) ¬∃x(S(x)∧C(x)) (B) The set of all strings containing at
most two 0’s
2. State the rule of inference used in the (C) The set of all strings containing at
statement, “It is foggy and cloudy now, least two 0’s
therefore it is foggy now”. (D) The set of all strings that begin and
(A) Addition end with either 0 or 1
(B) Simplification
(C) Resolution 6. Let set S = {1, ω, ω2}, where ω, ω2
(D) Conjunction are cube roots of unity. If * is the
multiplication operation, the structure
(S, *) represents
3. The bit string for the set {2, 4, 6, 8, 10}
with universal set of natural numbers (A) a group
less than or equal to 10 is (B) a ring
(A) 0101010101 (C) an integral domain
(B) 1010101010 (D) a field
(C) 1010010101
(D) 0010010101 7. A graph is said to be bipartite when it is
(A) Divided into two independent sets A
4. Out of 7 boys and 4 girls, how many and B such that each edge connects
queues of 3 boys and 2 girls can be a vertex from A to B
formed ? (B) Connected and it has odd number of
(A) 220 vertices
(B) 25200 (C) Disconnected
(C) 23400 (D) It has n/2 vertices, the degree of each
(D) 500 of which is greater than n/2

Paper II 2 K – 2420

8. Canonical Product of Sum (POS) for the 12. The 8085 microprocessor responds to
Boolean function F = AB + C D is the presence of an interrupt
(A) Π(M1, M2, M3, M5, M6, M7, M13, (A) As soon as the trap pin becomes
M14, M15) ‘low’
(B) Π(M0, M4, M8, M9, M10, M11,
(B) By checking the trap pin for ‘high’
M12)
(C) Π(M0, M4, M6, M7, M10, M11, status at the end of each instruction
M12) fetch
(D) Π(M1, M2, M3, M5, M8, M9, M13, (C) By checking the trap pin for ‘high’
M14, M15) status at the end of the execution of
each instruction
9. The IEEE-754 standard with 32-bit (D) By checking the trap pin for ‘high’
single-precision format uses 1 bit for status at regular intervals
sign, 8 bits for biased exponent and 23
bits for mantissa to represent a float type
variable. If a float type variable X is 13. The contents of the registers DX, AX
assigned the decimal value of 9.625, then and the Carry flag after the execution of
the representation of X in hexadecimal the following instructions are
notation is
MOV AX, 4823H
(A) 411B0000
MOV BX, 100H
(B) 401B0000
MUL BX
(C) 401A0000
(D) 411A0000 (A) DX = 0048H, AX = 2300H, CF = 1
(B) DX = 0048H, AX = 4823H, CF = 1
10. Which of the following is an invalid (C) DX = 4800H, AX = 2300H, CF = 1
register transfer statement ? (D) DX = 4800H, AX = 4823H, CF = 1
(A) wT : R3 ← R1 + R2
(B) xT : R1 ← R1 + R2 14. Choose the correct statement from the below
(C) yT : R2 ← R1, R1 ← R2
mentioned options for microprocessor in
(D) zT : R1 ← R2; R1 ← R3
I/O mapped I/O mode.
(A) Memory space available is greater
11. Which of the following is not a valid
(B) Not all data transfer instructions are
arithmetic instruction in 8085 ?
available
(A) SBI
(B) SUI (C) I/O and memory space are distinct
(C) AXI (D) I/O mapped I/O space is greater than
(D) LXI memory mapped I/O space
K – 2420 3 Paper II

15. Which of the following statement is 18. The number of different Boolean functions
correct with respect to multiprocessor that can be generated by n variables is
system ? equal to
2 n −1 2n
(A) In a loosely coupled multiprocessor, (A) 2 (B) 2
all the processors share a common (C) 2n (D) 2n – 1
memory module
(B) In a tightly coupled multiprocessor,
19. A direct mapped cache memory of size
memory is distributed across all the 1MB with block size 2KB has 9 bits in
processors the tag. The size of main memory is
(C) In loosely coupled multiprocessor (A) 512 MB (B) 128 MB
system, data rate is low rather than
(C) 64 MB (D) 32 MB
tightly coupled multiprocessor
system
(D) In a tightly coupled multiprocessor, 20. Consider a CPU which has 32-bit
processors communicate between instructions. A program is stored at
each other through message passing memory location with the starting
address 0050H. Which one of the
following is a valid program counter
16. Which of the following statement is value ?
false ? (A) 0191H (B) 0192H
(A) CISC architecture is based on (C) 0193H (D) 0194H
hardwired control unit
(B) In micro-programmed approach, 21. If x and y are non-zero positive integers,
the control signals are generated by the following pseudocode computes
machine instructions
while (x!=y)
(C) Hardwired control is faster than
{
micro-programmed control
if(x > y)
(D) Horizontal micro-programmed
control unit is used in parallel x=x–y
processing applications else
y=y–x
17. Which flag of the 8085’s flag register is }
not accessible to programmer directly ? display(x)
(A) Zero flag (A) GCD of x and y
(B) Carry flag (B) LCM of x and y
(C) Auxiliary carry flag (C) Largest of x and y
(D) Parity flag (D) Smallest of x and y

Paper II 4 K – 2420

22. The output of C statement printf(“%d”, 25. If cp is a pointer to char type, sizeof (cp)
printf(“Bangalore”)); is in a 32-bit machine is
(A) Results in a syntax error (A) 1 byte
(B) Displays Bangalore9 (B) 2 bytes
(C) Displays garbage value (C) 3 bytes
(D) Displays Bangalore twice (D) 4 bytes

23. The output of the below C program 26. The output of the following C code
segment is segment is
for(i = 1; i < 5; i++) int a, *ap, **app;
{ a = 10;
ap = &a;
if(i < 4) continue;
app = &ap;
printf(“%d”, i); printf(“%d”, **app);
}
(A) Address of a
(A) 1 2 3 4 5 (B) Address of ap
(B) 1 2 3 (C) Address of app
(C) 4 (D) 10
(D) 4 5
27. What is the output of the following C++
24. What is the output of the following C program segment ?
program segment ?
int main(void)
int main(void)
{
{
int a = 10;
char names [2][20] = {“Chandrashekar”, “Ramamurthy”};
int &p = a;
putchar(**names); cout << &p;
return 0; return 0;
} }
(A) Compilation error (A) Address of a
(B) Runtime error (B) Compiler error
(C) Prints garbage value (C) Value of a
(D) Prints C (D) Runtime error

K – 2420 5 Paper II

28. Choose the best answer. 30. The output of the following Java
A function that does the same operation program is
on different types of data is implemented
class test
using
(A) Macro {
(B) Function overloading public static void main(String args[])
(C) Function template
{
(D) Function with default arguments
int x, y;

29. Consider the following C++ code. x = 11 & 9;
int x(int m) y = x∧3;
{ System.out.println(y|12);
m = m – 1; }
return m; (A) 12
} (B) 13
(C) 14
int y(int n)
(D) 15
{
return(++n);
31. A thread can be initiated with ______
} method.
int main(void) (A) run()
{ (B) start()
int 1 = 5; (C) begin()
(D) create()
1 + = x(y(1));
cout <<1;
32. A cube of side 1 unit is placed in such a
return 0;
way that the origin coincides with one of
} its vertices and the three axes run along
three of its edges. The vertex diagonally
The output of the above program is
opposite to (1, 0, 1) is
(A) 11 (A) (0, 0, 0)
(B) 5 (B) (1, 1, 0)
(C) 10 (C) (0, 1, 1)
(D) 15 (D) (0, 1, 0)
Paper II 6 K – 2420

33. Hue of a colour is related to its 36. A transaction that inserts a new tuple
(A) Luminance into a database is given
(B) Saturation (A) Exclusive lock
(C) Incandescence (B) Shared lock
(D) Wavelength (C) Mutual lock
(D) No lock

34. In which stage of database design, all
37. The reliability of a system with n
the necessary fields and their types of a redundant components each having a
database are listed ? reliability of r is
(A) Data definition (A) (1 + r)n (B) 1 – (1 – r)n
(B) Data field definition (C) 1 – (1 + r)n (D) 1 + (1 – r)n
(C) E-R diagram
(D) User definition 38. Consider the schedule : T1 : R(X);
T2 : R(Y); T3 : W(X); T2 : R(X);
T1 : R(Y). The schedule T1 is
35. Database table by name Loan_Records
is given below : (A) Not conflict and not view
serializable
Borrower Bank_ Loan_ (B) Conflict and view serializable
Manager Amount (C) Not conflict, but view serializable
Rasika Praveen 10,000.00
(D) Conflict, but not view serializable
Karuna Kushal 5,000.00
Rajeshwari Praveen 7,000.00
39. Consider the following commands :
What is the output of the following SQL Create table dept(DeptNo int
query ? primary key, DName varchar (30));
select count(*) from ((select Create table emp(EmpNo int
Borrower, Bank_Manager from Primary keY, EmpName varchar(30),
DeptNo int references Dept(DeptNo));
Loan_Records) As S natural join
(Select Bank_Manager, Loan_Amount Which of the following operations may
From Loan_Records)AS T); cause violation of referential integrity
constraint ?
(A) 3
(A) delete on EMP
(B) 9 (B) insert into DEPT
(C) 5 (C) update on DEPT
(D) 6 (D) both (A) and (B)
K – 2420 7 Paper II

40. Consider two sets A and B. Element in 43. Which of the following is true about the
each set is a positive integer. These sets are three-tier data warehouses ?
represented as bit vector i.e. kth bit set to 1 (A) Once created, the data marts will
if number k belongs to set. For example, keep on being updated from the data
A = {0, 1, 3, 4, 7}; bit vector representation warehouse at periodic times
shall be 10011011 (LSB corresponds to (B) Once created, the data marts will
number 0). In such representation, A – B directly receive their new data from
can be computed using the operational databases
(A) A and B (C) The data marts are different groups
(B) a xor b of tables in the data warehouse
(C) a or b (D) A data mart becomes a data warehouse
(D) a and (not (b)) when it reaches a critical size

41. Information in GIS is entered and 44. Web Mining is not used in which of the
stored as following areas ?
(A) Panels (A) Online transaction processing
(B) Layers (B) Information filtering
(C) Single panel (C) Click stream analysis
(D) Dual panel (D) Crime fighting on the internet

42. Which of the following is heterogeneous 45. Which technology is used to store data
distributed database ? in hadoop ?
(A) The same DBMS is used at each (A) HBase
location and data are not distributed (B) Avro
across all nodes (C) Sqoop
(B) The same DBMS is used at each (D) Zookeepr
location and data are distributed
across all nodes 46. Object Definition Language (ODL)
(C) Different DBMSes are used at each supports __________ operators.
location and data are not distributed (A) unary
across all nodes (B) unary and binary
(D) Different DBMSes are used at each (C) unary and binary and ternary
location and data are distributed (D) unary and binary and ternary and
across all nodes higher

Paper II 8 K – 2420

47. Storage mapping is done by 51. Assume that there are 3 page frames which
(A) Linker are initially empty. If the page reference
(B) Compiler string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6 then, the
number of page faults using the optimal
(C) Loader
replacement policy is
(D) Operating system (A) 5
(B) 7
48. Compiler can check (C) 10
(A) Both logical and syntax error (D) 0
(B) Logical error
(C) Syntax error 52. In a system with 32-bit virtual addresses
(D) Runtime-errror and 1-KB page size, use of one-level
page tables for virtual to physical address
translation is not practical because of
49. A loader is a
(A) The large amount of internal
(A) Program that automates the fragmentation
translation of assembly language (B) The large amount of external
into machine language fragmentation
(B) Program that places programs into (C) The large computation overhead in
memory and prepares them for the translation process
execution (D) The large memory overhead in
(C) Program that accepts a high level maintaining page tables
language program and produces its
object program equivalent 53. A computer system supports 32-bit
(D) Program that translate byte code virtual addresses as well as 32-bit
into machine code physical addresses. Since the virtual
address space is of the same size as the
physical address space, the operating
50. CPU generates 32-bit virtual addresses.
system designers decide to get rid of the
The page size is 4 k bytes. The processor
virtual memory entirely. Which one of
has a Transition Look-aside Buffer the following is true ?
(TLB) which can hold a total of 128 page (A) Efficient implementation of multi-
table entries and is 4-way set associative. user support is no longer possible
The minimum size of the TLB tag is (B) The processor cache organization
(A) 11 bits can be made more efficient now
(B) 13 bits (C) Hardware support for memory
(C) 15 bits management is no longer needed
(D) CPU scheduling can be made more
(D) 20 bits
efficient now
K – 2420 9 Paper II

54. Threads of a process share 58. Identify the correct statement with
(A) Global variables but not heap respect to Evolutionary development.
(B) Heap but not global variables (A) Evolutionary development usually
has two flavours; exploratory
(C) Neither global variables nor heap
development and throw-away
(D) Both heap and global variables prototyping
(B) Very large projects are usually done
55. What is the purpose of the touch using evolutionary development
command in Linux ? based approach
(A) It creates a new empty file (C) It facilitates easy project management,
through the high volume of
(B) It displays the contents of a file
documentation it generates
(C) It updates the timestamp of an
(D) Sometimes the construction of
already existing file a throw-away prototype is not
(D) It makes a new directory followed by a re-implementation of
the software system using a more
56. Which testing is the re-execution of structured approach
some subset of tests that have already
been conducted to ensure the changes 59. Elements of which of the following data
that are not propagated ? structures are stored/accessed in non-
(A) Unit testing linear order ?
(A) Stack
(B) Regression testing
(B) Queue
(C) Integration testing
(C) Tree
(D) Thread-based testing
(D) Linked list

57. The Incremental Model is a result of
60. A1, A2, A3 and A4 are the four
combination of elements of which two algorithms to solve the same problem
models ? and their efficiency classes are log(n),
(A) Build and FIX Model and log(log(n)), nlog(n) and n2 respectively.
Waterfall Model Which is the second best algorithm ?
(B) Linear Model and RAD Model (A) A1
(C) Linear Model and Prototyping (B) A2
Model (C) A3
(D) Waterfall Model and RAD Model (D) A4

Paper II 10 K – 2420

61. The solution of the recurrence relation 66. The efficiency of Horspool’s algorithm
T(n) = T(n – 1) + n + 1 with the base for random texts in the average case is
condition T(1) = 0 ends up with the _______, where n and m are the lengths
efficiency class of text and pattern respectively.
(A) log(n) (B) n2 (A) O(n) (B) O(n2)
(C) n (D) nlog(n) (C) O(n + m) (D) O(mn)

62. The worst case efficiency of quick sort 67. n-queens problem is solved using
algorithm is (A) Branch and bound technique
(A) O(n2) (B) Backtracking technique
(B) O(n) (C) Greedy technique
(C) O(log(n))
(D) Dynamic programming
(D) O(nlog(n))

68. Which strategy is used in KMP String
63. The efficiency of DFS algorithm when matching algorithm ?
the graph with |V| vertices and |E| edges
(A) Divide and conquer
is represented using adjacency matrix is
(B) Greedy
(A) |V|2
(C) Trading space for time
(B) |V| + |E|
(D) Backtracking
(C) |E|2
(D) log(|V| + |E|)
69. The basic limitation of a FSM is that
64. The time efficiency class of heap sort in (A) It cannot remember arbitrary large
the worst case is amount of information
(A) n2 (B) nlog(n) (B) It sometimes recognizes grammars
that are not regular
(C) n (D) log(n)
(C) It sometimes fails to recognize
grammars that are regular
65. Consider P(x) = anxn + an – 1xn – 1 + (D) It can remember arbitrary large
an – 2xn – 2 + . . . + a2x2 + a1x + a0. amount of information
The algorithm to evaluate the above
polynomial from right to left, given the
values of the co-efficients an, an – 1 , . . ., a0 70. Finite state machine ________ recognize
and the value of x, has the efficiency class palindromes.
(A) n2 (B) n3 (A) can (B) cannot
(C) n (D) log(n) (C) may (D) may not

K – 2420 11 Paper II

71. Which of the following is true while 75. One of the purposes of using intermediate
converting CFG to LL(1) grammar ? code in compilers is to
(A) Remove left recursion
(A) Make parsing and semantic analysis
(B) Factoring grammar
simpler
(C) Both (A) and (B)
(D) Only (A) (B) Improve error recovery and error
reporting
72. Let L be a set accepted by a non deterministic (C) Increase the chances of reusing the
finite automaton having Q states. The machine-independent code optimizer
maximum number of states in equivalent
in other compilers
finite automaton that accepts L is
(A) |Q| (B) 2|Q| (D) Improve the register allocation
(C) 2 |Q| – 1
(D) 2|Q|
76. A regular grammar for the language
73. The grammar A → AA |(A)| ε is not
L = {anbm | n is even and m is even} is
suitable for predictive-parsing because
the grammar is given by
(A) Ambiguous (A) S → aSb | S1; S1 → bS1a | λ
(B) Left-recursive (B) S → aaS | S1; S1 → bSb | λ
(C) Right-recursive (C) S → aSb | S1; S1 → S1ab | λ
(D) An operator-grammar
(D) S → aaS | S1; S1 → bbS1 | λ

74. Consider the translation scheme shown
below. 77. Six channels, each with a 250 kHz
S→TR bandwidth, are to be multiplexed
R → + T {print(‘+’);} R | ε together. If there is a need for a guard
T → num {print(num.val);} band of 50 kHz between the channels
to prevent interference, the minimum
Here num is a token that represents
bandwidth of the link should be
an integer and num.val represents the
corresponding integer value. For an (A) 1700 kHz
input string ‘9 + 5 + 2’, this translation (B) 1750 kHz
scheme will print
(C) 1650 kHz
(A) 9 + 5 +2 (B) 9 5 + 2 +
(C) 9 5 2 + + (D) + + 9 5 2 (D) 1800 kHz

Paper II 12 K – 2420

78. If the hamming distance between the 82. Consider a system using Selective Repeat
data word and the corresponding code protocol with sender window size SWs = 8.
word is 5 then __________ numbers of Given that every 5th packet is lost during the
bits are corrupted during transmission. transmission. If total number of packets to
(A) 2 (B) 4 be sent is 17, then how many transmissions
(C) 5 (D) 6 will be required ?
(A) 21
79. If the _____________ is too much, the (B) 20
receiver may not be able to detect the
signal at all or may fall below the noise (C) 26
level. (D) 29
(A) noise
(B) delay 83. An IP router with a Maximum Transmission
(C) distortion Unit (MTU) of 320 bytes has received
(D) attenuation an IP packet of size 980 bytes which
includes header of length 20 bytes.
80. Which of the following is not a closed The identification field value for the
loop congestion control mechanism ? first packet is 100. The offset and
(A) Backpressure identification value for the last fragment
(B) Retransmission policy will be
(C) Implicit signaling (A) 111, 103
(D) Explicit signaling (B) 900, 100
(C) 111, 100
81. An Internet Service Provider (ISP) (D) 900, 103
has the following chunk of CIDR-
based IP addresses available with it
218.14.192.0/22. The ISP wants to 84. What is the maximum number of IP
give half of this chunk of addresses addresses that can be assigned to
to Organization A and a quarter to hosts on a local subnet that uses the
Organization B, while retaining the 255.255.255.192 subnet mask ?
remaining with it. Which of the following
is a valid prefix length for Organization (A) 62
A and Organization B ? (B) 30
(A) 23 and 24 (B) 20 and 21 (C) 32
(C) 22 and 22 (D) 22 and 23 (D) 64

K – 2420 13 Paper II

85. Using public key cryptography, X adds 88. ____________ describes a distribution
a digital signature σ to message M, model in cloud computing in which
encrypts <M, σ > and sends it to Y, applications are hosted by a service
where it is decrypted. Which one of the provider and made available to users.
following sequences of keys is used for the (A) Infrastructure-as-a-Service (IaaS)
operations ? (B) Platform-as-a-Service (PaaS)
(A) Encryption : X’s private key followed (C) Software-as-a-Service (SaaS)
by Y’s private key; Decryption : X’s (D) Cloud service
public key followed by Y’s public
key;
(B) Encryption : X’s private key followed 89. Suppose that a group contains 7 members.
by Y’s public key; Decryption : X’s Each member of the group wants to
public key followed by Y’s private communicate secretly with the others
key; using symmetric key cryptographic
system. The communication between any
(C) Encryption : X’s public key followed
two persons should not be decodable by
by Y’s private key; Decryption : Y’s
the others in the group. The number of
public key followed by X’s private
keys required in the system as a whole to
key;
satisfy the confidentiality requirement is
(D) Encryption : X’s private key followed
(A) 21
by Y’s public key; Decryption : Y’s
private key followed by X’s public (B) 14
key; (C) 42
(D) 49
86. Which of the following is the type
of software that has self-replicating 90. Which of the following is not a
software that causes damage to files and characteristic of 3G network ?
system ? (A) Communication over VoIP
(A) Viruses (B) Trojan horses (B) Multi-megabit internet access
(C) Bots (D) Worms (C) Greater security features
(D) LTE based network
87. Which of the following is not part of
switching system in GSM network ? 91. An agent is composed of
(A) Home Location Register (HLR) (A) Architecture
(B) Equipment Identity Register (EIR) (B) Agent function
(C) Authentication Centre (AC) (C) Perception sequence
(D) Base Transceiver Station (BTS) (D) Architecture and program
Paper II 14 K – 2420

92. A problem in search space is defined by 98. Context free languages are closed
(A) Initial state under
(B) Goal test (A) Union, intersection
(C) Intermediate state (B) Union, Kleene closure
(D) Both (A) and (B) (C) Intersection, complement
(D) Complement, Kleene closure
93. How many successors are generated in 99. The efficiency class of binary search in
backtracking search ? the best case is
(A) 1 (B) 2 (A) n/2 (B) log(n)
(C) 3 (D) 4 (C) constant (D) nlog(n)

94. The first neural network computer is 100. Output of the following C++ program is
(A) RFD (B) SNARC class A
(C) AM (D) AN {
protected : int i;
A(){ i = 10; }
95. In LISP addition 3 + 2 is entered as
void display() { cout <<i; }
(A) 3 + 2 (B) 3 add 2
};
(C) 3 + 2 = (D) (+3 2)
class B : public A
{
96. YACC stands for
private : int j;
(A) Yet Accept Compiler Constructs
B() : A() { j = 20; }
(B) Yet Accept Compiler Compiler
void display() { cout <<i<<j; }
(C) Yet Another Compiler Construct
};
(D) Yet Another Compiler Compiler
int main(void)
{
97. A set generated using infinite-value
A a;
membership function is known as
B b; a = b; a.display();return 0;
(A) Crisp set
(B) Boolean set }
(A) 20 (B) 10
(C) Fuzzy set
(C) 10 20 (D) 20 10
(D) All the above

K – 2420 15 Paper II

Space for Rough Work

Paper II 16 K – 2420