A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

1. The worst case time complexity of AVL tree is better in comparison to binary search tree for
a. Search and Insert Operations
b. Search and Delete Operations
c. Insert and Delete Operations
d. Search, Insert and Delete Operations
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Search, Insert and Delete Operations

2. Which of the following are two special functions that are meant for handling exception, that occur during exception handling itself ?
a. Void terminate ( ) and Void unexpected ( )
b. Non void terminate ( ) and void unexpected ( )
c. Void terminate ( ) and non void unexpected ( )
d. Non void terminate ( ) and non void unexpected ( )
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Void terminate ( ) and Void unexpected ( )

3. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack ?
a. 4
b. 3
c. 2
d. 1
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).1

4. The total number of spanning trees that can be drawn using five labelled vertices is:
a. 125
b. 64
c. 36
d. 16
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).125

5. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
a. O (n log logn)
b. θ(n logn)
c. Ω(n logn)
d. Ω(n3/2)
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).O (n log logn)

6. The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system 
a. Class Model, Object Model and Analysis Model
b. Object Model, Dynamic Model, and Functional Model
c. Class Model, Dynamic Model and Functional Model
d. Object Model, Analysis Model and Dynamic Model
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Object Model, Dynamic Model, and Functional Model

7. An example of a dictionary-based coding technique is 
a. Run-length coding
b. Huffman coding
c. Predictive coding
d. LZW coding
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).LZW coding

8. A algorithm is guaranteed to find an optimal solution if 
a. h' is always 0
b. g is always 1
c. h' never overestimates h
d. h' never underestimates h
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).h' never overestimates h

9. What is the value of the postfix expression ?
abc d + - * (where a = 8 , b = 4 , c = 2 and d = 5)
a. -3/8
b. -8/3
c. 24
d. -24
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).-24

10. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue?
a. Neither of the pointers change
b. Only front pointer changes
c. Only rear pointer changes
d. Both of the pointers changes
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Only rear pointer changes

Page 1 of 24