Test your basic knowledge |

Data Structures

Subject : it-skills
Instructions:
  • Answer 50 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. A linked list in which each elements has both forward and backward pointers






2. A pointer to the next element in a linked list






3. To convert from a pointer to the data that is pointed to






4. A node of a tree that has children






5. A variable containing the address of other data






6. An order of processing a tree in which the parent node is processed in between its children






7. An item (or description of items) being sough in a search






8. A condition of the input data where the data will be handled by call(s) to the same program






9. storage that is no longer pointed to by any variable and therefore can no longer be accessed






10. A problem that is so hard that it cannot be solved unless the problem is small






11. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






12. First in first out: describes ordering of a queue






13. Describes a function that makes a new data structure but does not modify its arguments






14. Depth first search






15. The area of program text over which a variable can be referenced






16. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






17. In a tree - a node that points to a given node






18. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






19. A pattern that describes a set of similar programs






20. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






21. Composed of multiple sequential elements stored in contiguous bytes of memory






22. Composed of a collection of data values; implemented with a data structure






23. Values are in the most basic form and cannot be decomposed into smaller parts






24. In a tree search - to move back from the node currently being examined to its parent






25. A problem whose solution requires a linear amount of time or space if the problem is size n






26. All nodes below a give node in a tree






27. A contiguous block of memory containing elements of the same type - accessed by numeric index






28. Last in first out: describes the order of a stack






29. An elements of a linked list - tree - or graph - often represented by a data structure






30. To look through a data structure until a goal object is found






31. The amount of space on the runtime stack required for execution of a program






32. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






33. In a search tree - a program that changes a state into a child state e.g a move in a game






34. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






35. Use of a function or method without knowing how it's accomplished






36. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






37. A pointer to data






38. An order of processing a tree in which the parent node is processed after its children






39. A runtime error that occurs when an operation such as method call is attempted on a null pointer






40. Any container with linear ordering






41. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






42. In object oriented programming - a description of a set of similar objects






43. To hide similar items with the same name






44. Constructed of multiple components (simple or complex types)






45. A case where tow data structures share some elements






46. A description of operations on a data type that could have multiple possible implementations






47. Two variables that reference the same object






48. A case where a program calls itself






49. Describes a though experiment or view of an entity






50. The next element in a linked list