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. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






2. Describes a though experiment or view of an entity






3. First-child/next-sibling






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






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






6. An elements of a linked list - tree - or graph - often represented by a data structure






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






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






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






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






11. A pointer to data






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






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






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






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






16. Describes a function that modifies its arguments






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






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






19. Any container with linear ordering






20. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






31. Two variables that reference the same object






32. The next element in a linked list






33. Depth first search






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






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. In a tree - a node that points to a given node






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






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






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






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






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






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






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






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






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






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






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






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






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






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