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. First in first out: describes ordering of a queue






2. A pattern that describes a set of similar programs






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






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






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






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






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






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






9. To hide similar items with the same name






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






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






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 problem that is so hard that it cannot be solved unless the problem is small






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






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






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






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






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






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






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






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






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






23. Two variables that reference the same object






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






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






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






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






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






29. Depth first search






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






31. First-child/next-sibling






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






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






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






35. Describes a function that modifies its arguments






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






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






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






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






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






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






42. A pointer to data






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






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






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






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






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






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






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






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