11111

31. Which of the following data structure is linear type? A. Strings B. Lists C. Queues D.All of above

All of above

45. A connected graph T without any cycles is called A.a tree graph B.free tree C. a tree D. All of above

All of above

69. Pushdown list means: A.Stack B.Queue C.Linked list D. All of the above

All of the above

70. Which of the following is the feature of stack? A.All operations are at one end B.It cannot reuse its memory C.All elements are of different data types D.Any element can be accessed from it directly

All operations are at one end

74. The size of a structure can be determined by a. size of variable name b. size of (struct tag) A.Only a B.Only b C.Both a and b D.None of these options

Both a and b

27. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return A. FAEKCDBHG B. FAEKCDHGB C.EAFKHDCBG D. FEAKDCHBG

FAEKCDHGB

Which graph representation is the best? Select one: A. It depends on the problem. B. Adjacency matrix C. Incidence matrix D. Adjacency list

It depends on the problem

In the worst case, quick sort is ______________. Select one: A. O(1) B. O ( n) C. O(nlogn) D. O(n^2)

O(n^2)

In the average-case, quicksort is __________. Select one: A. O(nlogn) B. O ( n) C. O(1) D. O(n^2)

O(nlogn)

Specify the reason for data compression (select the best answer): Select one: a. Increasing system performance b. Saving data storage c. Saving network band-width d. Just compress data for individual hobby

Saving data storage

State True or False: "Recursion bears substantial overhead. Each time the program calls a method, the system must assign space for all of the method's local variables and parameters. This can consume considerable memory and requires extra time to manage the additional space". Select one: True False

TRUE

52. A linked list index is ____ that represents the position of a node in a linked list. A. an Integer B. a variable C. a character D. a boolean

an Integer

24. Which of the following is two way list? A.grounded header list B.circular header list C. linked list with header and trailer nodes D.doubly linked list

doubly linked list

The operation for adding an entry to a queue is traditionally called: Select one: A.add B.insert C.append D.enqueue

enqueue

7. Each array declaration need not give, implicitly or explicitly, the information about A. the name of array B.the data type of array C. the first data from the set to be stored D. the index set of the array

the first data from the set to be stored

60. What happens when you push a new node onto a stack? A. the new node is placed at the front of the linked list. B. the new node is placed at the back of the linked list. C. the new node is placed at the middle of the linked list. D. No Changes happens

the new node is placed at the front of the linked list

67. How many parts are there in a declaration statement? A.1 B.2 C.3 D.4

3

What is the minimum number of nodes in a nearly complete binary tree with height 4? (In a tree the height of root is 1, and a binary tree with height h is called nearly complete if the tree is complete at level d for d = 1, 2, ..., h-1, and the leaves in the last level are all in the leftmost positions). Select one: A.8 B.6 C.7 D.9

8

26. A data structure where elements can be added or removed at either end but not in the middle A.Linked lists B.Stacks C.Queues D.Deque

Deque

34. The depth of a complete binary tree is given by A.Dn = n log2n B.Dn = n log2n+1 C. Dn = log2n D. Dn = log2n+1

Dn = log2n+1

71. The five items: A, B, C, D and E are pushed in a stack,one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is. A.A B.B C.C D.D

D

55. ______ form of access is used to add and remove nodes from a stack A. LIFO B. FIFO C. Both (a) and (b) D. None of these

LIFO

66. Each entry in a linked list is called a _______ A.Link B.Node C.data structure D.array index

Link

30. Which of the following data structure is non-linear type? A. Strings B. Lists C. Stacks D. None of above

None of above

50. Which of the following case does not exist in complexity theory A.Best case B.Worst case C.Average case D.Null case

Null case

48. The complexity of linear search algorithm is A.O(n) B.O(log n) C.O(n2) D. O(n log n)

O(n)

3. The operation of processing each element in the list is known as A.Sorting B. Merging C. Inserting D.Traversal

Traversal

32. To represent hierarchical relationship between elements, which data structure is suitable? A. Deque B.Priority C. Tree D.All of above

Tree

