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 next element in a linked list






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






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






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






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






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






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






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






9. A simple case that can be solved easily - without recursion






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






11. To combine two ordered linear structures into one






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






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






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






15. Describes a though experiment or view of an entity






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






17. A process that removes unwanted elements from a collection






18. Describes a function that modifies its arguments






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






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






21. A node of a tree that has children






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






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






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






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






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






27. To hide similar items with the same name






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






29. Two variables that reference the same object






30. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






33. Any container with linear ordering






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






35. 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?"






36. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






37. A collection of values






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






39. All nodes below a give node in a tree






40. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






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






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






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






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






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






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






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






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






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






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