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. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






3. The process of collecting garbage for recycling






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






5. A case where tow data structures share some elements






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






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






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






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






10. Depth first search






11. First-child/next-sibling






12. All nodes below a give node in a tree






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






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






15. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






27. Describes a though experiment or view of an entity






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






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






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






31. A data structure that can be identified at runtime as being a member of a class






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






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






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






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






36. A variable containing the address of other data






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






38. Two variables that reference the same object






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






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






41. To combine two ordered linear structures into one






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






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






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






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






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






47. The next element in a linked list






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






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






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