1. Home
  2. Back Today Date :- Sunday 22nd of June 2025 11:46:07 AM

Data structure - Online Exam Test Papers | Data structure - MCQs[multiple choice questions and answers ] | Data structure - Mock Test Papers | Data structure - Practice Papers | Data structure - Sample Test Papers |

Question:
Which is/are the application(s) of stack

1.function calls

2.large number arithmetic

3. evaluation of arithmetic expressions

4.All of the above

Posted Date:-2022-07-05 10:42:48

More MCQS Questions and answers

  1. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
  2. A …………………… does not keep track of address of every element in the list.
  3. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
  4. 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.
  5. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
  6. Any node is the path from the root to the node is called
  7. Arrays are best data structures …………
  8. Each array declaration need not give, implicitly or explicitly, the information about
  9. fThe disadvantage in using a circular linked list is …………………….
  10. Herder node is used as sentinel in …..
  11. In a priority queue, insertion and deletion takes place at ………………
  12. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
  13. In ……………, search start at the beginning of the list and check every element in the list.
  14. In doubly linked lists
  15. In doubly linked lists, traversal can be performed?
  16. In general, the binary search method needs no more than ……………. comparisons.
  17. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
  18. Linear arrays are also called ……………….
  19. The simplest type of data structure is ………………
  20. The time complexity of quick sort is …………..
  21. What is a dequeue?
  22. Which data structure allows deleting data elements from front and inserting at rear?
  23. Which of the following data structure is linear type?
  24. 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.
  25. A ……….. is a graph that has weights of costs associated with its edges.
  26. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
  27. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… D. none of the above
  28. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
  29. A circular linked list can be used for
  30. A data structure where elements can be added or removed at either end but not in the middle is called …
  31. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
  32. A list which displays the relationship of adjacency between elements is said to be
  33. Arrays are best data structures …………
  34. …… is not the operation that can be performed on queue.
  35. …… is not the operation that can be performed on queue.
  36. ……. Is a directed tree in which outdegree of each node is less than or equal to two.
  37. ……. Is a pile in which items are added at one end and removed from the other.
  38. ……… is not the operation that can be performed on queue.
  39. ……….. level is where the model becomes compatible executable code
  40. …………… is not the component of data structure.
  41. Each node in a linked list has two pairs of ………….. and ……………….
  42. Finding the location of the element with a given value is:
  43. How do you count the number of elements in the circular linked list?
  44. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
  45. In a circular queue the value of r will be ..
  46. 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.
  47. node.next -> node.next.next; will make
  48. Stack is also called as
  49. Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
  50. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
  51. The data structure which is one ended is ………………
  52. The disadvantage in using a circular linked list is …………………….
  53. The logical or mathematical model of a particular organization of data is called a ………
  54. The number of comparisons done by sequential search is ………………
  55. The property of binary tree is
  56. The term "push" and "pop" is related to the
  57. There is an extra element at the head of the list called a ……….
  58. To represent hierarchical relationship between elements, Which data structure is suitable?
  59. What differentiates a circular linked list from a normal linked list?
  60. What will be the value of top, if there is a size of stack STACK_SIZE is 5
  61. When does top value of the stack changes?
  62. Which data structure allows deleting data elements from and inserting at rear?
  63. Which data structure is used in breadth first search of a graph to hold nodes?
  64. Which data structure is used in breadth first search of a graph to hold nodes?
  65. Which if the following is/are the levels of implementation of data structure
  66. Which is/are the application(s) of stack
  67. Which of the following data structure is linear type?
  68. Which of the following data structure is non linear type?
  69. Which of the following data structure is non-linear type?
  70. Which of the following data structures are indexed structures?
  71. Which of the following is an application of stack?
  72. Which of the following is non-liner data structure?
  73. Which of the following is not the internal sort?
  74. Which of the following is not the part of ADT description?
  75. 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.
Search