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 next element in a linked list






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






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






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






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






6. To combine two ordered linear structures into one






7. A pointer to data






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






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






10. Describes a though experiment or view of an entity






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






12. A node of a tree that has children






13. A variable containing the address of other data






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






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






16. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






29. A case where tow data structures share some elements






30. First in first out: describes ordering of a queue






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






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






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






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






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






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






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






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






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






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






41. To hide similar items with the same name






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






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






44. Depth first search






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






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






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






48. A collection of values






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






50. All nodes below a give node in a tree