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






2. The next element in a linked list






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






4. Describes a though experiment or view of an entity






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






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






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






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






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






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






11. A pointer to data






12. A case where tow data structures share some elements






13. A pattern that describes a set of similar programs






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






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






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






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






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






19. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






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






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






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






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






33. The process of collecting garbage for recycling






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






35. A variable containing the address of other data






36. A case where a program calls itself






37. Any container with linear ordering






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






39. Values are in the most basic form and cannot be decomposed into smaller parts






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






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






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






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






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






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






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






47. Depth first search






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






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






50. A node of a tree that has children