Test Booklet Code & Serial No.

A
COMPUTER SCIENCE AND APPLICATION
Signature and Name of Invigilator Seat No.
1. (Signature) ......................................... (In figures as in Admit Card)
(Name) ................................................ Seat No. ..............................................................
2. (Signature) ......................................... (In words)

(Name) ................................................ OMR Sheet No.

JAN - 37218 (To be filled by the Candidate)
Time Allowed : 1¼ Hours] [Maximum Marks : 100
Number of Pages in this Booklet : 16 Number of Questions in this Booklet : 50
Instructions for the Candidates
1. Write your Seat No. and OMR Sheet No. in the space provided 1.
on the top of this page.
2. This paper consists of 50 objective type questions. Each question
will carry two marks. All questions of Paper-II will be compulsory, 2.
covering entire syllabus (including all electives, without options).
3. At the commencement of examination, the question booklet
will be given to the student. In the first 5 minutes, you are
requested to open the booklet and compulsorily examine it as 3.
follows :
(i) To have access to the Question Booklet, tear off the
paper seal on the edge of this cover page. Do not accept (i)
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 (ii)
cover page. Faulty booklets due to missing pages/
questions or questions repeated or not in serial
o rder or any other discre pancy should not be
accepted and correct booklet should be obtained
from the invigilator within the period of 5 minutes.
Afterwards, neither the Question Booklet will be
replaced nor any extra time will be given. The same
may please be noted.
(iii) After this verification is over, the OMR Sheet Number
should be entered on this Test Booklet. (iii)
4. Each question 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. 4. (A), (B), (C) (D)
Example : where (C) is the correct response.

A B D
(C)
5. Your responses to the items are to be indicated in the OMR
Sheet given inside the Booklet only. If you mark at any place A B D
other than in the circle in the OMR Sheet, it will not be evaluated.
5.
6. Read instructions given inside carefully.
7. Rough Work is to be done at the end of this booklet.
8. If you write your Name, Seat Number, Phone Number or put 6.
any mark on any part of the OMR Sheet, except for the space 7.
allotted for the relevant entries, which may disclose your 8.
identity, or use abusive language or employ any other unfair
means, you will render yourself liable to disqualification.
9. You have to return original OMR Sheet to the invigilator at the
end of the examination compulsorily and must not carry it with 9.
you outside the Examination Hall. You are, however, allowed
to carry the Test Booklet and duplicate copy of OMR Sheet on
conclusion of examination.
10. Use only Blue/Black Ball point pen. 10.
11. Use of any calculator or log table, etc., is prohibited. 11.
12. There is no negative marking for incorrect answers. 12.
 JAN - 37218/II—A

2
 JAN - 37218/II—A

Computer Science and Application

Paper II
Time Allowed : 75 Minutes] [Maximum Marks : 100

Note : This paper contains Fifty (50) multiple choice questions. Each question

carries Two (2) marks. Attempt All questions.

1. G is a planar graph with V-vertices, 3. A committee of 3 teachers is to be

E-edges and F-faces. If V = 5, E = 8, formed out of 6 teachers, 2 each from

Science, Maths and English. The
then F =
committee must include a Science
(A) 5 Teacher. In how many ways it can
be done ?
(B) 6
(A) 50

(C) 3 (B) 40

(C) 32
(D) 7
(D) 36
2. G is a complete graph with
4. 2 fair coins are tossed. What is the
V-vertices and E-edges. Then which probability of getting exactly 2
of the following is false ? heads or 2 tails ?

(A) G is V-colourable 1
(A)
4
V(V – 1)
(B) E = 3
2 (B)
8
(C) G cannot be planar for any 1
(C)
value of V and E 2
1
(D) G is always connected (D)
3
3 [P.T.O.
 JAN - 37218/II—A

5. What does this NFA accept ? 8. The ‘‘carry look ripple delay’’ is
eliminated in :

(A) Parallel adder circuits

(B) Carry-look-ahead adder circuit

(C) Full adder circuit

(A) 101010
(D) Haff-adder circuit
(B) 0110
9. For a ‘n’ bit number, the maximum
(C) only ‘A’
positive number which can be
(D) both ‘A’ and ‘B’
represented in 1’s complement
6. Designing of an asynchronous
representation is :
sequential circuits are difficult
because of : (A) 2 n
(A) Memory required is enormous
(B) 2n+1 – 1
(B) External clock is to be provided
(C) 2n–1 – 1
(C) They involve stability problem
(D) It is more complex (D) 2 n–1

7. While designing a sequential circuit, 10. Floating-point numbers are used to

the clock signals are used because represent :
of :
(A) Only for small numbers or very
(A) To display the time of the day
large numbers
(B) To carry serial data signals
(C) To synchronize events in (B) Only large negative number
various parts of a system
(C) Only for positive numbers
(D) To display the how much time
is elapsed after the system is (D) Only for negative numbers

turned on within computers

4
 JAN - 37218/II—A

11. Match of the following is : 13. The structure of C++ programming

(1) C (M) Imperative brings together a group of :

(2) Java (N) Functional (A) Related data items, variables

(3) Lisp (O) Object oriented

(B) Items of the same data type
(4) Prolog (P) Constraint based
(C) Integers with user-defined
(A) 1 – M, 2 – O, 3 – N, 4 – P
names
(B) 1 – M, 2 – P, 3 – O, 4 – N
(D) All of the above
(C) 1 – P, 2 – O, 3 – M, 4 – N
14. If an arithmetic assignment
(D) 1 – M, 2 – N, 3 – O, 4 – P
operator is overloaded in C++
12. In case of recursion which of the
programming the result :
following statements is false ?

(A) Every recursive program can (A) Goes in the object to the right

have an alternative iterative of the operator

program
(B) Goes in the object to the left of
(B) Simplifies the logic
the operator
(C) Generally recursive version of
(C) Must be returned
programs take less space over

iterative counter part (D) Goes in the object to the left of

(D) Options (A) & (C) only the operator is a member

5 [P.T.O.
 JAN - 37218/II—A

15. The purpose of interfaces is to 17. Consider the case that a record is

minimize dependencies between read by another, which is moved or

different parts of program for the deleted and it contains a pointer,

following reason : then that pointer is called as :

(A) Lead to systems that are easier (A) Unlinked pointer

to understand (B) Dynamic pointer

(B) Lead to better data hiding (C) Dangling pointer

properties
(D) Pointer to pointer
(C) Lead to easier to modify
18. Out of the following functions, one
(D) All of the above of the responsibility is not of the

16. A DBMS is transparent if : utilities component of DBMS

software :
(A) It keeps hidden, a physical

structure from user (A) Removing flagged records from

deletion
(B) A sensitive information from

user cannot be hide (B) Creating and maintaining the

data dictionary
(C) It keeps hidden, a logical

structure from user (C) Creating the physical and

logical designs
(D) A sensitive information from

user can be hide (D) Performance monitoring

6
 JAN - 37218/II—A

19. The approach represented by ER 21. Representation of data structure in

modeling is : memory is known as :

(A) Bottom approach (A) Recursive

(B) Top down approach (B) Abstract data type

(C) Left right approach (C) Storage structure

(D) Bottom left approach (D) File structure

20. If the field size is small, and data 22. The extra key inserted at the end

to be entered is longer, then : of the array is called a/an :

(A) Part of the data will be cut-off (A) End key

(B) Database program will freeze (B) Stop key

(C) Field will automatically adjust (C) Sentinel

(D) Field will be flexible (D) Transposition

7 [P.T.O.
 JAN - 37218/II—A

23. The number of different directed 25. The searching technique that takes

trees with 3 nodes is :

O(1) to find a data is :

(A) 2
(A) Linear search

(B) 3
(B) Binary search
(C) 4

(C) Hashing
(D) 5

(D) Tree
24. The pre-order and post-order

traversal of a binary tree generates 26. The main limitations of Manchester

the same output. The tree can have

encoding is :

maximum :
(A) Higher the baud rate

(A) Three nodes

(B) Lower attenuation

(B) Two nodes

(C) Higher attenuation

(C) One node

(D) Lower clocking rate

(D) Any number of nodes

8
 JAN - 37218/II—A

27. The 1EEE802·4 token bus standard 29. Match the following :
mainly designed by keeping
List-I List-II
motivations as :
(1) Repeater (i) Transport layer
(A) To support real time traffic
(2) Hub (ii) Data link layer
(B) It is less vulnerable compared
(3) Bridge (iii) Physical layer
to token ring
(4) Switch (iv) Network layer
(C) To remove probabilistic nature

of CSMA/CD (5) Router (v) Application layer

(D) All of the above (6) Transport

28. The fragment reassembly of IP Gateway

datagrams is done at the destination
(7) Application
not at the intermediate next hop
Gateway
router due to :
(A) 1 – (ii), 2 – (iii), 3 – (ii), 4 – (ii),
(A) Fragments may follow the same
5 – (ii), 6 – (i), 7 – (v)
route
(B) 1 – (iii), 2 – (ii), 3 – (ii), 4 – (ii),
(B) Fragments may follow the

different routes 5 – (iv), 6 – (i), 7 – (v)

(C) Different networks will have the (C) 1 – (iii), 2 – (ii), 3 – (ii), 4 – (ii),

same MTU size 5 – (v), 6 – (iv), 7 – (v)

(D) Intermediate routers do not (D) 1 – (iii), 2 – (iii), 3 – (ii), 4 – (iii),

know the reassembly algorithm 5 – (iv), 6 – (i), 7 – (i)

9 [P.T.O.
 JAN - 37218/II—A

30. Match the following : 32. The grouping of characters into

List – I List – II tokens are carried through :

(Protocols) (Protocol port nos) (A) Code optimization

(P) DNS (1) 23

(B) Code generator
(Q) DHCP (2) 53
(C) Scanner
(R) IMAP (3) 67
(D) Parser
(S) POP3 (4) 68
33. Which of the following is a Parser
(5) 110
generating tool ?
(6) 143
(A) vi
(A) P – 3, Q – 4, R – 5, S – 6

(B) P – 2, Q – 3, R – 5, S – 6 (B) ls

(C) P – 2, Q – 4, R – 6, S – 5 (C) lex

(D) P – 1, Q – 3, R – 6, S – 5 (D) yacc

31. The use of Macroprocessor is as an

34. foreach instruction is used in :
aid to :
(A) Pascal
(A) Linker
(B) Perl
(B) Loader

(C) FORTRAN
(C) Assembler

(D) Interpreter (D) COBOL

10
 JAN - 37218/II—A

35. Which is the post fix notation of

37. Thrashing means :
(9 – 5) + 2
(A) Increase in multiprogramming
(A) 59 – 2 +

(B) 95 – 2 + (B) Increase in paging activity

(C) 2 + 95 – (C) Increase in throughput

(D) 92 + 5 –
(D) Increase in cpu utilization
36. Three processes P, Q and R enter
38. The size of the swap space is
the ready queue simultaneously

with the length of the cpu burst decided :

given in milliseconds as 20, 10 and

(A) At the time of operating system
15 respectively. The wailing time for

process R in case of shortest job first installation

scheduling is :
(B) At the time of system start up

(A) 20
(C) At the time of loading the
(B) 25
swapper process
(C) 10

(D) 15 (D) By the hardware

11 [P.T.O.
 JAN - 37218/II—A

39. When actually data is to be read, 41. Continuous integration is one of the

approach in building complex

the first action taken by device
software system. This involves one
driver is :
of the important aspect of :
(A) To send the read( ) message to
(A) Requirement – design –
device controller
integrate cycle

(B) To check the device status

(B) Requirement – code – design –

(C) To send a get ready signal to integrate cycle

the device (C) Requirement – design – code –

integrate cycle
(D) To request a buffer space to

receive data (D) Requirement – code – integrate

cycle
40. Which option is used for ignoring
42. Software is an intelligent property
case during pattern search in grep
and the violation of this intellectual
command ?
property right does not involve :

(A) – i
(A) Software sharing

(B) – l (B) Software stealing

(C) – c (C) Illegal copying of software

(D) – p (D) Software installation

12
 JAN - 37218/II—A

43. One of the major factor incorporated 45. In case of performance optimization

in the process framework of RUP of almost any program, which of the

(Rational Unified Process) model following is correct ?

is : (A) Performance is most important

than correctness
(A) Iterative and incremental

(B) Optimization is most important

(B) Iterative and continuous
than performance
(C) Incremental and validations
(C) Correctness is most important
(D) Continuous and validations
than performance
44. Among the attributes of good object
(D) Correctness is most important
oriented design, two desirable and
than optimization
most important attributes are :
46. The electronic transmission of
(A) No. of children, nature of the business transaction documents
object between the computers of trading

(B) No. of children, response for a partners in a standard message

format is called :
class

(A) ERP
(C) Response for a class, nature of

object (B) EDI

(D) Response for a class, attributes (C) B2B

of objects (D) None of the above

13 [P.T.O.
 JAN - 37218/II—A

47. The commonly used mode for 3G 49. In win 32-Windows programming,

Networks is : the first message received by a

windows procedure is :
(A) TDMA

(A) WM_INIT
(B) CSMA

(B) WM_CREATE
(C) TDD

(C) WM_PAINT
(D) FDD

(D) WM_ACTIVATE
48. For constructing Data warehouse

from operational databases, which of 50. Which of the following is not part

the following operations are of minimal set of MPI (Message

necessary ? Passing Interface) routines ?

(A) Extract and Load (A) MPI_Init

(B) Create and Edit (B) MPI_Comm_Size

(C) Query and Update (C) MPI_Sendrecv

(D) Slice and Dice (D) MPI_Finalize

14
 JAN - 37218/II—A
ROUGH WORK

15 [P.T.O.
 JAN - 37218/II—A
ROUGH WORK

16