A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
A) log2n B) n-1 C) n D) 2n
A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is n-1
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 : 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 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 : State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False
Last Answer : C) False, True
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 number of distinct simple graphs with upto three nodes is A) 15 B) 10 C) 7 D) 9
Last Answer : 8
Description : The number of different binary trees with 6 nodes is ............. (A) 6 (B) 42 (C) 132 (D) 256
Last Answer : (C) 132
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 : State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True, True B) True, False C) False, True D) False, False
Last Answer : B) True, False
Description : There are n rotors mounted on the shaft and when subjected to torsional vibration there will be A. N nodes B. (N-1) nodes C. (N+1) nodesD. Any number of nodes
Last Answer : B. (N-1) nodes
Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.
Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.
Description : If the number of branches in a network is 'B', the number of nodes is 'N' and the number of dependent loops is 'L', then the number of independent node equations will be (a) N+L–1 (b) B–1 (c) B–N (d) N–1
Last Answer : N+l-
Description : The number of independent loops for a network with n nodes and b branches is
Last Answer : The number of independent loops for a network with n nodes and b branches is b-n+1
Description : The following are true about lymphocytes: a. T cells account for 20% of the circulating lymphocytes b. in the spleen, B cells are found in the periarteriolar areas of white pulp c. in the ... paracortical area surrounding the germinal centres. d. B cells but not T cells express surface Ig G
Last Answer : in the lymph nodes, T cells occupy the paracortical area surrounding the germinal centres
Description : An HIV patient with swollen lymph nodes and CD4 T cell count of would be in stage of HIV disease/AIDS. a. 1,000; stage II b. 700; stage I c. 400; stage III d. 400; stage IV
Last Answer : a. 1,000; stage II
Description : Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2
Last Answer : C. 2n-1
Description : With n nodes and b branches a network will have (A) (b+n) links (B) b - n +1 links (C) b -n-1 links (D) b + n + 1 links
Last Answer : With n nodes and b branches a network will have b - n +1 links
Description : In an n-bus power system, considering n-nodes network, the size of ybus is (a) (n – 1) × (n – 1) (b) (n + 1) × (n + 1) (c) n × n (d) 2n × 2n
Last Answer : c
Description : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned
Last Answer : d) All of the mentioned
Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned
Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network
Last Answer : c) Transition Network
Description : A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned
Description : A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree
Last Answer : A) Directed tree
Description : A heuristic is a way of trying (A) To discover something or an idea embedded in a program (B) To search and measure how far a node in a search tree seems to be from a goal (C) To compare two nodes in a search tree to see if one is better than the other (D) Only (a), (b) and (c).
Last Answer : (D) Only (a), (b) and (c).
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 : For a binary mixture distillation process, the degree of freedom is 2. However, if the pressure is fixed in this process, the number of independent variables in this process will be (A) 1 (B) 0 (C) 2 (D) 3
Last Answer : (A) 1
Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)
Last Answer : (D) O(th)
Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1
Last Answer : (C) t-1, 2t-1
Description : If the number of conditions in a decision table is n, the maximum number of rules (columns) possible is A) n B) 2n C) 2n D) log2n
Last Answer : If the number of conditions in a decision table is n, the maximum number of rules (columns) possible is 2n
Description : A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11
Last Answer : (D) 11
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 : The diffusivity (D) in a binary gas mixture is related to the temperature (T) as (A) D ∝ T (B) D ∝ T 0.5 (C) D ∝ T 1.5 (D) D ∝ T
Last Answer : (C) D ∝ T 1.5
Description : One mole feed of a binary mixture of a given composition is flash vaporised at a fixed P and T. If Raoult's law is obeyed, then changing the feed composition would effect (A) ... The fraction vaporised but not the product composition (D) Neither the product composition nor the fraction vaporised
Last Answer : (C) The fraction vaporised but not the product composition
Description : In case of liquids, the binary diffusivity is proportional to (where, T = temperature) (A) T (B) √T (C) T 2 (D) 1/T
Last Answer : (A) T
Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2
Last Answer : b. t
Description : The partial molar enthalpy of a component in an ideal binary gas mixture of composition Z, at a temperature T and pressure P, is a function only of (A) T (B) T and P (C) T, P and Z (D) T and Z
Last Answer : (B) T and P
Description : The molar excess Gibbs free energy, gE, for a binary liquid mixture at T and P is given by, (gE/RT) = A . x1. x2, where A is a constant. The corresponding equation for ln y1, where y1is the activity co-efficient of component 1, is (A) A . x22 (B) Ax1 (C) Ax2 (D) Ax12
Last Answer : (A) A . x22
Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2
Last Answer : (2) t
Description : Which weedicide is used to kill broad leaf weeds in wheat ? (A) 2, 4 - D.S.S. (WPSS) (B) 2, 4, 5 - T (C) 2, 4 - DB (D) None of these
Last Answer : (A) 2, 4 - D.S.S. (WPSS)
Description : IN which set do all elements tend to form anions in binary ionic compounds Question 3 options N S I Ca B K K Ga Pb Fe Hg Na?
Last Answer : Need answer
Description : A coherent binary phase shift keyed BPSK transmitter operates at a bit rate of 20 Mbps with a carrier to noise ratio C/N of 8.8dB. Find Eb/No. A. 73 dB B. 62.4 dB C. 81.8 dB D. 8.8 dB
Last Answer : D. 8.8 dB
Description : Which of the following binary systems is an example of a maximum boiling azeotrope? (A) Water-hydrochloric acid (B) Acetone-carbon disulphide (C) Water-ethyl alcohol (D) n-heptane-n-octane
Last Answer : (A) Water-hydrochloric acid
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 : Excess of N in citrus plant may cause a. Leaf drop b. Lodging c. Flower drop d. Fruit drop
Last Answer : Flower drop
Description : Yellow leaf of citrus is due to def of ? a Mo b Zn c Mn d N
Last Answer : a Mo
Description : n Pinus/gymnosperms, the haploid structure are (a) megaspore, endosperm and embryo (b) megaspore, pollen grain and endosperm (c) megaspore, integument and root (d) pollen grain, leaf and root.
Last Answer : (b) megaspore, pollen grain and endosperm
Description : Overlap in a leaf spring is (a) L/n (b) L/2n (c) L/3n (d) None
Last Answer : (b) L/2n
Description : The data representation of CSG objects is represented by a.a binary tree b.a boolean operation c.a primitive d.none of the above
Last Answer : a.a binary tree
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