Data Structures

This test consists of computer programming related questions based on data structures concept.

20 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

Stack is an example of

  1. static data structure
  2. complex data structure
  3. global data structure
  4. built-in data structure
  5. both (1) and (2)
Question 2 Multiple Choice (Single Answer)

Which of the following is called stack underflow operation?

  1. This is an attempt to delete an element from the already empty stack.
  2. This is an attempt to remove an element from the top of the stack.
  3. This is an attempt to insert an element to the top of the stack.
  4. This is an attempt to delete an element from the already full stack.
  5. None of the above
Question 3 Multiple Choice (Single Answer)

Which of the following sorting techniques is based on divide and conquer method?

  1. Merge sort
  2. Quick sort
  3. Shell sort
  4. Insertion sort
  5. None of the above
Question 4 Multiple Choice (Single Answer)

Which of the following is not a stack operation?

  1. Push
  2. Pop
  3. Peek
  4. Size
  5. None of the above
Question 5 Multiple Choice (Single Answer)

Which of the following operations of stack needs parameter in its method?

  1. Push
  2. Pop
  3. isEmpty
  4. Peek
  5. None of the above
Question 6 Multiple Choice (Single Answer)

Which of the following is/are unstable sort(s)?

  1. Insertion sort
  2. Quick sort
  3. Heap sort
  4. All of the above
  5. Only (2) and (3)
Question 7 Multiple Choice (Single Answer)

Which of the following is/are the implementation(s) of the queue data structure?

  1. List
  2. Singly linked list
  3. Array
  4. All of the above
  5. None of the above
Question 8 Multiple Choice (Single Answer)

Which of the following is/are the true statement(s)?

  1. Queue implementation is used in software development.
  2. In multitasking environment, the queue technique is used.
  3. Queues are used in printers.
  4. All of the above
  5. Only (2) and (3)
Question 9 Multiple Choice (Single Answer)

Which of the following is not an application of queue data structure?

  1. CPU scheduling
  2. Disk scheduling
  3. File IO
  4. Backtracking
  5. None of the above
Question 10 Multiple Choice (Single Answer)

File system on a computer is an example of which of the following data structures?

  1. Stack
  2. Tree
  3. Queue
  4. Array
  5. None of the above
Question 11 Multiple Choice (Single Answer)

Routing algorithm is an example of which of the following data structures?

  1. Stack
  2. Queue
  3. Tree
  4. Array
  5. None of the above
Question 12 Multiple Choice (Single Answer)

Graph data structure is used in which of the following?

  1. Network communication
  2. Flow of computation
  3. Data organisation
  4. All of the above
  5. Only (1) and (2)
Question 13 Multiple Choice (Single Answer)

Which of the following is/are the uses of a tree data structure?

  1. To manipulate hierarchical data
  2. To make information easy to search
  3. To manipulate sorted lists of data
  4. All of the above
  5. Only (1) and (2)
Question 14 Multiple Choice (Single Answer)

Which of the following is/are built-in data structures?

  1. Stack
  2. Queue
  3. Array
  4. All of the above
  5. Only (1) and (3)
Question 15 Multiple Choice (Single Answer)

Breadth-first search is an example of which of the following data structures?

  1. Stack
  2. Queue
  3. Array
  4. Linked list
  5. None of the above
Question 16 Multiple Choice (Single Answer)

Which of the following is/are the application(s) of an array data structure?

  1. Database implementation
  2. Dynamic memory allocation
  3. Implementing stack and queue
  4. To implement hash tables
  5. All of the above
Question 17 Multiple Choice (Single Answer)

Which of the following is/are the applications of a linked list data structure?

  1. To represent polynomials
  2. Linked list is used in dynamic memory management and in allocation and releasing memory at runtime
  3. Representing sparse matrix
  4. All of the above
  5. Only (1) and (3)
Question 18 Multiple Choice (Single Answer)

Decimal to binary conversion can be implemented using which of the following data structures?

  1. Stack
  2. Queue
  3. Array
  4. Both (1) and (3)
  5. None of the above
Question 19 Multiple Choice (Single Answer)

Which of the following statements is/are true about the double-ended queue?

  1. Double-ended queue is an abstract data type.
  2. In double-ended queue, elements can be added to or removed from either the front or back end.
  3. Double-ended queue is also called deque.
  4. All of the above
  5. Only (1) and (3) are true.
Question 20 Multiple Choice (Single Answer)

Dijkstra's algorithm is an example of which of the following data structures?

  1. Queue
  2. Stack
  3. Priority queue
  4. Array
  5. None of these