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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






5. A collection of values






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






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






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






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






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






11. First-child/next-sibling






12. A case where tow data structures share some elements






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






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






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






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






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






18. Two variables that reference the same object






19. To combine two ordered linear structures into one






20. A variable containing the address of other data






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






22. A node of a tree that has children






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






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






25. Depth first search






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






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






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






29. A linked list in which each elements has both forward and backward pointers






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






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






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






33. Composed of individually named data fields






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






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






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






37. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






49. To hide similar items with the same name






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