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 condition of the input data where the data will be handled by call(s) to the same program






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






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






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






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






6. Composed of individually named data fields






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






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






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






10. To combine two ordered linear structures into one






11. A pointer to data






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






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






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






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






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






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






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






19. A node of a tree that has children






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






21. Describes a though experiment or view of an entity






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






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






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






25. A variable containing the address of other data






26. A case where tow data structures share some elements






27. Two variables that reference the same object






28. A case where a program calls itself






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






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






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






32. Use of a function or method without knowing how it's accomplished






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






34. A pattern that describes a set of similar programs






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






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






37. Any container with linear ordering






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






39. A collection of values






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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






45. A list of pairs - where each pair has a key and a value associated with the key






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






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






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






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






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