×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
What does the above function do in general?
2.
Which one of the following is an application of Queue Data Structure?
3.
How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.
4.
How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.
5.
A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.
6.
Which of the following is a true about Binary Trees
7.
If arity of operators is fixed, then which of the following notations can be used to parse expressions without parentheses? a) Infix Notation (Inorder traversal of a expression tree) b) Postfix Notation (Postorder traversal of a expression tree) c) Prefix Notation (Preorder traversal of a expression tree)
8.
What are the main applications of tree data structure? 1) Manipulate hierarchical data 2) Make information easy to search (see tree traversal). 3) Manipulate sorted lists of data 4) Router algorithms 5) Form of a multi-stage decision-making, like Chess Game. 6) As a workflow for compositing digital images for visual effects
9.
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is
In the following answers, the operator '^' indicates power.
10.
In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is: