Q. The time complexity for solving the traveling salesman problem via brute-force search takes

View solution

Q. The time complexity for finding an item in a sorted array using binary search is

View solution

Q. The time complexity of determining a number is odd or even is

View solution

Q. The worst case of the job sequencing with deadline is

View solution

Q. The postfix expression for the infix expression (A+B*(C+D))/ (F+D*E) is

View solution

Q. In Linked list data is stored in

View solution

Q. ......................is called self referential structure.

View solution

Q. The time complexity for evaluating a postfix expression is

View solution

Q. Dequeue is called

View solution

Q. Consider the following complete binary tree and find out the height of the tree

View solution

Q. In a tree construction which one will suitable and efficient data structure?

View solution

Q. Which of following is not true about spanning tree?

View solution

Q. B–tree of order M is a tree having which of the following structural property?

View solution

Q. In a max heap both the addition and deletion operations can be performed in time

View solution

Q. Binary tree can be represented as

View solution

Q. Pre-order of A*(B+C) /D-G is

View solution

Q. Which of the following will have efficient space and time complexities?

View solution

Q. The worst case height of AVL tree with n nodes is

View solution

Q. The worst case complexity for searching an element in a binary search tree is

View solution

Q. The following sequence are inserted into a binary search tree:
6 10 25 12 4 7 15 8 33
What is the type of traversal given by: 6 4 10 7 25 8 12 33 15

View solution