1. Which of the following data structure is non linear data structure? A.Arrays B. Linked lists C.Trees D.None of above

Trees

43. In a Heap tree A.Values in a node is greater than every value in left sub tree and smaller than right sub tree B.Values in a node is greater than every value in children of it C. Both of above conditions applies D. None of above conditions applies

Values in a node is greater than every value in children of it

63. What member function places a new node at the end of the linked list? A.appendNode() B.addNode() C.displayNode() D.structNode()

appendNode()

State True or False: "A balanced tree is one whose root has many more left descendents than right descendants, or vice versa." Select one: False True

false

64. The _______ function retrieves the value of the size member of the LinkedList class A.getSize() B.giveSize() C.seeSize() D.addSize()

getSize()

14. Two dimensional arrays are also called A. tables arrays B. matrix arrays C.both of above D. none of above

matrix arrays

73. To create a linked list, we can allocate space and make something point to it, by writing: struct-name *pointer-variable; Which of the following statement will correctly allocate the space A.pointer-variable = malloc(sizeof(*struct-name)); B.pointer-variable = malloc(sizeof(struct struct-name)); C.pointer-variable = alloc(sizeof(struct struct-name)); D.pointer-variable = alloc(sizeof(*struct-name));

pointer-variable = malloc(sizeof(struct struct-name));

57. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out. A. queue linked list B.stacks linked list C. both of them D. neither of them

queue linked list

62. A Linked list can grow and shrink in size dynamically at _______ A.Beginning B.run time C.Ending D.none of the above

run time

46. In a graph if e=(u, v) means A.u is adjacent to v but v is not adjacent to u B.e begins at u and ends at v C. u is processor and v is successor D. both b and c

both b and c

4. Finding the location of the element with a given value is: A. Traversal B. Search C. Sort D.None of above

Search

65. Elements of an array are stored _______ in memory A.Periodical B.Sequentially C.Parallelly D.None of the above

Sequentially

68. _________ is the way you groups things together by placing one thing on top of another and then removing things one at a time from the top A.Array B.Stack C.Pointer D.All of the above

Stack

Suppose you are using the LZW algorithm to encode the message AABABDACA contents of the dictionary at the beginning of encoding are: (1) A (2) B (3) C (4) D What are the first 4 code words in the output when encoding the above string? Select one: A) (1) (1) (2) (5) B. (1) (1) (2) (6) C. (1) (1) (2) (3) D. (1) (1) (2) (4)

(1) (1) (2) (6)

What is value of the Boundary Folding Hash Function if K = 34-56-89-3 and TSize = 100? Select one: A.34 B.89 C.91 D.56

91

Which of the following about queue is true: Select one: A. A queue is a FIFO structure. B. A queue is a structure in which both ends are used for adding new elements and removing them. C. A queue is a LIFO structure. D. None of the others.

A queue is a FIFO structure.

19. The difference between linear array and a record is A. An array is suitable for homogeneous data but hte data items in a record may have different data type B. In a record, there may not be a natural ordering in opposed to linear array. C. A record form a hierarchical structure but a lienear array does not D. All of above

All of above

2. Which of the following data structure is linear data structure? A.Trees B. Graphs C. Arrays D.none of the above

Arrays

42. The in order traversal of tree will yield a sorted listing of elements of tree in A.Binary trees B.Binary search trees C. Heaps D. None of above

Binary search trees

Select the correct statement. (Note: full binary tree = proper binary tree = 2-tree) Select one: A. No binary tree is both complete and full. B. Every full binary tree is also a complete binary tree. C. Every binary tree is either complete or full. D. Every complete binary tree is also a full binary tree.

Every complete binary tree is also a full binary tree

33. A binary tree whose every node has either zero or two children is called A. Complete binary tree B.Binary search tree C. Extended binary tree D. None of above

Extended binary tree

54. _______ form of access is used to add and remove nodes from a queue A. LIFO,Last In First Out B. FIFO , First In First Out C. Both (a) and (c) D. None of these

FIFO , First In First Out

State True or False: In circular linked-list, it is always required to define both head and tail nodes. Select one: True False

False

