Home

Computer

Facts

Abbreviations

Tricks

Shortcut Keys

Tutorials

Websites

Software

Hardware

sc_online_i(549898,"ffffff","a3004f");

Tumblr Online Counter

Computer

Facts

Abbreviations

Tricks

Shortcut Keys

Tutorials

Websites

Software

Hardware

1. The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

A.

B.

C.

D.

2. The searching technique in which there are no unnecessary comparisons is called

A.

B.

C.

D.

3. Which of the following sorting procedures is the slowest?

A.

B.

C.

D.

4. If every node u in G is adjacent to every other node v in G, A graph is said to be

A.

B.

C.

D.

5. In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which of the following order?

A.

B.

C.

D.

6. In a Heap tree

A.

and Smaller than Right Sub Tree

B.

C.

D.

7. If any undirected graph ,the sum of degrees of all the nodes

A.

B.

C.

D.

8. A Graph in which all nodes are of equal degree is called

A.

B.

C.

D.

9. What is the postfix form of the following prefix *+ab–cd

A.

B.

C.

D.

10. The most common Hash functions use the__________to compute hash address.

A.

B.

C.

D.

11. The Data Structure required for Breadth First Traversal on a Graph is

A.

B.

C.

D.

12. The balance factor for an AVL tree is either

A.

B.

C.

D.

13. The Time Factor when determining the efficiency of algorithm is measured by

A.

B.

C.

D.

14. The Inorder traversal of the tree will yield a sorted listing of elements of tree in

A.

B.

C.

D.

15. Sparse matrices have

A.

B.

C.

D.

16. Which of the following algorithms solves the All Pair Shortest Path problem?

A.

B.

C.

D.

17. A Sorting technique that guarantees,that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

A.

B.

C.

D.

18. Hashing Collision Resolution Techniques are

A.

B.

C.

D.

19. Given a binary tree whose inorder and preorder traversal are given by

Inorder : EICFBGDJHK

Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is

A.

B.

C.

D.

20. Consider a Linked List of n elements. What is the time taken to insert an element after an element pointed by some pointer?

A.

B.

C.

D.