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. The next element in a linked list






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






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






4. A case where a program calls itself






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






6. A pointer to data






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






8. Two variables that reference the same object






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






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






11. First-child/next-sibling






12. All nodes below a give node in a tree






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






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






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






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






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






18. A case where tow data structures share some elements






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






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






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






22. Any container with linear ordering






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






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






25. Given two sets - the intersection is the set of elements that are members of both sets






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






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






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






29. Describes a function that modifies its arguments






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






31. A node of a tree that has children






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






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






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






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






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






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






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






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






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






41. Composed of individually named data fields






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






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






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






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






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






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






48. The process of collecting garbage for recycling






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






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