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. Composed of multiple sequential elements stored in contiguous bytes of memory






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






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






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






5. To hide similar items with the same name






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






7. A case where a program calls itself






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






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






10. A case where tow data structures share some elements






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






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






13. The process of collecting garbage for recycling






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






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






16. A node of a tree that has children






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






18. A process that removes unwanted elements from a collection






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






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






21. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






29. Two variables that reference the same object






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






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






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






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






34. A pointer to data






35. The next element in a linked list






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






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






38. Describes a though experiment or view of an entity






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






40. Describes a function that modifies its arguments






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






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






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






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






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






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






47. To combine two ordered linear structures into one






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






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






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