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






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






3. A search in which children of a node are considered before siblings are considered






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






5. A node of a tree that has children






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






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






8. A pattern that describes a set of similar programs






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






10. A case where a program calls itself






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






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






13. Composed of individually named data fields






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






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






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






17. A collection of values






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






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






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






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






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






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






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






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






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






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






28. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






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






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






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






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






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






37. A pointer to data






38. Depth first search






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






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






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






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






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






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






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






46. A variable containing the address of other data






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






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






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






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