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 a tree search - to move back from the node currently being examined to its parent






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






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






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






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






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






7. Any container with linear ordering






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






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






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






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






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






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






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






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






16. A variable containing the address of other data






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






18. To hide similar items with the same name






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






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






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






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






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






24. A node of a tree that has children






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






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






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






28. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






40. The process of collecting garbage for recycling






41. A collection of values






42. A pointer to data






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






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






45. Composed of individually named data fields






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






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






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






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






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