The efficiency of searching elements in a hash table is the same as in a linked list. Select one: False True

False

Select the statement that is most correct. Basically, the complexity of inserting new element before a given element in the middle of a singly linked lists is Select one: A. O(1) B. O ( n ) C. O(n^2) D. O(log n)

O ( n )

Suppose we are implementing a stack using a singly linked list where the head of the list is treated as the top of the stack. Specify the correct implementation of pop() method of the stack. (Choose the most suitable one) A. Select one: Object pop() { if(isEmpty()) return(null); Node p = head; head=head.next; if(head==tail) tail=null; return(p.info); } B. Object pop() { if(isEmpty()) return(null); Node p = head; head=head.next; return(p.info); } C. Object pop() { if(isEmpty()) return(null); Node p = head; head=head.next; if(head==null) tail=null; return(p.info); }

Object pop() { if(isEmpty()) return(null); Node p = head; head=head.next; if(head==null) tail=null; return(p.info); }

15. A variable P is called pointer if A. P contains the address of an element in DATA B P points to the address of first element in DATA C.P can store only memory addresses D. P contain the DATA and the address of DATA

P contains the address of an element in DATA

28. Which data structure allows deleting data elements from front and inserting at rear? A.Stacks B. Queues C. Deques D. Binary search tree

Queues

39. Which of the following sorting algorithm is of divide-and-conquer type? A. Bubble sort B. Insertion sort C. Quick sort D. All of above

Quick sort

17. Which of the following data structure store the non-homogeneous data elements? A.Arrays B. Records C.Pointers D.None

Records

40. An algorithm that calls itself directly or indirectly is known as A. Sub algorithm B. Recursion C. Polish notation D. Traversal algorithm

Recursion

Consider the following pseudocode: declare a queue of characters while(there are more characters in the word to read) {read a character if a character is '*' then dequeue the queue else enqueue the character into the queue } while(the queue is not empty) dequeue and write the dequeued character to the screen What is written to the screen for the input "HowAre**You**To**Day" ? . Select one: A.eYouToDa B.yaDoTuoY C.ouToDay D.YouToDay

YouToDay

51. Value of the first linked list index is _______ A.One B. Zero C. -1 D. None of these

Zero

18. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called A.elementary items B.atoms C. scalars D. all of above

all of above

44. In a graph if e=[u, v], Then u and v are called A.endpoints of e B.adjacent nodes C. neighbors D. all of above

all of above

56. New nodes are added to the _____ of the queue. A.front B.back C.middle D.Both 1 and 2

back

9. The memory address of the first element of an array is called A. floor address B.foundation address C. first address D. base address

base address

Fill in blank to form a correct statement: "A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more ____________". Select one: a.conditions b.base cases C.steps D.limit conditions

base cases

53. Why is the constructor of the LinkedList class empty? A. because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class. B. because initialization of data members of the LinkedList class is performed by the destructor of the LinkedList class. C. because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList class. D. because initialization of data members of the QueueLinkedList class is performed by the destructor of the LinkedList class

because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class

13. Which of the following is not a limitation of binary search algorithm? A. must use a sorted array B.requirement of sorted array is expensive when a lot of insertion and deletions are needed C.there must be a mechanism to access middle element directly D. binary search algorithm is not efficient when the data elements are more than 1000.

binary search algorithm is not efficient when the data elements are more than 1000

36. A binary tree can easily be converted into q 2-tree A. by replacing each empty sub tree by a new internal node B.by inserting an internal nodes for non-empty node C. by inserting an external nodes for non-empty node D. by replacing each empty sub tree by a new external node

by replacing each empty sub tree by a new external node

8. The elements of an array are stored successively in memory cells because A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated B. the architecture of computer memory does not allow arrays to store other than serially C. both of above D.none of above

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

The operation for removing and returning the element of the queue is traditionally called: Select one: A.delete B.peek C.dequeue D.remove

dequeue

Which of the following queue operations could result in queue underflow (become empty)? Select one: A.enqueue B.dequeue C.Two or more of the other choices D. isEmpty

dequeue

22. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called A. underflow B.overflow C.houseful D. saturated

overflow

20. Which of the following statement is false? A.Arrays are dense lists and static data structure B.data elements in linked list need not be stored in adjecent space in memory C. pointers store the next data element of a list D. linked lists are collection of the nodes that contain information part and next pointer

pointers store the next data element of a list

The operation for removing and returning the top element of the stack is traditionally called: Select one: A. pop B. peek C. delete D. remove

pop

Which of the following stack operations could result in stack underflow (become empty)? Select one: A.isEmpty B.Two or more of the other choices C.push D.pop

pop

The operation for adding an entry to a stack is traditionally called: Select one: A. add B. append C. insert D. push

push

21. Binary search algorithm can not be applied to A. sorted linked list B. sorted binary trees C.sorted linear array D. pointer array

sorted binary trees

25. The term "push" and "pop" is related to the A.array B. lists C. stacks D. all of above

stacks

35. When representing any algebraic expression E which uses only binary operations in a 2-tree, A.the variable in E will appear as external nodes and operations in internal nodes B. the operations in E will appear as external nodes and variables in internal nodes C. the variables and operations in E will appear only in internal nodes D. the variables and operations in E will appear only in external nodes

the variable in E will appear as external nodes and operations in internal nodes

41. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called A. Leaf B. branch C. path D. thread

thread

Linked lists allow easy insertion and deletion of information because such operations have a local impact on the list. Select one: True False

true

Skip list helps avoiding sequential search. Select one: True False

true

State True or False: In a singly-linked list every element contains some data and a link to the next element, which allows to keep the structure. Select one: False True

true

State True or False: In a singly-linked list, there is no efficient way to insert a node before the last node of the list, but we can insert a node after a given node or at the beginning of the list with time complexity O(1). Select one: False True

true

The advantage of arrays over linked lists is that they allow random accessing. Select one: True False

true

23. The situation when in a linked list START=NULL is A. underflow B. overflow C.housefull D. saturated

underflow

Run length encoding is a lossless compression method in which repeated occurrences of a symbol are replaced by one occurrence of the symbol followed by the number of occurrences Select one: a. True b. False

True

75. The reason for using pointer is ... Choose the false option from the following sentences A.Accessing arrays or string elements B.Dynamic memory allocation C.Implementing linked list,trees,graphs and many other data structures D.All are false

Accessing arrays or string elements

16. Which of the following data structure can't store the non-homogeneous data elements? A.Arrays B. Records C. Pointers D. None

Arrays

49. The complexity of merge sort algorithm is a. A. O(n) B.O(log n) C.O(n2) D.O(n log n)

O(n log n)

47. If every node u in G is adjacent to every other node v in G, A graph is said to be A. isolated B.complete C. finite D.strongly connected

complete

72. To delete a dynamically allocated array named `a`, the correct statement is A.delete a; B.delete a[0]; C.delete []a; D.delete [0]a;

delete a;

61. What happens when you push a new node onto a stack? A.the new node is placed at the front of the linked list. B.the new node is placed at the back of the linked list. C.the new node is placed at the middle of the linked list. D.No Changes

the new node is placed at the front of the linked list

Select the correct statement. Suppose T is a binary tree with 9 nodes. What is the minimum possible height of T? (Note: In a tree the height of root is 1) Select one: A. 3 B. 5 C. 2 D. 4

4

Given a raw message 'XXXXUUUUUXXXXUUXXXXXUU' (without single quote). Run the run-length encoding algorithm for that message, what is the output? Select one: a. 4X5U4X3U5X2U b. 4X5U4X2U5X2U c. 4X4U3X2U5X2U d. 4X5U3X2U5X2U

4X5U4X2U5X2U

What is the minimum number of nodes in a full binary tree with height 3? (In a tree the height of root is 1, and in a full binary tree every node other than the leaves has two children). Select one: A.6 B.5 C.4 D.7

5

Select the statement that is most correct. Select one: A. For a recursive method to terminate there must be one or more limit conditions. B. For a recursive method to terminate there must be one or more steps. C. A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more base cases. D. There is no difference between a recursive method and a non-recursive method.

