A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes

A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes

by

1 Answer

Answer :

(C) 2n –1 nodes 
by

Related questions

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

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

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 )

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) 

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, 259, 363, 364 (B) 3, 400, 388, 220, 267, 383, 382, 279, 364 (C) 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364

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

The number of different binary trees with 6 nodes is ............. (A) 6 (B) 42 (C) 132 (D) 256

Description : The number of different binary trees with 6 nodes is ............. (A) 6 (B) 42 (C) 132 (D) 256

Last Answer : (C) 132

Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2

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

In a fully connected mesh network with n devices, there are ................ physical channels to link all devices. (A) n(n–1)/2 (B) n(n+1)/2 (C) 2n (D) 2n+1

Description : In a fully connected mesh network with n devices, there are ................ physical channels to link all devices. (A) n(n–1)/2 (B) n(n+1)/2 (C) 2n (D) 2n+1

Last Answer : (A) n(n–1)/2

................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n-2 (B) n + floor(lg n) - 2 (C) floor(3n/2) - 2 (D) 2 lg n – 2

Description : ................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n-2 (B) n + floor(lg n) - 2 (C) floor(3n/2) - 2 (D) 2 lg n – 2

Last Answer : (C) floor(3n/2) - 2

A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is

Description : 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

Last Answer : A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is n-1

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

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) P – 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

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.

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

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

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

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

A framed structure is perfect if it contains members equal to a.n - 3 b.2n - 3 c.2n - 2 d.n - 2 e.2n - 1

Description : A framed structure is perfect if it contains members equal to a.n - 3 b.2n - 3 c.2n - 2 d.n - 2 e.2n - 1

Last Answer : b. 2n - 3

A bag contains 2n + 1 coins. It is known that n of these coins have a head on both sides, whereas the remaining (n + 1) coins are fair. -Maths 9th

Description : A bag contains 2n + 1 coins. It is known that n of these coins have a head on both sides, whereas the remaining (n + 1) coins are fair. -Maths 9th

Last Answer : (a) 10As (n + 1) coins are fair P (Tossing a tail) = \(rac{rac{n+1}{2}}{2n+1}\) = \(rac{n+1}{2(2n+1)}\)∴ P (Tossing a head) = 1 - \(rac{n+1}{2(2n+1)}\) = \(rac{4n+2-n-1}{2(2n+1)}\) = \(rac{3n+1}{4n+2}\)Given, \(rac{3n+1}{4n+2}\) = \(rac{31}{42}\)⇒ 126n + 42 = 124n + 62 ⇒ 2n = 20 ⇒ n = 10.

A framed structure is perfect if it contains members equal to (A) 2n 3 (B) nl (C) 2nl (D) 3n² Where n = number of joints in a frame

Description : A framed structure is perfect if it contains members equal to (A) 2n 3 (B) nl (C) 2nl (D) 3n² Where n = number of joints in a frame

Last Answer : (A) 2n 3

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

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

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

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

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

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

………………. 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

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

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

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

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Description : A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above

Last Answer : A) AVL tree

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

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

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 binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

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)

Consider the following binary search tree: Image 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

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

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) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

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

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Last Answer : A) vertices, edges

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

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

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

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

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Description : Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Last Answer : (B) 5, 4

In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C) store list of file names plus pointers associated with i-nodes (D) store information entered by a user application program or utility program

Description : In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C ... pointers associated with i-nodes (D) store information entered by a user application program or utility program

Last Answer : (B) provide a mechanism to map physical device to file names 

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Description : The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Last Answer : (A) P + 1 

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Description : Binary symmetric channel uses (A) Half duplex protocol (B) Full duplex protocol (C) Bit oriented protocol (D) None of the above

Last Answer : (A) Half duplex protocol

If input frequency of a full wave rectifier be n, then output frequency would be - (1) n/2 (2) n (3) 3n/2 (4) 2n

Description : If input frequency of a full wave rectifier be n, then output frequency would be - (1) n/2 (2) n (3) 3n/2 (4) 2n

Last Answer : (4) 2n Explanation: The frequency of a full-wave rectifier is double that of the input, if the input is a sine wave. A full-wave rectifier converts the whole of the input waveform to one ... both polarities of the input waveform to DC (direct current), and yields a higher mean output voltage.

