Professional Documents
Culture Documents
Paper-Ii Computer Science and Applications: Test Booklet No
Paper-Ii Computer Science and Applications: Test Booklet No
J 87 1 0
PAPER-II
Test Booklet No.
Note : This paper contains fifty (50) objective type questions, each question carrying
two (2) marks. Attempt all the questions.
J-8710 3 Paper-II
12. What will be the output of the 15. The data type created by the data
following c-code ? abstraction process is called
void main ( ) (A) class
{ (B) structure
char *P = "ayqm" ; (C) abstract data type
char c; (D) user defined data type
c = ++*p ;
printf ("%c", c); 16. An entity instance is a single
} occurrence of an _______.
(A) a (B) c (A) entity type
(C) b (D) q (B) relationship type
(C) entity and relationship type
13. Member of a class specified as (D) None of these
_______ are accessible only to
method of the class.
17. Generalization is _______ process.
(A) private (B) public
(A) top-down
(C) protected (D) derive (B) bottom up
(C) both (A) & (B)
14. Match the following : (D) None of these
(a) Garbage 1. Java
collection 18. Match the following :
in
I. 2 NF (a) transitive
(b) Nameless 2. generic dependencies
object programming eliminated
(c) Template 3. defines a II. 3 NF (b) multivalued
support class attribute
removed
(d) A forward 4. member
reference function III. 4 NF (c) contain no
partial
(e) Derived 5. within a functional
class statement dependencies
inherits
from base IV. 5 NF (d) contains no
class join
dependency
Codes :
Codes :
(a) (b) (c) (d) (e) I II III IV
(A) 1 5 4 2 3 (A) (a) (c) (b) (d)
(B) 1 5 2 3 4 (B) (d) (a) (b) (c)
(C) 5 1 2 3 4 (C) (c) (d) (a) (b)
(D) 5 4 3 1 2 (D) (d) (b) (a) (c)
Paper-II 4 J-8710
19. Which data management language 24. A chained hash table has an array
component enabled the DBA to size of 100. What is the maximum
define the schema components ? number of entries that can be placed
(A) DML in the table ?
(B) Sub-schema DLL (A) 100
(C) Schema DLL (B) 200
(D) All of these
(C) 10000
20. The PROJECT Command will create (D) There is no upper limit
new table that has
(A) more fields than the original 25. In a B tree of order 5, the following
table keys are inserted as follows :
(B) more rows than original table 7, 8, 1, 4, 13, 20, 2, 6 and 5
(C) both (A) & (B)
How many elements are present in
(D) none of these
the root of the tree ?
21. If we have six stack operations- (A) 1 (B) 2
pushing and popping each of A, B (C) 3 (D) 4
and C-such that push (A) must occur
before push (B) which must occur
before push (C), then A, C, B is a 26. The ______ field is the SNMP PDV
possible order for the pop operations, reports an error in a response
since this could be our sequence : message.
push (A), pop (A), push (B), push (A) error index
(C), pop (C), pop (B). Which one of (B) error status
the following orders could not be the (C) set request
order the pop operations are run, if
(D) agent index
we are to satisfy the requirements
described above ?
(A) ABC (B) CBA 27. What does the URL need to access
(C) BAC (D) CAB documents ?
I. Path name
22. What is the most appropriate data
structure to implement a priority II. Host name
queue ? III. DNS
(A) Heap IV. Retrieval method
(B) Circular array V. Server port number
(C) Linked list
(A) I, II, III (B) I, III, V
(D) Binary tree
(C) I, II, IV (D) III, IV, V
23. In a complete binary tree of n nodes,
how far are the two most distant
nodes ? Assume each edge in the 28. End-to-End connectivity is provided
path counts as ! from Last-to-Last in
(A) About log2n (A) Network layer
(B) About 2 log2n (B) Session layer
(C) About n log2n (C) Transport layer
(D) About 2n (D) Data link layer
J-8710 5 Paper-II
29. What services does the internet layer 34. Which of the following is the most
provide ? general phase structured grammar ?
1. Quality of service (A) Regular
2. Routing (B) Context-sensitive
3. Addressing
(C) Context free
4. Connection oriented delivery
5. Framing bits (D) None of the above
(A) 1, 2, 3 (B) 2, 3, 4
(C) 1, 3, 4, 5 (D) 2, 3, 4, 5 35. Which of the following is used for
grouping of characters into tokens
30. What is the maximum operating rate (in a computer) ?
of a wireless LAN using infrared
(A) A parser
communication ?
(A) 1 mbps (B) 2 mbps (B) Code optimizer
(C) 5 mbps (D) 11mbps (C) Code generator
(D) Scanner
31. In an absolute loading scheme,
which loader function is
accomplished by a loader ? 36. Match the following :
(A) Re-allocation (a) Disk 1. Round-robin
(B) Allocation scheduling
(C) Linking (b) Batch 2. SCAN
(D) Loading processing
32. Which of the following expression is (c) Time 3. LIFO
represented by the parse tree ? sharing
(d) Interrupt 4. FIFO
processing
Codes :
(a) (b) (c) (d)
(A) 3 4 2 1
(B) 4 3 2 1
(C) 2 4 1 3
(A) (A + B) * C (B) A + * BC
(C) A + B * C (D) A * C + B (D) 1 4 3 2
J-8710 7 Paper-II
Space For Rough Works
Paper-II 8 J-8710