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

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
by

1 Answer

Answer :

D) The right subtree can be empty
by

Related questions

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

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

Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Description : Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Last Answer : A) Subset of X

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

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

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

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 left side and a single atomic proposition on right side. (D) A single atomic proposition on left side or an empty left side.

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.

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

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn

Description : If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn

Last Answer : (B) D1x D2x… xDn

A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Last Answer : (D) maximal, minimal 

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?

Description : Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state  which of the following state cannot be reached? 

Last Answer : Answer: C

Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Description : Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Last Answer : B) Address of variable

The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Description : The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Last Answer : A) Like Predicate

…………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Description : …………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Last Answer : A) Unique predicate

NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Description : NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Last Answer : (D) not a value

Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above

Description : Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above

Last Answer : B) SELECT NAME FROM EMPLOYEE;

Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal. (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.

Description : Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a ... negated goal G against a fact or rule A to get clause C then C has positive literal or null goal. 

Last Answer : (B) The resolvent of two Horn clauses is a Horn Clause.

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Last Answer : (B) 80 msec

Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Description : Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Last Answer : (B) SLR is powerful than LALR.

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

Skip zone is otherwise known as A. Empty zone B. Shadow zone C. Null zone D. Zone of silence

Description : Skip zone is otherwise known as A. Empty zone B. Shadow zone C. Null zone D. Zone of silence

Last Answer : D. Zone of silence

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)

In C a variable cannot contain A) Blank Spaces B) Decimal Point C) Hyphen

Description : In C a variable cannot contain A) Blank Spaces B) Decimal Point C) Hyphen

Last Answer : A) Blank Spaces

What can you say about the following statements? I. XML tags are case-insensitive. II. In JavaScript, identifier names are case-sensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All well-formed XML documents must contain a document type definition. (1) only I and II are false. (2) only III and IV are false. (3) only I and III are false. (4) only II and IV are false.

Description : What can you say about the following statements? I. XML tags are case-insensitive. II. In JavaScript, identifier names are case-sensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All well-formed ... IV are false. (3) only I and III are false. (4) only II and IV are false. 

Last Answer : Answer: Marks to all

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

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

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

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

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) 

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

How do I find a minimum subtree?

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.

Which field property specifies whether the field can be left empty when entering data into a record? -Technology

Description : Which field property specifies whether the field can be left empty when entering data into a record? -Technology

Last Answer : Required property.

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

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

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Description : Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Last Answer : A) push, pop

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

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 

Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Description : Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, ... in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Last Answer : (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.

A subset of a network that includes all the routers but contains no loops is called ________ a. spanning tree b. spider structure c. spider tree d. special tree

Description : A subset of a network that includes all the routers but contains no loops is called ________ a. spanning tree b. spider structure c. spider tree d. special tree

Last Answer : a. spanning tree

The subset of a network that includes all the routers but contains no loops is called ________A. spanning tree B. spider structure C. spider tree D. special tree

Description : The subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Last Answer : A. spanning tree

One subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Description : One subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Last Answer : A. spanning tree

In C++, the keyword void was used ……….. A) To specify the return type of function when it is not returning any value. B) To indicate an empty argument list to a function. C) To declare the generic pointers. D) All of the above.

Description : In C++, the keyword void was used ……….. A) To specify the return type of function when it is not returning any value. B) To indicate an empty argument list to a function. C) To declare the generic pointers. D) All of the above.

Last Answer : D) All of the above.

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2