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 power set of the set { φ} is a. {φ} b. { φ, { φ}} c. {0} d. {0,  φ, { φ}}

 2. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be a. 32 b. 64 c. 128 d. 160

 3. In which tree, for every node the height of its left subtree and right subtree differ almost by one ? a. Binary search tree b. AVL tree c. Threaded Binary Tree d. Complete Binary Tree

 4. Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ? a. 122 & 22 b. 111 & 11 c. 133 & 33 d. 144 & 44

 5. The maximum number of keys stored in a B-tree of order m and depth d is a. m^d + 1 - 1 b. m^d+1 - 1/(m - 1) c. (m - 1) (m^d + 1 - 1) d. m^d-1

 6. Which of the following is the most powerful parring method ? a. LL(I) b. Canonical LR c. SLR d. LALR

 7. The graph K3,4 has a. 3 edges b. 4 edges c. 7 edges d. 12 edges