Test Paper : II

Test Booklet SERIAL No.

Test Subject : Computer Science and Applications
Test Subject Code : K-2418

Roll No.
(Figures as per admission card)

OMR Sheet No. : ____________________

Name & Signature of Invigilator/s

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

K-2418 1 ±Üâ.£.®æãà./P.T.O.
*K2418* Total Number of Pages : 16

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. How many 2-digit numbers greater 6. How many flip-flops circuits are needed
than 40 can be formed by using the digits to divide by 16 ?
1, 2, 3, 4, 6, 7 when repetition is allowed ? (A) Two (B) Four

(A) 12 (B) 14 (C) Eight (D) Sixteen

(C) 18 (D) 22 7. A combinational logic circuit which

is used to send data coming from a
2. How many subsets of {1, 2, 3, ....10}
single source to 2 or more separate
contain at least 7 elements ?
destinations is called
(A) 89 (B) 125 (A) Decoder
(C) 151 (D) 176 (B) Encoder
(C) Multiplexer
3. A graph G has 16 edges and all vertices
(D) Demultiplexer
of G are of degree 2. The number of
vertices in G is equal to 8. For the circuit shown for AB = 00, AB = 01,
(A) 16 (B) 17 C, S values respectively are

(C) 18 (D) 10

4. For a connected planar graph G = (V, E)

having R regions, v vertices and
E edges. Then V + R – E is equal to
(A) 1 (B) 2
(C) 3 (D) 4

(A) 0, 0 and 0, 1
5. An and gate has 7 inputs. How many
input words are in truth table ? (B) 0, 0 and 1, 0

(A) 64 (B) 32 (C) 0, 1, and 0, 0

(C) 16 (D) 128 (D) 1, 0 and 0, 0

Paper II 2 K-2418
*K2418* Total Number of Pages : 16

9. What is the output of the following 13. In SQL the word ‘natural’ can be used
program ? with
(A) Inner join
# include < stdio.h >
(B) Full outer join
int main ( )
(C) Right outer join
{
(D) All of the above
printf (“%d”, ‘A’) ;
return 0 ; 14. In 2NF
} (A) No functional dependencies (FDs)
exist
(A) A (B) ‘A’
(B) No multivalued dependencies
(C) 64 (D) 65 (MVDs) exist
(C) No partial FDs exist
10. Given the array declaration
(D) No partial MVDs exist
int myArray [ ] = { 0, 2, 4, 6, 8, 10 }.
What is the value of 15. Relations produced from an E-R model
myArray [myArray[2] ] ; ? will always be
(A) 0 (B) 2 (A) First normal form
(B) Second normal form
(C) 8 (D) 6
(C) Third normal form
11. An C++ operator that works in special (D) Fourth normal form
way on newly defines data type is said
16. In RDBMS, different classes of relations
to be are created using _________ technique
(A) Encapsulated to prevent modification anomalies.
(B) Classified (A) Functional Dependencies
(B) Data integrity
(C) Polymorphed
(C) Referential integrity
(D) Overloaded
(D) Normal forms

12. Local variables are also called as 17. A full binary tree with n leave contains
________ variables. (A) n nodes

(A) Global (B) External (B) log2n nodes

(C) 2n –1
(C) Scope (D) Automatic
(D) 2n nodes

Paper II 3 K-2418
*K2418* Total Number of Pages : 16

18. A machine needs a minimum of 23. A bridge has access to which address of
100 sec to sort 1000 names by quick a station on the same network
sort the minimum time needed to sort (A) Physical
100 names will be approximately
(B) Network
(A) 50.2 sec
(C) Service access point
(B) 6.7 sec
(C) 72.7 sec (D) All of these

(D) 11.2 sec 24. How many character per sec

19. Which of the following is not an inherent (7 bits +1 parity) can be transmitted over a
application of stack ? 2400 bps line if the transfer is synchronous
(A) Reversing a string (1 start and 1 stop bit) ?

(B) Evaluation of postfix expression (A) 300 (B) 240

(C) Implementation of recursion (C) 250 (D) 275
(D) Job scheduling
25. In a two-pass assembler the pseudo-
20. The rule for implicit type conversion in C code EQU is to be evaluated during
is (A) Pass 1
(A) int < unsigned < float < double (B) Pass 2
(B) unsigned < int < float < double (C) non evaluated by the assembler
(C) int < unsigned < double < float
(D) none of the above
(D) unsigned < int < double < float
26. A shift reduce parser carries out
21. Which of the following uses UDP as the the actions specified within braces
transport protocol ? immediately after reducing with the
(A) HTTP corresponding rule of grammar
(B) Telnet S →XXW { Print “ 1” }
(C) DNS
S → Y { Print “ 2” }
(D) SMTP
W → Sz { Print “ 3” }
22. Gateways can function all way upto What is the translation of XXXXYZZ
(A) Transport layer using the syntax directed translation
(B) Network layer scheme described by the above rules ?
(C) Presentation layer (A) 23131 (B) 11233
(D) Application layer (C) 11231 (D) 33211

