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. The area of program text over which a variable can be referenced






2. A process that removes unwanted elements from a collection






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






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






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






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






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






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






9. The next element in a linked list






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






11. Describes a though experiment or view of an entity






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






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






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






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






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






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






18. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






28. Describes a function that modifies its arguments






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






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






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






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






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






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






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






36. A variable containing the address of other data






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






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






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






40. A node of a tree that has children






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






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






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






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






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






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






47. Composed of a collection of data values; implemented with a data structure






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






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






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