A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more base cases

38. The post order traversal of a binary tree is DEBFC Find out the pre order traversal A.ABFCDE B. ADBFEC C. ABDECF D. ABDCEF

ABDECF

Specify the correct statement about bucket addressing method for handling collision (select the best answer). Select one: A. A bucket is a block of space which is large enough to store multiple items. All colliding items are stored on bucket instead of an array. B. Colliding elements in the same position in the hash table are placed on a bucket assosiated with that position. C. Bucket is a kind of list which holds items in the hash table. D. All of the statements are incorrect.

Colliding elements in the same position in the hash table are placed on a bucket assosiated with that position

Consider the following pseudocode: declare a queue of characters while(there are more characters in the word to read) {read a character if a character is '*' then dequeue and write the dequeued character to the screen else enqueue the character into the queue } What is written to the screen for the input "Goo**dAft***erno*on" ? Select one: A.GoodAE B.GoodAT C.GoodAf D.fAdooG

GoodAf

Specify the correct statement about chaining method for handling collision Select one: A. In chaining, each position of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys B. None of the other choices C. In chaining, some positions of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys D. In chaining, the linked-list is used instead of array for a hash table

In chaining, each position of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys

29. Identify the data structure which allows deletions at both ends of the list but insertion at only one en A. Input-restricted deque B.Output-restricted deque C. Priority queues D. None of above

Input-restricted deque

