Data Structure interview questions – page 24

893 questions. Tap “Show answer” to check yourself.

Advertisement
  1. _________ 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

  2. Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.

  3. How many parts are there in a declaration statement?

  4. What kind of value is assigned to the top attribute?

  5. The LinkedList constructor is a member function that is called when an instance of the LinkedList is removed

  6. What are the various kinds of sorting techniques? Which is has best case?

  7. The symbol * is also called as _________________

  8. What is significance of ? * ? ?

  9. Why would you use a structure?

  10. Popping removes an item from the stack

  11. Identify the error in the following example of the use of a displayNodesReverse() member function void displayNodesReverse(){ cout << "Nodes in reverse order:"; NODE* temp = back; while(temp != NULL) { cout << " " << temp->data; temp = temp->Next; }}

  12. The size of a structure is determines by the Product of sizes of all primitive data types within the structure

  13. Advertisement
  14. What is the quickest sorting method to use?

  15. What is Heap data structure?

  16. Definitions of member functions for the LinkedList class are contained in

  17. Run Time Memory Allocation is known as ?

  18. Link list does not have any advantage when compared to an Array

  19. Is Pointer a variable?

  20. Priority queue organizes items in a line where the first item is at the beginning of the line and the last item is at the back of the line.

  21. Which file contains the definition of member functions?

  22. What method removes the value from the top of a stack?

  23. The _______ process places data at the back of the queue

  24. Data in a queue is accessible

  25. Linked list C++ application is organized into three files.They are _____, ______ and _____

  26. Advertisement
  27. The destructor is responsible for allocating all the memory that was allocated for the linked list.

  28. The dequeue process removes data from the front of the queue

  29. Why is the isEmpty() member method called?

  30. What does isEmpty() member method determines?

  31. What does each entry in the Link List called?

  32. What is linear and non-linear datastructures

Advertisement