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 ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






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






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






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






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






7. A case where a program calls itself






8. A collection of values






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






10. A node of a tree that has children






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






12. Two variables that reference the same object






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






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






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






16. The next element in a linked list






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






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






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






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






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






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






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






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






25. Any container with linear ordering






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






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






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






29. Depth first search






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






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






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






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






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






35. Describes a function that modifies its arguments






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






37. All nodes below a give node in a tree






38. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






47. First-child/next-sibling






48. A pattern that describes a set of similar programs






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






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