Q. In bubble sort, the first step is swapping two of the element in the code array is to

View solution

Q. An adjacency matrix representation of graph cannot contain information of

View solution

Q. Stacks can be used to

View solution

Q. Queue can be useful to implement

View solution

Q. Which of the following technique is used in the quick sort algorithm?

View solution

Q. A 3- array tree in which every internal node has exactly 3 children, the number leaf nodes such a tree with 6 internal nodes will be

View solution

Q. Which data structure may give overflow error, even though the current number of elements in it is less than its size?

View solution

Q. Number of possible ordered trees with 3 nodes x, y, z is

View solution

Q. The best sorting methods if number of swapping done, is the only measure of efficiency is

View solution

Q. The sorting method which sorts a set of elements that is already in order or in reverse order with equal speed is

View solution

Q. The expression which access the (ij)th entry of a m x n matrix stored in column major form is

View solution

Q. Number of possible trees with 3 nodes is

View solution

Q. Binary expression tree is traversed in ...........traversal.

View solution

Q. The value for which we are searching is called the

View solution

Q. A ................. search begins the search with the element that is located in the middle of the array.

View solution

Q. Recursion in merge sort performs

View solution

Q. The address field of linked list

View solution

Q. A circular list can be used to represent

View solution

Q. A list node representing an arc of a graph requires how many fields?

View solution

Q. Traversing a binary tree first root and then left and right sub trees is called...............traversal.

View solution