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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






2. The top node of a tree - from which all other nodes can be reached






3. All nodes below a give node in a tree






4. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






6. A sequence of records - where each record contains a link to the next one






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






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






9. Describes a though experiment or view of an entity






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






11. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






13. Describes a data structure or device in which all accesses have the same cost - O(1)






14. A tree node containing a contents value but with no children






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






16. Any container with linear ordering






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






18. Depth first search






19. A pointer to data






20. A collection of objects that are inserted and removed according to the LIFO principle






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






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






23. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






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






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






26. A collection of values






27. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






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






29. Given two sets - the intersection is the set of elements that are members of both sets






30. The number of links between the root of a tree and the leaves






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






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






33. A search in which children of a node are considered before siblings are considered






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






35. Container for storing a collection of data in unique key/value pairs






36. A variable containing the address of other data






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






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






39. A case where tow data structures share some elements






40. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






41. Two variables that reference the same object






42. A node of a tree that has children






43. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






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






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






46. A section of the runtime stack holding the values of all variables for one invocation






47. Describes a function that modifies its arguments






48. A case where a program calls itself






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






50. Separation of the properties of a data type from its implementation