Paper II 4 K-2418
*K2418* Total Number of Pages : 16

27. Which phase of compiler generates 31. Solid-state disks are

stream of atoms ? (A) Volatile
(A) Syntax Analysis (B) Semiconductor
(B) Lexical Analysis (C) Non-volatile
(C) Code Generation (D) Personal digital assistants
(D) Code optimization
32. Consider the following segment table.
28. Which of the following regular
expressions, each describing a language Segment Base Length
of binary numbers (MSB to LSB) that
represents non-negative decimal values, 0 219 600
does not include even values ?
1 2300 14
(A) 0*1 + 0*1* (B) 0*1*0+1*
2 90 100
(C) 0*1*0*1+ (D) 0 +1*0*1*
3 1327 580
29. Let m [0].... m [4] be mutexes (binary 4 1952 96
semaphores) and P [0].... P[4] processes.
Suppose each process P [i] executes What is the physical addresses for the
the following logical address 0, 430 ?
wait (m [i]); wait (m[(i+1) mod 4]); (A) 2310
release (m[i]) ; release (m[(i+1) mod 4]); (B) 649
This could cause (C) illegal reference
(A) Thrashing (D) 1727
(B) Deadlock
(C) Starvation, but not deadlock 33. Which process model is called as classic
(D) Inversion life cycle model ?
30. Match the following : (A) Waterfall model
I. The processes ID a. grep (B) RAD model
II. Editor b. ps (C) Prototyping model
III. Searching in files c. cat (D) Incremental model
IV. Printing a file d. vi
34. The extent to which a software tolerates
Codes : the unexpected problems, is termed as
I II III IV
(A) Accuracy
(A) b d a c
(B) c d b a (B) Reliability
(C) b c d a (C) Correctness
(D) d c a b (D) Robustness
Paper II 5 K-2418
*K2418* Total Number of Pages : 16

35. Cohesion is an extension of 40. A goal of data mining is

(A) Abstraction concept (A) To confirm that data exists
(B) Refinement concept (B) To create a new data for
(C) Information hiding concept warehouse

(D) modularity (C) To explain some observed event or

condition
36. A software design pattern used to (D) To analyze data for expected
enhance the functionality of an object at relationships
run-time is
41. The clock signals are used in sequential
(A) Adapter
logic circuits to
(B) Decorator
(A) carry serial data signals
(C) Delegation
(B) to display time of the day
(D) Proxy
(C) tell how much time has elapsed
37. EDI standards are after the system turned on
(A) not universally available (D) coordinate action of digital circuits
(B) essential for B2B commerce in various parts of the system
(C) not required for B2B commerce
42. The output of a sequential circuit
(D) used for ftp depends on
38. The ratio of number of successful calls (A) present input only
to the number of call attempts is known (B) past inputs only
as (C) present outputs only
(A) Call forwarding rate (D) both present and past inputs
(B) Call completion rate
43. Which addressing mode execute its
(C) call block rate
instructions within Cpu without the
(D) Busy hour call rate
necessity of reference memory for
39. Self-organizing maps are an example of operands ?
(A) Supervised learning (A) Index mode
(B) unsupervised learning (B) Immediate mode
(C) Self map learning (C) Register mode
(D) Reinforcement learning (D) Direct mode

Paper II 6 K-2418
*K2418* Total Number of Pages : 16

