Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list. A) i-only B) ii-only C) Both i and ii D) None of both

Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked  list.
A) i-only
B) ii-only
C) Both i and ii
D) None of both
by

1 Answer

Answer :

C) Both i and ii
by

Related questions

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. 

Linked Lists -- Can you tell me how to check whether a linked list is circular?

Description : Linked Lists -- Can you tell me how to check whether a linked list is circular?

Last Answer : Create two pointers, and set both to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next ... before pointer1, or the item before that. Either way, its either 1 or 2 jumps until they meet.

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 

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Description : The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Last Answer : B) Linked Lists

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)

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

The following conditions of policy must be present for a deadlock to be possible. i) Mutual exclusion ii) Hold and wait iii) No preemption iv) Circular wait A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv

Description : The following conditions of policy must be present for a deadlock to be possible. i) Mutual exclusion ii) Hold and wait iii) No preemption iv) Circular wait A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv

Last Answer : D) All i, ii, iii and iv

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

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

What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Description : What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type

Last Answer : b) List of tuples

Which of the following statements are true with reference to the way of describing XML data ? (a) XML uses DTD to describe the data (b) XML uses XSL to describe the data (c) XML uses a description node to describe the data Codes : (A) (a) only (B) (b) only (C) (a) and (b) (D) (a) and (c)

Description : Which of the following statements are true with reference to the way of describing XML data ? (a) XML uses DTD to describe the data (b) XML uses XSL to describe the data (c) XML uses a description node to describe the data Codes : (A) (a) only (B) (b) only (C) (a) and (b) (D) (a) and (c)

Last Answer : Answer: D

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block 

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.

What is the name of the network topology in which there are bi-directional links between each possible node? A) Ring B) Star C) Tree D) Mesh

Description : What is the name of the network topology in which there are bi-directional links between each possible node? A) Ring B) Star C) Tree D) Mesh

Last Answer : D) Mesh

Which of the syntax is correct for insert statement? i) insert into <table_name> values <list of values> ii) insert into <table_name> (column list) values <list of values> A) i-only B) ii-only C) Both of them D) None of them

Description : Which of the syntax is correct for insert statement? i) insert into values ii) insert into (column list) values A) i-only B) ii-only C) Both of them D) None of them

Last Answer : C) Both of them

Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence (C) Conceptual model is not accurate representation of "Universe of interest". (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".

State whether the following statement is true. i) A macro virus is platform independent. ii) Macro viruses infect documents, not executable portions of code. A) i-only B) ii-only C) Both i and ii D) Non i and ii

Description : State whether the following statement is true. i) A macro virus is platform independent. ii) Macro viruses infect documents, not executable portions of code. A) i-only B) ii-only C) Both i and ii D) Non i and ii

Last Answer : D) Non i and ii

Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Description : Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Last Answer : A) i only

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class to be inherited by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Description : Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class ... by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Last Answer : Both l and II

Which of the following statement(s) regarding a linker software is/are true? I. A function of a linker is to combine several object modules into a single load module. II. A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Description : Which of the following statement(s) regarding a linker software is/are true? I. A function of a linker is to combine several object modules into a single load module. II. A function of a linker is to replace absolute ... modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 1

Pick out the wrong statement. (A) Linear polymers are formed from bifunctional groups only and are normally thermoplastic (B) Cross-linked branched chain polymers are either elastometric or thermosetting (C) Branching in case of cross-linked polymers caused by small amount of impurities in bifunctional monomer formulation reduces its solubility and increases the softening point (D) Dibasic acids reacts with dihydric alcohols to give polyesters using addition polymerisation reaction

Description : Pick out the wrong statement. (A) Linear polymers are formed from bifunctional groups only and are normally thermoplastic (B) Cross-linked branched chain polymers are either elastometric or ... (D) Dibasic acids reacts with dihydric alcohols to give polyesters using addition polymerisation reaction

Last Answer : D) Dibasic acids reacts with dihydric alcohols to give polyesters using addition polymerisation reaction

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

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

Which of the following operations can be performed by using FTP. i) Connect to a remote host ii) Select directory iii) Define the transfer mode iv) List file available A) i, and ii only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii and iv

Description : Which of the following operations can be performed by using FTP. i) Connect to a remote host ii) Select directory iii) Define the transfer mode iv) List file available A) i, and ii only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : C) ii, iii and iv only

Tell how to check whether a linked list is circular.

Description : Tell how to check whether a linked list is circular.

