Description : Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16
Last Answer : (D) 16
Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty
Last Answer : D) The right subtree can be empty
Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)
Last Answer : (2) O(log n)
Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search
Last Answer : A) Linear search
Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)
Last Answer : (D) (a), (b) , (c) and (d)
Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364
Last Answer : (C) 926, 203, 912, 241, 913, 246, 364
Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 )
Last Answer : (C) O(n)
Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D
Last Answer : Answer: 2
Description : What is the difference between linear and binary search?
Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i
Description : When does Binary search fail?
Last Answer : A: When the array is not sorted.
Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1
Last Answer : D) [log2n]+1
Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True
Last Answer : D) True, True
Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI
Last Answer : (B) HI
Description : State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False
Last Answer : C) True, True
Description : ………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C
Last Answer : B) Binary tree
Description : A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes
Last Answer : (C) 2n –1 nodes
Description : The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............ (A) dbefacg (B) debfagc (C) dbefcga (D) debfgca
Last Answer : (D) debfgca
Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2
Last Answer : (C) (n-1)/2
Description : The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN
Last Answer : (D) 2MN
Description : How do I find a minimum subtree?
Last Answer : This is why I don't do phylogenetics! :) But really, aren't all questions like this incredibly slow to answer? That's why it takes so much computer power to run trees. I'm a biologist, not a math person, so ... . I think it's supposed to take a long time - if you want to get the best tree, that is.
Description : I am looking for a shrub, for shade,max hight 4'
Last Answer : Need Answer
Description : if im 12 years old and my hight is 4'11 how much should i weigh?
Last Answer : 80 to 120i am 12 and 5'1 and i weigh 105 pounds and i do gymnastics and cheer.
Description : .total grain loss in a combine increase with a. increase in forward speed b. decrease in stubble Hight c. increase in concave clearance d. all of the above
Last Answer : .total grain loss in a combine increase with a. increase in forward speed b. decrease in stubble Hight c. increase in concave clearance d. all of the above
Description : Which one is a true statement regarding DNA polymerase used in PCR ? (1) It remains active at hight temperature (2) It is used to ligate introduced DNA in recipient cells (3) It serves as a selectable marker (4) It is isolated from a virus
Last Answer : (2) It is used to ligate introduced DNA in recipient cells
Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search
Last Answer : (C) Alpha-beta pruning procedure
Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search
Last Answer : (A) Breadth First Search
Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)
Last Answer : Answer: D
Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65
Last Answer : Answer: All
Description : Use Euclid’s Division Lemma to show that the cube of any positive integer is either of the form 9m, 9m + 1 or 9m + 8 -Maths 10th
Last Answer : Let us consider a and b where a be any positive number and b is equal to 3. According to Euclid's Division Lemma a = bq + r where r is greater than or equal to zero and less than b (0 ≤ r < b) a = 3q + r so ... 8 Where m = (3q3 + 6q2 + 4q)therefore a can be any of the form 9m or 9m + 1 or, 9m + 8.
Description : The smallest flowering plant is - (1) Wolffia (2) Lemma (3) Azolla (4) Ficus
Last Answer : (1) Wolffia Explanation: Wolffia is a genus of 9 to 11 species which include the smallest flowering plants on Earth. Commonly called watermeal or duckweed, these aquatic plants resemble specks of ... together in pairs or form floating mats with related plants, such as Lemna and Spirodela species.
Description : aquatic plant used by companies for assessing bioactivity a).Pistia stratiotes 12 b). Liverworts c). Nelumbo nucifera d). Lemma
Last Answer : d). Lemma
Description : The ________ provides fixed shape and rigidity to plant cell. a) cell wall b)cell membrane c)plasma lemma d)lysosome
Last Answer : a) cell wall
Description : The smallest flowering plant is : (1) Wolffia (2) Lemma (3) Azolla (4) Ficus
Last Answer : Wolffia
Description : By an external entity we mean a A) Unit outside the system being designed which can be controlled by an analyst. B) Unit outside the system whose behavior is independent of the system being designed C) A unit external to the system being designed D) A unit which is not part of a DFD
Last Answer : C) A unit external to the system being designed
Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above
Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.
Description : What is a relationship called when it is maintained between two entities? (A) Unary (B) Binary (C) Ternary (D) Quaternary
Last Answer : (B) Binary
Description : Which of the following statements is/are incorrect ? (a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation. (b) The right ... (A) (a) only (B) (a) and (b) (C) (c) only (D) (d) only
Last Answer : (D) (d) only
Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search
Last Answer : b) The entire tree so far been generated must be stored in BFS
Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs
Last Answer : d) Planning Graphs
Description : When the operators are having the same priority, they are evaluated from ................. ............. in the order they appear in the expression. A) right to left B) left to right C) any of the order D) depends on compiler
Last Answer : B) left to right
Description : Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic ... proposition on right side. (D) A single atomic proposition on left side or an empty left side.
Last Answer : (D) A single atomic proposition on left side or an empty left side.
Description : Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right. (A) Leftmost derivation (B) Leftmost derivation traced out in reverse (C) Rightmost derivation traced out in reverse (D) Rightmost derivation
Last Answer : (A) Leftmost derivation
Description : Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.
Last Answer : (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).
Description : Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36
Last Answer : (C) 14 / 36
Description : There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. We pick a card at random and observe only one side. What is the ... the same colour as the one side we observed? (A) 3/4 (B) 2/3 (C) 1/2 (D) 1/3
Last Answer : (B) 2/3
Description : The command javac A) Converts a java program into binary code B) Converts a java program into bytecode C) Converts a java program into machine language D) None of the above.
Last Answer : B) Converts a java program into bytecode
Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False
Last Answer : C) False, True
Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project
Last Answer : D) Project
Description : Binary code "0" means ............ A) State of absence B) State of presence C) State of Negative D) State of Positive
Last Answer : B) State of presence
Description : Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.
Last Answer : (B) a Binary operator.