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 formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






3. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






7. A collection of values






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






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






10. Composed of individually named data fields






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






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






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






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






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






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






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






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






19. Describes a though experiment or view of an entity






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






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






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






23. To hide similar items with the same name






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






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






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






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






28. First-child/next-sibling






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






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






31. A variable containing the address of other data






32. Describes a function that modifies its arguments






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






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






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






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






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






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






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






40. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






41. Depth first search






42. A case where tow data structures share some elements






43. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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