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. The process of collecting garbage for recycling






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






3. A description of the state of a process such as a board game






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






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






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






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






8. A stack containing a stack frame of variable value for each active invocation of procedure






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






10. Two variables that reference the same object






11. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






14. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






17. A collection of values






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






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






20. A linked list in which the last element points back to the first element






21. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






22. 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






23. A case where tow data structures share some elements






24. First-child/next-sibling






25. A linked list in which each elements has both forward and backward pointers






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






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






28. A node of a tree that has children






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






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






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






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






33. Describes a though experiment or view of an entity






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






35. A process that removes unwanted elements from a collection






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






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






38. A given collection of values along with a collection of operations for use on those values






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






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






41. All nodes below a give node in a tree






42. To combine two ordered linear structures into one






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






44. 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






45. In a tree - the union of a node's parent and the parent's ancestors






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






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






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






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






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