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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






5. A pattern that describes a set of similar programs






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






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






8. Any container with linear ordering






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






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






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






12. A variable containing the address of other data






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






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






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






16. A process that removes unwanted elements from a collection






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






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






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






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






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






22. A pointer to data






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






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






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






26. Composed of individually named data fields






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






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






29. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






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






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






43. Depth first search






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






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






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






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






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






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






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