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 problem that is so hard that it cannot be solved unless the problem is small






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






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






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






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






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






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






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






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






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






11. A case where a program calls itself






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






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






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






15. First-child/next-sibling






16. Describes a though experiment or view of an entity






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






18. A list of pairs - where each pair has a key and a value associated with the key






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






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






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






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






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






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






25. In a tree - the union of a node's parent and the parent's ancestors






26. A process that removes unwanted elements from a collection






27. Composed of individually named data fields






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






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






30. A pointer to data






31. To combine two ordered linear structures into one






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






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






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






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






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






37. The process of collecting garbage for recycling






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






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






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






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






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






43. A classification of objects into a tree structure that groups related objects






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






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






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






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






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






49. A node of a tree that has children






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