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. In a search tree - a program that changes a state into a child state e.g a move in a game






2. A pattern that describes a set of similar programs






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






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






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






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






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






8. The next element in a linked list






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






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






11. To combine two ordered linear structures into one






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






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






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






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






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






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






18. Any container with linear ordering






19. A node of a tree that has children






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






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






22. The process of collecting garbage for recycling






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






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






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






26. Depth first search






27. Composed of individually named data fields






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






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






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






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






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






33. A queue implemented within an array - where the first elements of the array logically follows the last elements






34. A case where tow data structures share some elements






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






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






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






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






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






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






41. To hide similar items with the same name






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






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






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






45. A process that removes unwanted elements from a collection






46. All nodes below a give node in a tree






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






48. A variable containing the address of other data






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






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