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 pointer to data






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






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






4. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






5. The process of collecting garbage for recycling






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






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






8. To combine two ordered linear structures into one






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






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






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






12. A pattern that describes a set of similar programs






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






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






15. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






32. In object oriented programming - a description of a set of similar objects






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






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






35. Last in first out: describes the order of a stack






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






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






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






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






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






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






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






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






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






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






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






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






48. Depth first search






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






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