44. Which circuit implements the hardware 47. Consider the following relational schema :
priority input unit function to determine Supplier (sid : integer, sname : string,
the highest priority of simultaneously city : string , street : string)
arriving various input signals ? Parts (pid : integer, pname : string,
color : string )
(A) Priority Decoder Catalog (sid : integer, pid : integer,
(B) Priority Selector cost : real)
Assume that in the suppliers relation
(C) Priority maximizer
above, each supplier and each street
(D) Priority Encoder within a city has a unique name and
(sname, city) forms a candiate key. No
45. Every Boyce-Codd Normal form (BCNF) other than those implied by primary and
decomposition is candiate key. Which of the following
TRUE about the above schema ?
(A) Dependency preserving
(A) The schema is in BCNF
(B) Not dependency preserving
(B) The schema is in 3NF but not in
(C) Need to be dependency preserving BCNF
(D) None of these (C) The schema is in 2NF but not in
3NF
46. Match the following : (D) The schema is not in 2NF
a. Secondary index 1. Functional
48. Let R (a, b, c) and S (d, e, f) be two
dependency relations in which d is the foreign key of
b. Non-procedural 2. B-Tree S that refers to the primary key of R.
Query language
Consider following four operations
c. Closure of a set 3. domain R and S
of attributes calculus i. insert into R
d. Natural-join 4. Relation ii. insert into S
algebraic iii. delete from R
operation iv. delete from S
Codes : Which of the following can cause violation
a b c d of the referential integrity constraint
above ?
(A) 2 3 1 4
(A) Both i and iv
(B) 3 2 4 1
(B) Both ii and iii
(C) 3 1 2 4 (C) All of these
(D) 2 1 4 3 (D) None of these

Paper II 7 K-2418
*K2418* Total Number of Pages : 16

49. How many K bytes does a frame buffer 53. The Running time T(n), where (n) is
needs in a 600 × 400 pixel ? the input size of a recursive algorithm is

(A) 27.30 nk bytes given as follows :

(B) 19.45 nk bytes T(n) = C + T (n – 1) ; if (n >1)

(C) 29.30 nk bytes = d, if n ≤ 1
(D) 25.45 nk bytes The order of algorithm is

50. An array of values specifying the relative (A) n2 (B) n

importance of sub-pixel is referred as (C) n3 (D) nn

______ of sub pixel weights.
54. For the 8-bit word 00111001, check bits
(A) Sub-mask stored with it would be 0111, suppose
(B) Mask when the word is read from memory,
(C) Pixel phasing the check bits are calculated to be 1101,
what is the data word that was read from
(D) Pixel weighting
memory ?
51. ______ refers to the common elements of (A) 10011001
graphics scenes, often used in graphics (B) 00011001
package as primitive components. (C) 00111000
(A) Quadric surfaces (D) 11000110
(B) Wire frame model
55. For each production in P of the form :
(C) Composite transformation
A → X1, X2, X3,.....Xn
(D) Octrees
Put into P’ that production as well
52. Oblique projection with an angle of as all those generated by replacing
45 degree to the horizontal plane is null variables with e in all possible
called as combinations. If all x (i) are nullable

(A) Cabinet projection (A) A → e is put into P’

(B) Isometric projection (B) e is a number of G’

(C) Cavalier projection (C) A → e is not put into P’

(D) Isomorphic projection (D) None of the mentioned

Paper II 8 K-2418
*K2418* Total Number of Pages : 16

56. What does the following command do ? 59. Match the following :
grep – vn “abc” x P. Smtp 1. Application layer
(A) It will print line number of file x Q. BGP 2. Transport layer
in which there is a match for the
R. TCP 3. Data link layer
string “abc”
S. PPP 4. Network layer
(B) It will print all of the lines in the file
5. Physical Layer
x that do not match the search
string “abc” Codes :

(C) It will print total number of the lines (A) P – 2, Q – 1, R – 3, S – 5

in x that match the search string (B) P – 1, Q – 4, R – 2, S – 3

“abc” (C) P – 1, Q – 4, R – 2, S – 5

(D) It will print all of the lines in the file (D) P – 2, Q – 4, R – 1, S – 3

x that match the search string “abc” 60. Suppose transmission rate of a channel
is 32 kbps. If there are ‘8’ routes from
57. In the slow start phase the TCP
congestion control algorithm, the size of source to destination and each packet

congestion window p contains 8000 bits. Total end to end

delay in sending packet P is
(A) Does not increase

(B) Increase linearly (A) 2 sec (B) 3 sec

(C) Increase quadratically (C) 4 sec (D) 1 sec

(D) Increase exponentially 61. A text is made up of the characters

a, b, c, d, e each occurring with the
58. What is the maximum size of data that
probability 0.11, 0.40, 0.16, 0.09 and
the application layer can pass on to the
0.24 respectively. The optimal Huffman
TCP layer below ?
coding technique will have the average
(A) Any size
length of
(B) 2∧ 16 bytes size of Tcp header
(A) 2.40 (B) 2.16
(C) 1500 bytes
(C) 2.26 (D) 2.15
(D) 2 ∧15 bytes
Paper II 9 K-2418
*K2418* Total Number of Pages : 16

62. An all-pairs shortest-paths problem is 66. ___________ statement allows an

