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






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






3. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






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






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






16. A node of a tree that has children






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






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






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






20. A variable containing the address of other data






21. Two variables that reference the same object






22. To combine two ordered linear structures into one






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






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






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






26. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






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






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






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






30. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






41. Any container with linear ordering






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






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






44. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






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






49. A process that removes unwanted elements from a collection






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