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 linked list in which each elements has both forward and backward pointers






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






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






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






5. To hide similar items with the same name






6. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






7. Describes a though experiment or view of an entity






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






9. A process that removes unwanted elements from a collection






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






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






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






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






14. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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. A section of the runtime stack holding the values of all variables for one invocation






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






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






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






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






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






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






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






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






34. A variable containing the address of other data






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. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






37. Composed of individually named data fields






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






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






40. Any container with linear ordering






41. A description of operations on a data type that could have multiple possible implementations






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






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






44. The next element in a linked list






45. Describes a function that modifies its arguments






46. A node of a tree that has children






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






48. A pattern that describes a set of similar programs






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






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