Specify the correct implementation of pop() method of a stack of Integers. This stack uses the object a of java.util.LinkedList class for storing data and the end of the list is treated as the top of the stack. (Choose the most suitable one) Select one: A . void pop(Integer x) { if (isEmpty()) return(null); a.remove(a.size()-1); } B. Integer pop() { if (isEmpty()) return(null); return((Integer) a.remove(a.size())); } C. Integer pop() { if (isEmpty()) return(null); return((Integer) a.removeLast(); } D. Integer pop() {if (isEmpty()) return; return((Integer) a.remove(a.size()-1)); }

Integer pop() { if (isEmpty()) return(null); return((Integer) a.removeLast(); }

Specify the disadvantage of hashing algorithm (select the best answer): Select one: A. It is hard to retrieve an item from the hash table. B. It is imposible to delete an item from a hash tables. C. In most cases the collision is unsolvable. D. It is difficult to expand hash tables because they are based on arrays. Correct

It is difficult to expand hash tables because they are based on arrays

Select the statement that is most correct. Basically, the complexity (worst-case) of search algorithm in singly linked lists is Select one: A. O(log n) B. O ( n ) C. O(1) D. O(n^2)

O ( n )

Specify the correct statement about a binary search tree(select the most suitable one). Select one: A..The main purpose of balancing a tree is to keep the tree in good shape. B..For better searching performance, a tree should be in back-bone shape. C..In a binary search tree, all the nodes that are left descendants of node A have key values greater than A; all the nodes that are A's right descendants have key values less than (or equal to) A. D..It is necessary to build a tree with optimized height to stimulate searching operation.

It is necessary to build a tree with optimized height to stimulate searching operation

10. The memory address of fifth element of an array can be calculated by the formula A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array D. None of above

LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

Select the statement that is most correct. Which of the following applications may not use a stack? Select one: A.Undo sequence in a text editor. B.Keeping track of local variables at run time. C.Evaluating arithmetic expressions. D.Multi-programming.

Multi-programming

Suppose we are considering a singly linked list and p is some node in the list which has predecessor node. Select the most correct java code snippet that inserts new node with value x before the node p. Select one: a. Node f = head; while(f.next != p) f = f.next; Node q = new Node(x); q.next = p; f.next = q; b. Node f = head; while(f.next != p) f = f.next; Node q = new Node(x); q.next = null; f.next = q; c. Node f = head; while(f.next != p) f = f.next; Node q = new Node(x); q.next = f; f.next = q; d. Node f = head; while(f != p) f = f.next; Node q = new Node(x); q.next = p; f.next = q;

Node f = head; while(f.next != p) f = f.next; Node q = new Node(x); q.next = p; f.next = q;

Suppose we are considering a doubly linked list and p is some node in the list which has successor node. Select the most correct java code snippet that inserts new node with value x after the node p. A. Node p1, p2; p1 = new Node(x); p2 = p.next; p.next = p1; p1.prev = p; p1.next = p2; p2.prev = p1; B. Node p1, p2; p1 = new Node(x); p.next = p1; p1.prev = p; p2 = p.next; p1.next = p2; p2.prev = p1; C. Node p1, p2; p1 = new Node(x); p.next = p1; p1.prev = p; p1.next = p2; p2.prev = p1; p2 = p.next;

Node p1, p2; p1 = new Node(x); p2 = p.next; p.next = p1; p1.prev = p; p1.next = p2; p2.prev = p1;

Suppose we are considering a singly linked list and p is some node in the list which has successor node. Select the most correct java code snippet that inserts new node with value x after the node p. Select one: A. Node q = new Node(x); q.next = p.next; p.next = q; B. p.next = new Node(x); p=p.next; C. Node q = new Node(x); q.next = null; p.next = q; D. Node q = new Node(x); p.next = q; q.next = p.next;

Node q = new Node(x); q.next = p.next; p.next = q;

Select the statement that is most correct. Select one: A.Tail recursion is a special case of recursion in which the first operation of the function, is a recursive call. B.Tail recursion is a special case of recursion in which the last operation of the function, the tail call, is a recursive call.

Tail recursion is a special case of recursion in which the last operation of the function, the tail call, is a recursive call

Specify the correct statement about open addressing method for handling collision Select one: A. An address is opened for storing keys B. The collision is resolved by finding an available table entry other than the position to which the colliding key is originally hashed C. The collision is resolved by open an address to store any collision D. Each position of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys

The collision is resolved by finding an available table entry other than the position to which the colliding key is originally hashed

12. Which of the following is not the required condition for binary search algorithm? A.The list must be sorted B.there should be the direct access to the middle element in any sublist C. There must be mechanism to delete and/or insert elements in list D. none of above

There must be mechanism to delete and/or insert elements in list

In Huffman coding, both the sender and receiver must have a copy of the same code in order for the decoded file to match the encoded file. Select one: a. Tr ueb. False

True

Select the statement that is most correct. Which of the following applications may not use a queue? Select one: A.Store a waiting list of printing jobs. B.Auxiliary data structure for algorithms. C.Multi-programming. D.Undo sequence in a text editor.

Undo sequence in a text editor

Consider the following pseudocode: declare a stack of characters while(there are more characters in the word to read) {read a character if a character is '*' then pop and write the poped character to the screen else push the character into the stack } What is written to the screen for the input "Good**Mor*ni***ng" ? Select one: A..dorioM B..dorino C..dorinG D..dorinM

dorino

5. Arrays are best data structures A. for relatively permanent collections of data B.for the size of the structure and the data in the structure are constantly changing C. for both of above situation D. for none of above situation

for relatively permanent collections of data

6. Linked lists are best suited A. for relatively permanent collections of data B.for the size of the structure and the data in the structure are constantly changing C. for both of above situation D. for none of above situation

for the size of the structure and the data in the structure are constantly changing

Consider the following pseudocode: declare a stack of characters while(there are more characters in the word to read) {read a character if a character is '*' then pop the stack else push the character into the stack } while(the stack is not empty) pop and write the poped character to the screen What is written to the screen for the input "Good**Mor*ni***ng" ? Select one: A.gnoMo B.gnMoG C.gnMoo D.GoMng

gnMoG

37. When converting binary tree into extended binary tree, all the original nodes in binary tree are A. internal nodes on extended tree B. external nodes on extended tree C. vanished on extended tree D. None of above

internal nodes on extended tree

59. The pop() member function determines if the stack is empty by calling the _____ member function A. removeback() B.isEmpty() C.removedfront() D.hasNext()

isEmpty()

11. Which of the following data structures are indexed structures? A. linear arrays B. linked lists C.both of above D. none of above

linear arrays