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

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 
by

1 Answer

Answer :

(C) 926, 203, 912, 241, 913, 246, 364
by

Related questions

If the average of two numbers are 138& product is 2241. Then find the difference of both numbers? A) 225.40 B) 259.25 C) 267.81 D) 294.57

Description : If the average of two numbers are 138& product is 2241. Then find the difference of both numbers? A) 225.40 B) 259.25 C) 267.81 D) 294.57

Last Answer : B) let the two number be a & b sum of two numbers, a+b = 138*2 =276---1 product of two numbers, a*b=2241 (a+b)2 = a2 + 2ab + b2 ------2 (a-b)2 = a2 -2ab +b2 ------3 solving 2 & 3, 76176 - (a-b)2 = 4*2241 a-b = 259.25

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) 

How many Articles are there in the Indian Constitution? (1) 395 (2) 396 (3) 398 (4) 399

Description : How many Articles are there in the Indian Constitution? (1) 395 (2) 396 (3) 398 (4) 399

Last Answer : (1) 395 Explanation: It is the longest written constitution of any sovereign country in the world, containing 448 articles in 22 parts, 12 schedules and 100 amendments. Although the last article of ... For example, Article 21A pertaining to Right to Education was inserted by the 86th Amendment Act.

3. Suppose set \( A \) consists of first 250 natural numbers that are multiples of 3 and set \( B \) consists of first 200 even natural numbers. How many elements does \( A \cup B \) have?(a) 324(b) 364(c) 384(d) 400

Description : 3. Suppose set \( A \) consists of first 250 natural numbers that are multiples of 3 and set \( B \) consists of first 200 even natural numbers. How many elements does \( A \cup B \) have?(a) 324(b) 364(c) 384(d) 400

Last Answer : 3. Suppose set \( A \) consists of first 250 natural numbers that are multiples of 3 and set \( B \) consists ... ? (a) 324 (b) 364 (c) 384 (d) 400

Provision for the representation of Anglo - Indian Community in the Lok sabha has been made in the Constitution under the article - (1) 331 (2) 221 (3) 121 (4) 139

Description : Provision for the representation of Anglo - Indian Community in the Lok sabha has been made in the Constitution under the article - (1) 331 (2) 221 (3) 121 (4) 139

Last Answer : (1) 331 Explanation: Representation of the AngloIndian community in the Lok Sabha or Lower House of parliament is mentioned in the Article 331 of the Indian Constitution.

259 256 ? 244 235 224 a) 250 b) 251 c) 253 d) 249 e) None of these

Description : 259 256 ? 244 235 224 a) 250 b) 251 c) 253 d) 249 e) None of these

Last Answer : Difference of odd numbers 3, 5, 7, 9, 11. Answer: b)

Himanshi Ltd. purchase consideration is Rs.22,345 and Net Assets Rs.6,568, then........... (A) Goodwill Rs. 15,777 (B) Capital Reserve Rs. 15,777 (C) Goodwill Rs. 28,913 (D) Capital Reserve Rs. 28,913

Description : Himanshi Ltd. purchase consideration is Rs.22,345 and Net Assets Rs.6,568, then........... (A) Goodwill Rs. 15,777 (B) Capital Reserve Rs. 15,777 (C) Goodwill Rs. 28,913 (D) Capital Reserve Rs. 28,913

Last Answer : (A) Goodwill Rs. 15,777

Hitanshi Ltd.‘s purchase consideration is Rs.12,345 and Net Assets Rs.3,568, then........... (A) Goodwill Rs. 8,777 (B) Capital Reserve Rs. 8,777 (C)Goodwill Rs. 15,913 (D) Capital Reserve R

Description : Hitanshi Ltd.‘s purchase consideration is Rs.12,345 and Net Assets Rs.3,568, then........... (A) Goodwill Rs. 8,777 (B) Capital Reserve Rs. 8,777 (C)Goodwill Rs. 15,913 (D) Capital Reserve R

Last Answer : (A) Goodwill Rs. 8,777

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

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 