A leaf spring consists of 3 extra full length leaves and 14 graduated length leaves. The maximum force that can act on the spring is 70kN and the distance between eyes of the spring is 1.2m. Width and thickness of the leaves are 100mm and 12mm respectively. Calculate the initial pre load required to close the nip. (a) 4332.2N (b) 4674.1N (c) 4985.4N (d) Can’t be determined

Description : A leaf spring consists of 3 extra full length leaves and 14 graduated length leaves. The maximum force that can act on the spring is 70kN and the distance between eyes of the spring is 1.2m. Width and thickness of the ... close the nip. (a) 4332.2N (b) 4674.1N (c) 4985.4N (d) Can't be determined

Last Answer : (b) 4674.1N

Find the value of x, if log2 (5.2^x + 1), log4(2^(1–x) + 1) and 1 are in A.P. -Maths 9th

Description : Find the value of x, if log2 (5.2^x + 1), log4(2^(1–x) + 1) and 1 are in A.P. -Maths 9th

Last Answer : (b) 1 - log25 Given, log2 (5.2x + 1), log4 (21- x + 1), 1 are in A.P. ⇒ log2 (5.2x + 1) + 1 = 2 log4 (21 - x + 1) ⇒ log2 (5.2x + 1) + log22 = 2 log22 (21-x + 1)⇒ log2 (5.2x + 1).2 = 2 x \(rac12\) ... a=-rac{1}{2}\big)\)⇒ log 2x = log \(rac{2}{5}\)⇒ x log2 2 = log2 2 - log2 5 ⇒ \(x\) = 1 - log2 5.

The number log2 7 is : -Maths 9th

Description : The number log2 7 is : -Maths 9th

Last Answer : (c) an irrational numberLet us assume log27 be a rational number. Then, log27 = \(rac{p}{q}\), where p,q ∈ I and q ≠ 0 ⇒ \(2^{rac{p}{q}}\) = 7 ⇒ 2p = 7q This is not true as 2 is even and 7 is odd.∴ Hence our assumption that log27 is a rational number is wrong. ∴ log27 is an irrational number.

If log2 [log7(x^2 – x + 37)] = 1, then what could be the value of x ? -Maths 9th

Description : If log2 [log7(x^2 – x + 37)] = 1, then what could be the value of x ? -Maths 9th

Last Answer : (c) 4log2 [log7(x2 – x + 37)] = 1 ⇒ log7(x2 – x + 37) = 21 = 2 ⇒ x2 – x + 37 = 72 = 49 ⇒ x2 – x – 12 = 0 Now solve for x.

The number of meaningful solutions of log4(x – 1) = log2 (x – 3) is -Maths 9th

Description : The number of meaningful solutions of log4(x – 1) = log2 (x – 3) is -Maths 9th

Last Answer : (b) 1log4(x - 1) = log2(x - 3) ⇒ log22 (x − 1) = log2(x - 3)⇒ \(rac{1}{2}\) log2 (x-1) = log2 (x- 3) ⇒ log2 (x-1) = 2 log2 (x- 3)\(\big[\)Using logam (bn) = \(rac{n}{m} ... x = 2 or 5 Neglecting x = 2 as log2(x - 3) is defined when x > 2.⇒ There is only one meaningful solution of the given equation.

The number of solution of log4 (x – 1) = log2 (x – 3) is : -Maths 9th

Description : The number of solution of log4 (x – 1) = log2 (x – 3) is : -Maths 9th

Last Answer : answer:

Solve for x : log10 [log2 (log39)] = x -Maths 9th

Description : Solve for x : log10 [log2 (log39)] = x -Maths 9th

Last Answer : answer:

log2 (x + 1) = How do I get x from Equation 5?

Description : How to calculate the logarithmic equation below? log2 (x + 1) = 5

Last Answer : We take the fifth power of 2, it's 32, it's x + 1, so x = 31

If Log2 x - 5 Log x + 6 = 0, then what would the value(s) of x be?

Description : If Log2 x - 5 Log x + 6 = 0, then what would the value(s) of x be?

Last Answer : Answer: x = e2 or e3.

If m is a power of 2, the number of select lines required for an m-input mux is: a. m b. 2^m c. log2 (m) d. 2*m

Description : If m is a power of 2, the number of select lines required for an m-input mux is: a. m b. 2^m c. log2 (m) d. 2*m

Last Answer : c. log2 (m)

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

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

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)

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

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

Description : A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

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)

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)