efficiently solved using alias to be associated with simple or
structured data type.
(A) Dijkstra algorithm
(A) union (B) class
(B) Bellman-Ford algorithm (C) typedef (D) atoi
(C) Kruskal algorithm
67. int n ;
(D) Floyd-warshall algorithm n = atoi (“1000”) ;
What is the value stored in n ?
63. Consider a weighted complete graph G
(A) 1 (B) 10
on the vertex set { V1, V2, ..... Vn} such
(C) 100 (D) 1000
that the weight of the edge (Vi, Vj) is
4|i – j|. The weight of minimum cost 68. A member function of a derived class
may have the same name as a member
spanning tree of G is
function of a base class is known by
(A) 4n2 (B) n
(A) Overloading
(C) 4n – 4 (D) 2n – 2 (B) overriding
(C) Abstraction
64. In a binary tree with n nodes, every node
(D) Virtual
has an odd number of descendants.
Every node is considered to be its own 69. According to Brooks, if n is the number
of programmers in a project team then
descendant. what is the number of
the number of communication path is
nodes in the tree that have exactly one
(A) n(n – 1)/2
child ?
(B) nlogn
(A) 0 (B) 1 (C) n
(C) (n –1)/2 (D) n – 1 (D) n (n + 1)/2

65. Let y = 0 × 1ff ; 70. The two dimensions of spiral model are

result = y << 3; (A) diagonal, angular

The output of result is (B) radial, perpendicular

(A) ff 9 (B) ff 7 (C) radial, angular

(C) ff 6 (D) ff 8 (D) diagonal, perpendicular

Paper II 10 K-2418
*K2418* Total Number of Pages : 16

71. Match the following with various activities 73. Consider a 4-way set associative cache
consisting of 128 lines with a line size
encountered in a software life cycle.
of 64 words. The CPU generates a
P. Requirements 1. Module 20-bit address of a word in main memory.
capture development and The number of bits in the TAG, LINe and
word fields are respectively.
integration
(A) 9, 6, 5 (B) 7, 7, 6
Q. Design 2. Domain analysis (C) 7, 5, 8 (D) 9, 5, 6
R. Implementation 3. Structural and
74. Consider the methods used by
behavioral processes P1 and P2 for accessing their
modeling critical sections whenever needed,
as given below. The initial values of
S. Maintenance 4. Performance
shared boolean variables S1 and S2 are
tuning randomly assigned.
method used by P1
Codes :
while (S1 = S2) ;
(A) P – 3, Q – 2, R – 4, S – 1 critical section
S1 = S2 ;
(B) P – 2, Q – 3, R – 1, S – 4
method used by P2
(C) P – 3, Q – 2, R – 1, S – 4
while (S1 ! = S2);
(D) P – 2, Q – 3, R – 4, S – 1 critical section
S2 = not (S1) ;
72. IEEE 830-1993 is a IEEE Which one of the following statements
recommended standard for describes the properties achieved ?
(A) Mutual exclusion but not progress
(A) Software requirement specification
(B) Progress but not mutual exclusion
(B) Software design (C) neither mutual exclusion nor
progress
(C) Testing
(D) Both mutual exclusion and
(D) Maintenance progress

Paper II 11 K-2418
*K2418* Total Number of Pages : 16

75. Which of the following features will 78. Match the following knowledge
characterize an OS as multi-programmed representation techniques with their
OS ?
application.
a. more than one program may be
loaded into main memory at the List – I List – II
same time.
a. Frames i. Pictorial
b. If a program waits for certain event
another program is immediately representation
scheduled. of objects, their
c. If the execution of a program attributes and
terminates, another program is
relationships
immediately scheduled.
(A) (a) only b. Conceptual ii. To describe real
(B) (a) and (b) only dependencies world stereotype
(C) (a) and (c) only events
(D) (a), (b) and (c) only c. Associative iii. Record like

76. Distributed systems have networks structures

(A) high security for grouping
(B) better resource sharing closely related
(C) better system utilization knowledge
(D) low system overhead
d. Scripts iv. structures and
77. The first widely used commercial form of primitives to
Artificial Intelligence (AI) is being used in represent
many popular products like microwave
sentences
ovens, automobiles and plug in circuit
boards for desktop PCs. It allows Codes :
machine to handle vague information
a b c d
with a deftness that mimics human
intuition. What is the name of this AI ? (A) iii iv i ii
(A) Boolean logic
(B) iii iv ii i
(B) Human logic
(C) Fuzzy logic (C) iv iii i ii

(D) Functional logic (D) iv iii ii i

Paper II 12 K-2418
*K2418* Total Number of Pages : 16

