Signature and Name of Invigilator 1. (Signature) (Name) 2.

(Signature) (Name)

Answer Sheet No. : ................................................ Roll No.

(To be filled by the Candidate)

(In figures as per admission card)

Roll No.

(In words)

D—8 7 0 7
Time : 1¼ hours]

COMPUTER SCIENCE AND APPLICATIONS

PAPER—II

Test Booklet No. [Maximum Marks : 100

Number of Pages in this Booklet : 16 Instructions for the Candidates
1. 2. 3. Write your roll number in the space provided on the top of this page. This paper consists of fifty multiple-choice type of questions. 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 this cover page. Do not accept a booklet without sticker-seal and do not accept an open booklet. 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. After this verification is over, the Serial No. of the booklet should be entered in the Answer-sheets and the Serial No. of Answer Sheet should be entered on this Booklet.

Number of Questions in this Booklet : 50

ÂÚUèÿææçÍüØô¢ ·ð¤ çÜ° çÙÎðüàæ
1. ÂãÜðU ÂëDU ·ð¤ ª¤ÂÚU çÙØÌ SÍæÙ ÂÚU ¥ÂÙæ ÚUôÜU ِÕÚU çÜç¹°Ð 2. §â ÂýàÙ-˜æ ×𢠿æâ Õãéçß·¤ËÂèØ ÂýàÙ ãñ¢Ð 3. ÂÚUèÿææ ÂýæڐUÖ ãôÙð ÂÚU, ÂýàÙ-ÂéçSÌ·¤æ ¥æ·¤ô Îð Îè ÁæØð»èÐ ÂãÜðU ÂUæ¡¿ ç×ÙÅU

¥æ·¤ô ÂýàÙ-ÂéçSÌ·¤æ ¹ôÜÙð ÌÍæ ©â·¤è çِÙçÜç¹Ì Áæ¡¿ ·ð¤ çÜ° çÎØð ÁæØð¢»ð çÁâ·¤è Áæ¡¿ ¥æ·¤ô ¥ßàØ ·¤ÚUÙè ãñ Ñ
(i)

ÂýàÙ-ÂéçSÌ·¤æ ¹ôÜÙð ·ð¤ çÜ° ©â·ð¤ ·¤ßÚU ÂðÁ¤ÂÚU Ü»è ·¤æ»Á ·¤è âèÜ ·¤ô ȤæǸU Üð¢UÐ ¹éÜè ãé§ü Øæ çÕÙæ SÅUè·¤ÚU-âèÜU ·¤è ÂéçSÌ·¤æ Sßè·¤æÚU Ù ·¤Úð¢UÐ

(ii)

(ii)

·¤ßÚU ÂëDU ÂÚU ÀUÂð çÙÎðüàææÙéâæÚU ÂýàÙ-ÂéçSÌ·¤æ ·ð¤ ÂëDU ÌÍæ ÂýàÙô¢ ·¤è ⢁Øæ ·¤ô ¥‘ÀUè ÌÚUã ¿ñ·¤ ·¤ÚU Üð¢U ç·¤ Øð ÂêÚðU ãñ¢UÐ ÎôáÂê‡æü ÂéçSÌ·¤æ çÁÙ×ð¢ ÂëDU / ÂýàÙ ·¤× ãô¢ Øæ ÎéÕæÚUæ ¥æ »Øð ãô¢ Øæ âèçÚUØÜU ×ð¢ Ù ãô¢ ¥ÍæüÌ ç·¤âè Öè Âý·¤æÚU ·¤è ˜æéçÅUÂê‡æü ÂéçSÌ·¤æ Sßè·¤æÚU Ù ·¤Úð¢U ÌÍæ ©âè â×Ø ©âð ÜUõÅUæ·¤ÚU ©â·ð¤ SÍæÙ ÂÚU ÎêâÚUè âãè ÂýàÙ-ÂéçSÌ·¤æ Üð Üð¢Ð U §â·ð¤ çÜ° ¥æ·¤ô Âæ¡¿ ç×ÙÅU çÎØð ÁæØð¢»ðÐ ©â·ð¤ ÕæÎ Ù Ìô ¥æ·¤è ÂýàÙ-ÂéçSÌ·¤æ ßæÂâ Üè ÁæØð»è ¥õÚU Ù ãè ¥æ·¤ô ¥çÌçÚUQ¤ â×Ø çÎØæ ÁæØð»æÐ
·¤Úð¢U ¥UõÚU ©žæÚU-˜淤 ·¤è R¤×¤â¢Øæ §â ÂýàÙ-ÂéçSÌ·¤æ ÂÚU ¥¢ç·¤Ì ·¤ÚU ÎðÐ ¢

(iii)

(iii) §â Áæ¡¿ ·ð¤ ÕæÎ ÂýàÙ-ÂéçSÌ·¤æ ·¤è R¤× ⢁Øæ ©žæÚU-˜淤 ÂÚU ¥¢ç·¤Ì

4.

Each item has four alternative responses marked (A), (B), (C) and (D). You have to darken the oval as indicated below on the correct response against each item. Example :
A B C D

4. ÂýˆØð·¤ ÂýàÙ ·ð¤ çÜ° ¿æÚU ©žæÚU çß·¤Ë (A), (B), (C) ÌÍæ (D) çÎØð »Øð ãñ¢Ð

¥æ·¤ô âãè ©žæÚU ·ð¤ Îèƒæüßëžæ ·¤ô ÂðÙ âð ÖÚU·¤ÚU ·¤æÜæ ·¤ÚUÙæ ãñ Áñâæ ç·¤ Ùè¿ð çιæØæ »Øæ ãñÐ

©ÎæãÚU‡æ Ñ

A

B

C

D

where (C) is the correct response. 5. Your responses to the items are to be indicated in the Answer Sheet given inside the Paper I booklet only. If you mark at any place other than in the ovals in the Answer Sheet, it will not be evaluated. Read instructions given inside carefully. Rough Work is to be done in the end of this booklet. If you write your name or put any mark on any part of the test booklet, except for the space allotted for the relevant entries, which may disclose your identity, you will render yourself liable to disqualification. You have to return the test question booklet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall.

ÁÕç·¤ (C) âãè ©žæÚU ãñÐ
5. ÂýàÙô¢ ·ð¤ ©žæÚU ·ð¤ßÜU Âýà٠˜æ I ·ð¤ ¥‹ÎÚU çÎØð »Ø𠩞æÚU-˜淤 ÂÚU ãè ¥¢ç·¤Ì

·¤ÚUÙð ãñ¢Ð ØçÎ ¥æ ©žæÚU ˜淤 ÂÚU çÎØð »Øð Îèƒæüßëžæ ·ð¤ ¥Üæßæ ç·¤âè ¥‹Ø SÍæÙ ÂÚU ©žæÚU 翋ãæ¢ç·¤Ì ·¤ÚUÌð ãñ, Ìô ©â·¤æ ×êËUØ梷¤Ù Ùãè¢ ãô»æÐ

6. 7. 8.

6. ¥‹ÎÚU çÎØð »Øð çÙÎðüàæô¢ ·¤ô ŠØæÙÂêßü·¤ Âɸð¢UÐ 7. ·¤“ææ ·¤æ× (Rough Work) §â ÂéçSÌ·¤æ ·ð¤ ¥ç‹Ì× ÂëDU ÂÚU ·¤Úð¢UÐ 8. ØçÎ ¥æ ©žæÚU-ÂéçSÌ·¤æ ÂÚU ¥ÂÙæ Ùæ× Øæ °ðâæ ·¤ô§ü Öè çÙàææÙ çÁââð ¥æ·¤è

Âã¿æÙ ãô â·ð¤, ¤ç·¤âè Öè Öæ» ÂÚU ÎàææüÌð Øæ ¥¢ç·¤Ì ·¤ÚUÌð ãñ¢ Ìô ÂÚUèÿææ ·ð¤ çÜØð ¥Øô‚Ø ƒæôçáÌ ·¤ÚU çÎØð ÁæØð¢»ðÐ
9. ¥æ·¤ô ÂÚUèÿææ â×æ# ãôÙð ¤ÂÚU ©žæÚU-ÂéçSÌ·¤æ çÙÚUèÿæ·¤ ×ãôÎØ ·¤ô ÜUõÅUæÙæ

9.

¥æßàØ·¤ ãñ ¥õÚU ÂÚUèÿææ â×æç# ·ð¤ ÕæÎ ¥ÂÙð âæÍ ÂÚUèÿææ ÖßÙ âð ÕæãÚU Ù Üð·¤ÚU ÁæØð¢Ð

10. Use only Blue/Black Ball point pen. 11. Use of any calculator or log table etc., is prohibited. 12. There is NO negative marking.

·ð¤ßÜ ÙèÜð / ·¤æÜð ÕæÜU Œßæ§ZÅU ÂñÙ ·¤æ ãè §SÌð×æÜ ·¤Úð¢UÐ ç·¤âè Öè Âý·¤æÚU ·¤æ ⢻‡æ·¤ (·ñ¤Ü·é¤ÜðÅUÚU) UØæ Üæ» ÅðUÕÜ ¥æçÎ ·¤æ ÂýØô» ßçÁüÌ ãñÐ 12. »ÜÌ ©žæÚU ·ð¤ çÜ° ¥¢·¤ Ùãè¢ ·¤æÅðU ÁæØð¢»ðÐ
10. 11.

D—8707

1

P.T.O.

Computer Science and Applications PAPER—II Note : This paper contains fifty (50) objective-type questions. each question carrying two (2) marks. (B) (D) type 1. A context free grammar is : (A) (C) type 0. The minimum distance of ‘e’ is equal to : (A) (B) (C) (D) the maximum weight of a non zero code word the minimum weight of a non zero code word m n 2 D—8707 . 4. Attempt all of them. A box contains six red balls and four green balls. 1. Four balls are selected at random from the box. Let e : B^m → B^n is a group code. type 2. What is the probability that two of the selected balls are red and two are green ? (A) 3 7 (B) 4 7 (C) 5 7 (D) 6 7 2. The number of edges in a complete graph with ‘n’ vertices is equal to : (A) (C) n(n21) n2 (B) (D) n (n21) 2 2n21 3. type 3.

(~ x) y 1xz. Consider a Moore machine M whose digraph is : Then L(M). The dual of the switching function F5x1yz is given by : (A) (C) x 1 yz (~x)1(~ y)(~z) (B) (D) 3 x( y1 z ) (~x)((~y)1(~z)) P. D—8707 .O. two or more a’s.T. (B) (D) (~x)y1 (~x)z. In order to build a MOD . the language accepted by the machine M.18 counter. is the set of all strings having : (A) (C) two or more b’s. xy 1 xz. the minimum number of flip flops needed is equal to : (A) (C) 18 5 (B) (D) 9 4 9. 8.5. three or more a’s. Simplified form of Boolean expression xy1(~x)z1yz is : (A) (C) xy 1(~ x)z. (B) (D) three or more b’s. 6. A WFF that is equivalent to the WFF x5> y is : (A) (C) y5 > x ~ y5 > ~ x (B) (D) ~ y5> x y5> ~ x 7.

p → next !5NULL. i). (D) for (p5list. p5q. p !5NULL. p5p → next). (C) for (p5list. ? . p → next5q. p → next !5NULL. p5q. p5p → next). p !5NULL. What cannot replace ‘?’ in the following C-code to print all odd numbers less than 100 ? for (i51. Amongst the logic families DTL. i5i12) printf(“%d\n”. p5p → next). the family with the least power dissipation is : (A) (C) CMOS TTL (B) (D) DTL ECL 11. Consider the following linked list : Which of the following piece of code will insert the node pointed to by q at the end of the list ? (A) for (p5list.10. (A) (C) i[100 i <100 (B) (D) i[101 i<101 12. D—8707 4 . ECL and CMOS. (B) for (p5list. TTL. p → next5q. p5p → next).

} D—8707 5 P. case ‘B’5printf (“%d\n”. switch(x) { case ‘A’ : printf (“%d\n”. } (B) x5’A’. . break. x). Which of the following is a valid C code to print character ‘A’ to ‘C’ ? (A) x5’A’.. case ‘C’5printf (“%d\n”. x).} (C) x5’A’. case ‘C’ : printf (“%d\n”. x). x).. case ‘B’ : printf (“%d\n”. switch(x) { case ‘A’5printf (“%d\n”.T. case ‘C’5printf (“%d\n”. switch(x) {case ‘A’5printf (“%d\n”. } (D) x5’A’.. x). break. switch(x) {case ‘A’<5x <5’C’ : printf (“%d\n”. .O. x). x). x). x). break.13.

16. Which of the following is true of constructor function in C11 ? (A) (B) (C) (D) A class must have at least one constructor.14. When base class access specified is “Public”. When base class access specified is “Public”. A primary key for an entity is : (A) (B) (C) (D) a candidate key any attribute a unique attribute a superkey 6 D—8707 . A constructor is a unique function which cannot be overloaded. (B) (C) (D) 15. protected elements of a base class become protected members of its derived class. “Protected” elements of base class are not accessible by members of its derived class. Which of the following is not true in C11 ? (A) “Private” elements of a base class are not accessible by members of its derived class. public elements of the base class become public members of its derived class. A constructor function must be invoked with the object name. A constructor function is automatically invoked when an object is created.

Consider the query : SELECT student_name FROM students WHERE class_name 5 (SELECT class_name FROM students WHERE math_marks 5 100). The end of an SQL command is denoted by : (A) (B) (C) (D) an end-of-line character an ‘enter-key’ marker entering F4 key a semicolon (. Aggregate functions in SQL are : (A) (B) (C) (D) GREATEST.17. D—8707 . If a relation is in 2NF and 3NF forms then : (A) (B) (C) (D) no non-prime attribute is functionally dependent on other non-prime attributes no non-prime attribute is functionally dependent on prime attributes all attributes are functionally independent prime attribute is functionally independent of all non-prime attributes 19. COUNT and AVG UPPER.O. what will be the output ? (A) (B) (C) (D) the list of names of students with 100 marks in mathematics the names of all students of all classes in which at least one student has 100 marks in mathematics the names of all students in all classes having 100 marks in mathematics the names and class of all students whose marks in mathematics is 100 7 P.T.) 20. LOWER and LENGTH SQRT. POWER and MOD 18. LEAST and ABS SUM.

What is the minimum number of nodes at level i (i > 0) of the tree ? Assume that the root is at level 0: (A) (B) (C) (D) 3i 3i 3 3i + 1 22. Consider a rooted tree in which every node has at least three children. in the worst case is : (A) (B) (C) (D) O(log n) O(n) Ω (n log n) 2 Ω (n ) 24. An example of a file extension is : (A) (B) (C) (D) text pict mp3 web 8 D—8707 . Which of the following data structure is used to implement recursion ? (A) (B) (C) (D) Arrays Stacks Queues Linked lists 23.21. The height of a binary tree with ‘n’ nodes.

a layer that is often thin or non-existent is : (A) (B) (C) (D) network layer transport layer presentation layer application layer 28. then the mean time (ms) required for a hit rate ‘h’ is given by : (A) (B) (C) (D) 1 h 1 10 (1 2 h) (1 2 h) 1 10 h 10 26.O. D—8707 . 9000 bps.T.000 bps.3 27. If it takes 1 msec to satisfy a request from the cache but 10 msec to satisfy a request if a disk read is needed. (B) (D) 9 6000 bps. The performance of a file system depends upon the cache hit rate.25. The maximum data rate of binary signals on a noiseless 3 KHz channel is : (A) (C) 3000 bps. The best known example of a MAN is : (A) (B) (C) (D) Ethernet Cable Television FDDI IEEE 802. 12. In a broadcast network. P.

during the first pass : (A) (B) (C) (D) user defined address symbols are correlated with their binary equivalent the syntax of the statement is checked and mistakes.29. In a two pass compiler. the maximum channel utilization is : (A) (C) 100% 36% (B) (D) 50% 18% 30. For pure ALOHA. An example of an adaptive routing algorithm is : (A) (B) (C) (D) distance vector routing flooding selective flooding shortest path routing 31. are listed object program is generated semantic of the source program is elucidated. 32. A single instruction in an assembly language program contains : (A) (B) (C) (D) one micro operation one macro operation one instruction to be completed in a single pulse one machine code instruction 10 D—8707 . if any.

next lower level of the parse tree is predicted. length of the parse tree is predicted before hand.33. How many states can a process be in ? (A) (C) 2 4 (B) (D) 11 3 5 P. Top-down parsers are predictive parsers. because : (A) (B) (C) (D) next tokens are predicted. lowest node in the parse tree is predicted.O. 35. “reduction in strength” refers to : (A) (B) (C) (D) code optimization obtained by the use of cheaper machine instructions reduction in accuracy of the output reduction in the range of values of input variables reduction in efficiency of the program 36. Absolute loader demands that the programmer needs to know the : (A) (B) (C) (D) start address of the available main memory total size of the program actual address of the data location absolute values of the operands used 34. D—8707 . In the context of compiler design.T.

the total number of page faults with FIFO will be equal to : (A) (C) 0 6 (B) (D) 4 9 38. (B) (D) 25 msec. 39 msec. The previous four runs from oldest to most recent are 40. Average process size = s bytes. A major defect in water fall model in software development is that : (A) (B) (C) (D) the documentation is difficult a blunder at any stage can be disastrous a trial version is available only at the end of the project the maintenance of the software is difficult 12 D—8707 .5 is used to predict run times. A program has five virtual pages. 20. 41. The aging algorithm with a = 0. numbered from 0 to 4. 20. unmap. If the pages are referenced in the order 012301401234. The prediction for the next time will be : (A) (C) 15 msec. brk. 40. 40 msec. and 15 msec. (B) (D) waitpid. with three page frames. An example of a directory found in most UNIX system is : (A) (C) usr. The optimum page size is given by : (A) (C) s (se) (B) (D) e (2se) 39. Each page entry requires e bytes.37.

The approach to software testing is to design test cases to : (A) (B) (C) (D) break the software understand the software analyse the design of sub processes in the software analyze the output of the software 13 P. D—8707 .O. An error message produced by an interactive system should have : (A) (B) (C) (D) always the error code the list of mistakes done by the user displayed a non-judgmental approach the past records of the occurrence of the same mistake 44.T. System development cost estimation with use-cases is problematic because : (A) (B) (C) (D) of paucity of examples the data can be totally incorrect the expertise and resource available are not used the problem is being over simplified 45. Function point metric of a software also depends on the : (A) (B) (C) (D) number of function needed number of final users of the software number of external inputs and outputs time required for one set of output from a set of input data 43.42.

If 840 frequencies are available. Identify the incorrect statement : (A) (B) (C) (D) The internet has evolved into phenomenally successful e-commerce engine e-business is synonymous with e-commerce The e-commerce model B2C did not begin with billboardware The e-commerce model G2C began with billboardware 14 D—8707 . Given a parallel algorithm A with computation time t. if parallel algorithm A performs m computational operation. With reference to implementation of different association mining algorithms. Consider a typical mobile communication system. identify the correct statement : (A) The FP growth method was usually better than the best implementation of the apriori algorithm Apriori algorithm is usually better than CHARM Apriori algorithm is good when the support required is low At very low support the number of frequent items becomes less (B) (C) (D) 48. how many can be used in a given cell ? (A) (C) 140 84 (B) (D) 120 60 49.46. then p processors can execute algorithm A in time given by : (A) (C) t /p t1(m2t)/p (B) (D) mt / p (m2t)/ p 47.

.O.50. Identify the incorrect statement : (A) (B) (C) (D) ATM provides both real time and non-real time service ATM provides faster packet switching than X.T.25 ATM was developed as part of the work on broadband ISDN ATM does not have application in Non-ISDN environments where very high data rates are required -oOo- D—8707 15 P.

Space For Rough Work D—8707 16 .

Sign up to vote on this title
UsefulNot useful