McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
| 1. |
Which if the following is/are the levels of implementation of data structure |
| A. | abstract level |
| B. | application level |
| C. | implementation level |
| D. | all of the above |
| Answer» D. all of the above | |
| 2. |
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 |
| Answer» A. avl tree | |
| 3. |
Stack is also called as |
| A. | last in first out |
| B. | first in last out |
| C. | last in last out |
| D. | first in first out |
| Answer» A. last in first out | |
| 4. |
…………… is not the component of data structure. |
| A. | operations |
| B. | storage structures |
| C. | algorithms |
| D. | none of above |
| Answer» D. none of above | |
| 5. |
Which of the following is not the part of ADT description? |
| A. | data |
| B. | operations |
| C. | both of the above |
| D. | none of the above |
| Answer» D. none of the above | |
| 6. |
……………. Is a pile in which items are added at one end and removed from the other. |
| A. | stack |
| B. | queue |
| C. | list |
| D. | none of the above |
| Answer» B. queue | |
| 7. |
………… is very useful in situation when data have to stored and then retrieved in reverse order. |
| A. | stack |
| B. | queue |
| C. | list |
| D. | link list |
| Answer» A. stack | |
| 8. |
Which data structure allows deleting data elements from and inserting at rear? |
| A. | stacks |
| B. | queues |
| C. | dequeues |
| D. | binary search tree |
| Answer» B. queues | |
| 9. |
Which of the following data structure can’t store the non-homogeneous data elements? |
| A. | arrays |
| B. | records |
| C. | pointers |
| D. | stacks |
| Answer» A. arrays | |
| 10. |
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 |
| Answer» A. queue linked list | |
| 11. |
Which of the following is non-liner data structure? |
| A. | stacks |
| B. | list |
| C. | strings |
| D. | trees |
| Answer» D. trees | |
| 12. |
Herder node is used as sentinel in ….. |
| A. | graphs |
| B. | stacks |
| C. | binary tree |
| D. | queues |
| Answer» C. binary tree | |
| 13. |
Which data structure is used in breadth first search of a graph to hold nodes? |
| A. | stack |
| B. | queue |
| C. | tree |
| D. | array |
| Answer» B. queue | |
| 14. |
Identify the data structure which allows deletions at both ends of the list but insertion at only one end. |
| A. | input restricted dequeue |
| B. | output restricted qequeue |
| C. | priority queues |
| D. | stack |
| Answer» A. input restricted dequeue | |
| 15. |
Which of the following data structure is non linear type? |
| A. | strings |
| B. | lists |
| C. | stacks |
| D. | graph |
| Answer» D. graph | |
| 16. |
Which of the following data structure is linear type? |
| A. | graph |
| B. | trees |
| C. | binary tree |
| D. | stack |
| Answer» D. stack | |
| 17. |
To represent hierarchical relationship between elements, Which data structure is suitable? |
| A. | dequeue |
| B. | priority |
| C. | tree |
| D. | graph |
| Answer» C. tree | |
| 18. |
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. |
| A. | weakly connected |
| B. | strongly connected |
| C. | tightly connected |
| D. | linearly connected |
| Answer» B. strongly connected | |
| 19. |
In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex. |
| A. | depth first |
| B. | breadth first |
| C. | with first |
| D. | depth limited |
| Answer» A. depth first | |
| 20. |
The number of comparisons done by sequential search is ……………… |
| A. | (n/2)+1 |
| B. | (n+1)/2 |
| C. | (n-1)/2 |
| D. | (n+2)/2 |
| Answer» B. (n+1)/2 | |
| 21. |
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 |
| Answer» A. linear search | |
| 22. |
Which of the following is not the internal sort? |
| A. | insertion sort |
| B. | bubble sort |
| C. | merge sort |
| D. | heap sort |
| Answer» C. merge sort | |
| 23. |
A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. |
| A. | partite |
| B. | bipartite |
| C. | rooted |
| D. | bisects |
| Answer» B. bipartite | |
| 24. |
In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively. |
| A. | 0 and 1 |
| B. | 0 and -1 |
| C. | -1 and 0 |
| D. | 1 and 0 |
| Answer» B. 0 and -1 | |
| 25. |
In a circular queue the value of r will be .. |
| A. | r=r+1 |
| B. | r=(r+1)% [queue_size – 1] |
| C. | r=(r+1)% queue_size |
| D. | r=(r-1)% queue_size |
| Answer» C. r=(r+1)% queue_size | |
| 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 | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.