Last Answer : Create two pointers, each set to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) { print (\"circular\n\"); }

Match List (Forms of power Sharing) with List II (forms of government) and select the correct answer using the codes given below in the lists: -SST 10th

Description : Match List (Forms of power Sharing) with List II (forms of government) and select the correct answer using the codes given below in the lists: -SST 10th

Last Answer : The correct option is (C) The following table shows the correct matches: List I List II 1. Power shared among different organs of government B. Separation of power 2. Power ... social groups A. Community Government 4. Power shared by two or more political parties C. Coalition government

Match List I with List II and select the correct answer using the code given below the lists `:` `{:("List-1",,,"List"-II),((a)"Argentite",,,"(1)Halid

Description : Match List I with List II and select the correct answer using the code given below the lists `:` `{:("List-1",,,"List"-II),((a)"Argentite",,,"(1)Halid

Last Answer : Match List I with List II and select the correct answer using the code given below the lists `:` `{:("List-1",,,"List" ... . `{:(a,b,c,d),(3,4,1,2):}`

Match List I with List II and select the correct answer by using the codes gives below the lists: List-I (Climatic conditions) List-II (Resons) A. Chennai is warmer than Kolkata 1. North-East Monsoon B. Snowfall in Himalayas 2. Altitude C. Rainfall decreases from West Bengal to Punjab 3. Western depressions D. Sutlej-Ganga Plain gets some rain in winter 4. Distance from sea 5. Latitude Codes: A B C D (a) 1 2 4 5 (b) 4 5 1 3 (c) 5 2 4 3 (d) 5 1 3 4

Description : Match List I with List II and select the correct answer by using the codes gives below the lists: List-I (Climatic conditions) List-II (Resons) A. Chennai is warmer than Kolkata 1. North-East Monsoon B. Snowfall in Himalayas 2. Altitude C. ... (a) 1 2 4 5 (b) 4 5 1 3 (c) 5 2 4 3 (d) 5 1 3 4

Last Answer : Ans: (c)

Match List -I (Bearings) with List-II (Applications) and select the using the codes given below the lists: [IAS-1998] List –I List-II A. Journal bearing 1. Electric motors B. Thrust bearing 2. Watches C. Conical pivot bearing 3. Marine engines D. Ball bearing 4. Swivelling chairs A B C D A B C D (a) 3 4 1 2 (b) 4 2 1 3 (c) 3 4 2 1 (d) 4 2 3 1

Description : Match List -I (Bearings) with List-II (Applications) and select the using the codes given below the lists: [IAS-1998] List -I List-II A. Journal bearing 1. Electric motors B. Thrust bearing 2. Watches C. Conical pivot bearing 3. Marine ... D (a) 3 4 1 2 (b) 4 2 1 3 (c) 3 4 2 1 (d) 4 2 3 1

Last Answer : (c) 3 4 2 1

Match List-I (Type of Anti-friction bearing) with List-II (Specific Use) and select the using the code given below the Lists: [IES-2006] List-I List -II A. Self-aligning ball bearing 1. For pure axial load B. Taper roller bearing 2. For hinged condition C. Deep groove ball bearing 3. For pure radial load D. Thrust ball bearing 4. For axial and radial load A B C D A B C D (a) 2 1 3 4 (b) 3 4 2 1 (c) 2 4 3 1 (d) 3 1 2 4

Description : Match List-I (Type of Anti-friction bearing) with List-II (Specific Use) and select the using the code given below the Lists: [IES-2006] List-I List -II A. Self-aligning ball bearing 1. For pure axial load B. Taper roller bearing 2. For ... C D (a) 2 1 3 4 (b) 3 4 2 1 (c) 2 4 3 1 (d) 3 1 2 4

Last Answer : (c) 2 4 3 1

Match List- I and List –II and select the correct answer using code given below lists List-I a) Facts as effect of fact in issue 1) Section9 b) Facts forming part of same transaction 2) Section 8 c) Fact which constitute preparation for any fact in issue 3) Section 7 d) facts necessary to explain or introduce relevant facts 4) Section 6 Code (a) (b) (c) (d) A) 1 2 3 4 B) 4 3 2 1 C) 3 4 2 1 D) 2 3 1 4

Description : Match List- I and List -II and select the correct answer using code given below lists List-I  a) Facts as effect of fact in issue 1) Section9 b) Facts forming part of same transaction 2) Section 8 c) Fact which constitute preparation for any ... d) A) 1 2 3 4 B) 4 3 2 1 C) 3 4 2 1 D) 2 3 1 4

Last Answer : c) Fact which constitute preparation for any fact in issue

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curves lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points. (A) I, II and IV only (B) II and III only (C) I and II only (D) I, II and III only

Description : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only

Last Answer : (D) I, II and III only

State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i- ... -false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : C) i-false, ii-true, iii-false, iv-false

State which statement is true for Suspended process? i) The process is not immediately available for execution. ii) The process may be removed from suspended state automatically without removal order. A) i only B) ii only C) i and ii only D) None

Description : State which statement is true for Suspended process? i) The process is not immediately available for execution. ii) The process may be removed from suspended state automatically without removal order. A) i only B) ii only C) i and ii only D) None

Last Answer : A) i only

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Last Answer : B) True, False

Before continuing the client relationship, the auditor should perform the following except: a. Communicate with the predecessor auditor. b. Evaluate client in case of change of client’s businesc. Evaluate client’s integrity. d. Evaluate financial condition of the cliens

Description : Before continuing the client relationship, the auditor should perform the following except: a. Communicate with the predecessor auditor. b. Evaluate client in case of change of client’s business c. Evaluate client’s integrity. d. Evaluate financial condition of the clien

Last Answer : Communicate with the predecessor auditor

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

A CPA is conducting the first audit of a client’s financial statements. The CPA hopes to reduce the audit work by consulting with the predecessor auditor and reviewing the predecessor's working papers. This procedure is a. Acceptable if the CPA refers in the audit report to reliance upon the predecessor auditor's work. b. Required if the CPA is to render an unqualified opinion. c. Unacceptable because the CPA should bring an independent viewpoint to a new engagement. d. Acceptable if the client and the predecessor auditor agree to it.

Description : A CPA is conducting the first audit of a client's financial statements. The CPA hopes to reduce the audit work by consulting with the predecessor auditor and reviewing the predecessor's working papers. ... to a new engagement. d. Acceptable if the client and the predecessor auditor agree to it.

Last Answer : Acceptable if the client and the predecessor auditor agree to it.

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

Any node is the path from the root to the node is called A) Successor node B) Ancestor node C) Internal node D) None of the above

Description : Any node is the path from the root to the node is called A) Successor node B) Ancestor node C) Internal node D) None of the above

Last Answer : B) Ancestor node

Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Last Answer : B) End to end delivery

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)

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)

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

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 

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