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 search in which children of a node are considered before siblings are considered






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






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






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






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






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






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






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






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






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






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






12. A variable containing the address of other data






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






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






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






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






17. Any container with linear ordering






18. A collection of values






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






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






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






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






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






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






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






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






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






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






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






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






31. A process that removes unwanted elements from a collection






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






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






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






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






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. Depth first search






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






39. A pointer to data






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






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






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






43. A case where a program calls itself






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






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






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






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






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






49. To hide similar items with the same name






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