The State Election Commission conducts, controls and supervises Municipal elections under - (1) Article 240 (1) (2) Article 241 (2) (3) Article 243 (K) (4) Article 245 (4)

Description : The State Election Commission conducts, controls and supervises Municipal elections under - (1) Article 240 (1) (2) Article 241 (2) (3) Article 243 (K) (4) Article 245 (4)

Last Answer : (3) Article 243 (K) Explanation: According to Article 243 (K), the superintendence, rp direction and control of the preparation of electoral rolls for, and the conduct of, all elections ... in a State Election Commission consisting of a State Election Commissioner to be appointed by the Governor.

A rectangular park has a concrete footpath running in the middle of the park parallel to the length of the park. The rest of the park is used as a playing ground, which has an area of 253 sq. m. If the width of the path is 4m and the length of the park is greater than its breadth by 8 m. What is the area of the park? (in sq. m.) (a) 896 (b) 345 (c) 432

Description : A rectangular park has a concrete footpath running in the middle of the park parallel to the length of the park. The rest of the park is used as a playing ground, which has an area of 253 sq. m. If the width of the path ... m. What is the area of the park? (in sq. m.) (a) 896 (b) 345 (c) 432

Last Answer : (b) 345

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

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

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. 

A vertical spring-mass system has a mass of 0.5 kg and an initial deflection of 0.2 cm. Find the spring stiffness. A. 345 N/m B. 245 N/m C. 3452 N/mD. 2452 N/m

Description : A vertical spring-mass system has a mass of 0.5 kg and an initial deflection of 0.2 cm. Find the spring stiffness. A. 345 N/m B. 245 N/m C. 3452 N/mD. 2452 N/m

Last Answer : D. 2452 N/m

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

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

If `int (x^(2020)+x^(804)+x^(402))(2x^(1608)+5x^(402)+10)^(1//402)dx=(1)/(10a)(2x^(2010)+5x^(804)+10^(402))^(a//402)`. Then `(a-400)` is equal to ....

Description : If `int (x^(2020)+x^(804)+x^(402))(2x^(1608)+5x^(402)+10)^(1//402)dx=(1)/(10a)(2x^(2010)+5x^(804)+10^(402))^(a//402)`. Then `(a-400)` is equal to ....

Last Answer : If `int (x^(2020)+x^(804)+x^(402))(2x^(1608)+5x^(402)+10)^(1//402)dx=(1)/(10a)(2x^(2010)+5x^(804)+ ... )^(a//402)`. Then `(a-400)` is equal to .......

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

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

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)

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

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. a) True b) False

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

The BCD equivalent of decimal 912 is ________. 60) A) 1001 0001 0010BCD B) 1001 1000 0001BCD C) 0111 1111 1110BCD D) 0010 001 1001BCD

Description : The BCD equivalent of decimal 912 is ________. 60) A) 1001 0001 0010BCD B) 1001 1000 0001BCD C) 0111 1111 1110BCD D) 0010 001 1001BCD

Last Answer : A) 1001 0001 0010BCD

Choose the statement below which correctly compares the numbers 36,899 and 34,901.?

Description : Choose the statement below which correctly compares the numbers 36,899 and 34,901.?

Last Answer : I am trying to cheat in school test😇

A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate? (A) 100 Kbps (B) 200 Kbps (C) 400 kbps (D) 1000 Kbps

Description : A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate? (A) 100 Kbps (B) 200 Kbps (C) 400 kbps (D) 1000 Kbps

Last Answer : (C) 400 kbps

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

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

What is the difference between linear and binary search?

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

When does Binary search fail?

Description : When does Binary search fail?

Last Answer : A: When the array is not sorted.

In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

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

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

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

