| 26. |
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 |
| Answer» B. linked lists | |
| 27. |
What will be the value of top, if there is a size of stack STACK_SIZE is 5 |
| A. | 5 |
| B. | 6 |
| C. | 4 |
| D. | none |
| Answer» C. 4 | |
| 28. |
………… is not the operation that can be performed on queue. |
| A. | insertion |
| B. | deletion |
| C. | retrieval |
| D. | traversal |
| Answer» D. traversal | |
| 29. |
There is an extra element at the head of the list called a ………. |
| A. | antinel |
| B. | sentinel |
| C. | list header |
| D. | list head |
| Answer» B. sentinel | |
| 30. |
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 |
| Answer» A. vertices, edges | |
| 31. |
A ……….. is a graph that has weights of costs associated with its edges. |
| A. | network |
| B. | weighted graph |
| C. | both a and b |
| D. | none a and b |
| Answer» C. both a and b | |
| 32. |
In general, the binary search method needs no more than ……………. comparisons. |
| A. | [log2n]-1 |
| B. | [logn]+1 |
| C. | [log2n] |
| D. | [log2n]+1 |
| Answer» D. [log2n]+1 | |
| 33. |
Which of the following is not the type of queue? |
| A. | ordinary queue |
| B. | single ended queue |
| C. | circular queue |
| D. | priority queue |
| Answer» B. single ended queue | |
| 34. |
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 |
| Answer» D. the right subtree can be empty | |
| 35. |
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 |
| Answer» B. ancestor node | |
| 36. |
Which is/are the application(s) of stack |
| A. | function calls |
| B. | large number arithmetic |
| C. | evaluation of arithmetic expressions |
| D. | all of the above |
| Answer» D. all of the above | |
| 37. |
A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. |
| A. | directed tree |
| B. | undirected tree |
| C. | dis-joint tree |
| D. | direction oriented tree |
| Answer» A. directed tree | |
| 38. |
…………………. Is a directed tree in which outdegree of each node is less than or equal to two. |
| A. | unary tree |
| B. | binary tree |
| C. | trinary tree |
| D. | both b and c |
| Answer» B. binary tree | |
| 39. |
Which of the following data structure is non-linear type? |
| A. | strings |
| B. | lists |
| C. | stacks |
| D. | tree |
| Answer» D. tree | |
| 40. |
Which of the following data structure is linear type? |
| A. | array |
| B. | tree |
| C. | graphs |
| D. | hierarchy |
| Answer» A. array | |
| 41. |
The logical or mathematical model of a particular organization of data is called a ……… |
| A. | data structure |
| B. | data arrangement |
| C. | data configuration |
| D. | data formation |
| Answer» A. data structure | |
| 42. |
The simplest type of data structure is ……………… |
| A. | multidimensional array |
| B. | linear array |
| C. | two dimensional array |
| D. | three dimensional array |
| Answer» B. linear array | |
| 43. |
Linear arrays are also called ………………. |
| A. | straight line array |
| B. | one-dimensional array |
| C. | vertical array |
| D. | horizontal array |
| Answer» B. one-dimensional array | |
| 44. |
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 the above |
| Answer» A. for relatively permanent collections of data | |
| 45. |
Which of the following data structures are indexed structures? |
| A. | linear arrays |
| B. | linked lists |
| C. | graphs |
| D. | trees |
| Answer» A. linear arrays | |
| 46. |
Each node in a linked list has two pairs of ………….. and ………………. |
| A. | link field and information field |
| B. | link field and avail field |
| C. | avail field and information field |
| D. | address field and link field |
| Answer» A. link field and information field | |
| 47. |
A …………………… does not keep track of address of every element in the list. |
| A. | stack |
| B. | string |
| C. | linear array |
| D. | queue |
| Answer» C. linear array | |
| 48. |
When does top value of the stack changes? |
| A. | before deletion |
| B. | while checking underflow |
| C. | at the time of deletion |
| D. | after deletion |
| Answer» D. after deletion | |
| 49. |
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 the above |
| Answer» A. for relatively permanent collections of data. | |
| 50. |
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 |
| Answer» A. for relatively permanent collections of data | |
We want to make our service better for you. Please take a moment to fill out our survey.
Take Survey