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. In object oriented programming - a description of a set of similar objects






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






3. Composed of individually named data fields






4. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






16. A collection of values






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






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






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






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






21. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






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






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






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






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






35. A pattern that describes a set of similar programs






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






37. All nodes below a give node in a tree






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






39. The process of collecting garbage for recycling






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






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






42. The next element in a linked list






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






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






45. To hide similar items with the same name






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






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






48. A case where tow data structures share some elements






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






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