79. In an expert system, the expertise is 83. Which of the following is TRUE for the
contained in a language ?
(A) Data base { aq | q is a prime }
(B) Model base
(A) It is not accepted by a Turing
(C) Knowledge base
machine
(D) Content base
(B) It is context-free but not regular
80. What is a manager’s primary use of a (C) It is regular but not context-free
MIS ?
(D) It is neither regular nor context-
(A) to facilitate problem solving and
free, but accepted by a Turing
decision making
machine
(B) To facilitate quality control
(C) To monitor inventory 84. The language accepted by a pushdown
(D) To evaluate productivity automaton in which the stack is limited
to 8 items is best described as
81. Let w be any string of length n in {0, 1}*.
Let L be the set of all substrings of w. (A) context-free
What is the minimum number of states (B) Regular
in a non-deterministic finite automaton
(C) Deterministic context-free
that accepts L ?
(D) Recursive
(A) n –1
(B) n 85. Huffman coding is an encoding algorithm
(C) n + 1 used for
(D) 2n +1 (A) files greater than 1m bit

82. Which one of the following is FALSE ? (B) lossy data compression

(A) There is a unique minimal DFA for (C) broadband systems

every regular language (D) lossless data compression
(B) Every NFA can be converted to an
86. The best visual compression quality is
equivalent PDA
achieved using
(C) Complement of every context-free
(A) DCT
language is recursive
(B) Fourier transform
(D) Every non-deterministic PDA can
be converted to an equivalent (C) Dolby
deterministic PDA (D) Wavelets

Paper II 13 K-2418
*K2418*
87. What is the sum of all components of a
normalized histogram ?
(A) 1
(B) –1
(C) 0
(D) None of the above
88. What is the sum of the coefficient of the
mark defined using gradient ?
(A) 1
(B) –1
(C) 0
(D) None of the mentioned
89. The dual simplex method is applicable
provided
(A) Optimality remains satisfied
(B) feasibility remains satisfied
(C) Both remain satisfied
(D) Optimality is satistified but
feasibility is disturbed
90. In an unweighted, undirected connected
graph, the shortest path from a node S
to every other node is computed most
efficiently in terms of time complexity
by
(A) Dijkstra’s algorithm starting from S
(B) Warshall’s algorithm
(C) Performing a DFS starting from S
(D) Performing a BFS starting from S
Paper II
Total Number of Pages : 16
91. The Hungarian method for solving an
assignment problem can also be used
to solve
(A) A transportation problem
(B) A traveling salesperson problem
(C) Both A and B
(D) Only B
92. How do find the min-cut ?
(A) use the residual graph
(B) use the spanning tree
(C) use the isomorphic graph
(D) use the B-tree
93. Back propagation is a learning technique
that adjusts weights in the neural network
by propagating weight changes
(A) Forward from source to sink
(B) Backward from sink to source
(C) forward from source to hidden
nodes
(D) Backward from sink to hidden
nodes
94. Epoch is a term used to describe in
neural network for
(A) 25% of data in the training set is
presented to the neural network
(B) 50% of data in the training set is
presented to the neural network
(C) No data in the training set is
presented to the neural network
(D) All of the data in the training set is
presented to the neural network
14 K-2418
*K2418* Total Number of Pages : 16

95. Perceptron can learn 99. The following program

(A) AND main ( )
(B) XOR {
(C) Both A and B if (fork( ) > 0 )
(D) None of these sleep(100);
}
96. A 4-input neuron has weights 1, 2, 3 and
results in the creation of
4. The transfer function is linear with the
constant of proportionality being equal (A) an orphan process
to 2. The inputs are 4, 10, 5 and 20 (B) a zombie process
respectively. The output will be (C) a process that executes for ever
(A) 238
(D) none of the above
(B) 76
(C) 119 100. Match the following WINDOWS system
(D) 123 calls and UNIX system calls with
reference to process control and file
97. _________ command is used to manipulation.
terminate a process. Windows UNIX
(A) shutdown
a. Create-process ( ) 1. Open ( )
(B) Haltsys
b. WaitForSingle 2. Close ( )
(C) Kill Object ( )
(D) Cancel
c. CreateFile ( ) 3. Fork ( )
98. In Shell’s interpretive cycle, the shell first d. CloseHandle ( ) 4. Wait ( )
scans for ____________ in the entered Codes :
commands. a b c d
(A) characters (A) 3 4 1 2
(B) priority (B) 4 3 1 2
(C) meta-characters (C) 4 3 2 1

(D) wild cards (D) 3 4 2 1

Paper II 15 K-2418
*K2418* Total Number of Pages : 16

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

Space for Rough Work

Paper II 16 K-2418