1. A statement that can be either true or false, depending on the truth values of its propositional variables is called:

(a) Contradiction
(b) Tautology
(c) Absurdity
(d) Contingency

Answer: (d)

2. Which one of the following algorithms is designed by Ford and Fulkerson?

(a) The labeling algorithm
(b) The matching algorithm
(c) The line drawing algorithm
(d) The edge detection algorithm

Answer: (a)

3. In Object-Oriented Programming using C++, static variable is also known as:

(a) Object variable
(b) Class variable
(c) Stored variable
(d) Global variable

Answer: (b)

4. Which one of the following types of class is not used to create objects?

(a) Anonymous class
(b) Nested class
(c) Base class
(d) Abstract class

Answer: (d)

5. The XML DOM object is

(a) Entity
(b) Entity Reference
(c) Comment Reference
(d) Comment Data

Answer: (b)

6. Which one of the following characteristics is satisfied by websites without the attached database?

(a) The ability to generate data via SQL
(b) The inability to use a browser to display WebPages
(c) Static information using HTML or JavaScript
(d) The need to use TCP/IP as the network protocol

Answer: (c)

7. A model which is used to understand the design of a data structure to indicate an implementation-independent view of the data structure is:

(a) Linear data type
(b) Non- linear data type
(c) Abstract data type
(d) Primitive data type

Answer: (c)

8. Which one of the following search algorithms cannot be applied to a sorted linked list?

(a) Sequential search algorithm
(b) Iterative search algorithm
(c) Recursive search algorithm
(d) Binary search algorithm

Answer: (d)

9. In a queue an element can be added arbitrarily and from which only either the smallest or largest element can be removed, the type of the queue is:

(a) Circular queue
(b) Priority queue
(c) Deques
(d) Ordinary queue

Answer: (b)

10. Postfix notation is also known as:

(a) Reverse polish notation
(b) Polish notation
(c) Infix notation
(d) Reverse notation

Answer: (a)