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 contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






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






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






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






8. A case where a program calls itself






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






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






11. Describes a though experiment or view of an entity






12. All nodes below a give node in a tree






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






14. Describes a function that modifies its arguments






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






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






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






18. Two variables that reference the same object






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






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






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






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






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






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






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






26. In a tree - a node pointed to by a parent node






27. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






29. First-child/next-sibling






30. The next element in a linked list






31. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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