Find the cube roots of the following numbers by successive subtraction of numbers: 1, 7, 19, 37, 61, 91, 127, 169, 217, 271, 331, 397, 64 (ii) 512 (ii

Description : Find the cube roots of the following numbers by successive subtraction of numbers: 1, 7, 19, 37, 61, 91, 127, 169, 217, 271, 331, 397, 64 (ii) 512 (ii

Last Answer : Find the cube roots of the following numbers by successive subtraction of numbers: 1, 7, 19, 37, 61, 91, 127, ... 1728 A. 125 B. 343 C. 2197 D. n/a

57% of 400 + 23% of 700 + 32% of 1100 – 28% of 1300 = ? a) 401 b) 389 c) 377 d) 364 e) 352

Description : 57% of 400 + 23% of 700 + 32% of 1100 – 28% of 1300 = ? a) 401 b) 389 c) 377 d) 364 e) 352

Last Answer : ? = 57×4 + 23×7 + 32×11 - 28×13 = 228 + 161 + 352 – 364 = 377 Answer: c)

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

The average gestation period in buffalo is of how many days?a) 310 b) 210 c) 400 d) 345

Description : The average gestation period in buffalo is of how many days?a) 310 b) 210 c) 400 d) 345

Last Answer : a) 310

what is the average property tax on a house in tobyhanna, pa monroe county, coolbaugh township, pocono country place. The property is worth 30,899 and I just want to know what the yearly property tax would be for that property and that general area?

Description : what is the average property tax on a house in tobyhanna, pa monroe county, coolbaugh township, pocono country place. The property is worth 30,899 and I just want to know what the yearly property tax would be for that property and that general area?

Last Answer : Call the Tax Collector's Office at (570) 894-5952 for information about assessment.

The longest common subsequence of the sequences X=<A, B, C, B, D, A, B> and Y=<B, D, C, A, B, A> has length (A) 2 (B) 3 (C) 4 (D) 5

Description : The longest common subsequence of the sequences X= and Y= has length (A) 2 (B) 3 (C) 4 (D) 5

Last Answer : (C) 4

Given two sequences X and Y: X = <a, b, c, b, d, a, b> Y = <b, d, c, a, b, a> The longest common subsequence of X and Y is: (A) <b, c, a> (B) <c, a, b> (C) <b, c, a, a> (D) <b, c, b, a>

Description : Given two sequences X and Y: X = Y = The longest common subsequence of X and Y is: (A) (B) (C) (D)

Last Answer : Answer: D Explanation: A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. A sequence G is said to be a ... common subsequences to both X and Y. However, the longest common subsequence of X and Y is 

What does the following command do? grep −vn “abc” x (A) It will print all of the lines in the file x that match the search string “abc” (B) It will print all of the lines in file x that do not match the search string “abc” (C) It will print total number of lines in the file x that match the search string “abc” (D) It will print the specific line numbers of the file x in which there is a match for string “abc”

Description : What does the following command do? grep −vn abc x (A) It will print all of the lines in the file x that match the search string abc (B) It will print all of the lines in file x that do not ... (D) It will print the specific line numbers of the file x in which there is a match for string abc

Last Answer : (A) It will print all of the lines in the file x that match the search string “abc”

Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (A) Circular linked list (B) Doubly linked list (C) Linked list (D) Dequeue

Description : Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (A) Circular linked list (B) Doubly linked list (C) Linked list (D) Dequeue

Last Answer :  (B) Doubly linked list 

Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network? (A) Physical (B) Data-link (C) Transport (D) Application

Description : Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network? (A) Physical (B) Data-link (C) Transport (D) Application

Last Answer : (C) Transport 

A boy and his dad put a rope around a tree and stand side by side. What force by the boy can resist a force of 800 N by the dad? a.231 b.246 c.192 d.107 dynes e.166

Description : A boy and his dad put a rope around a tree and stand side by side. What force by the boy can resist a force of 800 N by the dad? a.231 b.246 c.192 d.107 dynes e.166

Last Answer : e. 166

Suppose d = {“john”:40, “peter”:45}. To obtain the number of entries in dictionary which command do we use? a) d.size() b) len(d) c) size(d) d) d.len()

Description : Suppose d = {“john”:40, “peter”:45}. To obtain the number of entries in dictionary which command do we use? a) d.size() b) len(d) c) size(d) d) d.len()

Last Answer : b) len(d)

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